Approximation properties of fixed point planar algebras

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 P associated to (,μ). Consider a subgroup G < Aut(, μ) and the set of fixed points PG ⊂ 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 PG inherits this property respectively. As a corollary we show that if is a tree, then the subfactor planar algebra PG 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…