Added to Favorites

Related Searches

Nearby Words

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

- 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 β, the set Φ contains the reflection of β,
- :$sigma\_alpha(beta)\; =beta-2frac\{(alpha,beta)\}\{(alpha,alpha)\}alpha\; in\; Phi.$
- (Integrality condition) If α and β are roots in Φ, then the projection of β onto the line through α is a half-integral multiple of α. That is,
- :$langle\; beta,\; alpha\; rangle\; =\; 2\; frac\{(alpha,beta)\}\{(alpha,alpha)\}\; 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\; rangle\; colon\; Phi\; times\; Phi\; to\; mathbb\{Z\}$

The integrality condition also means that the ratio of the lengths (magnitudes) of any two roots cannot be 2 or greater, since otherwise either the projection of the shorter root onto the longer root will be less than half as long as the longer root, or the shorter root will be exactly half the longer root or its negative.

The cosine of the angle between two roots is constrained to be a half-integral multiple of a square root of an integer:

$langle\; beta,\; alpha\; rangle\; langle\; alpha,\; beta\; rangle\; =\; 2\; frac\{(alpha,beta)\}\{(alpha,alpha)\}\; 2\; frac\{(alpha,beta)\}\{(beta,beta)\}\; =\; 4\; frac\{(alpha,beta)^2\}\{vert\; alpha\; vert^2\; vert\; beta\; vert^2\}\; =\; 4\; cos^2(theta)\; in\; mathbb\{Z\},$

These values can only be $0,\; pm\; tfrac\{1\}\{2\},\; pmtfrac\{sqrt\{2\}\}\{2\},\; pmtfrac\{sqrt\{3\}\}\{2\}$, corresponding to angles of 30°, 45°, 60°, 90°, 120°, 135°, 150°.

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_{2}, B_{2}, and G_{2} pictured below, is said to be irreducible.

Two irreducible root systems (E_{1},Φ_{1}) and (E_{2},Φ_{2}) are considered to be the same if there is an invertible linear transformation E_{1}→E_{2} which sends Φ_{1} to Φ_{2}.

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.

In rank 2 there are four possibilities, corresponding to σ_{α}(β) = β + nα, where n = 0, 1, 2, 3.

Root system A_{1}×A_{1}
| Root system A_{2} |

Root system B_{2}
| Root system G_{2} |

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 chosen from a root system of arbitrary rank. In particular, two such roots meet at an angle of 0, 30, 45, 60, 90, 120, 135, 150, or 180 degrees.

- for each root $alphainPhi$ exactly one of the roots $alpha,\; -alpha$ is contained in $Phi^+$
- For any $alpha,\; betain\; Phi^+$ such that $alpha+beta$ is a root, $alpha+betainPhi^+$.

If a set of positive roots $Phi^+$ is chosen, elements of ($-Phi^+$) are called negative roots.

An element of $Phi^+$ is called indecomposable or simple if it cannot be written as the sum of two elements of $Phi^+$. The set $Delta$ of simple roots is a basis of $V$ with the property that every vector in $Phi$ is a linear combination of elements of $Delta$ with all coefficients non-negative, or all coefficients non-positive.

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.

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. The term "directed edge" means that 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).

$Phi$ | >Phi| | >Phi^{<}| | I | >W| |
---|---|---|---|---|

A_{n} (n≥1)
| n(n+1) | n+1 | (n+1)! | |

B_{n} (n≥2)
| 2n^{2}
| 2n | 2 | 2^{n} n! |

C_{n} (n≥3)
| 2n^{2}
| 2n(n−1) | 2 | 2^{n} n! |

D_{n} (n≥4)
| 2n(n−1) | 4 | 2^{n−1} n! | |

E_{6}
| 72 | 3 | 51840 | |

E_{7}
| 126 | 2 | 2903040 | |

E_{8}
| 240 | 1 | 696729600 | |

F_{4}
| 48 | 24 | 1 | 1152 |

G_{2}
| 12 | 6 | 1 | 12 |

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). The subscript indicates the rank of the root system. In the table to the right, $|Phi^\{<\}|$ 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.

The reflection σ_{i} through the hyperplane perpendicular to α_{i} is the same as permutation of the adjacent ith and i+1th coordinates. Such
transpositions generate the full permutation group.
For adjacent simple roots,
σ_{i}(α_{i+1}) = α_{i+1} + α_{i} =
σ_{i+1}(α_{i}) = α_{i} + α_{i+1}, that is, reflection is equivalent to adding a multiple of 1; but
reflection of a simple root perpendicular to a nonadjacent simple root leaves it unchanged, differing by a multiple of 0.

1 | -1 | 0 | 0 |

0 | 1 | -1 | 0 |

0 | 0 | 1 | -1 |

0 | 0 | 0 | 1 |

