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 semi-simple Lie algebras, while in other cases they are assumed to be undirected, in which case they correspond to Weyl groups; the $B_n$ and $C_n$ directed diagrams yield the same undirected diagram, correspondingly named $BC_n.$ In this article, "Dynkin diagram" means directed Dynkin diagram, and undirected Dynkin diagrams will be explicitly so named.

• 

  Finite Dynkin diagrams

• 

  Affine (extended) Dynkin diagrams

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 so-called 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₈ lattice. This is naturally defined, but not one-to-one – for example, A₂ and G₂ both generate the hexagonal lattice.
• An associated polytope – for example Gosset 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, the E₈ manifold has intersection 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 (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, $B_4$ corresponds to $\mathfrak{so}_{2\cdot 4 + 1} = \mathfrak{so}_9,$ which naturally acts on 9-dimensional 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

The $A_2$, root system.

For example, the symbol $A_2$ may refer to:

• The Dynkin diagram with 2 connected nodes, , which may also be interpreted as a Coxeter diagram.
• The root system with 2 simple roots at a $2\pi/3$ (120 degree) angle.
• The Lie algebra $\mathfrak{sl}_{2+1} = \mathfrak{sl}_3$ of rank 2.
• The Weyl group of symmetries of the roots (reflections in the hyperplane orthogonal to the roots), isomorphic to the symmetric group $S_3$ (of order 6).
• The abstract Coxeter group, presented by generators and relations, $\left\langle r_1,r_2 \mid (r_1)^2=(r_2)^2=(r_ir_j)^3=1\right\rangle.$

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.

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 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 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₃, H₄ and I₂(p) for p = 5 p ≥ 7), and correspondingly not every finite Coxeter group is a Weyl group.

Isomorphisms

The exceptional isomorphisms of connected Dynkin diagrams.

Dynkin diagrams are conventionally numbered so that the list is non-redundant: $n \geq 1$ for $A_n,$ $n \geq 2$ for $B_n,$ $n \geq 3$ for $C_n,$ $n \geq 4$ for $D_n,$ and $E_n$ starting at $n=6.$ 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 $n=0$ or $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:

• $A_1 \cong B_1 \cong C_1$
• $B_2 \cong C_2$
• $D_2 \cong A_1 \times A_1$
• $D_3 \cong A_3$
• $E_3 \cong A_1 \times A_2$
• $E_4 \cong A_4$
• $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 the E_n family.

Automorphisms

The most symmetric Dynkin diagram is D₄, which gives rise to triality.

In addition to isomorphism between different diagrams, some diagrams also have self-isomorphisms 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.

The diagrams that have non-trivial automorphisms are A_n ($n > 1$), D_n ($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 the symmetric 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.

A_n.

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 $\bigwedge^i C^n$ for $i=1,\dots,n$, and the diagram automorphism corresponds to the duality $\bigwedge^i C^n \mapsto \bigwedge^{n-i} C^n.$ Realized as the Lie algebra $\mathfrak{sl}_{n+1},$ the outer automorphism can be expressed as negative transpose, $T \mapsto -T^{\mathrm T}$, which is how the dual representation acts.

D_n.

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 $\mathfrak{so}_{2n},$ the outer automorphism can be expressed as conjugation by a matrix in O(2n) with determinant −1. Note that $\mathrm{A}_3 \cong \mathrm{D}_3,$ so their automorphisms agree, while $\mathrm{D}_2 \cong \mathrm{A}_1 \times \mathrm{A}_1,$ which is disconnected, and the automorphism corresponds to switching the two nodes.

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

E₆.

The automorphism group of E₆ corresponds to reversing the diagram, and can be expressed using Jordan algebras.

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

In characteristic 2, the arrow on F₄ can be ignored, yielding an additional diagram automorphism and corresponding Suzuki–Ree groups.

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 $\mathrm{B}_2 \cong \mathrm{C}_2$ and of F₄, while in characteristic 3 there is an order 2 automorphism of G₂.

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 non-split orthogonal groups. The Steinberg 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 the Suzuki–Ree groups, ²B₂, ²F₄, and ²G₂.

Folding

Finite Coxeter group foldings.

Affine Coxeter group foldings, with three naming conventions: first, the original extended set; the second used in the context of quiver graphs; and the last by Victor Kac for twisted affine Lie algebras.

A (simply-laced) 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 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. Further, every multiply laced diagram (finite or infinite) can be obtained by folding a simply-laced diagram.

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. 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 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:

• $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.)

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

