Dynkin diagram
In the mathematical field of Lie theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled (drawn as a double or triple line). The multiple edges are, within certain constraints, directed.
The main interest in Dynkin diagrams are as a means to classify semisimple Lie algebras over algebraically closed fields. This gives rise to Weyl groups, i.e. to many (although not all) finite reflection groups. Dynkin diagrams may also arise in other contexts.
The term "Dynkin diagram" can be ambiguous. In some cases, Dynkin diagrams are assumed to be directed, in which case they correspond to root systems and semisimple Lie algebras, while in other cases they are assumed to be undirected, in which case they correspond to Weyl groups; the and directed diagrams yield the same undirected diagram, correspondingly named In this article, "Dynkin diagram" means directed Dynkin diagram, and undirected Dynkin diagrams will be explicitly so named.
Contents
 1 Classification of semisimple Lie algebras
 2 Related classifications
 3 Constraints
 4 Connection with Coxeter diagrams
 5 Isomorphisms
 6 Automorphisms
 7 Other maps of diagrams
 8 Simply laced
 9 Satake diagrams
 10 History
 11 Conventions
 12 Rank 2 Dynkin diagrams
 13 Finite Dynkin diagrams
 14 Affine Dynkin diagrams
 15 Hyperbolic and higher Dynkin diagrams
 16 See also
 17 Notes
 18 References
 19 External links
Classification of semisimple Lie algebras
The fundamental interest in Dynkin diagrams is that they classify semisimple Lie algebras over algebraically closed fields. One classifies such Lie algebras via their root system, which can be represented by a Dynkin diagram. One then classifies Dynkin diagrams according to the constraints they must satisfy, as described below.
Dropping the direction on the graph edges corresponds to replacing a root system by the finite reflection group it generates, the socalled Weyl group, and thus undirected Dynkin diagrams classify Weyl groups.
Related classifications
Dynkin diagrams can be interpreted as classifying many distinct, related objects, and the notation "A_{n}, B_{n}, ..." is used to refer to all such interpretations, depending on context; this ambiguity can be confusing.
The central classification is that a simple Lie algebra has a root system, to which is associated an (oriented) Dynkin diagram; all three of these may be referred to as B_{n}, for instance.
The unoriented Dynkin diagram is a form of Coxeter diagram, and corresponds to the Weyl group, which is the finite reflection group associated to the root system. Thus B_{n} may refer to the unoriented diagram (a special kind of Coxeter diagram), the Weyl group (a concrete reflection group), or the abstract Coxeter group.
Note that while the Weyl group is abstractly isomorphic to the Coxeter group, a specific isomorphism depends on an ordered choice of simple roots. Beware also that while Dynkin diagram notation is standardized, Coxeter diagram and group notation is varied and sometimes agrees with Dynkin diagram notation and sometimes does not.
Lastly, sometimes associated objects are referred to by the same notation, though this cannot always be done regularly. Examples include:
 The root lattice generated by the root system, as in the E_{8} lattice. This is naturally defined, but not onetoone – for example, A_{2} and G_{2} both generate the hexagonal lattice.
 An associated polytope – for example Gosset 4_{21} polytope may be referred to as "the E_{8} polytope", as its vertices are derived from the E_{8} root system and it has the E_{8} Coxeter group as symmetry group.
 An associated quadratic form or manifold – for example, the E_{8} manifold has intersection form given by the E_{8} lattice.
These latter notations are mostly used for objects associated with exceptional diagrams – objects associated to the regular diagrams (A, B, C, D) instead have traditional names.
The index (the n) equals to the number of nodes in the diagram, the number of simple roots in a basis, the dimension of the root lattice and span of the root system, the number of generators of the Coxeter group, and the rank of the Lie algebra. However, n does not equal the dimension of the defining module (a fundamental representation) of the Lie algebra – the index on the Dynkin diagram should not be confused with the index on the Lie algebra. For example, corresponds to which naturally acts on 9dimensional space, but has rank 4 as a Lie algebra.
The simply laced Dynkin diagrams, those with no multiple edges (A, D, E) classify many further mathematical objects; see discussion at ADE classification.
Example: A2
For example, the symbol may refer to:
 The Dynkin diagram with 2 connected nodes, Template:Dynkin, which may also be interpreted as a Coxeter diagram.
 The root system with 2 simple roots at a (120 degree) angle.
 The Lie algebra of rank 2.
 The Weyl group of symmetries of the roots (reflections in the hyperplane orthogonal to the roots), isomorphic to the symmetric group (of order 6).
 The abstract Coxeter group, presented by generators and relations,