The reflection σ_{n} through the hyperplane perpendicular to the short root α_{n} is of course simply negation of the nth coordinate.
For the long simple root α_{n-1}, σ_{n-1}(α_{n}) = α_{n} + α_{n-1}, but for reflection perpendicular to the short root, σ_{n}(α_{n-1}) = α_{n-1} + 2α_{n}, a difference by a multiple of 2 instead of 1.

B_{1} is isomorphic to A_{1} via scaling by √2, and is therefore not a distinct root system.

1 | -1 | 0 | 0 |

0 | 1 | -1 | 0 |

0 | 0 | 1 | -1 |

0 | 0 | 0 | 2 |

C_{2} is isomorphic to B_{2} via scaling by √2 and a 45 degree rotation, and is therefore not a distinct root system.

1 | -1 | 0 | 0 |

0 | 1 | -1 | 0 |

0 | 0 | 1 | -1 |

0 | 0 | 1 | 1 |

Reflection through the hyperplane perpendicular to α_{n} is the same as transposing and negating the adjacent nth and n-1th coordinates. Any simple root and its reflection perpendicular to another simple root differ by a multiple of 0 or 1 of the second root, not by any greater multiple.

D_{3} reduces to A_{3}, and is therefore not a distinct root system.

D_{4} has additional symmetry called triality.

- all the coordinates are integers or all the coordinates are half-integers (a mixture of integers and half-integers is not allowed), and
- the sum of the eight coordinates is an even integer.

Let the E_{8} root system be the set of vectors of length √2 in Γ_{8}, that is: (α ∈ Z^{8} ∪ (Z+½)^{8}: |α|^{2} = ∑α_{i}^{2} = 2, ∑α_{i} ∈ 2Z).

Then let E_{7} be the intersection of E_{8} with the hyperplane of vectors perpendicular to a fixed root in E_{8}, and let E_{6} the intersection of E_{7} with the hyperplane of vectors perpendicular to a fixed root in E_{7}. The root systems E_{6}, E_{7}, and E_{8} have 72, 126, and 240 roots respectively.
If we continue to delete roots and reduce dimension, E_{5} reduces to D_{5}, and E_{4} reduces to A_{4}, so no more distinct root systems are found.

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 | 1 | 1 | 0 |

½ | ½ | ½ | ½ | ½ | ½ | ½ | ½ |

- all the coordinates are integers and the sum of the coordinates is even, or
- all the coordinates are half-integers and the sum of the coordinates is odd.

The lattices Γ_{8} and Γ′_{8} are isomorphic and one may pass from one to the other by changing the signs of any odd number of coordinates. The lattice Γ_{8} is sometimes called the even coordinate system for E_{8} while the lattice Γ′_{8} is called the odd coordinate system.

One choice of simple roots for E_{8} in the even coordinate system is: α_{i} = e_{i} - e_{i+1}, for 1 ≤ i ≤ 6 and α_{7} = e_{7} + e_{6} (the above choice of simple roots for D_{7}) along with α_{8} = β_{0} = $(textstyle\; sum\_\{i=1\}^8e\_i)/2$ = (½,½,½,½,½,½,½,½).

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 |

-½ | -½ | -½ | -½ | -½ | ½ | ½ | ½ |

Deleting α_{1} and then α_{2} gives sets of simple roots for E_{7} and E_{6}.
Since perpendicularity to α_{1} means that the first two coordinates are equal, E_{7} is then the subspace of E_{8} where the first two coordinates are equal, and similarly E_{6} is the subspace of E_{8} where the first three coordinates are equal. This facilitates explicit definitions of E_{7} and E_{6} as:

E_{7} = (α ∈ Z^{7} ∪ (Z+½)^{7}: ∑α_{i}^{2} + α_{1}^{2} = 2, ∑α_{i} + α_{1} ∈ 2Z),
E_{6} = (α ∈ Z^{6} ∪ (Z+½)^{6}: ∑α_{i}^{2} + 2α_{1}^{2} = 2, ∑α_{i} + 2α_{1} ∈ 2Z)

1 | -1 | 0 | 0 |

0 | 1 | -1 | 0 |

0 | 0 | 1 | 0 |

-½ | -½ | -½ | -½ |

1 | -1 | 0 |

-1 | 2 | -1 |

One choice of simple roots is: (α_{1},
β=α_{2}-α_{1}) where
α_{i} = e_{i} - e_{i+1} for i = 1, 2 is the above choice of simple roots for A_{2}.

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

There are extensions of Dynkin diagrams, namely extended Dynkin diagrams and affine Dynkin diagrams.

Extended Dynkin diagrams are denoted with a tilde, as in $tilde\; A\_5$.

Affine Dynkin diagrams describe Cartan matrices of affine Lie algebras.

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

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

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Wednesday September 10, 2008 at 15:01:03 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Wednesday September 10, 2008 at 15:01:03 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.