Similar foldings exist for affine diagrams, including:

• $\tilde A_{2n-1} \to \tilde C_n$
• $\tilde D_{n+1} \to \tilde B_n$
• $\tilde D_4 \to \tilde G_2$
• $\tilde E_6 \to \tilde F_4$

The notion of foldings can also be applied more generally to Coxeter diagrams – notably, one can generalize allowable quotients of Dynkin diagrams to H_n and I₂(p). Geometrically this corresponds to projections of uniform polytopes. Notably, any simply laced Dynkin diagram can be folded to I₂(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 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. See Math Overflow: Folding by Automorphisms for further discussion.

Other maps of diagrams

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.

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 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 sub-Lie algebras.

The maximal subgraphs are as follows; subgraphs related by a diagram 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: $\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: B_n and C_n are dual, while F₄, and G₂ are self-dual, as are the simply-laced ADE diagrams.

Simply laced

Main article: ADE classification

The simply laced Dynkin diagrams classify diverse mathematical objects; this is called the ADE classification.

A Dynkin diagram with no multiple edges is called simply laced, as are the corresponding Lie algebra and Lie group. These are the $A_n, D_n, E_n$ 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

Main article: Satake diagram

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

See also: Semisimple Lie algebra § History

Eugene Dynkin.

Dynkin diagrams are named for Eugene Dynkin, who used them in two papers (1946, 1947) simplifying the classification of semisimple Lie algebras; 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.

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

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 = \left [\begin{matrix}2&a_{12}\\a_{21}&2\end{matrix}\right ]$

A multi-edged diagram corresponds to the nondiagonal Cartan matrix elements -a₂₁, -a₁₂, with the number of edges drawn equal to max(-a₂₁, -a₁₂), and an arrow pointing towards nonunity elements.

A generalized Cartan matrix is a square matrix $A = (a_{ij})$ such that:

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

The Cartan matrix determines whether the group is of finite type (if it is a Positive-definite matrix, i.e. all eigenvalues are positive), of affine type (if it is not positive-definite but positive-semidefinite, i.e. all eigenvalues are non-negative), 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 non-equivalent 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₂₁, -a₁₂)=(1,1), (2,1), (3,1), and affine branches (with a zero determinant) have (-a₂₁, -a₁₂) =(2,2) 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	$\left [\begin{matrix}2&a_{12}\\a_{21}&2\end{matrix}\right ]$	Determinant (4-a21*a12)
Finite (Determinant>0)
A1xA1				$\left [\begin{smallmatrix}2&0\\0&2\end{smallmatrix}\right ]$	4	2
A2 (undirected)				$\left [\begin{smallmatrix}2&-1\\-1&2\end{smallmatrix}\right ]$	3	3
B2				$\left [\begin{smallmatrix}2&-2\\-1&2\end{smallmatrix}\right ]$	2	4	${A}_3$
C2				$\left [\begin{smallmatrix}2&-1\\-2&2\end{smallmatrix}\right ]$	2	4	${A}_3$
BC2 (undirected)				$\left [\begin{smallmatrix}2&-\sqrt{2}\\-\sqrt{2}&2\end{smallmatrix}\right ]$	2	4
G2				$\left [\begin{smallmatrix}2&-1\\-3&2\end{smallmatrix}\right ]$	1	6	${D}_4$
G2 (undirected)				$\left [\begin{smallmatrix}2&-\sqrt{3}\\-\sqrt{3}&2\end{smallmatrix}\right ]$	1	6
Affine (Determinant=0)
A1(1)				$\left [\begin{smallmatrix}2&-2\\-2&2\end{smallmatrix}\right ]$	0	∞	${\tilde{A}}_3$
A2(2)				$\left [\begin{smallmatrix}2&-1\\-4&2\end{smallmatrix}\right ]$	0	∞	${\tilde{D}}_4$
Hyperbolic (Determinant<0)
				$\left [\begin{smallmatrix}2&-1\\-5&2\end{smallmatrix}\right ]$	-1	-
				$\left [\begin{smallmatrix}2&-2\\-3&2\end{smallmatrix}\right ]$	-2	-
				$\left [\begin{smallmatrix}2&-1\\-6&2\end{smallmatrix}\right ]$	-2	-
				$\left [\begin{smallmatrix}2&-1\\-7&2\end{smallmatrix}\right ]$	-3	-
				$\left [\begin{smallmatrix}2&-2\\-4&2\end{smallmatrix}\right ]$	-4	-
				$\left [\begin{smallmatrix}2&-1\\-8&2\end{smallmatrix}\right ]$	-4	-
				$\left [\begin{smallmatrix}2&-3\\-3&2\end{smallmatrix}\right ]$	-5	-
				$\left [\begin{smallmatrix}2&-b\\-a&2\end{smallmatrix}\right ]$	4-ab<0	-
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. 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 suitable folding operation.

