ROOT SYSTEM

(Redirected from Dynkin diagram)
:''This article discusses root systems in mathematics. For root systems of plants, see root.''
In mathematics, a 'root system' is a configuration of vectors in a Euclidean space satisfying certain geometrical properties. The concept is fundamental in Lie group theory. Since Lie groups (and some analogues such as algebraic groups) have come to be used in most parts of mathematics during the twentieth century, the apparently special nature of root systems belies the number of areas in which they are applied. Further, the classification scheme for root systems, by 'Dynkin diagrams', occurs in parts of mathematics with no overt connection to Lie groups (such as singularity theory).

Contents

Definitions

Rank 1 and rank 2 examples

Positive roots and simple roots

Classification of root systems by Dynkin diagrams

Properties of irreducible root systems

A''n''

B''n''

C''n''

D''n''

E''6'', E''7'', E''8''

F4

G2

Root systems and Lie theory

References

See also

External links

Definitions

Let ''V'' be a finite-dimensional Euclidean space, with the standard Euclidean inner product denoted by (·,·). A 'root system' in ''V'' is a finite set Φ of non-zero vectors (called 'roots') that satisfy the following properties:

# The roots span ''V''
# The only scalar multiples of a root α ∈ Φ that belong to Φ are α itself and −α.
# For every root α ∈ Φ, the set Φ is closed under reflection through the hyperplane perpendicular to α. That is, for any two roots α and β,
#:
# (''Integrality condition'') If α and β are roots in Φ, then the projection of β onto the line through α is a half-integral multiple of α. That is,
#:
angle = 2 rac{(lpha,eta)}{(lpha,lpha)} in mathbb{Z},
In view of property 3, the integrality condition is equivalent to stating that β and its reflection σ_α(β) differ by an integer multiple of α. Note that the operator
:$langle\; cdot,\; cdot$
angle colon Phi imes Phi o mathbb{Z}
defined by property 4 is not an inner product. It is not necessarily symmetric and is linear only in the first argument.
The 'rank' of a root system Φ is the dimension of ''V''.
Two root systems may be combined by regarding the Euclidean spaces they span as mutually orthogonal subspaces of a common Euclidean space. A root system which does not arise from such a combination, such as the systems A₂, B₂, and G₂ pictured below, is said to be 'irreducible'.
Two irreducible root systems (''E''₁,Φ₁) and (''E''₂,Φ₂) are considered to be the same if there is an invertible linear transformation ''E''₁→''E''₂ which preserves distance up to a scale factor and which sends Φ₁ to Φ₂.
The group of isometries of ''V'' generated by reflections through hyperplanes associated to the roots of Φ is called the Weyl group of Φ. As it acts faithfully on the finite set Φ, the Weyl group is always finite.

Rank 1 and rank 2 examples

There is only one root system of rank 1, consisting of two nonzero vectors {α, −α}. This root system is called A₁.
In rank 2 there are four possibilities:

'Rank 2 root systems'

Root system A1×A1	Root system A2
Root system A1×A1	Root system A2
Root system B2	Root system G2
Root system B2	Root system G2

Whenever Φ is a root system in ''V'' and ''W'' is a subspace of ''V'' spanned by Ψ=Φ∩''W'', then Ψ is a root system in ''W''. Thus, our exhaustive list of root systems of rank 2 shows the geometric possibilities for any two roots in a root system. In particular, two such roots meet at an angle of 0, 30, 45, 60, 90, 120, 135, 150, or 180 degrees.

Positive roots and simple roots

Given a root system Φ we can always choose (in many ways) a set of 'positive roots'. This is a subset
$Phi^+$ of Φ such that

★ for each root exactly one of the roots is contained in $Phi^+$

★ For any such that is a root, .
If a set of positive roots $Phi^+$ is chosen, elements of ($-Phi^+$) are called 'negative roots'.
The choice of $Phi^+$ is equivalent to the choice of 'simple roots'. The set of simple roots is a subset Δ of Φ which is a basis of ''V'' with the special property that every vector in Φ when written in the basis Δ has either all coefficients ≥0 or else all ≤0.
It can be shown that for each choice of positive roots there exists a unique set of simple roots so that the positive roots are exactly those roots that can be expressed as a combination of simple roots with non-negative coefficients.

