Lie groups andLie algebras
Classical groups General linear GL(n) Special linear SL(n) Orthogonal O(n) Special orthogonal SO(n) Unitary U(n) Special unitary SU(n) Symplectic Sp(n)
Simple Lie groups Classical An Bn Cn Dn Exceptional G2 F4 E6 E7 E8
Other Lie groups Circle Lorentz Poincaré Conformal group Diffeomorphism Loop Euclidean
Lie algebras Lie group–Lie algebra correspondence Exponential map Adjoint representation Killing form Index Simple Lie algebra Loop algebra Affine Lie algebra
Semisimple Lie algebra Dynkin diagrams Cartan subalgebra Root system Weyl group Real form Complexification Split Lie algebra Compact Lie algebra
Representation theory Lie group representation Lie algebra representation Representation theory of semisimple Lie algebras Representations of classical Lie groups Theorem of the highest weight Borel–Weil–Bott theorem
Lie groups inphysics Particle physics and representation theory Lorentz group representations Poincaré group representations Galilean group representations
Scientists Sophus Lie Henri Poincaré Wilhelm Killing Élie Cartan Hermann Weyl Claude Chevalley Harish-Chandra Armand Borel
Glossary Table of Lie groups
v t e

In themathematical field ofLie theory, aDynkin diagram, named forEugene Dynkin, is a type ofgraph with some edges doubled or tripled (drawn as a double or triple line). Dynkin diagrams arise in the classification ofsemisimple Lie algebras overalgebraically closed fields, in the classification ofWeyl groups and otherfinite reflection groups, and in other contexts. Various properties of the Dynkin diagram (such as whether it contains multiple edges, or its symmetries) correspond to important features of the associated Lie algebra.

The term "Dynkin diagram" can be ambiguous. In some cases, Dynkin diagrams are assumed to bedirected, in which case they correspond toroot systems and semi-simple Lie algebras, while in other cases they are assumed to beundirected, in which case they correspond to Weyl groups. In this article, "Dynkin diagram" meansdirected Dynkin diagram, andundirected Dynkin diagrams will be explicitly so named.

The fundamental interest in Dynkin diagrams is that they classifysemisimple Lie algebras overalgebraically closed fields. One classifies such Lie algebras via theirroot 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 thefinite reflection group it generates, the so-calledWeyl group, and thus undirected Dynkin diagrams classify Weyl groups.

They have the following correspondence for the Lie algebras associated to classical groups over the complex numbers:

• ${\displaystyle A_n}$:${\displaystyle {\mathfrak{s}\mathfrak{l}}_{n+1}}$, thespecial linear Lie algebra.
• ${\displaystyle B_n}$:${\displaystyle {\mathfrak{s}\mathfrak{o}}_{2n+1}}$, the odd-dimensionalspecial orthogonal Lie algebra.
• ${\displaystyle C_n}$:${\displaystyle {\mathfrak{s}\mathfrak{p}}_{2n}}$, thesymplectic Lie algebra.
• ${\displaystyle D_n}$:${\displaystyle {\mathfrak{s}\mathfrak{o}}_{2n}}$, the even-dimensionalspecial orthogonal Lie algebra (${\displaystyle n>1}$).

For the exceptional groups, the names for the Lie algebra and the associated Dynkin diagram coincide.

Dynkin diagrams can be interpreted as classifying many distinct, related objects, and the notation "A_n, B_n, ..." is used to refer toall 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.

Theunoriented Dynkin diagram is a form ofCoxeter diagram, and corresponds to the Weyl group, which is thefinite 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.

Although the Weyl group is abstractly isomorphic to the Coxeter group, a specific isomorphism depends on an ordered choice of simple roots. Likewise, while Dynkin diagram notation is standardized, Coxeter diagram and group notation is varied and sometimes agrees with Dynkin diagram notation and sometimes does not.^{[citation needed]}

Lastly,sometimes associated objects are referred to by the same notation, though this cannot always be done regularly. Examples include:

