Weight Lattices and Root Systems
Root systems provide the combinatorial foundation for classification of semisimple Lie algebras and their representations.
A root system in a Euclidean space is a finite set of non-zero vectors (roots) satisfying:
- spans
- For , the only scalar multiples in are
- For , the reflection preserves , where
- For , we have
Type (): Roots are for , where is the standard basis with .
Type (): Roots are () and .
Type (): Roots are () and .
Type (): Roots are for .
Choose a set of positive roots . The simple roots are the indecomposable positive roots (not sums of other positive roots).
The fundamental weights satisfy:
Dominant integral weights are non-negative integer combinations of fundamental weights: with .
The Weyl group is generated by reflections for . It acts on the weight lattice and satisfies:
- is a finite Coxeter group
- preserves the root system: for all
- Irreducible characters are invariant: (conjugacy invariance)
The Weyl group for is , for is the hyperoctahedral group, and for is a subgroup of the hyperoctahedral group.
Root systems classify semisimple Lie algebras:
- Dynkin diagrams: Encode the Cartan matrix and determine the Lie algebra up to isomorphism
- Classification: Four infinite families and five exceptionals
- Geometry: Root systems appear in crystallography, sphere packing, and lattice theory
- Physics: Gauge groups in particle physics correspond to Lie algebras with specific root systems
The combinatorics of root systems, Weyl groups, and weight lattices provide computational tools for representation theory while revealing deep structural patterns.