A root string of length gives an irreducible sl2 Lie algebra module when restricting the Adjoint representation to the sl2 subalgebra associated with a root. Include also the root's own and one commuting Cartan direction . For either simple root gives . For , the long root gives and the short root gives . For , the long root gives and the short root gives .
Centralizer lower bound for a root vector 2026-10-05
In a complex semisimple Lie algebra whose rank of a semisimple Lie algebra is , a root vector satisfies . To see this, select roots whose images form a basis of the real root span modulo , where . Take the highest endpoints of the root strings through both signs of each selected root. Their distinct root spaces commute with . Together with and , these give independent vectors in the Lie algebra centralizer.
Chevalley basis 2026-10-14
A Chevalley basis of a complex semisimple Lie algebra consists of suitable coroot elements and one vector in each root space, chosen so all Lie bracket structure constants are integers. In particular when the sum is a root, with where is the last negative-direction root in the root string. For independent roots with no root sum the bracket is zero. The integral lattice makes reduction to other fields possible.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 63 3 Solution Created 2026-10-03 Updated 2026-10-14
For a Cartan-Weyl basis, the Jacobi identity givesThus the bracket has joint Cartan weight . If , it belongs to the zero-weight space, which is the Cartan subalgebra, and so is a linear combination . If is a nonzero root, its root space is one-dimensional and the bracket is proportional to . If that nonzero sum is not a root, the bracket vanishes. This proves the asserted forms without assuming every pair of roots has a root sum.
With the stated normalization, put . The commutators becomeThe adjoint relations make , , the usual SU(2) Lie algebra generators. Hence every finite-dimensional SU(2) irreducible component has eigenvalues , with an integer. Therefore has integer eigenvalues , including in the finite-dimensional Adjoint representation. Algebraically this is the sl2 subalgebra associated with a root.
If , another use of the Jacobi identity givesThe bracket is therefore zero or lies in the eigenvalue- space. Within one irreducible SU(2) ladder it is proportional to the next chosen vector . If the full eigenspace has multiplicity, the weight statement is the general one; proportionality to one named vector presupposes the ladder choice. Similarly lowers this eigenvalue by two, and the ladder weights run from to in steps of two.
For a root vector , its weight isThe adjoint SU(2) ladder therefore provesFor nonparallel , raising and lowering move its joint Cartan weight through the root string . The finite irreducible ladder has weights symmetric about zero. Starting at , reaching its partner requires . The corresponding nonzero vector lies in the root space of , proving the Weyl reflection property:There is no zero joint root in this string when are nonparallel. Its one-dimensional root spaces prevent two irreducible ladders with the same weight parity from overlapping, so the ladder argument applies to the entire string. For , reflection simply interchanges the two opposite roots, which already exist by the adjoint relation.
For angle and length restrictions, set and . These Cartan integers have the same sign when nonzero and obeyFor nonparallel, nonorthogonal roots, is an integer strictly between zero and four. The possibilities are consequently:
Orthogonal roots have and . Parallel roots have ; the integer pairs would allow only length multiples . The stated reducedness condition excludes the latter two, so parallel roots are equal or opposite, with angles zero or and equal lengths. ThusNot every root system realizes every listed angle.
The orthogonal pair alone gives no ratio through . To finish the length restriction for a simple Lie algebra, use irreducibility of its root system. Let span the Weyl group orbit of . Both and are invariant under the orthogonal root reflections. If a root had nonzero projections in both, reflection of its projection in would have a nonzero component, violating invariance. Hence every root is entirely in one of these subspaces. A proper nonzero would split the root system into two orthogonal parts, contradicting irreducibility. This proves that the Weyl orbit spans an irreducible root space.
In particular, some orbit root is nonorthogonal to any chosen , and . Applying the previous integer-pair restriction to therefore also handles orthogonal :There can be at most two different root lengths: three lengths would have ratios two and three relative to the shortest, but then the longest-to-middle squared-length ratio would be , which is forbidden. A reducible collection of orthogonal rank-one factors could have independently chosen scales; the simple-algebra assumption excludes that exception.
Choose a generic linear functional to define positive roots. The simple roots are those positive roots which cannot be written as sums of two positive roots; they form a basis in which all root coefficients are integers of one sign. Distinct simple roots have nonpositive inner product: if their inner product were positive, their root string would contain their difference, and whichever difference is positive would decompose one of them. In rank two, irreducibility excludes the orthogonal case. The allowed simple-root angles are therefore , giving the three irreducible diagrams in the classification of rank-two root systems: A2 root system, B2 root system and G2 root system. Reflections in the two simple roots generate their respective six, eight and twelve roots.
Here are explicit simple-root choices and positive roots; adding their negatives gives each complete diagram.
- For A2 root system, take and . The positive roots are ; all have squared length one.
- For B2 root system, take the long and short . The positive roots are . These give the four axis roots and four diagonal roots, with squared lengths one and two. The rank-two Lie algebra is isomorphic to this one; changing the long/short ordering changes its Cartan presentation.
- For G2 root system, take short and long . The positive roots are . They give two hexagons rotated by , with squared lengths one and three.
The nonnegative coefficients in each positive-root list verify the chosen simple roots explicitly. The orthogonal four-root system is rank two but reducible, so it is not a diagram for the simple algebra assumed here.
Define the Cartan matrix in the column-coroot convention:Using the ordered roots above givesThe alternative row-coroot convention transposes these matrices. Stating the convention and root ordering avoids a spurious disagreement in the unequal-length cases.
The irreducible rank-two root systems A2, B2 and G2, with long and short roots and explicit ordered simple roots highlighted
. Details. Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 4 4 v Solution Created 2026-10-03 Updated 2026-10-14
The root-space decomposition gives when . The two roots are independent, so , and the missing root sum means that this weight space is zero. Hence . These adjoint root operators are nilpotent: successive brackets shift root weights by the same root, so finite root strings force eventual vanishing; on the Cartan subalgebra the first bracket lies in its root space and the next is zero. By part (iv), the nilpotent operators and commute. Every power of therefore commutes with every power of , so their finite matrix exponentials commute too. Using the inverses proved in part (ii),
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 3 4 iv Solution Created 2026-10-03 Updated 2026-10-14
Let be distinct simple roots. Their difference is not a root, since its simple-root coefficients have opposite signs. The root string through in the direction therefore starts at and has the formHere we use the root-string theorem: if the full string runs from through , then ; in this case . Thus is a root exactly when , equivalently when the corresponding Dynkin diagram nodes are connected.
The root-space bracket facts are , with a zero space when the sum is not a root, and when the sum is a root and . Applying these stated structural facts proves
If the two names denote the same simple root, its one-dimensional root space has zero bracket with itself, and a Dynkin diagram has no self-edge. Thus the equivalence also holds in that case.
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.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 2 c Solution Created 2026-10-03 Updated 2026-10-05
Choose the given short root as a simple root, and let be the long simple root. This entails no loss of generality: the Weyl group is transitive on the short roots of the G2 root system. The relevant Cartan integers are and . The positive roots areUnder , the root space for has eigenvalue . The subalgebra itself is the three-dimensional irreducible in the Adjoint representation.
The four root spaces along the root string have eigenvalues . Consecutive spaces are connected by nonzero raising operators and lowering operators, so their sum is . The negative root string supplies another . The root spaces for have eigenvalue zero, and neither adding nor subtracting gives a root; they are two copies of . Finally, the one-dimensional space commutes with , giving one more . We have accounted for all dimensions, and therefore the G2 adjoint branching to a short-root sl2 subalgebra isFor a nonzero root vector , its Adjoint representation action is a nonzero scalar multiple of the raising operator on each summand. On each irreducible this operator has a one-dimensional kernel, including . Since the Lie algebra centralizer is that kernel,
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 2 d Solution Created 2026-10-03 Updated 2026-10-05
Suppose first that , and let be the real span of the root system, of dimension equal to the rank of a semisimple Lie algebra . The images of the roots span , so select roots whose images form a basis of this quotient.
For each , take the highest endpoint of the root string through , and the highest endpoint of the root string through . By construction, is not a root. Moreover , since their images in are nonzero. The root-space decomposition and its bracket rule therefore giveThese roots are distinct: their quotient images are the two signs of a basis, which are distinct. Their one-dimensional root spaces consequently contribute independent vectors to the Lie algebra centralizer.
In addition, the dimensional subspace commutes with , because . The line also commutes with . These contributions are independent by the root-space decomposition; in particular none of the selected endpoint roots is . Thus the centralizer lower bound for a root vector isIf , then . The root system contains the distinct roots , so , which also proves the desired inequality. The argument includes rank one, where the list of is empty.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 302 3 Solution Created 2026-10-03 Updated 2026-10-05
Use the wiki's Cartan matrix conventionLabel the long simple root first when the lengths differ. The matrix of an irreducible rank-two root system has the form , where are positive integers. Integrality and the signs follow from the Cartan integers for distinct simple roots, and irreducibility rules out a zero off-diagonal pair. Its positive-definite symmetrization gives , equivalently . Moreover . Thus , giving the entire classification of rank-two root systems relevant to a simple algebra:These correspond to , , and the exceptional algebra . Here denotes the Isomorphism between so5 and sp4, not an additional case. The disconnected system corresponds to a semisimple but nonsimple algebra and is excluded.
The Dynkin diagrams, with nodes in the same order as the matrices, areThe second and third diagrams have two and three bonds respectively, with the arrowhead pointing to the short root . In the last diagram draws the three bonds and their arrowhead.
To enumerate roots, use the standard root string theorem: for , the roots are consecutive from through , with . Also use the standard results that the root system is reduced, every root is conjugate under the Weyl group to a simple root, and each root space has dimension one.
Write . Since a difference of simple roots is not a root, the -string starting at has and . It produces . The -string starting at has . In type , the further string through hasand is not a root, so it also produces . The resulting positive roots areAll roots are these and their negatives. To check completeness, the simple root reflections act on coordinates byEach listed set together with its negatives is stable under both reflections. It contains the simple roots and consists of roots already forced by strings. Since every root lies in a Weyl orbit of a simple root, no other roots can occur. This proves the lists for the A2 root system, B2 root system, and G2 root system. The root-space decomposition then gives
For the restriction to a sl2 subalgebra associated with a root, normalize its Cartan element to be . On a root vector of root , its eigenvalue is . The classification of finite-dimensional sl2 representations says that has weights and dimension . A root string of nonparallel roots therefore supplies one such irreducible module: the raising and lowering brackets connect its consecutive root spaces.
For clarity, the positive-side strings for each simple-root direction are listed below. Brackets denote the whole consecutive string; a single listed root is a string of length one. In every row also include each negative string in reverse order, and separately the triple formed by the root , its negative, and .The root's own triple is always . The one-dimensional subspace of annihilated by commutes with this subalgebra and gives . Each singleton root in the table, and its negative, contributes another . Reading the other string lengths now gives the adjoint branching to root sl2 subalgebras in rank two:Their dimensions are respectively . The last row agrees with G2 adjoint branching to a short-root sl2 subalgebra. All labels in the table are highest weights, rather than dimensions.
Past exam of the mathematics course of the University of Cambridge 2021 iii Paper 302 1 ii Solution 2026-09-28
The root string through in the direction contains and , so can be raised once by . The string through in the direction containsso can be raised three times by .
Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 302 3 b Solution 2026-09-28
Let be a positive root. If it is not simple, it is a sum of two positive roots. Repeating this decomposition terminates because the height with respect to a regular positive functional strictly decreases, and it writeswith at least one . Equivalently, one may repeatedly choose a simple root with and use the root string to replace by the root .
For uniqueness, the simple roots are linearly independent. Therefore two such expansions have identical coefficients. Here “positive integer coefficients” must allow zero coefficients: a simple root itself has coefficient one on its own basis vector and zero on the others.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 302 4 a iii Solution Created 2026-09-24 Updated 2026-09-25
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.