Constraints
Dynkin diagrams must satisfy certain constraints; these are essentially those satisfied by finite Coxeter–Dynkin diagrams, together with an additional crystallographic constraint.
Connection with Coxeter diagrams
Dynkin diagrams are closely related to Coxeter diagrams of finite Coxeter groups, and the terminology is often conflated.^{[note 1]}
Dynkin diagrams differ from Coxeter diagrams of finite groups in two important respects:
 Partly directed
 Dynkin diagrams are partly directed – any multiple edge (in Coxeter terms, labeled with "4" or above) has a direction (an arrow pointing from one node to the other); thus Dynkin diagrams have more data than the underlying Coxeter diagram (undirected graph).
 At the level of root systems the direction corresponds to pointing towards the shorter vector; edges labeled "3" have no direction because the corresponding vectors must have equal length. (Caution: Some authors reverse this convention, with the arrow pointing towards the longer vector.)
 Crystallographic restriction
 Dynkin diagrams must satisfy an additional restriction, namely that the only allowable edge labels are 2, 3, 4, and 6, a restriction not shared by Coxeter diagrams, so not every Coxeter diagram of a finite group comes from a Dynkin diagram.
 At the level of root systems this corresponds to the crystallographic restriction theorem, as the roots form a lattice.
A further difference, which is only stylistic, is that Dynkin diagrams are conventionally drawn with double or triple edges between nodes (for p = 4, 6), rather than an edge labeled with "p".
The term "Dynkin diagram" at times refers to the directed graph, at times to the undirected graph. For precision, in this article "Dynkin diagram" will mean directed, and the underlying undirected graph will be called an "undirected Dynkin diagram". Then Dynkin diagrams and Coxeter diagrams may be related as follows:
crystallographic  point group  

directed  Dynkin diagrams  
undirected  undirected Dynkin diagrams  Coxeter diagrams of finite groups 
By this is meant that Coxeter diagrams of finite groups correspond to point groups generated by reflections, while Dynkin diagrams must satisfy an additional restriction corresponding to the crystallographic restriction theorem, and that Coxeter diagrams are undirected, while Dynkin diagrams are (partly) directed.
The corresponding mathematical objects classified by the diagrams are:
crystallographic  point group  

