In this series of papers we show that there are exactly ten subfactors, other than $A_\infty$ subfactors, of index between 4 and 5. Previously this classification was known up to index $3+\sqrt{3}$. In the first paper we give an analogue of Haagerup's initial classification of subfactors of index less than $3+\sqrt{3}$, showing that any subfactor of index less than 5 must appear in one of a large list of families. These families will be considered separately in the three subsequent papers in this series.
Progress on classifying small index subfactors has revealed an almost empty landscape. In this paper we give some evidence that this desert continues up to index 3+\sqrt{5}. There are two known quantum-group subfactors with index in this interval, and we show that these subfactors are the only way to realize the corresponding principal graphs. One of these subfactors is 1-supertransitive, and we demonstrate that it is the only 1-supertransitive subfactor with index between 5 and 3+\sqrt{5}. Computer evidence shows that any other subfactor in this interval would need to have rank at least 38. W…
We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor.
We show that any graph, in the sequence given by Haagerup in 1991 as that of candidates of principal graphs of subfactors, is not realized as a principal graph except for the smallest two. This settles the remaining case of a previous work of the first author.
This article proves the existence and uniqueness of a subfactor planar algebra with principal graph consisting of a diamond with arms of length 2 at opposite sides, which we call 2D2. We also prove the uniqueness of the subfactor planar algebra with principal graph 4442. We conjecture this will complete the list of subfactor planar algebras at index $3+\sqrt{5}$.
Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known initial triple point obstructions to possible principal graphs. We also prove a similar quadruple point obstruction with the same technique. Using our obstructions, we eliminate some infinite families of possible principal graphs with initial triple and quadruple points which were a major hurdle in extending subfactor classification results above index 5.
In this paper, we construct the "2221" subfactor planar algebra by finding it as a subalgebra of the graph planar algebra of its principal graph. In particular, we give a presentation of the "2221" subfactor planar algebra consisting of generators and relations. As a corollary, we have a planar algebra proof of the existence of a subfactor with principal graph "2221". To show the subfactor property, we use the jellyfish algorithm for evaluating closed diagrams. Lastly, we show uniqueness up to conjugation of "2221".
We show that if the principal graph of a subfactor planar algebra of modulus δ>2 is stable for two depths, then it must end in A_{finite} tails. This result is analogous to Popa's theorem on principal graph stability. We use these theorems to show that an (n-1) supertransitive subfactor planar algebra has jellyfish generators at depth n if and only if its principal graph is a spoke graph.
We construct a new subfactor planar algebra, and as a corollary a new subfactor, with the `extended Haagerup' principal graph pair. This completes the classification of irreducible amenable subfactors with index in the range $(4,3+\sqrt{3})$, which was initiated by Haagerup in 1993. We prove that the subfactor planar algebra with these principal graphs is unique. We give a skein theoretic description, and a description as a subalgebra generated by a certain element in the graph planar algebra of its principal graph. In the skein theoretic description there is an explicit algorithm for evaluati…
We construct subfactors where one of the principal graphs is a spoke graph using an algorithm which computes two-strand jellyfish relations. One of the subfactors we construct is a 3^{Z/4} subfactor known to Izumi, which has not previously appeared in the literature. To do so, we provide a systematic treatment of the space of second annular consequences, which is analogous to Jones' treatment of the space of first annular consequences in his quadratic tangles article. This article is the natural followup to two recent articles on spoke subfactor planar algebras and the jellyfish algorithm. Wor…
The Galois group of the minimal polymonal of a Jones index value gives a new type of obstruction to a principal graph, thanks to a recent result of P.Etingof, D.Nikshych, and V.Ostrik. We show that the sequence of the graphs given by Haagerup as candidates of principal graphs of subfactors, are not realized as principal graphs for 7<n <= 27 using GAP program. We further utilize Mathematica to extend the statement to 27 <n <= 55. We conjecture that none of the graphs are principal graphs for all n>7, and give an evidence using Mathematica for smaller graphs among them for n>55. The problem for …
We define a canonical relative commutant planar algebra from a strongly Markov inclusion of finite von Neumann algebras. In the case of a connected unital inclusion of finite dimensional C*-algebras with the Markov trace, we show this planar algebra is isomorphic to the bipartite graph planar algebra of the Bratteli diagram of the inclusion. Finally, we show that a finite depth subfactor planar algebra is a planar subalgebra of the bipartite graph planar algebra of its principal graph.
We eliminate 38 infinite families of possible principal graphs as part of the classification of subfactors up to index 5. A number-theoretic result of Calegari-Morrison-Snyder, generalizing Asaeda-Yasuda, reduces each infinite family to a finite number of cases. We provide algorithms for computing the effective constants that are required for this result, and we obtain 28 possible principal graphs. The Ostrik d-number test and an algebraic integer test reduce this list to 7 graphs in the index range (4,5) which actually occur as principal graphs.
By using Ocneanu's result on the classification of all irreducible connections on the Dynkin diagrams, we show that the dual principal graphs as well as the fusion rules of bimodules arising from any Goodman-de la Harpe-Jones subfactors are obtained by a purely combinatorial method. In particular we obtain the dual principal graph and the fusion rule of bimodules arising from the Goodman-de la Harpe-Jones subfactor corresponding to the Dynkin diagram $E_8$. As an application, we also show some subequivalence among $A$-$D$-$E$ paragroups.
We summarize the known obstructions to subfactors with principal graphs which begin with a triple point. One is based on Jones's quadratic tangles techniques, although we apply it in a novel way. The other two are based on connections techniques; one due to Ocneanu, and the other previously unpublished, although likely known to Haagerup. We then apply these obstructions to the classification of subfactors with index below 5. In particular, we eliminate three of the five families of possible principal graphs called "weeds" in the classification from arXiv:1007.1730.
Scarparo has constructed counterexamples to Matui's HK-conjecture. These counterexample and other known counterexamples are essentially principal but not principal. In the present paper, a counterexample to the HK-conjecture that is principal is given. Like Scarparo's original counterexample, our counterexample is the transformation groupoid associated to a particular odometer. However, the relevant group is the fundamental group of a flat manifold (and hence is torsion-free) and the associated odometer action is free. The examples discussed here do satisfy the rational version of the HK-conje…
The principal graph $X$ of a subfactor with finite Jones index is one of the important algebraic invariants of the subfactor. If $Δ$ is the adjacency matrix of $X$ we consider the equation $Δ=U+U^{-1}$. When $X$ has square norm $\leq 4$ the spectral measure of $U$ can be averaged by using the map $u\to u^{-1}$, and we get a probability measure $ε$ on the unit circle which does not depend on $U$. We find explicit formulae for this measure $ε$ for the principal graphs of subfactors with index $\le 4$, the (extended) Coxeter-Dynkin graphs of type $A$, $D$ and $E$. The moment generating function o…
We answer three related questions concerning the Haagerup subfactor and its even parts, the Haagerup fusion categories. Namely we find all simple module categories over each of the Haagerup fusion categories (in other words, we find the `"quantum subgroups" in the sense of Ocneanu), we find all subfactors whose principal even part is one of the Haagerup fusion categories, and we compute the Brauer-Picard groupoid of Morita equivalences of the Haagerup fusion categories. In addition to the two even parts of the Haagerup subfactor, there is exactly one more fusion category which is Morita equiva…
One major obstacle in extending the classification of small index subfactors beyond 3+\sqrt{3} is the appearance of infinite families of candidate principal graphs with 4-valent vertices (in particular, the "weeds" Q and Q' from Part 1 (arXiv:1007.1730)). Thus instead of using triple point obstructions to eliminate candidate graphs, we need to develop new quadruple point obstructions. In this paper we prove two quadruple point obstructions. The first uses quadratic tangles techniques and eliminates the weed Q' immediately. The second uses connections, and when combined with an additional numbe…
Dimensions of objects in fusion categories are cyclotomic integers, hence number theoretic results have implications in the study of fusion categories and finite depth subfactors. We give two such applications. The first application is determining a complete list of numbers in the interval (2, 76/33) which can occur as the Frobenius-Perron dimension of an object in a fusion category. The smallest number on this list is realized in a new fusion category which is constructed in the appendix written by V. Ostrik, while the others are all realized by known examples. The second application proves t…
Jones and Penneys showed that a finite depth subfactor planar algebra embeds in the bipartite graph planar algebra of its principal graph, via a Markov towers of algebras approach. We relate several equivalent perspectives on the notion of module over a subfactor planar algebra, and show that a Markov tower is equivalent to a module over the Temperley-Lieb-Jones planar algebra. As a corollary, we obtain a classification of semisimple pivotal C* modules over Temperley-Lieb-Jones in terms of pointed graphs with a Frobenius-Perron vertex weighting. We then generalize the Markov towers of algebras…
A series of pairs of graphs (Gamma_k, Gamma'_k), k = 0,1,2,... has been considered as candidates for dual pairs of principal graphs of subfactors of small Jones index above 4 and it has recently been proved that the pair (Gamma_k, Gamma'_k) comes from a subfactor if and only if k = 0 or k =1. We show that nevertheless there exists a unique fusion system compatible with this pair of graphs for all non-negative integers k.
The main goal of this paper is to classify $\ast$-module categories for the $SO(3)_{2m}$ modular tensor category. This is done by classifying $SO(3)_{2m}$ nimrep graphs and cell systems, and in the process we also classify the $SO(3)$ modular invariants. There are module categories of type $\mathcal{A}$, $\mathcal{E}$ and their conjugates, but there are no orbifold (or type $\mathcal{D}$) module categories. We present a construction of a subfactor with principal graph given by the fusion rules of the fundamental generator of the $SO(3)_{2m}$ modular category. We also introduce a Frobenius alge…
