Lesson plan
ADE classification
s classify diverse mathematical objects. In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications, rather than a posteriori verification of a parallelism, was posed in . The complete list of simply laced Dynkin diagrams comprises : A_n, \, D_n, \, E_6, \, E_7, \, E_8. Here "simply laced" means that there are no multiple edges, which corresponds to all simple roots in the root system forming angles of \pi/2 = 90^\circ (no edge between the vertices) or 2\pi/3 = 120^\circ (single edge between the vertices). These are two of the four families of Dynkin diagrams (omitting B_n and C_n ), and three of the five exceptional Dynkin diagrams (omitting F_4 and G_2 ). This list is non-redundant if one takes n \geq 4 for D_n. If one extends the families to include redundant terms, one obtains the exceptional isomorphisms : D_3 \cong A_3, E_4 \cong A_4, E_5 \cong D_5, and corresponding isomorphisms of classified objects. The A, D, E nomenclature also yields the simply laced finite Coxeter groups, by the same diagrams: in this case the Dynkin diagrams exactly coincide with the Coxeter diagrams, as there are no multiple edges.
Article summary
s classify diverse mathematical objects. In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications, rather than a posteriori verification of a parallelism, was posed in . The complete list of simply laced Dynkin diagrams comprises : A_n, \, D_n, \, E_6, \, E_7, \, E_8. Here "simply laced" means that there are no multiple edges, which corresponds to all simple roots in the root system forming angles of \pi/2 = 90^\circ (no edge between the vertices) or 2\pi/3 = 120^\circ (single edge between the vertices). These are two of the four families of Dynkin diagrams (omitting B_n and C_n ), and three of the five exceptional Dynkin diagrams (omitting F_4 and G_2 ). This list is non-redundant if one takes n \geq 4 for D_n. If one extends the families to include redundant terms, one obtains the exceptional isomorphisms : D_3 \cong A_3, E_4 \cong A_4, E_5 \cong D_5, and corresponding isomorphisms of classified objects. The A, D, E nomenclature also yields the simply laced finite Coxeter groups, by the same diagrams: in this case the Dynkin diagrams exactly coincide with the Coxeter diagrams, as there are no multiple edges.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.