Finite Dynkin diagrams

Finite Dynkin graphs with 1 to 9 nodes

Rank	Classical Lie groups				Exceptional Lie groups
	${A}_{1+}$	${B}_{2+}$	${C}_{2+}$	${D}_{2+}$	${E}_{3-8}$	${G}_{2}$ / ${F}_{4}$
1	A1
2	A2	B2	C2=B2	D2=A1xA1		G2
3	A3	B3	C3	D3=A3	E3=A2xA1
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+	..	..	..	..

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 (Kac 1994, Chapter 4, pp. 47–), specifically listed on (Kac 1994, pp. 53–55). Affine diagrams are denoted as $X_l^{(1)}, X_l^{(2)},$ or $X_l^{(3)},$ 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, $X_l^{(1)},$ are most common, and are called extended Dynkin diagrams and denoted with a tilde, and also sometimes marked with a + superscript. as in $\tilde A_5 = A_5^{(1)} = A_5^{+}$. 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 ($n\ge 3$ for $B_n$ and $n\ge 4$ for $D_n$)

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

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

Rank	${\tilde{A}}_{1+}$	${\tilde{B}}_{3+}$	${\tilde{C}}_{2+}$	${\tilde{D}}_{4+}$	E / F / G
2	${\tilde{A}}_{1}$ or ${A}_{1}^{(1)}$		${A}_{2}^{(2)}$:
3	${\tilde{A}}_{2}$ or ${A}_{2}^{(1)}$		${\tilde{C}}_{2}$ or ${C}_{2}^{(1)}$ ${D}_{5}^{(2)}$: ${A}_{4}^{(2)}$:		${\tilde{G}}_{2}$ or ${G}_{2}^{(1)}$ ${D}_{4}^{(3)}$
4	${\tilde{A}}_{3}$ or ${A}_{3}^{(1)}$	${\tilde{B}}_{3}$ or ${B}_{3}^{(1)}$ ${A}_{5}^{(2)}$:	${\tilde{C}}_{3}$ or ${C}_{3}^{(1)}$ ${D}_{6}^{(2)}$: ${A}_{6}^{(2)}$:
5	${\tilde{A}}_{4}$ or ${A}_{4}^{(1)}$	${\tilde{B}}_{4}$ or ${B}_{4}^{(1)}$ ${A}_{7}^{(2)}$:	${\tilde{C}}_{4}$ or ${C}_{4}^{(1)}$ ${D}_{7}^{(2)}$: ${A}_{8}^{(2)}$:	${\tilde{D}}_{4}$ or ${D}_{4}^{(1)}$	${\tilde{F}}_{4}$ or ${F}_{4}^{(1)}$ ${E}_{6}^{(2)}$
6	${\tilde{A}}_{5}$ or ${A}_{5}^{(1)}$	${\tilde{B}}_{5}$ or ${B}_{5}^{(1)}$ ${A}_{9}^{(2)}$:	${\tilde{C}}_{5}$ or ${C}_{5}^{(1)}$ ${D}_{8}^{(2)}$: ${A}_{10}^{(2)}$:	${\tilde{D}}_{5}$ or ${D}_{5}^{(1)}$
7	${\tilde{A}}_{6}$ or ${A}_{6}^{(1)}$	${\tilde{B}}_{6}$ or ${B}_{6}^{(1)}$ ${A}_{11}^{(2)}$:	${\tilde{C}}_{6}$ or ${C}_{6}^{(1)}$ ${D}_{9}^{(2)}$: ${A}_{12}^{(2)}$:	${\tilde{D}}_{6}$ or ${D}_{6}^{(1)}$	${\tilde{E}}_{6}$ or ${E}_{6}^{(1)}$
8	${\tilde{A}}_{7}$ or ${A}_{7}^{(1)}$	${\tilde{B}}_{7}$ or ${B}_{7}^{(1)}$ ${A}_{13}^{(2)}$:	${\tilde{C}}_{7}$ or ${C}_{7}^{(1)}$ ${D}_{10}^{(2)}$: ${A}_{14}^{(2)}$:	${\tilde{D}}_{7}$ or ${D}_{7}^{(1)}$	${\tilde{E}}_{7}$ or ${E}_{7}^{(1)}$
9	${\tilde{A}}_{8}$ or ${A}_{8}^{(1)}$	${\tilde{B}}_{8}$ or ${B}_{8}^{(1)}$ ${A}_{15}^{(2)}$:	${\tilde{C}}_{8}$ or ${C}_{8}^{(1)}$ ${D}_{11}^{(2)}$: ${A}_{16}^{(2)}$:	${\tilde{D}}_{8}$ or ${D}_{8}^{(1)}$	${\tilde{E}}_{8}$ or ${E}_{8}^{(1)}$
10	${\tilde{A}}_{9}$ or ${A}_{9}^{(1)}$	${\tilde{B}}_{9}$ or ${B}_{9}^{(1)}$ ${A}_{17}^{(2)}$:	${\tilde{C}}_{9}$ or ${C}_{9}^{(1)}$ ${D}_{12}^{(2)}$: ${A}_{18}^{(2)}$:	${\tilde{D}}_{9}$ or ${D}_{9}^{(1)}$
11	...	...	...	...