directed  root systems  
undirected  Weyl groups  finite Coxeter groups 
The blank in the upper right, corresponding to directed graphs with underlying undirected graph any Coxeter diagram (of a finite group), can be defined formally, but is littlediscussed, and does not appear to admit a simple interpretation in terms of mathematical objects of interest.
There are natural maps down – from Dynkin diagrams to undirected Dynkin diagrams; respectively, from root systems to the associated Weyl groups – and right – from undirected Dynkin diagrams to Coxeter diagrams; respectively from Weyl groups to finite Coxeter groups.
The down map is onto (by definition) but not onetoone, as the B_{n} and C_{n} diagrams map to the same undirected diagram, with the resulting Coxeter diagram and Weyl group thus sometimes denoted BC_{n}.
The right map is simply an inclusion – undirected Dynkin diagrams are special cases of Coxeter diagrams, and Weyl groups are special cases of finite Coxeter groups – and is not onto, as not every Coxeter diagram is an undirected Dynkin diagram (the missed diagrams being H_{3}, H_{4} and I_{2}(p) for p = 5 p ≥ 7), and correspondingly not every finite Coxeter group is a Weyl group.
Isomorphisms
Dynkin diagrams are conventionally numbered so that the list is nonredundant: for for for for and starting at The families can however be defined for lower n, yielding exceptional isomorphisms of diagrams, and corresponding exceptional isomorphisms of Lie algebras and associated Lie groups.
Trivially, one can start the families at or which are all then isomorphic as there is a unique empty diagram and a unique 1node diagram. The other isomorphisms of connected Dynkin diagrams are:
These isomorphisms correspond to isomorphism of simple and semisimple Lie algebras, which also correspond to certain isomorphisms of Lie group forms of these. They also add context to the E_{n} family.^{[1]}
Automorphisms
In addition to isomorphism between different diagrams, some diagrams also have selfisomorphisms or "automorphisms". Diagram automorphisms correspond to outer automorphisms of the Lie algebra, meaning that the outer automorphism group Out = Aut/Inn equals the group of diagram automorphisms.^{[2]}^{[3]}^{[4]}
The diagrams that have nontrivial automorphisms are A_{n} (), D_{n} (), and E_{6}. In all these cases except for D_{4}, there is a single nontrivial automorphism (Out = C_{2}, the cyclic group of order 2), while for D_{4}, the automorphism group is the symmetric group on three letters (S_{3}, order 6) – this phenomenon is known as "triality". It happens that all these diagram automorphisms can be realized as Euclidean symmetries of how the diagrams are conventionally drawn in the plane, but this is just an artifact of how they are drawn, and not intrinsic structure.
For A_{n}, the diagram automorphism is reversing the diagram, which is a line. The nodes of the diagram index the fundamental weights, which (for A_{n−1}) are for , and the diagram automorphism corresponds to the duality Realized as the Lie algebra the outer automorphism can be expressed as negative transpose, , which is how the dual representation acts.^{[3]}
For D_{n}, the diagram automorphism is switching the two nodes at the end of the Y, and corresponds to switching the two chiral spin representations. Realized as the Lie algebra the outer automorphism can be expressed as conjugation by a matrix in O(2n) with determinant −1. Note that so their automorphisms agree, while which is disconnected, and the automorphism corresponds to switching the two nodes.
For D_{4}, the fundamental representation is isomorphic to the two spin representations, and the resulting symmetric group on three letter (S_{3}, or alternatively the dihedral group of order 6, Dih_{3}) corresponds both to automorphisms of the Lie algebra and automorphisms of the diagram.
The automorphism group of E_{6} corresponds to reversing the diagram, and can be expressed using Jordan algebras.^{[3]}^{[5]}
Disconnected diagrams, which correspond to semisimple Lie algebras, may have automorphisms from exchanging components of the diagram.
In positive characteristic there are additional diagram automorphisms – roughly speaking, in characteristic p one is allowed to ignore the arrow on bonds of multiplicity p in the Dynkin diagram when taking diagram automorphisms. Thus in characteristic 2 there is an order 2 automorphism of and of F_{4}, while in characteristic 3 there is an order 2 automorphism of G_{2}.
Construction of Lie groups via diagram automorphisms
Diagram automorphisms in turn yield additional Lie groups and groups of Lie type, which are of central importance in the classification of finite simple groups.
The Chevalley group construction of Lie groups in terms of their Dynkin diagram does not yield some of the classical groups, namely the unitary groups and the nonsplit orthogonal groups. The Steinberg groups construct the unitary groups ^{2}A_{n}, while the other orthogonal groups are constructed as ^{2}D_{n}, where in both cases this refers to combining a diagram automorphism with a field automorphism. This also yields additional exotic Lie groups ^{2}E_{6} and ^{3}D_{4}, the latter only defined over fields with an order 3 automorphism.
The additional diagram automorphisms in positive characteristic yield the Suzuki–Ree groups, ^{2}B_{2}, ^{2}F_{4}, and ^{2}G_{2}.
Folding
A (simplylaced) Dynkin diagram (finite or affine) that has a symmetry (satisfying one condition, below) can be quotiented by the symmetry, yielding a new, generally multiply laced diagram, with the process called folding (due to most symmetries being 2fold). At the level of Lie algebras, this corresponds to taking the invariant subalgebra under the outer automorphism group, and the process can be defined purely with reference to root systems, without using diagrams.^{[6]} Further, every multiply laced diagram (finite or infinite) can be obtained by folding a simplylaced diagram.^{[7]}
The one condition on the automorphism for folding to be possible is that distinct nodes of the graph in the same orbit (under the automorphism) must not be connected by an edge; at the level of root systems, roots in the same orbit must be orthogonal.^{[7]} At the level of diagrams, this is necessary as otherwise the quotient diagram will have a loop, due to identifying two nodes but having an edge between them, and loops are not allowed in Dynkin diagrams.
The nodes and edges of the quotient ("folded") diagram are the orbits of nodes and edges of the original diagram; the edges are single unless two incident edges map to the same edge (notably at nodes of valence greater than 2) – a "branch point" of the map, in which case the weight is the number of incident edges, and the arrow points towards the node at which they are incident – "the branch point maps to the nonhomogeneous point". For example, in D_{4} folding to G_{2}, the edge in G_{2} points from the class of the 3 outer nodes (valence 1), to the class of the central node (valence 3).
The foldings of finite diagrams are:^{[8]}^{[note 2]}
 (The automorphism of A_{2n} does not yield a folding because the middle two nodes are connected by an edge, but in the same orbit.)
 (if quotienting by the full group or a 3cycle, in addition to in 3 different ways, if quotienting by an involution)