• Theroot lattice generated by the root system, as in theE₈ lattice. This is naturally defined, but not one-to-one – for example, A₂ and G₂ both generate thehexagonal lattice.
• An associated polytope – for exampleGosset 4₂₁ polytope may be referred to as "the E₈ polytope", as its vertices are derived from the E₈ root system and it has the E₈ Coxeter group as symmetry group.
• An associated quadratic form or manifold – for example, theE₈ manifold hasintersection form given by the E₈ 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 (then) 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 (afundamental representation) of the Lie algebra – the index on the Dynkin diagram should not be confused with the index on the Lie algebra. For example,${\displaystyle B_4}$ corresponds to${\displaystyle {\mathfrak{s}\mathfrak{o}}_{2\cdot 4+1}={\mathfrak{s}\mathfrak{o}}_9,}$ which naturally acts on 9-dimensional space, but has rank 4 as a Lie algebra.

Thesimply laced Dynkin diagrams, those with no multiple edges (A, D, E) classify many further mathematical objects; see discussion atADE classification.

For example, the symbol${\displaystyle A_2}$ may refer to:

• TheDynkin diagram with 2 connected nodes,, which may also be interpreted as aCoxeter diagram.
• Theroot system with 2 simple roots at a${\displaystyle 2\pi /3}$ (120 degree) angle.
• TheLie algebra${\displaystyle {\mathfrak{s}\mathfrak{l}}_{2+1}={\mathfrak{s}\mathfrak{l}}_3}$ ofrank 2.
• TheWeyl group of symmetries of the roots (reflections in the hyperplane orthogonal to the roots), isomorphic to thesymmetric group${\displaystyle S_3}$ (of order 6).
• The abstractCoxeter group, presented by generators and relations,${\displaystyle ⟨r_1,r_2\mid (r_1{)}^2=(r_2{)}^2=(r_i{r}_j{)}^3=1⟩.}$

Consider aroot system, assumed to be reduced and integral (or "crystallographic"). In many applications, this root system will arise from asemisimple Lie algebra. Let${\displaystyle \mathrm{\Delta }}$ be a set ofpositive simple roots. We then construct a diagram from${\displaystyle \mathrm{\Delta }}$ as follows.^[1] Form a graph with one vertex for each element of${\displaystyle \mathrm{\Delta }}$. Then insert edges between each pair of vertices according to the following recipe. If the roots corresponding to the two vertices are orthogonal, there is no edge between the vertices. If the angle between the two roots is 120 degrees, we put one edge between the vertices. If the angle is 135 degrees, we put two edges, and if the angle is 150 degrees, we put three edges. (These four cases exhaust all possible angles between pairs of positive simple roots.^[2]) Finally, if there are any edges between a given pair of vertices, we decorate them with an arrow pointing from the vertex corresponding to the longer root to the vertex corresponding to the shorter one. (The arrow is omitted if the roots have the same length.) Thinking of the arrow as a "greater than" sign makes it clear which way the arrow should go. Dynkin diagrams lead to aclassification of root systems. The angles and length ratios between roots arerelated.^[3] Thus, the edges for non-orthogonal roots may alternatively be described as one edge for a length ratio of 1, two edges for a length ratio of${\displaystyle \sqrt{2}}$, and three edges for a length ratio of${\displaystyle \sqrt{3}}$. (There are no edges when the roots are orthogonal, regardless of the length ratio.)

In the${\displaystyle A_2}$ root system, shown at right, the roots labeled${\displaystyle \alpha }$ and${\displaystyle \beta }$ form a base. Since these two roots are at angle of 120 degrees (with a length ratio of 1), the Dynkin diagram consists of two vertices connected by a single edge:.

This sectionneeds expansion. You can help byadding to it.(December 2009)

Dynkin diagrams must satisfy certain constraints; these are essentially those satisfied by finiteCoxeter–Dynkin diagrams, together with an additional crystallographic constraint.

Dynkin diagrams are closely related toCoxeter diagrams of finiteCoxeter 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 arepartlydirected – 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 havemore 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 thecrystallographic 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 (forp = 4, 6), rather than an edge labeled with "p".

