Colloquium:
Classifying Subfactor Planar Algebras
Scott Morrison, Microsoft Station Q at UC Santa Barbara
Abstract
I'll introduce the notion of a "subfactor planar algebra",
briefly making contact with its origin in von Neumann algebras, but
mostly focusing on the 2-d dimensional combinatorial diagrams that
encode everything we care about! The "principal graph" is the first
interesting invariant, and a little graph theory gets us started on
the classification problem. Next, I'll explain the "annular
Temperley-Lieb category": this is important because every subfactor
planar algebra gives a representation of this category, and the
irreducible representations are easy to describe. Understanding how a
planar algebra breaks up into irreducible representations gives us
lots of information, including obstructions that rule out some
potential principal graphs, as well as clues for constructing new
planar algebras. I'll end with an overview of the current
classification of small index subfactor planar algebras, and a brief
account of a recent construction of the long mysterious "extended
Haagerup planar algebra" (joint work with Stephen Bigelow, Emily
Peters, and Noah Snyder).
|