Root system
See also Simple Lie group.A root system is a finite set Φ of non-zero vectors (roots) spanning a finite-dimensional Euclidean space V which satisfy the following properties:
- The only scalar multiples of a root α in V which belong to &Phi are α itself and −α.
- For every root α in V, the set Φ is symmetric under reflection through the hyperplane of vectors perpendicular to α
- If α and β are vectors in Φ, the projection of 2β onto the line through α is an integer multiple of α
Two irreducible root systems (E1,Φ1) and (E2,Φ2) are considered to be the same if there is an invertible linear transformation E1→E2 which preserves distance up to a scale factor and 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.
| Table of contents |
|
2 Root systems and Lie theory |
It is not too difficult to classify the root systems of rank 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 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.
In general, irreducible root systems are specified by a family (indicated by a letter A to G) and the rank (indicated by a subscript). There are four infinite families and five exceptional cases:
Classification
The actual root systems can be realized as follows:
Let V be the subspace of Rn+1 for which the coordinates sum to 0, and let Φ be the set of vectors in V of length √2 and with integer coordinates in Rn+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 n2+n roots in all.
Let V=Rn, and let Φ consist of all integer vectors in V of length 1 or √2. The total number of roots is 2n2.
Let V=Rn, and let Φ consist of all integer vectors in V of √2 together with all vectors of the form 2λ, where λ is an integer vector of length 1. The total number of roots is 2n2. The total number of roots is 2n2.
Let V=Rn, and let Φ consist of all integer vectors in V of length √2. The total number of roots is 2n2.
For V8, let V=R8, and let E8 denote the set of vectors α of length √2 such that the coordinates of 2α are all integers and are either all even or all odd. Then E7 can be constructed as the intersection of E8 with the hyperplane of vectors perpendicular to a fixed root α in E8, and E6 can be constructed as the intersection of E8 with two such hyperplanes corresponding to roots α and β which are neither orthogonal to one another nor scalar multiples of one another. The root systems E6, E7, and E8 have 72, 126, and 240 roots respectively.
For F4, let V=R4, and let Φ denote the set of vectors α of length 1 or √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.
There are 12 roots in G2, which form the vertices of a hexagram. See the picture above.
Irreducible root systems classify a number of related objects in Lie theory, notably:
See also Weyl group, Coxeter group, Cartan matrix, Coxeter matrix
An
Bn
Cn
Dn
En
F4
G2
Root systems and Lie theory
In each case, the roots are non-zero weightss of the adjoint representation.
A root system can also be said to describe a plant's roots and associated systems