The term "Dynkin diagram" at times refers to thedirected graph, at times to theundirected graph. For precision, in this article "Dynkin diagram" will meandirected, and the underlying undirected graph will be called an "undirected Dynkin diagram". Then Dynkin diagrams and Coxeter diagrams may be related as follows:

By this is meant that Coxeter diagrams of finite groups correspond topoint groups generated by reflections, while Dynkin diagrams must satisfy an additional restriction corresponding to thecrystallographic restriction theorem, and that Coxeter diagrams are undirected, while Dynkin diagrams are (partly) directed.

The corresponding mathematical objects classified by the diagrams are:

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 little-discussed, 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 one-to-one, as theB_n andC_n diagrams map to the same undirected diagram, with the resulting Coxeter diagram and Weyl group thus sometimes denotedBC_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 beingH₃,H₄ andI₂(p) forp = 5 p ≥ 7), and correspondingly not every finite Coxeter group is a Weyl group.

Dynkin diagrams are conventionally numbered so that the list is non-redundant:${\displaystyle n\ge 1}$ for${\displaystyle A_n,}$${\displaystyle n\ge 2}$ for${\displaystyle B_n,}$${\displaystyle n\ge 3}$ for${\displaystyle C_n,}$${\displaystyle n\ge 4}$ for${\displaystyle D_n,}$ and${\displaystyle E_n}$ starting at${\displaystyle n=6.}$ The families can however be defined for lowern, yieldingexceptional isomorphisms of diagrams, and corresponding exceptional isomorphisms of Lie algebras and associated Lie groups.

Trivially, one can start the families at${\displaystyle n=0}$ or${\displaystyle n=1,}$ which are all then isomorphic as there is a unique empty diagram and a unique 1-node diagram. The other isomorphisms of connected Dynkin diagrams are:

• ${\displaystyle A_1\cong B_1\cong C_1}$
• ${\displaystyle B_2\cong C_2}$
• ${\displaystyle D_2\cong A_1\times A_1}$
• ${\displaystyle D_3\cong A_3}$
• ${\displaystyle E_3\cong A_1\times A_2}$
• ${\displaystyle E_4\cong A_4}$
• ${\displaystyle E_5\cong D_5}$

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 theE_n family.^[4]

In addition to isomorphism between different diagrams, some diagrams also have self-isomorphisms or "automorphisms". Diagram automorphisms correspond toouter automorphisms of the Lie algebra, meaning that the outer automorphism group Out = Aut/Inn equals the group of diagram automorphisms.^[5][6][7]

