ConceptComplete

Root Systems and Dynkin Diagrams - Core Definitions

Root systems provide the combinatorial framework for classifying semisimple Lie algebras. They encode the structure of the Lie algebra in a finite configuration of vectors satisfying special symmetry properties.

Definition

Let VV be a finite-dimensional real vector space with inner product. A root system in VV is a finite set ΦV\Phi \subset V of nonzero vectors (called roots) satisfying:

  1. Φ\Phi spans VV
  2. If αΦ\alpha \in \Phi, the only scalar multiples of α\alpha in Φ\Phi are ±α\pm \alpha
  3. For each αΦ\alpha \in \Phi, the reflection sα(v)=v2v,αα,ααs_\alpha(v) = v - \frac{2\langle v, \alpha\rangle}{\langle \alpha, \alpha\rangle}\alpha maps Φ\Phi to itself
  4. For α,βΦ\alpha, \beta \in \Phi, the number 2β,αα,α\frac{2\langle \beta, \alpha\rangle}{\langle \alpha, \alpha\rangle} is an integer

The fourth condition is called the crystallographic condition. It ensures that root systems arise from Lie algebras rather than arbitrary reflection groups.

Example

For sl3(C)\mathfrak{sl}_3(\mathbb{C}) with Cartan subalgebra h\mathfrak{h} of diagonal matrices, the root system consists of six roots in R2\mathbb{R}^2: Φ={±α1,±α2,±(α1+α2)}\Phi = \{\pm \alpha_1, \pm \alpha_2, \pm(\alpha_1 + \alpha_2)\} where α1,α2\alpha_1, \alpha_2 are simple roots. This forms a hexagonal configuration (type A2A_2).

Definition

The Weyl group WW of a root system Φ\Phi is the group generated by all root reflections sαs_\alpha for αΦ\alpha \in \Phi. This is a finite reflection group acting on VV.

The Weyl group is central to both the geometry of root systems and the representation theory of the associated Lie algebra.

Definition

A subset Δ={α1,,αn}Φ\Delta = \{\alpha_1, \ldots, \alpha_n\} \subseteq \Phi is a set of simple roots if:

  1. Δ\Delta is a basis of VV
  2. Every root βΦ\beta \in \Phi can be written as β=ikiαi\beta = \sum_i k_i \alpha_i where all ki0k_i \geq 0 (positive root) or all ki0k_i \leq 0 (negative root)

Simple roots provide a canonical basis for describing the root system. Every root system has a simple root system, unique up to Weyl group action.

Remark

The Cartan matrix A=(aij)A = (a_{ij}) is defined by aij=2αj,αiαi,αia_{ij} = \frac{2\langle \alpha_j, \alpha_i\rangle}{\langle \alpha_i, \alpha_i\rangle} for simple roots {αi}\{\alpha_i\}. This matrix completely determines the root system and hence the Lie algebra structure.

Definition

The Dynkin diagram of a root system with simple roots Δ={α1,,αn}\Delta = \{\alpha_1, \ldots, \alpha_n\} is a graph with:

  • One node for each simple root
  • Nodes ii and jj connected by aijajia_{ij} \cdot a_{ji} edges (where aija_{ij} are Cartan matrix entries)
  • An arrow pointing from longer root to shorter root if roots have different lengths

Dynkin diagrams provide a visual classification of root systems and semisimple Lie algebras. The simply-laced diagrams (no multiple edges) correspond to types An,Dn,E6,E7,E8A_n, D_n, E_6, E_7, E_8.

Example

Type AnA_n has Dynkin diagram: \circ - \circ - \cdots - \circ (nn nodes in a line) Type DnD_n has a fork at one end: \circ - \circ - \cdots - \begin{matrix}\circ \\ \circ\end{matrix} Type G2G_2 has a triple edge: \circ \equiv \circ with arrow

The classification theorem states that connected Dynkin diagrams are exactly the types An,Bn,Cn,Dn,E6,E7,E8,F4,G2A_n, B_n, C_n, D_n, E_6, E_7, E_8, F_4, G_2, corresponding to all simple Lie algebras over C\mathbb{C}.