On representing some lattices as lattices of intermediate subfactors of finite index
Abstract
We prove that the very simple lattices which consist of a largest, a smallest and 2n pairwise incomparable elements where n is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite depth. Using the same techniques, we give a necessary and sufficient condition for subfactors coming from Loop groups of type A at generic levels to be maximal.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.