Root System

A root system is a finite set of vectors in a Euclidean space that satisfies precise geometric constraints: it is closed under reflection across the hyperplanes orthogonal to its members, and the angles between any two roots are severely restricted. These constraints are so stringent that only a handful of root systems exist, and their classification — achieved by Wilhelm Killing and refined by Élie Cartan — is identical to the classification of simple Lie algebras. The root system of a Lie algebra encodes the algebra's entire multiplicative structure: each root corresponds to a one-dimensional subspace of the algebra, and the way roots add and subtract determines the commutators.

Root systems are not merely algebraic curiosities. Their reflection symmetries generate the Weyl Group, a finite group that governs the representation theory of the corresponding Lie algebra. And the classification of root systems by their Dynkin diagrams is the same combinatorial skeleton that appears in the theory of Coxeter groups, singularity theory, and the geometry of symmetric spaces. The fact that the same finite list of diagrams governs so many disparate domains is one of the deepest unexplained regularities in mathematics.