Similar foldings exist for affine diagrams, including:
The notion of foldings can also be applied more generally to Coxeter diagrams^{[9]} – notably, one can generalize allowable quotients of Dynkin diagrams to H_{n} and I_{2}(p). Geometrically this corresponds to projections of uniform polytopes. Notably, any simply laced Dynkin diagram can be folded to I_{2}(h), where h is the Coxeter number, which corresponds geometrically to projection to the Coxeter plane.
Folding can be applied to reduce questions about (semisimple) Lie algebras to questions about simplylaced ones, together with an automorphism, which may be simpler than treating multiply laced algebras directly; this can be done in constructing the semisimple Lie algebras, for instance. See Math Overflow: Folding by Automorphisms for further discussion.
Other maps of diagrams
A_{2} root system 
G_{2} root system 
Some additional maps of diagrams have meaningful interpretations, as detailed below. However, not all maps of root systems arise as maps of diagrams.^{[10]}
For example, there are two inclusions of root systems of A_{2} in G_{2}, either as the six long roots or the six short roots. However, the nodes in the G_{2} diagram correspond to one long root and one short root, while the nodes in the A_{2} diagram correspond to roots of equal length, and thus this map of root systems cannot be expressed as a map of the diagrams.
Some inclusions of root systems can be expressed as one diagram being an induced subgraph of another, meaning "a subset of the nodes, with all edges between them". This is because eliminating a node from a Dynkin diagram corresponds to removing a simple root from a root system, which yields a root system of rank one lower. By contrast, removing an edge (or changing the multiplicity of an edge) while leaving the nodes unchanged corresponds to changing the angles between roots, which cannot be done without changing the entire root system. Thus, one can meaningfully remove nodes, but not edges. Removing a node from a connected diagram may yield a connected diagram (simple Lie algebra), if the node is a leaf, or a disconnected diagram (semisimple but not simple Lie algebra), with either two or three components (the latter for D_{n} and E_{n}). At the level of Lie algebras, these inclusions correspond to subLie algebras.
The maximal subgraphs are ("conjugate" means "by a diagram automorphism"):
 A_{n+1}: A_{n}, in 2 conjugate ways.
 B_{n+1}: A_{n}, B_{n}.
 C_{n+1}: A_{n}, C_{n}.
 D_{n+1}: A_{n} (2 conjugate ways), D_{n}.
 E_{n+1}: A_{n}, D_{n}, E_{n}.
 F_{4}: B_{3}, C_{3}.
 G_{2}: A_{1}, in 2 nonconjugate ways (as a long root or a short root).