Classification of root systems by Dynkin diagrams

Irreducible root systems correspond to certain graphs, the 'Dynkin diagrams' named for Eugene Dynkin. The classification of these graphs is a simple matter of combinatorics, and induces a classification of irreducible root systems.
Given a root system, select a set Δ of simple roots as in the preceding section. The vertices of the associated Dynkin diagram correspond to vectors in Δ. An edge is drawn between each non-orthogonal pair of vectors; it is an undirected single edge if they make an angle of 120 degrees, a directed double edge if they make an angle of 135 degrees, and a directed triple edge if they make an angle of 150 degrees. In addition, double and triple edges are marked with an angle sign pointing toward the shorter vector.
Although a given root system has more than one possible set of simple roots, the Weyl group acts transitively on such choices. Consequently, the Dynkin diagram is independent of the choice of simple roots; it is determined by the root system itself. Conversely, given two root systems with the same Dynkin diagram, one can match up roots, starting with the roots in the base, and show that the systems are in fact the same.
Thus the problem of classifying root systems reduces to the problem of classifying possible Dynkin diagrams. The problem of classifying irreducible root systems reduces to the problem of classifying connected Dynkin diagrams. Dynkin diagrams encode the inner product on ''E'' in terms of the basis Δ, and the condition that this inner product must be positive definite turns out to be all that is needed to get the desired classification.
The actual connected diagrams are as follows. The subscripts indicate the number of vertices in the diagram (and hence the rank of the corresponding irreducible root system).

Properties of irreducible root systems

Irreducible root systems are named according to their corresponding connected Dynkin diagrams. There are four infinite families (A_''n'', B_''n'', C_''n'', and D_''n'', called the 'classical root systems') and five exceptional cases (the 'exceptional root systems'). In every case, the subscript indicates the rank of the root system. The following table lists some of their other properties.
{|border=1 cellpadding=4 style="margin: auto; text-align: center; border-collapse: collapse;"
!$Phi$ || $|Phi|$ || || ''I'' || $|W|$
|-
|A_''n'' (''n'' ≥ 1) || ''n''(''n''+1) ||   || ''n''+1 || (''n''+1)!
|-
|B_''n'' (''n'' ≥ 2) || 2''n''² || 2''n'' || 2 || 2^''n'' ''n''!
|-
|C_''n'' (''n'' ≥ 3) || 2''n''² || 2''n''(''n''−1) || 2 || 2^''n'' ''n''!
|-
|D_''n'' (''n'' ≥ 4) || 2''n''(''n''−1) ||   || 4 || 2^''n''−1 ''n''!
|-
|E₆ || 72 ||   || 3 || 51840
|-
|E₇ || 126 ||   || 2 || 2903040
|-
|E₈ || 240 ||   || 1 || 696729600
|-
|F₄ || 48 || 24 || 1 || 1152
|-
|G₂ || 12 || 6 || 1 || 12
|}
Here denotes the number of short roots (if all roots have the same length they are taken to be long by definition), ''I'' denotes the determinant of the Cartan matrix, and $|W|$ denotes the order of the Weyl group.
Explicit constructions of these systems are given in the following subsections.

A_''n''

Let ''V'' be the subspace of 'R'^''n''+1 for which the coordinates sum to 0, and let Φ be the set of vectors in ''V'' of length $sqrt\; 2$ and which are ''integer vectors,'' i.e. have integer coordinates in 'R'^''n''+1. Such a vector must have all but two coordinates equal to 0, one coordinate equal to 1, and one equal to −1, so there are ''n''² + ''n'' roots in all. One choice of simple roots expressed in the standard basis is: 'α'_i = 'e'_i - 'e'_i+1, for 1 ≤ i ≤ n.

B_''n''

Let ''V''='R'^''n'', and let Φ consist of all integer vectors in ''V'' of length 1 or $sqrt\; 2$. The total number of roots is 2''n''². One choice of simple roots is: 'α'_i = 'e'_i - 'e'_i+1, for 1 ≤ i < n (the above choice of simple roots for 'A_n-1') plus 'α'_n = 'e'_n.

C_''n''