The diagrams that have non-trivial automorphisms are A_n (${\displaystyle n>1}$), D_n (${\displaystyle n>1}$), and E₆. In all these cases except for D₄, there is a single non-trivial automorphism (Out =C₂, the cyclic group of order 2), while for D₄, the automorphism group is thesymmetric group on three letters (S₃, 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 thefundamental weights, which (for A_n−1) are${\displaystyle \stackrel{i}{\bigwedge }{C}^n}$ for${\displaystyle i=1,\dots ,n}$, and the diagram automorphism corresponds to the duality${\displaystyle \stackrel{i}{\bigwedge }{C}^n\mapsto \stackrel{n-i}{\bigwedge }{C}^n.}$ Realized as the Lie algebra${\displaystyle {\mathfrak{s}\mathfrak{l}}_{n+1},}$ the outer automorphism can be expressed as negative transpose,${\displaystyle T\mapsto -T^{\mathrm{T}}}$, which is how the dual representation acts.^[6]

For D_n, the diagram automorphism is switching the two nodes at the end of the Y, and corresponds to switching the twochiralspin representations. Realized as the Lie algebra${\displaystyle {\mathfrak{s}\mathfrak{o}}_{2n},}$ the outer automorphism can be expressed as conjugation by a matrix in O(2n) with determinant −1. Whenn = 3, one has${\displaystyle {\mathrm{D}}_3\cong {\mathrm{A}}_3,}$ so their automorphisms agree, while${\displaystyle {\mathrm{D}}_2\cong {\mathrm{A}}_1\times {\mathrm{A}}_1}$ is disconnected, and the automorphism corresponds to switching the two nodes.

For D₄, thefundamental representation is isomorphic to the two spin representations, and the resultingsymmetric group on three letter (S₃, or alternatively thedihedral group of order 6, Dih₃) corresponds both to automorphisms of the Lie algebra and automorphisms of the diagram.

The automorphism group of E₆ corresponds to reversing the diagram, and can be expressed usingJordan algebras.^[6][8]

Disconnected diagrams, which correspond tosemisimple Lie algebras, may have automorphisms from exchanging components of the diagram.

Inpositive characteristic there are additional "diagram automorphisms" – roughly speaking, in characteristicp one is sometimes allowed to ignore the arrow on bonds of multiplicityp in the Dynkin diagram when taking diagram automorphisms. Thus in characteristic 2 there is an order 2 automorphism of${\displaystyle {\mathrm{B}}_2\cong {\mathrm{C}}_2}$ and of F₄, while in characteristic 3 there is an order 2 automorphism of G₂. But doesn't apply in all circumstances: for example, such automorphisms need not arise as automorphisms of the corresponding algebraic group, but rather on the level of points valued in a finite field.

Diagram automorphisms in turn yield additionalLie groups andgroups of Lie type, which are of central importance in the classification of finite simple groups.

TheChevalley 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 non-split orthogonal groups. TheSteinberg groups construct the unitary groups²A_n, while the other orthogonal groups are constructed as²D_n, where in both cases this refers to combining a diagram automorphism with a field automorphism. This also yields additional exotic Lie groups²E₆ and³D₄, the latter only defined over fields with an order 3 automorphism.

The additional diagram automorphisms in positive characteristic yield theSuzuki–Ree groups,²B₂,²F₄, and²G₂.

A (simply-laced) Dynkin diagram (finite oraffine) that has a symmetry (satisfying one condition, below) can be quotiented by the symmetry, yielding a new, generally multiply laced diagram, with the process calledfolding (due to most symmetries being 2-fold). 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.^[9] Further, every multiply laced diagram (finite or infinite) can be obtained by folding a simply-laced diagram.^[10]

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.^[10] 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 pointstowards the node at which they are incident – "the branch point maps to the non-homogeneous point". For example, in D₄ folding to G₂, the edge in G₂ 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:^{[11][note 2]}

• ${\displaystyle A_{2n-1}\to C_n}$

(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.)

• ${\displaystyle D_{n+1}\to B_n}$
• ${\displaystyle D_4\to G_2}$ (if quotienting by the full group or a 3-cycle, in addition to${\displaystyle D_4\to B_3}$ in 3 different ways, if quotienting by an involution)
• ${\displaystyle E_6\to F_4}$

Similar foldings exist for affine diagrams, including:

• ${\displaystyle {\tilde{A}}_{2n-1}\to {\tilde{C}}_n}$
• ${\displaystyle {\tilde{D}}_{n+1}\to {\tilde{B}}_n}$
• ${\displaystyle {\tilde{D}}_4\to {\tilde{G}}_2}$
• ${\displaystyle {\tilde{E}}_6\to {\tilde{F}}_4}$

The notion of foldings can also be applied more generally toCoxeter diagrams^[12] – notably, one can generalize allowable quotients of Dynkin diagrams to H_n and I₂(p). Geometrically this corresponds to projections ofuniform polytopes. Notably, any simply laced Dynkin diagram can be folded to I₂(h), whereh is theCoxeter number, which corresponds geometrically to projection to theCoxeter plane.

Folding can be applied to reduce questions about (semisimple) Lie algebras to questions about simply-laced 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. SeeMath Overflow: Folding by Automorphisms for further discussion.

A2 root system

G2 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.^[13]

For example, there are two inclusions of root systems of A₂ in G₂, either as the six long roots or the six short roots. However, the nodes in the G₂ diagram correspond to one long root and one short root, while the nodes in the A₂ 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 aninduced 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 sub-Lie algebras.

The maximal subgraphs are as follows; subgraphs related by adiagram automorphism are labeled "conjugate":

• 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.
  • For E₆, two of these coincide:${\displaystyle {\mathrm{D}}_5\cong {\mathrm{E}}_5}$ and are conjugate.
• F₄: B₃, C₃.
• G₂: A₁, in 2 non-conjugate ways (as a long root or a short root).

Finally, duality of diagrams corresponds to reversing the direction of arrows, if any:^[13] B_n and C_n are dual, while F₄, and G₂ are self-dual, as are the simply-laced ADE diagrams.

A Dynkin diagram with no multiple edges is calledsimply laced, as are the corresponding Lie algebra and Lie group. These are the${\displaystyle A_n,D_n,E_n}$ diagrams, and phenomena that such diagrams classify are referred to as anADE classification. In this case the Dynkin diagrams exactly coincide with Coxeter diagrams, as there are no multiple edges.

This sectionneeds expansion. You can help byadding to it.(December 2009)

Dynkin diagrams classifycomplex semisimple Lie algebras. Real semisimple Lie algebras can be classified asreal forms of complex semisimple Lie algebras, and these are classified bySatake 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.

Dynkin diagrams are named forEugene Dynkin, who used them in two papers (1946, 1947) simplifying the classification of semisimple Lie algebras;^[14] see (Dynkin 2000). 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.^{[citation needed]}

Undirected graphs had been used earlier by Coxeter (1934) to classifyreflection 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.^[14][15] Dynkin then used them in 1946 and 1947, acknowledging Coxeter and Witt in his 1947 paper.

Dynkin diagrams have been drawn in a number of ways;^[15] 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 (Bourbaki 1968).^[15]

Dynkin diagrams are equivalent to generalizedCartan matrices, as shown in this table of rank 2 Dynkin diagrams with their corresponding2 × 2 Cartan matrices.

For rank 2, the Cartan matrix form is:

A multi-edged diagram corresponds to the nondiagonal Cartan matrix elements⁠${\displaystyle -a_{21},-a_{12}}$⁠, with the number of edges drawn equal to⁠${\displaystyle max(-a_{21},-a_{12})}$⁠, and an arrow pointing towards nonunity elements.

Ageneralized Cartan matrix is asquare matrix${\displaystyle A=(a_{ij})}$ such that:

1. For diagonal entries,${\displaystyle a_{ii}=2}$.
2. For non-diagonal entries,${\displaystyle a_{ij}\le 0}$.
3. ${\displaystyle a_{ij}=0}$ if and only if${\displaystyle a_{ji}=0}$

The Cartan matrix determines whether the group is offinite type (if it is apositive-definite matrix, i.e. all eigenvalues are positive), ofaffine type (if it is not positive-definite but positive-semidefinite, i.e. all eigenvalues are non-negative), or ofindefinite type. The indefinite type often is further subdivided, for example a Coxeter group isLorentzian if it has one negative eigenvalue and all other eigenvalues are positive. Moreover, multiple sources refer tohyberbolic Coxeter groups, but there are several non-equivalent definitions for this term. In the discussion below, hyperbolic Coxeter groups are a special case of Lorentzian, satisfying an extra condition. 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${\displaystyle (-a_{21},-a_{12})=(1,1),(2,1),(3,1)}$, and affine branches (with a zero determinant) have⁠${\displaystyle (-a_{21},-a_{12})=(2,2)\text{ or }(4,1)}$⁠.

Rank 2 Dynkin diagrams

Group name	Dynkin diagram			Cartan matrix		Symmetry order	Related simply-laced group3
	(Standard) multi-edged graph	Valued graph1	Coxeter graph2		Determinant ⁠${\displaystyle (4-a_{21}\cdot a_{12})}$⁠
Finite					Determinant > 0
A1xA1					4	2
A2 (undirected)					3	3
B2					2	4	${\displaystyle A_3}$
C2					2	4	${\displaystyle A_3}$
BC2 (undirected)					2	4
G2					1	6	${\displaystyle D_4}$
G2 (undirected)					1	6
Affine					Determinant = 0
A1(1)					0	∞	${\displaystyle {\tilde{A}}_3}$
A2(2)					0	∞	${\displaystyle {\tilde{D}}_4}$
Hyperbolic					Determinant < 0
					−1	—
					−2	—
					−2	—
					−3	—
					−4	—
					−4	—
					−5	—
					⁠⁠	—
Note1: For hyperbolic groups, (a12⋅a21>4), the multiedge style is abandoned in favor of an explicit labeling(a21,a12) on the edge. These are usually not applied to finite and affine graphs.[16] Note2: For undirected groups,Coxeter diagrams are interchangeable. They are usually labeled by their order of symmetry, with order-3 implied with no label. Note3: Many multi-edged groups can be obtained from a higher ranked simply-laced group by applying a suitablefolding operation.

Finite Dynkin graphs with 1 to 9 nodes

Rank	Classical Lie groups				Exceptional Lie groups
	${\displaystyle A_{1+}}$	${\displaystyle B_{2+}}$	${\displaystyle C_{2+}}$	${\displaystyle D_{2+}}$	${\displaystyle E_{3-8}}$	${\displaystyle G_2}$ /${\displaystyle F_4}$
1	A1
2	A2	B2	C2=B2	D2=A1A1		G2
3	A3	B3	C3	D3=A3	E3=A2A1
4	A4	B4	C4	D4	E4=A4	F4
5	A5	B5	C5	D5	E5=D5
6	A6	B6	C6	D6	E6
7	A7	B7	C7	D7	E7
8	A8	B8	C8	D8	E8
9	A9	B9	C9	D9
10+	..	..	..	..

There are extensions of Dynkin diagrams, namely theaffine Dynkin diagrams; these classify Cartan matrices ofaffine Lie algebras. These are classified in (Kac 1994, Chapter 4,pp. 47–), specifically listed on (Kac 1994,pp. 53–55). Affine diagrams are denoted as${\displaystyle X_l^{(1)},X_l^{(2)},}$ or${\displaystyle X_l^{(3)},}$ whereX 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,${\displaystyle X_l^{(1)},}$ are most common, and are calledextended Dynkin diagrams and denoted with atilde, and also sometimes marked with a+ superscript.^[17] as in${\displaystyle {\tilde{A}}_5=A_5^{(1)}=A_5^{+}}$. The (2) and (3) series are calledtwisted affine diagrams.

SeeDynkin diagram generator for diagrams.

The set of extended affine Dynkin diagrams, with added nodes in green (${\displaystyle n\ge 3}$ for${\displaystyle B_n}$ and${\displaystyle n\ge 4}$ for${\displaystyle D_n}$)

"Twisted" affine forms are named with (2) or (3) superscripts. (The subscriptk always counts the number ofyellow nodes in the graph, i.e. the total number of nodes minus 1.)

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 directed-graph variations are given with a superscript value (2) or (3), representing foldings of higher order groups. These are categorized asTwisted affine diagrams.^[18]

Connected affine Dynkin graphs up to (2 to 10 nodes)
(Grouped as undirected graphs)

Rank	${\displaystyle {\tilde{A}}_{1+}}$	${\displaystyle {\tilde{B}}_{3+}}$	${\displaystyle {\tilde{C}}_{2+}}$	${\displaystyle {\tilde{D}}_{4+}}$	E / F / G
2	${\displaystyle {\tilde{A}}_1}$ or${\displaystyle A_1^{(1)}}$		${\displaystyle A_2^{(2)}}$:
3	${\displaystyle {\tilde{A}}_2}$ or${\displaystyle A_2^{(1)}}$		${\displaystyle {\tilde{C}}_2}$ or${\displaystyle C_2^{(1)}}$ ${\displaystyle D_5^{(2)}}$: ${\displaystyle A_4^{(2)}}$:		${\displaystyle {\tilde{G}}_2}$ or${\displaystyle G_2^{(1)}}$ ${\displaystyle D_4^{(3)}}$
4	${\displaystyle {\tilde{A}}_3}$ or${\displaystyle A_3^{(1)}}$	${\displaystyle {\tilde{B}}_3}$ or${\displaystyle B_3^{(1)}}$ ${\displaystyle A_5^{(2)}}$:	${\displaystyle {\tilde{C}}_3}$ or${\displaystyle C_3^{(1)}}$ ${\displaystyle D_6^{(2)}}$: ${\displaystyle A_6^{(2)}}$:
5	${\displaystyle {\tilde{A}}_4}$ or${\displaystyle A_4^{(1)}}$	${\displaystyle {\tilde{B}}_4}$ or${\displaystyle B_4^{(1)}}$ ${\displaystyle A_7^{(2)}}$:	${\displaystyle {\tilde{C}}_4}$ or${\displaystyle C_4^{(1)}}$ ${\displaystyle D_7^{(2)}}$: ${\displaystyle A_8^{(2)}}$:	${\displaystyle {\tilde{D}}_4}$ or${\displaystyle D_4^{(1)}}$	${\displaystyle {\tilde{F}}_4}$ or${\displaystyle F_4^{(1)}}$ ${\displaystyle E_6^{(2)}}$
6	${\displaystyle {\tilde{A}}_5}$ or${\displaystyle A_5^{(1)}}$	${\displaystyle {\tilde{B}}_5}$ or${\displaystyle B_5^{(1)}}$ ${\displaystyle A_9^{(2)}}$:	${\displaystyle {\tilde{C}}_5}$ or${\displaystyle C_5^{(1)}}$ ${\displaystyle D_8^{(2)}}$: ${\displaystyle A_{10}^{(2)}}$:	${\displaystyle {\tilde{D}}_5}$ or${\displaystyle D_5^{(1)}}$
7	${\displaystyle {\tilde{A}}_6}$ or${\displaystyle A_6^{(1)}}$	${\displaystyle {\tilde{B}}_6}$ or${\displaystyle B_6^{(1)}}$ ${\displaystyle A_{11}^{(2)}}$:	${\displaystyle {\tilde{C}}_6}$ or${\displaystyle C_6^{(1)}}$ ${\displaystyle D_9^{(2)}}$: ${\displaystyle A_{12}^{(2)}}$:	${\displaystyle {\tilde{D}}_6}$ or${\displaystyle D_6^{(1)}}$	${\displaystyle {\tilde{E}}_6}$ or${\displaystyle E_6^{(1)}}$
8	${\displaystyle {\tilde{A}}_7}$ or${\displaystyle A_7^{(1)}}$	${\displaystyle {\tilde{B}}_7}$ or${\displaystyle B_7^{(1)}}$ ${\displaystyle A_{13}^{(2)}}$:	${\displaystyle {\tilde{C}}_7}$ or${\displaystyle C_7^{(1)}}$ ${\displaystyle D_{10}^{(2)}}$: ${\displaystyle A_{14}^{(2)}}$:	${\displaystyle {\tilde{D}}_7}$ or${\displaystyle D_7^{(1)}}$	${\displaystyle {\tilde{E}}_7}$ or${\displaystyle E_7^{(1)}}$
9	${\displaystyle {\tilde{A}}_8}$ or${\displaystyle A_8^{(1)}}$	${\displaystyle {\tilde{B}}_8}$ or${\displaystyle B_8^{(1)}}$ ${\displaystyle A_{15}^{(2)}}$:	${\displaystyle {\tilde{C}}_8}$ or${\displaystyle C_8^{(1)}}$ ${\displaystyle D_{11}^{(2)}}$: ${\displaystyle A_{16}^{(2)}}$:	${\displaystyle {\tilde{D}}_8}$ or${\displaystyle D_8^{(1)}}$	${\displaystyle {\tilde{E}}_8}$ or${\displaystyle E_8^{(1)}}$
10	${\displaystyle {\tilde{A}}_9}$ or${\displaystyle A_9^{(1)}}$	${\displaystyle {\tilde{B}}_9}$ or${\displaystyle B_9^{(1)}}$ ${\displaystyle A_{17}^{(2)}}$:	${\displaystyle {\tilde{C}}_9}$ or${\displaystyle C_9^{(1)}}$ ${\displaystyle D_{12}^{(2)}}$: ${\displaystyle A_{18}^{(2)}}$:	${\displaystyle {\tilde{D}}_9}$ or${\displaystyle D_9^{(1)}}$
11	...	...	...	...