Finally, duality of diagrams corresponds to reversing the direction of arrows, if any:^{[10]} B_{n} and C_{n} are dual, while F_{4}, and G_{2} are selfdual, as are the simplylaced ADE diagrams.
Simply laced
{{#invoke:mainmain}}
A Dynkin diagram with no multiple edges is called simply laced, as are the corresponding Lie algebra and Lie group. These are the diagrams, and phenomena that such diagrams classify are referred to as an ADE classification. In this case the Dynkin diagrams exactly coincide with Coxeter diagrams, as there are no multiple edges.
Satake diagrams
{{#invoke:mainmain}} Template:Expand section
Dynkin diagrams classify complex semisimple Lie algebras. Real semisimple Lie algebras can be classified as real forms of complex semisimple Lie algebras, and these are classified by Satake diagrams, which are obtained from the Dynkin diagram by labeling some vertices black (filled), and connecting some other vertices in pairs by arrows, according to certain rules.
History
{{#invoke:see alsoseealso}}
Dynkin diagrams are named for Eugene Dynkin, who used them in two papers (1946, 1947) simplifying the classification of semisimple Lie algebras;^{[11]} see Template:Harv. When Dynkin left the Soviet Union in 1976, which was at the time considered tantamount to treason, Soviet mathematicians were directed to refer to "diagrams of simple roots" rather than use his name.{{ safesubst:#invoke:Unsubstdate=__DATE__ $B= {{#invoke:Category handlermain}}{{#invoke:Category handlermain}}^{[citation needed]} }}
Undirected graphs had been used earlier by Coxeter (1934) to classify reflection groups, where the nodes corresponded to simple reflections; the graphs were then used (with length information) by Witt (1941) in reference to root systems, with the nodes corresponding to simple roots, as they are used today.^{[11]}^{[12]} Dynkin then used them in 1946 and 1947, acknowledging Coxeter and Witt in his 1947 paper.
Conventions
Dynkin diagrams have been drawn in a number of ways;^{[12]} the convention followed here is common, with 180° angles on nodes of valence 2, 120° angles on the valence 3 node of D_{n}, and 90°/90°/180° angles on the valence 3 node of E_{n}, with multiplicity indicated by 1, 2, or 3 parallel edges, and root length indicated by drawing an arrow on the edge for orientation. Beyond simplicity, a further benefit of this convention is that diagram automorphisms are realized by Euclidean isometries of the diagrams.
Alternative convention include writing a number by the edge to indicate multiplicity (commonly used in Coxeter diagrams), darkening nodes to indicate root length, or using 120° angles on valence 2 nodes to make the nodes more distinct.
There are also conventions about numbering the nodes. The most common modern convention had developed by the 1960s and is illustrated in Template:Harv.^{[12]}
Rank 2 Dynkin diagrams
Dynkin diagrams are equivalent to generalized Cartan matrices, as shown in this table of rank 2 Dynkin diagrams with their corresponding 2x2 Cartan matrices.
For rank 2, the Cartan matrix form is:
A multiedged diagram corresponds to the nondiagonal Cartan matrix elements a_{21}, a_{12}, with the number of edges drawn equal to max(a_{21}, a_{12}), and an arrow pointing towards nonunity elements.
A generalized Cartan matrix is a square matrix such that:
The Cartan matrix determines whether the group is of finite type (if it is a Positivedefinite matrix, i.e. all eigenvalues are positive), of affine type (if it is not positivedefinite but positivesemidefinite, i.e. all eigenvalues are nonnegative), or of indefinite type. The indefinite type often is further subdivided, for example a Coxeter group is Lorentzian if it has one negative eigenvalue and all other eigenvalues are positive. Moreover, multiple sources refer to hyberbolic Coxeter groups, but there are several nonequivalent definitions for this term. In the discussion below, hyperbolic Coxeter groups are a special case of Lorentzian, satisfying an extra condition. Note that for rank 2, all negative determinant Cartan matrices correspond to hyperbolic Coxeter group. But in general, most negative determinant matrices are neither hyperbolic nor Lorentzian.
Finite branches have (a_{21}, a_{12})=(1,1), (2,1), (3,1), and affine branches (with a zero determinant) have (a_{21}, a_{12}) =(2,2) or (4,1).
Group name 
Dynkin diagram  Cartan matrix  Symmetry order 
Related simplylaced group^{3}  

(Standard) multiedged graph Template:Dynkin2 
Valued graph^{1} 
Coxeter graph^{2} 
Determinant (4a_{21}*a_{12})  
Finite (Determinant>0)  
A_{1}xA_{1}  Template:Dynkin Template:Dynkin  Template:Dynkin Template:Dynkin  Template:CDD  4  2  
A_{2} (undirected) 
Template:Dynkin  Template:Dynkin  Template:CDD  3  3  
B_{2}  Template:Dynkin  Template:Dynkin  2  4  Template:Dynkin  
C_{2}  Template:Dynkin  Template:Dynkin  2  4  Template:Dynkin  
BC_{2} (undirected) 
Template:Dynkin  Template:CDD  2  4  
G_{2}  Template:Dynkin  Template:Dynkin  1  6  
G_{2} (undirected) 
Template:Dynkin  Template:CDD  1  6  
Affine (Determinant=0)  
A_{1}^{(1)}  Template:Dynkin  Template:Dynkin  Template:CDD  0  ∞  
A_{2}^{(2)}  Template:Dynkin  Template:Dynkin  0  ∞  
Hyperbolic (Determinant<0)  
Template:Dynkin  1    
Template:Dynkin  2    
Template:Dynkin  2    
Template:Dynkin  3    
Template:Dynkin  4    
Template:Dynkin  4    
Template:Dynkin  5    
Template:Dynkin  4ab<0    
Note^{1}: For hyperbolic groups, (a_{12}*a_{21}>4), the multiedge style is abandoned in favor of an explicit labeling (a_{21}, a_{12}) on the edge. These are usually not applied to finite and affine graphs.^{[13]} Note^{2}: For undirected groups, Coxeter diagrams are interchangeable. They are usually labeled by their order of symmetry, with order3 implied with no label. Note^{3}: Many multiedged groups can be obtained from a higher ranked simplylaced group by applying a suitable folding operation. 
Finite Dynkin diagrams
Affine Dynkin diagrams
There are extensions of Dynkin diagrams, namely the affine Dynkin diagrams; these classify Cartan matrices of affine Lie algebras. These are classified in Template:Harv, specifically listed on Template:Harv. Affine diagrams are denoted as or where X is the letter of the corresponding finite diagram, and the exponent depends on which series of affine diagrams they are in. The first of these, are most common, and are called extended Dynkin diagrams and denoted with a tilde, and also sometimes marked with a + superscript.^{[14]} as in . The (2) and (3) series are called twisted affine diagrams.
See Dynkin diagram generator for diagrams.
The set of extended affine Dynkin diagrams, with added nodes in green ( for and for ) 
"Twisted" affine forms are named with (2) or (3) superscripts. (k is the number of yellow nodes in the graph) 
Here are all of the Dynkin graphs for affine groups up to 10 nodes. Extended Dynkin graphs are given as the ~ families, the same as the finite graphs above, with one node added. Other directedgraph variations are given with a superscript value (2) or (3), representing foldings of higher order groups. These are categorized as Twisted affine diagrams.^{[15]}
Hyperbolic and higher Dynkin diagrams
The set of compact and noncompact hyperbolic Dynkin graphs has been enumerated.^{[16]} All rank 3 hyperbolic graphs are compact. Compact hyperbolic Dynkin diagrams exist up to rank 5, and noncompact hyperbolic graphs exist up to rank 10.
Rank  Compact  Noncompact  Total 

3  31  93  123 
4  3  50  53 
5  1  21  22 
6  0  22  22 
7  0  4  4 
8  0  5  5 
9  0  5  5 
10  0  4  4 
Compact hyperbolic Dynkin diagrams
Rank 3  Rank 4  Rank 5  

Linear graphs

Cyclic graphs



Noncompact (Overextended forms)
Some notations used in theoretical physics, such as Mtheory, use a "+" superscript for extended groups instead of a "~" and this allows higher extensions groups to be defined.
 Extended Dynkin diagrams (affine) are given "+" and represent one added node. (Same as "~")
 Overextended Dynkin diagrams (hyperbolic) are given "^" or "++" and represent two added nodes.
 Veryextended Dynkin diagrams with 3 nodes added are given "+++".
238 Hyperbolic groups (compact and noncompact)
The 238 enumerated hyperbolic groups (compact and noncompact) are named as: H_{i}^{(n)}, for rank n, and counting i=1,2,3... for each rank.
Veryextended
Veryextended groups are lorentz groups, defined by adding three nodes to the finite groups. The E_{8}, E_{7}, E_{6}, F_{4}, and G_{2} offer six series ending as veryextended groups. Other extended series not shown can be defined from A_{n}, B_{n}, C_{n}, and D_{n}, as different series for each n. The determinant of the associated Cartan matrix determine where the series changes from finite (positive) to affine (zero) to a noncompact hyperbolic group (negative), and ending as a lorentz group that can be defined with the use of one timelike dimension, and is used in M theory.^{[17]}
Finite  

2  A_{2}Template:Dynkin2  C_{2}Template:Dynkin  G_{2}Template:Dynkin 
3  A_{2}^{+}= Template:Dynkin 
C_{2}^{+}= Template:Dynkin 
G_{2}^{+}= Template:Dynkin 
4  A_{2}^{++} Template:Dynkin 
C_{2}^{++} Template:Dynkin 
G_{2}^{++} Template:Dynkin 
5  A_{2}^{+++} Template:Dynkin 
C_{2}^{+++} Template:Dynkin 
G_{2}^{+++} Template:Dynkin 
Det(M_{n})  3(3n)  2(3n)  3n 
Finite  

4  B_{3}A_{1} Template:Dynkin2 
A_{3}A_{1} Template:Dynkin2 
A_{2}^{2} Template:Dynkin  
5  A_{5} Template:Dynkin 
Template:Dynkin2  D_{5} Template:Dynkin2 
B_{4}A_{1} Template:Dynkin2 
D_{4}A_{1} Template:Dynkin2 
A_{5} Template:Dynkin  
6  A_{5}^{+}= Template:Dynkin 
B_{5}^{+}= Template:Dynkin2 
D_{5}^{+}= Template:Dynkin2 
A_{6} Template:Dynkin2 
B_{6} Template:Dynkin2 
D_{6} Template:Dynkin2 
E_{6} Template:Dynkin 
7  A_{5}^{++} Template:Dynkin 
B_{5}^{++} Template:Dynkin2 
D_{5}^{++} Template:Dynkin2 
A_{6}^{+}= Template:Dynkin 
B_{6}^{+}= Template:Dynkin2 
D_{6}^{+}= Template:Dynkin2 
E_{6}^{+}= Template:Dynkin 
8  A_{5}^{+++} Template:Dynkin 
B_{5}^{+++} Template:Dynkin2 
D_{5}^{+++} Template:Dynkin2 
A_{6}^{++} Template:Dynkin 
B_{6}^{++} Template:Dynkin2 
D_{6}^{++} Template:Dynkin2 
E_{6}^{++} Template:Dynkin 
9  A_{6}^{+++} Template:Dynkin 
B_{6}^{+++} Template:Dynkin2 
D_{6}^{+++} Template:Dynkin2 
E_{6}^{+++} Template:Dynkin  
Det(M_{n})  6(6n)  2(6n)  4(6n)  7(7n)  2(7n)  4(7n)  3(7n) 
Finite  A_{7}  B_{7}  D_{7}  E_{7}  E_{8} 

3  E_{3}=A_{2}A_{1} Template:Dynkin2  
4  A_{3}A_{1} Template:Dynkin2 
E_{4}=A_{4} Template:Dynkin2  
5  A_{5} Template:Dynkin2 
E_{5}=D_{5} Template:Dynkin2  
6  B_{5}A_{1} Template:Dynkin2 
D_{5}A_{1} Template:Dynkin2 
D_{6} Template:Dynkin2 
E_{6} Template:Dynkin2  
7  A_{7} Template:Dynkin 
B_{7} Template:Dynkin2 
D_{7} Template:Dynkin2 
E_{7} Template:Dynkin2 
E_{7} Template:Dynkin2 
8  A_{7}^{+}= Template:Dynkin 
B_{7}^{+}= Template:Dynkin2 
D_{7}^{+}= Template:Dynkin2 
E_{7}^{+}= Template:Dynkin2 
E_{8} Template:Dynkin2 
9  A_{7}^{++} Template:Dynkin 
B_{7}^{++} Template:Dynkin2 
D_{7}^{++} Template:Dynkin2 
E_{7}^{++} Template:Dynkin2 
E_{9}=E_{8}^{+}= Template:Dynkin2 
10  A_{7}^{+++} Template:Dynkin 
B_{7}^{+++} Template:Dynkin2 
D_{7}^{+++} Template:Dynkin2 
E_{7}^{+++} Template:Dynkin2 
E_{10}=E_{8}^{++} Template:Dynkin2 
11  E_{11}=E_{8}^{+++} Template:Dynkin2  
Det(M_{n})  8(8n)  2(8n)  4(8n)  2(8n)  9n 
See also
 Affine Dynkin diagram
 Satake diagram
 Klassifikation von Wurzelsystemen (Classification of root systems) Template:De icon
Notes
References
 ↑ {{#invoke:citation/CS1citation CitationClass=citation }}
 ↑ Template:Harv
 ↑ ^{3.0} ^{3.1} ^{3.2} Outer automorphisms of simple Lie Algebras
 ↑ Template:Harv
 ↑ Template:Harv
 ↑ Algebraic geometry and number theory: in honor of Vladimir Drinfeld's 50th Birthday, edited by Victor Ginzburg, p. 47, section 3.6: Cluster folding
 ↑ ^{7.0} ^{7.1} Folding by Automorphisms, John Stembridge, 4pp., 79K, 20 August 2008, Other Articles by John Stembridge
 ↑ See Template:Harv for illustrations of these foldings and references.
 ↑ Template:Cite paper
 ↑ ^{10.0} ^{10.1} Transformations of Dynkin Diagrams, John Armstrong, March 5, 2010
 ↑ ^{11.0} ^{11.1} Template:Harv
 ↑ ^{12.0} ^{12.1} ^{12.2} Why are the Dynkin diagrams E6, E7 and E8 always drawn the way they are drawn?
 ↑ Notes on Coxeter Transformations and the McKay correspondence, Rafael Stekolshchik, 2005, Section 2.1 The Cartan matrix and its Tits form p. 27. [1]
 ↑ See for example Reflection groups and Coxeter groups, by James E. Humphreys, p. 96
 ↑ [2] Infinite dimensional Lie algebras, Victor Kac
 ↑ Carbone, L, Chung, S, Cobbs, C, McRae, R, Nandi, D, Naqvi, Y, and Penta, D: Classification of hyperbolic Dynkin diagrams, root lengths and Weyl group orbits, J. Phys. A: Math. Theor. 43 155209, 2010, arXiv:1003.0564
 ↑ The symmetry of Mtheories, Francois Englert, Laurent Houart, Anne Taormina and Peter West, 2003
 {{#invoke:citation/CS1citation
CitationClass=citation }}
 {{#invoke:citation/CS1citation
CitationClass=citation }}
 {{#invoke:citation/CS1citation
CitationClass=citation }}
 {{#invoke:citation/CS1citation
CitationClass=citation }}
 Template:FultonHarris
 {{#invoke:citation/CS1citation
CitationClass=citation }}
 {{#invoke:citation/CS1citation
CitationClass=citation }}