Root Systems and Cartan Classification
Continuous symmetry looks infinitely varied — every rotation, phase, and gauge transformation seems to demand its own bespoke algebra. Cartan's classification is the discovery that it is not varied at all. Take any finite-dimensional complex semisimple Lie algebra , isolate a maximal set of commuting generators — the Cartan subalgebra — and diagonalize the adjoint action. The algebra shatters into plus a family of one-dimensional ladder spaces, each tagged by a vector called a root. That finite constellation, floating in a Euclidean space whose metric is the Killing form, obeys axioms so rigid it reconstructs completely. The rigidity is almost unreasonable. Roots come in pairs; reflection perpendicular to any root permutes the whole set; and the only angles two roots may subtend are . Split the roots into positive and negative with a hyperplane and a minimal generating set of simple roots appears, whose geometry compresses into a small matrix of integers — the Cartan matrix — drawn as a Dynkin diagram of nodes and bonds. Killing, Cartan, Coxeter, and Dynkin proved that the connected admissible diagrams form exactly four infinite families and precisely five exceptions — the entire universe of simple symmetry, on one page. For physics this is infrastructure, not decoration: it fixes the compact gauge groups, the of colour and flavour, the grand-unified and , the of the heterotic string, and the highest-weight machine that turns a diagram into a particle multiplet.
- A semisimple Lie algebra is reconstructed from its root system : the nonzero weights of the adjoint action of a maximal abelian (Cartan) subalgebra , with .
- Choosing positive roots singles out a basis of simple roots, whose angles and length ratios are packed into the integer Cartan matrix .
- The one hard fact, integrality of , comes from an embedded ladder and forces — only four angles survive.
- Cartan matrices are drawn as Dynkin diagrams; positive-definiteness forbids loops and multiple branches, cutting the admissible list to plus .
- The same root data run representation theory: highest weights , the Weyl group of reflections, and the weight diagrams that are physical multiplets.
- Key idea: encode a semisimple Lie algebra in the finite geometry of its roots, compress that geometry into a small integer matrix and its diagram, and enumerate every admissible diagram — that finite list is every simple symmetry there is.
Encode a semisimple Lie algebra in the finite geometry of its roots; reduce that geometry to a small integer matrix — the Cartan matrix — and its Dynkin diagram, then enumerate all admissible diagrams. The four families plus five exceptionals are the complete list of simple complex Lie algebras.
Where this lives today
The most striking modern appearance of a root system is not a string-theory blackboard but a laboratory magnet. In 2010 Coldea and collaborators cooled the quasi-one-dimensional Ising ferromagnet cobalt niobate () to its quantum critical point in a transverse field and read out its quasiparticle spectrum with neutron scattering. Zamolodchikov had predicted in 1989 that the critical Ising chain in a longitudinal field is governed by an integrable theory whose eight massive particles carry the hidden symmetry of — and that the two lightest masses must stand in the ratio , the golden ratio, a number built directly from the root geometry. The experiment found the first two peaks in precisely that ratio: a rank-8 root system with 240 roots, discovered by Killing while classifying abstract symmetry, sets the mass spectrum of a real solid. Root systems are also the daily grammar of high-energy physics. Grand-unified model builders sift the Dynkin diagrams for simple groups containing as a sub-diagram — deleting a node of or yields the Standard Model, with branching rules read straight off the sub-diagrams. The two anomaly-free heterotic strings carry gauge algebra or , chosen for the root-lattice reasons the classification supplies. And the half of the list reappears far from Lie theory — in the McKay correspondence, in simple surface singularities, and in the quiver gauge theories of condensed matter.
The physical picture
Think of the Cartan subalgebra as a rack of mutually commuting "measuring rods" — the analogue of in angular momentum, or the pair (isospin) and (hypercharge) in . Being commuting, they diagonalize at once, and every remaining generator becomes a ladder operator that shifts those simultaneous eigenvalues by a fixed vector — the root. The algebra is a lattice of ladder operators hanging off the Cartan torus, the roots the arrows between rungs. The first figure is the smallest interesting case, : six roots on a regular hexagon in the plane, two singled out as simple roots at , every other generator reached by adding them. The hexagonal symmetry is the Weyl group — reflections perpendicular to each root — the same symmetry decorating the meson and baryon multiplets of the eightfold way.
Each opposite pair , with the coroot , closes into a private copy of . This is the secret engine of the classification: 's rigidly integer-spaced ladders are imported wholesale, forcing the Cartan matrix entries to be integers — and integers admit only finitely many geometric solutions. Everything downstream — the four angles, the ban on loops, the five exceptionals — is ladder theory iterated over every pair of roots. The second figure is the destination: the complete gallery of connected Dynkin diagrams. A node is a simple root; a missing line means two commuting 's; single, double, and triple bonds record ever-tighter angles, arrows pointing from long root to short. Reading this chart is reading the list of every simple symmetry the universe permits.
The core equations
The starting move is to diagonalize the algebra by its own commuting core. The operators for commute and are simultaneously diagonalizable, splitting into joint eigenspaces whose nonzero eigenvalue-functionals are the roots — replacing the algebra by the finite set of arrows in .
where: — the Cartan subalgebra, maximal abelian and ad-diagonalizable; — the roots, nonzero weights of the adjoint action; — the one-dimensional root space, spanned by ; — the root evaluated on . Reading it: scales by , so shifts every Cartan eigenvalue by the fixed vector — a raising operator. The one genuinely hard fact of the subject is that a certain projection of one root onto another is always an integer — it descends from the hidden inside each root pair (Derivation A) and seeds every angle and length constraint.
where: — the inner product on inherited from the Killing form; — the coroot dual to ; — the projection is always an integer. Reading it: the angles between roots may be irrational, but the asymmetric pairing of a root with a coroot is quantized — and quantization is what makes the geometry finite. Restricting equation (2) to the simple roots packages all their geometry into one integer matrix: diagonal fixed at , off-diagonal non-positive, and — crucially — generally not symmetric, only symmetrizable, since roots may differ in length.
where: — the simple roots, with ; — the Cartan integer, encoding both the angle and the length ratio of and . The whole algebra is recoverable from this table of integers — the most economical fingerprint of a simple symmetry. Multiplying the two off-diagonal partners cancels the length information, leaving the angle alone; the product of two non-positive integers, bounded by Cauchy–Schwarz, leaves only four values.
where: — the angle between the simple roots and . Reading it: (no bond), (single, equal length), (double, ratio ), (triple, ratio ); is excluded as it makes the roots parallel. Each root defines a reflection of the ambient space, and these reflections map the root system to itself. The finite group they generate is the Weyl group, the symmetry group of every weight diagram.
where: — the orthogonal reflection in the hyperplane perpendicular to ; — the Weyl group, generated by the simple reflections. Since is an integer, moves roots by integer multiples of and never leaves — the symmetry that hexagons the multiplets. The unbroken chain of roots obtained by stepping along is symmetric under , and its imbalance is exactly the Cartan integer — the identity behind the integrality proof.
where: — how far the string extends below and above in the -direction. The string is unbroken and reverses it end for end, so its asymmetry equals the integer . Representations run the same data in reverse: a finite-dimensional irreducible is fixed by one highest weight, a non-negative-integer combination of the fundamental weights dual to the coroots.
where: — the fundamental weights, the dual basis to the coroots; — the Dynkin labels of . Attach non-negative integers to the diagram's nodes and you have named an irreducible representation; the Cartan matrix then unfolds it into a full weight diagram. Finally, one master count reconciles the sizes: the algebra is its rank plus its roots, and the root total factors through the Coxeter number.
where: — the number of roots, equal to the number of ladder operators; — the Coxeter number; — the rank. For , and , so and — the largest exceptional algebra, on the back of an envelope.
The goal is to prove the single fact on which the whole classification balances: for any two roots , the projection is an integer. Everything else — the four angles, the acyclic diagrams, the finite list — is a corollary. The strategy: each root pair generates a copy of ; let it act on the chain of root spaces through and import the rigidly integer weight-spectrum of finite-dimensional modules.
Step 1. Take with and set , , with , , — the standard , acting as the coroot . Why: the bracket-grading makes these close, so theory becomes available inside any semisimple .
Step 2. Collect the root spaces along the -string through into ; raises and lowers it, so is a finite-dimensional -module. Why: a raising and a lowering operator on an unbroken ladder is exactly what theory constrains.
Step 3. The -eigenvalue on rung is , since : consecutive rungs carry -weights spaced by exactly . Why: spacing is the fingerprint of an ladder, locking the string into one irreducible tower.
Step 4. Finite-dimensional weights are symmetric about zero, so top bottom: . Why: this is just running from to in any spin- multiplet, pinning the two ends of the string together.
Step 5. Solve the symmetry condition to get . Since and are non-negative integers, the projection is an integer — the boxed result. Why: this integer, differenced from two ladder lengths, is the whole arithmetic backbone of the classification.
Note that the string relation is exactly the Weyl-reflection reversal , confirming that the ladder structure and the integer Cartan matrices are two faces of the same fact.
Go deeper · Derivation B · 1 minEnumerating the four rank-2 root systems
The goal is to show, by direct enumeration, that a rank-2 simple Lie algebra takes only four shapes — , , , — watching the integrality of Derivation A collapse a seemingly continuous family into a finite list. Two simple roots are constrained only by integrality of the off-diagonal Cartan entries and the bound ; we run through the allowed products and read off the algebra.
Step 1. If then and the Cartan matrix is diagonal, . The two roots are orthogonal, so the algebra splits into — two disconnected nodes, not simple. Why: orthogonal simple roots mean the two 's commute — a disconnected diagram is a direct sum.
Step 2. If then , the roots have equal length, and . This is : six roots forming the regular hexagon of the first figure, . Why: equal-length roots at tile the plane hexagonally — the eightfold-way geometry.
Step 3. If then , the length-squared ratio is , and . This is : eight roots, . Why: a double bond encodes one root longer — the orthogonal/symplectic asymmetry in rank 2.
Step 4. If then , the length-squared ratio is , and . This is : twelve roots, , the smallest exceptional algebra. Why: the triple bond is the most lopsided angle integrality allows, and it occurs exactly once.
Step 5. If then , forcing , which is impossible for distinct simple roots. The list therefore terminates at four. Why: parallel simple roots would be equal up to sign, contradicting independence — no fifth system exists.
The four Cartan matrices and their root counts — — give dimensions , , , for , , , and respectively, as expected from the master count .
Go deeper · Derivation C · 1 minWhy Dynkin diagrams have no loops and branch at most once
The goal is to see how positive-definiteness — the mere fact that the simple roots are linearly independent — eliminates all but the finite list. The device: normalize each simple root to a unit vector and study the Gram matrix . Because the simple roots form a basis, this matrix is positive-definite, and positivity is a surprisingly sharp bound on how many bonds a connected diagram may carry.
Step 1. Linear independence of means forces all , so any nonzero combination has strictly positive norm and the Gram matrix of the is positive-definite. Why: positive-definiteness is the one global fact surviving from "the roots are a basis," and every inequality is squeezed from it.
Step 2. Two nodes joined by at least a single bond have angle , so ; unlinked nodes are orthogonal. Why: this turns a diagram's bond count into a numerical bound on overlaps — the bridge from combinatorics to geometry.
Step 3. Suppose a cycle of single-bonded nodes existed. Then , a contradiction. So Dynkin diagrams contain no loops. Why: a cycle supplies linked pairs, each pulling the norm down by — just enough to cancel the diagonal and violate positivity.
Step 4. A similar estimate at a single node bounds its incident bond strength, , permitting at most three single bonds (or one triple, giving ) and one branch point per connected diagram. Why: this outlaws a fourth arm at a vertex, restricting branch nodes to the and shapes.
Step 5. Solving the remaining finite set of positive-definite diagram constraints yields exactly . Why: with loops forbidden and branching limited, only these shapes stay positive-definite — the classification theorem.
Limiting cases
The rank-1 and -2 systems make the machinery concrete; the classical families show how it scales.
| Case | Result | Meaning |
|---|---|---|
| Rank 1, | one root pair — the ladder and one Cartan ; the atom of the whole subject | |
| Rank 2, | angle , , | six roots in a regular hexagon — colour and flavour |
| Rank 2, | angle , ratio , | eight roots; , the first double bond |
| Rank 2, | angle , ratio , | twelve roots, triple bond — the smallest and most lopsided exceptional |
| Rank , | a straight chain of equal-length roots each to its neighbour | |
| Rank 8, | , | the maximal exceptional; its root lattice is the densest packing in eight dimensions |
Worked examples
1 · Building su(3) = A₂ from scratch (confidence builder)
Start from two equal-length simple roots at . Construct the Cartan matrix, count the roots, get the dimension, and use the Cartan data to size the smallest irreducible representations.
Step 1. With and , the off-diagonal entries are , so . The product sits in the allowed set , confirming a legal single-bond diagram.
Step 2. The positive roots are , , and (allowed because gives a string of length one above ); with negatives, . Hence — the eight Gell-Mann generators.
Step 3. Irreducible representations are labelled by Dynkin labels , and for the Weyl dimension formula collapses to . The fundamental gives — the quark triplet.
Step 4. The adjoint gives , matching as it must, since the adjoint acts on the algebra itself. The symmetric gives — the baryon decuplet.
Result. From two arrows at : Cartan matrix , 6 roots, dim 8, and the multiplets 3, 8, 10 that organize the eightfold way.
2 · Reading an algebra off its Cartan matrix
A rank-2 algebra has Cartan matrix . Identify it, and find the angle, length ratio, root count, and dimension.
Step 1. Form the diagnostic product . Then , so and — a triple bond.
Step 2. The asymmetry versus fixes the length ratio: , giving , so one root is times longer than the other.
Step 3. The unique rank-2 system with a triple bond is , the smallest exceptional, with roots (six long, six short).
Step 4. The dimension follows from the master count: , consistent with using the Coxeter number .
Result. The matrix is : angle , length ratio , 12 roots, dimension 14 — every feature extracted from four integers.
Physics of the portrait
The classification carries three names welded together. Wilhelm Killing found the roots and the list in a burst of papers he himself distrusted; Élie Cartan, in a doctoral thesis of legendary precision, corrected the errors, proved the exceptional cases genuinely exist, and made the whole edifice rigorous. It is Cartan's name the classification bears.
Origins · 1 minÉlie Cartan and how this was discovered
Élie Cartan was the son of a village blacksmith in the French Alps, lifted out of poverty by a state scholarship spotted by a travelling inspector. His 1894 doctoral thesis, Sur la structure des groupes de transformations finis et continus, took Wilhelm Killing's brilliant but error-strewn 1888–1890 classification and rebuilt it on solid ground — supplying the correct definition of the Cartan subalgebra, proving that the four families and five exceptional algebras really are the complete list, and showing that the mysterious genuinely exist rather than being mere combinatorial possibilities. Cartan went on to reshape much of modern mathematics: the exterior calculus of differential forms, the method of moving frames underlying modern differential geometry, the theory of symmetric spaces, and — in 1913, purely from the representation theory of the orthogonal algebras — the spinors that Dirac would later need for the electron. His work on connections produced Einstein–Cartan gravity with torsion. Recognition came late, cemented when his son Henri became a leading light of the Bourbaki generation. The classification that opens every course in Lie theory is his monument: a proof that continuous symmetry, for all its variety, is finite and knowable.
Going further
Texts. Humphreys, Introduction to Lie Algebras and Representation Theory (the standard proof of the classification, §10–11) · Fulton & Harris, Representation Theory: A First Course (root systems worked example by example) · Georgi, Lie Algebras in Particle Physics, 2nd ed. (the physicist's operational treatment) · Stone & Goldbart, Mathematics for Physics, ch. on Lie groups and algebras · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed. · Hassani, Mathematical Physics, chapters on group theory. Key results to keep in mind: integrality from the embedded- root string; and the four rank-2 Cartan matrices; the dimensions , , , , via with the cross-check ; and the multiplets from . The golden-ratio mass ratio is the result of Zamolodchikov (1989) and Coldea et al., Science 327, 177 (2010).
Prerequisites. Lie Algebras and the Exponential Map · Lie Groups · Group Representations · Reducible and Irreducible Representations · The Rotation Group SO(3). Leads to. Tensor Products and Clebsch–Gordan Decomposition · Group Representations.
Ask the tutor: Ask me to walk you through drawing the root system by hand, or to derive the Cartan matrix and show exactly which node you delete to recover the Standard Model.
What exactly is a root, in one sentence?
A root is a nonzero weight of the adjoint representation: a vector with a generator satisfying for every Cartan element . Concretely it is the amount by which the ladder operator shifts the simultaneous Cartan eigenvalues. In those eigenvalues are isospin and hypercharge , so each root is the step of one of the six raising and lowering operators. Roots live in the same space as representation weights, which is why root and weight diagrams share one plane.
Why does the whole classification reduce to su(2)?
Because every pair generates a copy of , and letting it act on the rest of the algebra imports the one rigid fact of theory: its weights are integers, spaced by two and symmetric about zero. Applied to the string through any other root, that symmetry forces to be an integer (Derivation A). Integers admit only finitely many configurations of angles and lengths, and enumerating them is the classification. In a real sense there is only one simple Lie algebra — — and the rest are consistent ways of gluing copies of it together.
What is the difference between simple roots and positive roots?
A hyperplane through the origin that misses every root splits into positive roots (one side) and negative roots (their mirror images). A positive root is simple if it is not a sum of two other positive roots. The simple roots are the minimal generating set: exactly of them, forming a basis of , with every positive root a non-negative integer combination of them. So simple roots are few — one per Dynkin node — while positive roots are many; has two simple roots () but three positive roots ().
How can there be only five exceptional algebras and not, say, six?
The exceptionals are the connected Dynkin diagrams that survive the positive-definiteness constraints of Derivation C but escape the four regular families. The branch-and-loop bounds allow only a handful of shapes with a branch node or multiple bond: the triple bond gives ; a central double bond on four nodes gives ; and the three "-type" trees with one short arm give , after which lengthening the arm destroys positive-definiteness. Try to build and the Gram determinant hits zero — the diagram turns affine, an infinite-dimensional Kac–Moody algebra, not a finite simple one. Five is where finiteness runs out.
Is the Cartan matrix always symmetric?
No, and assuming so is a classic trap. It is symmetric only for the simply-laced algebras , where all simple roots share a length. Whenever a double or triple bond appears — — the roots come in two lengths, and divides by , so swapping and changes the entry. It is still symmetrizable: a positive diagonal (the squared root lengths) makes symmetric. The asymmetry is information, not a defect — it is how the diagram remembers which root is long.
How do root systems turn into particle multiplets?
Through the highest-weight construction. Attach non-negative integers — the Dynkin labels — to the diagram's nodes; this names an irreducible representation with highest weight . From you generate the full weight set by repeatedly subtracting simple roots, the allowed steps dictated by the Cartan matrix, until the diagram closes under the Weyl group. Those weights are the states' quantum numbers, and their count is the dimension. In this turns into the eight-state adjoint (meson octet) and into the ten-state decuplet — the eightfold way, generated mechanically from root data.