Hyperbolic and higher Dynkin diagrams

The set of compact and noncompact hyperbolic Dynkin graphs has been enumerated. 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.

Summary

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

Compact hyperbolic graphs

Rank 3		Rank 4	Rank 5
Linear graphs (6 4 2): H100(3): H101(3): H105(3): H106(3): (6 6 2): H114(3): H115(3): H116(3):	Cyclic graphs (4 3 3): H1(3): (4 4 3): 3 forms... (4 4 4): 2 forms... (6 3 3): H3(3): (6 4 3): 4 forms... (6 4 4): 4 forms... (6 6 3): 3 forms... (6 6 4): 4 forms... (6 6 6): 2 forms...	(4 3 3 3): H8(4): H13(4): (4 3 4 3): H14(4):	(4 3 3 3 3): H7(5):

Noncompact (Over-extended forms)

Some notations used in theoretical physics, such as M-theory, use a "+" superscript for extended groups instead of a "~" and this allows higher extensions groups to be defined.

1. Extended Dynkin diagrams (affine) are given "+" and represent one added node. (Same as "~")
2. Over-extended Dynkin diagrams (hyperbolic) are given "^" or "++" and represent two added nodes.
3. Very-extended Dynkin diagrams with 3 nodes added are given "+++".

Some example over-extended (hyperbolic) Dynkin diagrams

Rank	${AE}_{n}$ = An-2(1)^	${BE}_{n}$ = Bn-2(1)^ ${CE}_{n}$	Cn-2(1)^	${DE}_{n}$ = Dn-2(1)^	E / F / G
3	${AE}_{3}$:
4	${AE}_{4}$:		C2(1)^ A4(2)'^ A4(2)^ D3(2)^		G2(1)^ D4(3)^
5	${AE}_{5}$:	${BE}_{5}$ ${CE}_{5}$	C3(1)^ A6(2)^ A6(2)'^ D5(2)^
6	${AE}_{6}$	${BE}_{6}$ ${CE}_{6}$	C4(1)^ A8(2)^ A8(2)'^ D7(2)^	${DE}_{6}$	F4(1)^ E6(2)^
7	${AE}_{7}$	${BE}_{7}$ ${CE}_{7}$		${DE}_{7}$
8	${AE}_{8}$	${BE}_{8}$ ${CE}_{8}$		${DE}_{8}$	E6(1)^
9	${AE}_{9}$	${BE}_{9}$ ${CE}_{9}$		${DE}_{9}$	E7(1)^
10		${BE}_{10}$ ${CE}_{10}$		${DE}_{10}$	${E}_{10}$=E8(1)^

