Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 2 5 ii Solution Created 2026-10-03 Updated 2026-10-14
Use the standard coroot normalization . The symbols are vectors in the Cartan subalgebra, not the root-space vectors . The root-string theorem gives , so every root takes real values onThe simple coroots form a basis of this real space.
In the root-space decomposition, is zero on and scalar multiplication by on the one-dimensional space . Therefore, for ,For every term is real, so the restricted form is real. Moreover,If it is zero, all vanish. Then commutes with every root space and with , hence is central in . The center of a Lie algebra vanishes for a semisimple Lie algebra, so . Thus the Euclidean subspace of a Cartan subalgebra hasEquivalently, positivity follows because the roots span .
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 2 6 Solution Created 2026-10-03 Updated 2026-10-14
Work with a finite-dimensional complex semisimple Lie algebra. The Dynkin diagram is obtained from its intrinsic root system, with several structure theorems entering the construction.
First choose a Cartan subalgebra . The semisimple structure theory gives the root-space decompositionThe nonzero roots span , root spaces have dimension one, and every root has its negative. The rank is .
Next use the Killing form. Its nondegeneracy on and its positive-definite restriction to the real coroot span identify the real root span with a Euclidean space. Explicitly, if , put . The sl2 subalgebra associated with a root supplies its normalized coroot and the integral pairingThe root-string theorem makes the reflection permute . Together with the absence of multiples other than , this shows that is a finite reduced root system and a crystallographic root system. These properties come from semisimple Lie algebra theory, not from the diagram's definition.
Choose a vector in that is not perpendicular to any root. Define the positive roots by positive inner product with this vector. The simple roots are those positive roots that cannot be expressed as sums of two positive roots. Root-system theory shows that they form a basis , and each root is an integer combination of them with coefficients all of one sign. Distinct simple roots have nonpositive inner product.
Use the standard Cartan matrix conventionThere is one diagram vertex for each simple root. For , the integral off-diagonal entries are nonpositive andConnect the two vertices with respectively zero, one, two or three edges. The corresponding angles are . A multiple edge carries an arrow toward the shorter root. For joined vertices, the length ratio is determined by ; hence the diagram records both angle and relative length.
For example, has simple roots and , giving two equal-length vertices joined by one edge: type . For , take and . Thenso the two vertices have a double edge directed toward , the shorter root: type .
Finally, orthogonal irreducible components of the root system correspond to the simple ideals of a Lie algebra in the semisimple Lie algebra, so its diagram is the disjoint union of their connected diagrams. Conjugacy of Cartan subalgebras and the Weyl group action on choices of positive roots make the resulting diagram independent of these choices up to isomorphism. Thus the vertices, edge multiplicities, arrows and connected components encode the simple-root geometry and the simple-ideal decomposition.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 302 3 Solution Created 2026-10-03 Updated 2026-10-14
The triple bond in the original Dynkin diagram gives the Cartan integerswhere is the long root and the short root. Their product is , and the inner product of distinct simple roots is nonpositive. The ratio of the two integers gives the squared-length ratio. ThereforeIt is convenient to normalize , and . Scaling the inner product does not affect the root system or the fundamental-weight relations.
For nonproportional roots , the root-string theorem states that the root string is consecutive:The endpoints are maximal, and reflection in reverses the string. The Cartan integer determines , not in general the total by itself. This result follows by restricting the Adjoint representation to the sl2 subalgebra associated with a root. If the roots are distinct simple roots, cannot be a root: its simple-root coefficients have opposite signs. Thus andHere length means number of roots; the number of intervals between them is one less. Distinctness matters. If , a reduced root system gives the set , with a missing zero between them, so the consecutive-string theorem and the displayed simple-root formula do not apply.
In the G2 root system, the initial strings areFor , . Since is not a root in a reduced root system, and : this generates . The remaining strings explain why the construction stops. The -strings through and are the same two-element string; the one through is a singleton since subtracting gives , and its Cartan integer is zero; the one through is the string . The -strings through , , and are the initial four-element string. Finally, is orthogonal to ; its -string is a singleton because is not a root. Apply the same reasoning to negatives. Using the permitted completeness of this procedure givesThe short positive roots are , of squared length two; the other three are long, of squared length six. Each root space is one-dimensional and the Cartan subalgebra has dimension two, soHere the dimension refers to the Lie algebra, with one Cartan generator per rank, not just the number of roots.
Write a prospective weight as . The pairings with simple coroots areThe fundamental weights are dual to those coroots. Solving the two linear systems gives, in the long-root-first numbering of this paper,The representation with Dynkin labels has highest weight , a short root. Numbering the short root first, as some references do, would call this the representation instead; the representation itself is unchanged.
The weight set of a finite-dimensional irreducible highest-weight representation is invariant under the Weyl group and lies in the convex hull of the orbit of its highest weight. All weights also differ from the highest weight by an element of the root lattice. The orbit of comprises the six short roots, so all six are weights. The lowering operators give the chainIn particular zero occurs: at weight , its pairing with is two, so the lowering operator is nonzero by the finite-dimensional sl2 Lie algebra representation theory. The -string through it is the usual three-weight string ; higher weight would lie outside the highest-weight convex hull.
There can be no further weights. Every point of that convex hull has squared norm at most , while a root-lattice point hasThe integer solutions of the bound are precisely zero and the six short roots: gives ; gives ; and gives . ThusThe final dimension uses the stipulated nondegeneracy of the weights. It also agrees with the Weyl dimension formula without that stipulation. The zero weight is not in the Weyl orbit of the nonzero weights, so this is not a minuscule representation.
In the diagram above, a coordinate label means . The left panel contains all twelve roots of a root system; the right panel contains the six short-root weights and the zero weight. The long-root-first convention is the same as in the calculations.
Root string Created 2026-09-24 Updated 2026-10-05
A root string is the set for roots of a root system . For nonproportional roots and of a reduced crystallographic root system, the roots of the form form an unbroken root string , and . The root-string theorem explains the endpoint relation. If , zero is missing and this consecutive-string statement does not apply.