Let ''V''='R'^''n'', and let Φ consist of all integer vectors in ''V'' of length $sqrt\; 2$ together with all vectors of the form 2λ, where λ is an integer vector of length 1. The total number of roots is 2''n''². One choice of simple roots is: 'α'_i = 'e'_i - 'e'_i+1, for 1 ≤ i < n (the above choice of simple roots for 'A_n-1') plus 'α'_n = 2'e'_n.

D_''n''

Let ''V''='R'^''n'', and let Φ consist of all integer vectors in ''V'' of length $sqrt\; 2$. The total number of roots is 2''n''(''n''−1). One choice of simple roots is: 'α'_i = 'e'_i - 'e'_i+1, for 1 ≤ i < n (the above choice of simple roots for 'A_n-1') plus 'α'_n = 'e'_n + 'e'_n-1.

E_''6'', E_''7'', E_''8''

Let ''V''='R'⁸ and let E_''8'' denote the set of vectors α of length $sqrt\; 2$ such that the coordinates of 2α are all integers and are either all even or all odd and the sum of all 8 coordinates is even. As regards E₇, it can be constructed as the intersection of E₈ with the hyperplane of vectors perpendicular to a fixed root α in E₈. Finally, E₆ can be constructed as the intersection of E₈ with two such hyperplanes corresponding to roots α and β which are neither orthogonal to one another nor scalar multiples of one another. The root systems E₆, E₇, and E₈ have 72, 126, and 240 roots respectively.
One choice of simple roots for E₈ is: 'α'_i = 'e'_i - 'e'_i+1, for 1 ≤ i ≤ 7 (the above choice of simple roots for 'A₇') plus 'α'₈ = 'β'₃ or 'β'₅, where 'β'_j =
left (
egin{smallmatrix}
+1&-1&0&0&0&0&0&0 \ 0&+1&-1&0&0&0&0&0 \ 0&0&+1&-1&0&0&0&0 \ 0&0&0&+1&-1&0&0&0 \ 0&0&0&0&+1&-1&0&0 \ 0&0&0&0&0&+1&-1&0 \ 0&0&0&0&0&0&+1&-1 \ -rac{1}{2}&-rac{1}{2}&-rac{1}{2}&+rac{1}{2}&+rac{1}{2}&+rac{1}{2}&+rac{1}{2}&+rac{1}{2}
end{smallmatrix}
ight ).

(Using 'β'_1,7 or 'β'_2,6 would simply give A₈ or D₈, while the coordinates of 'β'₄ sum to 0, and since the same is true for 'α'_1...7, they span only the 7-dimensional subspace for which the coordinates sum to 0, not all of 'R'^''8''.)
Deleting 'α'₇ and 'α'₆ give sets of simple roots for E₇ and E₆.

F₄

For F₄, let ''V''='R'⁴, and let Φ denote the set of vectors α of length 1 or $sqrt\; 2$ such that the coordinates of 2α are all integers and are either all even or all odd. There are 48 roots in this system. One choice of simple roots is: the choice of simple roots given above for 'B₃', plus 'α'₄ =
left (
egin{smallmatrix}
+1&-1&0&0 \ 0&+1&-1&0 \ 0&0&+1&0 \ -rac{1}{2}&-rac{1}{2}&-rac{1}{2}&-rac{1}{2}
end{smallmatrix}
ight )

G₂

There are 12 roots in G₂, which form the vertices of a hexagram. See the picture above.

Root systems and Lie theory

Irreducible root systems classify a number of related objects in Lie theory, notably:

★ Simple complex Lie algebras

★ Simple complex Lie groups

★ Simply connected complex Lie groups which are simple modulo centers

★ Simple compact Lie groups
In each case, the roots are non-zero weights of the adjoint representation.

References

★ Dynkin, E. B. ''The structure of semi-simple algebras.'' (Russian) Uspehi Matem. Nauk (N.S.) 2, (1947). no. 4(20), 59--127.

See also

★ Weyl group, Coxeter group

★ Cartan matrix

★ Coxeter matrix

★ ADE classification

★ root datum

★ Coxeter-Dynkin diagram

External links

★ John Baez on the ubiquity of Dynkin diagrams in mathematics

★ Web tool for making publication-quality Dynkin diagrams with labels (written in JavaScript)