Approximation properties of fixed point planar algebras

preprint2016arXivOpen access

Abstract

Let (Γ,μ)(Γ,μ) be a bipartite graph together with a weight on its vertices. Assume that μμ is an eigenvector for the adjacency matrix of ΓΓ. Let Aut(Γ,μ)(Γ, μ) be the automorphism group of the bipartite graph ΓΓ that scales the weight μμ. It is a locally compact totally disconnected group that acts on the bipartite graph planar algebra PP associated to (Γ,μ)(Γ,μ). Consider a subgroup G < Aut(Γ,μ)(Γ, μ) and the set of fixed points PG⊂PP^G \subset P that we assume to be a subfactor planar algebra. If the closure of G inside Aut(Γ,μ)(Γ, μ) satisfies an approximation property such as amenability, the Haagerup property, weak amenability, or not having property (T), then the subfactor planar algebra PGP^G inherits this property respectively. As a corollary we show that if ΓΓ is a tree, then the subfactor planar algebra PGP^G has the Haagerup property and has the complete metric approximation property (CMAP). This provides an infinite family of subfactor planar algebras that have non-integer index, are non-amenable, have the Haagerup property, and have CMAP. We define the crossed product of a (finite) von Neumann algebra by a Hecke pair of groups. We show that a large class of symmetric enveloping inclusions of subfactor planar algebras are described by such a crossed product including Bisch-Haagerup subfactors.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.