238 Hyperbolic groups (compact and noncompact)

The 238 enumerated hyperbolic groups (compact and noncompact) are named as: H_i⁽ⁿ⁾, for rank n, and counting i=1,2,3... for each rank.

Very-extended

Very-extended groups are Lorentz groups, defined by adding three nodes to the finite groups. The E₈, E₇, E₆, F₄, and G₂ offer six series ending as very-extended 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 time-like dimension, and is used in M theory.

Rank 2 extended series

Finite	$A_2$	$C_2$	$G_2$
2	A2	C2	G2
3	A2+=${\tilde{A}}_{2}$	C2+=${\tilde{C}}_{2}$	G2+=${\tilde{G}}_{2}$
4	A2++	C2++	G2++
5	A2+++	C2+++	G2+++
Det(Mn)	3(3-n)	2(3-n)	3-n

Rank 3 and 4 extended series

Finite	$A_3$	$B_3$	$C_3$	$A_4$	$B_4$	$C_4$	$D_4$	$F_4$
2		A12						A2
3	A3	B3	C3		B2A1		A13
4	A3+=${\tilde{A}}_3$	B3+=${\tilde{B}}_{3}$	C3+=${\tilde{C}}_{3}$	A4	B4	C4	D4	F4
5	A3++	B3++	C3++	A4+=${\tilde{A}}_{4}$	B4+=${\tilde{B}}_{4}$	C4+=${\tilde{C}}_{4}$	D4+=${\tilde{D}}_{4}$	F4+=${\tilde{F}}_{4}$
6	A3+++	B3+++	C3+++	A4++	B4++	C4++	D4++	F4++
7				A4+++	B4+++	C4+++	D4+++	F4+++
Det(Mn)	4(4-n)	2(4-n)		5(5-n)	2(5-n)		4(5-n)	5-n

Rank 5 and 6 extended series

Finite	$A_5$	$B_5$	$D_5$	$A_6$	$B_6$	$D_6$	$E_6$
4		B3A1	A3A1				A22
5	A5		D5		B4A1	D4A1	A5
6	A5+=${\tilde{A}}_5$	B5+=${\tilde{B}}_{5}$	D5+=${\tilde{D}}_5$	A6	B6	D6	E6
7	A5++	B5++	D5++	A6+=${\tilde{A}}_6$	B6+=${\tilde{B}}_{6}$	D6+=${\tilde{D}}_6$	E6+=${\tilde{E}}_6$
8	A5+++	B5+++	D5+++	A6++	B6++	D6++	E6++
9				A6+++	B6+++	D6+++	E6+++
Det(Mn)	6(6-n)	2(6-n)	4(6-n)	7(7-n)	2(7-n)	4(7-n)	3(7-n)

Some rank 7 and higher extended series

Finite	A7	B7	D7	E7	E8
3					E3=A2A1
4				A3A1	E4=A4
5				A5	E5=D5
6		B5A1	D5A1	D6	E6
7	A7	B7	D7	E7	E7
8	A7+=${\tilde{A}}_7$	B7+=${\tilde{B}}_{7}$	D7+=${\tilde{D}}_7$	E7+=${\tilde{E}}_{7}$	E8
9	A7++	B7++	D7++	E7++	E9=E8+=${\tilde{E}}_{8}$
10	A7+++	B7+++	D7+++	E7+++	E10=E8++
11					E11=E8+++
Det(Mn)	8(8-n)	2(8-n)	4(8-n)	2(8-n)	9-n

See also

• Affine Dynkin diagram
• Satake diagram
• Klassifikation von Wurzelsystemen (Classification of root systems) (German)

External links

• Dynkin diagram at Encyclopaedia of Mathematics
• John Baez on the ubiquity of Dynkin diagrams in mathematics
• Web tool for making publication-quality Dynkin diagrams with labels (written in JavaScript)