1995
DOI: 10.1006/jfan.1995.1003
|View full text |Cite
|
Sign up to set email alerts
|

On Flatness of Ocneanu′s Connections on the Dynkin Diagrams and Classification of Subfactors

Abstract: We will give a proof of Ocneanu's announced classification of subfactors of the AFD type II 1 factor with the principal graphs A n , D n , E 7 , the Dynkin diagrams, and give a single explicit equation of exp π √ −1 24 and exp π √ −1 60for each of E 6 and E 8 such that its validity is equivalent to existence of two (and only two) subfactors for these principal graphs. Our main tool is flatness of connections on finite graphs, which is the key notion of Ocneanu's paragroup theory. We give the difference between… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
84
0

Year Published

1996
1996
2004
2004

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 83 publications
(86 citation statements)
references
References 16 publications
2
84
0
Order By: Relevance
“…This deep theorem solves the original problem of Loi of classification of strongly amenable subfactors of type III λ completely. Subfactors, however, often have interesting automorphisms with trivial Loi invariant, as shown in our previous work [11], [12], [21], [22]. Thus we expect an interesting classification theory for automorphisms of subfactors which are not classified by Loi's invariant.…”
Section: Introductionmentioning
confidence: 57%
See 1 more Smart Citation
“…This deep theorem solves the original problem of Loi of classification of strongly amenable subfactors of type III λ completely. Subfactors, however, often have interesting automorphisms with trivial Loi invariant, as shown in our previous work [11], [12], [21], [22]. Thus we expect an interesting classification theory for automorphisms of subfactors which are not classified by Loi's invariant.…”
Section: Introductionmentioning
confidence: 57%
“…We, however, have something different for subfactors from the case of injective type III factors, that is, the obstruction to flatness in the orbifold construction may not vanish -as in [21], [39]. This causes combinatorial difficulty and gives a reason our classification here is not complete in all the cases.…”
Section: Example 63mentioning
confidence: 97%
“…This means that in order to get an automorphism ϕ 11 of the commuting square (2.1) the following must be satisfied; see for instance [6], [10]. Definition 2.10.…”
Section: Construction Of Subfactor Automorphismsmentioning
confidence: 99%
“…The orbifold construction has originally arisen from the technique in conformal field theory and in solvable lattice model theory. This technique was first used in subfactor theory by Y. Kawahigashi [Ka2]. At first he used it to show the existence of subfactors of the AFD factor of type II 1 with principal graph D 2n and non-existence of those with principal graph D 2n+1 .…”
Section: Proposition 25 Let G Be a Finite Group And α An Outer Actmentioning
confidence: 99%