Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 45 3 Solution Created 2026-10-03 Updated 2026-10-14
Work first in a finite-dimensional SU(2) representation, with its invariant positive inner product. In the complexified Lie algebra, choose and . Let be a highest-weight vector with and , and put . The commutator with givesInduction also givesFor this is . For the induction step, use on : the coefficient becomes . In particularwhich proves the assumed formula rather than merely invoking it.
The norm identity shows that, for nonnegative integer , the ladder is nonzero for and stops with . Distinct eigenvalues make these vectors independent. Their span is stable under , and in the irreducible module it is the full space. ThusFor normalized states, , with the last state killed. General finite-dimensional SU(2) representations are direct sums of these ladders.
The representation category matters here. The Lie-algebra relations alone allow an infinite Verma module even at integral highest weight: its nonzero vector is singular. The finite representation can instead be constructed algebraically by taking the basis with the displayed actions and declaring ; all three Lie brackets then hold, including at the endpoints. Thus the finite-dimensional assertion uses the integrable SU(2) module, or this explicit finite quotient, rather than assuming that a singular vector must vanish in every highest-weight module.
For rank two, take a Cartan subalgebra with commuting basis elements. A root is a nonzero linear functional on for which a root space contains an element satisfyingChoose simple roots and their coroots . In the PDF's index convention, the Cartan matrix isNormalize so . The difference of distinct simple roots is not a root, so the mixed positive-negative bracket is zero. This givesThe transpose in the last formula is essential and is printed correctly in the original PDF.
A highest-weight vector of labels is killed by both and is an eigenvector of the two . Repeated words in generate its highest-weight representation; each lowers the weight by the corresponding simple root. Restricting to the sl2 subalgebra associated with a root for either simple root gives the preceding integer ladder, so finite-dimensional highest labels must be nonnegative integers. The finite irreducible module is the highest-weight quotient imposing and the submodules generated by these relations, together with the Serre relations. Choosing independent nonzero lowering words gives a simultaneous weight basis; an extra multiplicity index is needed where a weight space has dimension greater than one.
For the specified B2 root system, the simple-root squared lengths are and their inner product is , givingThe positive root is generated by , and by . No further positive sums occur, so and . These are the relevant Serre relations. Applying the Cartan commutators to a weight vector proveswhenever the image is nonzero.
To enumerate the requested representation without guessing when arrows stop, realize it concretely as the Adjoint representation. For a Euclidean weight , its labels are . The highest root has labels , so it generates the irreducible adjoint module of this simple rank-two Lie algebra. Its nonzero weights are exactly its eight roots, and its zero weight space is the two-dimensional Cartan subalgebra. This gives the B2 adjoint representation weight diagram and the nine distinct states labels:Their actual production by lowering can be seen fromAn arrow labelled denotes a nonzero action of between the indicated weight spaces. The two paths into zero produce independent Cartan vectors. Hence there are nine distinct pairs, as requested when degeneracy is disregarded, but the full representation has dimension ten, not nine.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 50 4 Solution Created 2026-10-03 Updated 2026-10-14
Use a finite-dimensional complex semisimple Lie algebra, or the complexification of its compact real form, as required for the root construction. Choose a Cartan subalgebra with basis . Simultaneous diagonalization of its adjoint action gives the root-space decompositionThe nonzero weights are the roots of a root system; each root space is one-dimensional in this setting, and roots occur in opposite pairs. This supplies the Cartan and root-vector basis.
The Jacobi identity givesIf the bracket is nonzero and , it is a nonzero vector in the root space of weight , so that sum is a root. The printed implication needs the opposite-root exception: for , can be a nonzero Cartan element, while zero is not a root. The supplied simple-root commutator itself gives this counterexample. This is the root bracket and the opposite-root exception.
Choose a real linear functional nonzero on every root; positive roots are those on which it is positive, and negative roots are their negatives. The simple roots are positive roots not decomposable into two positive roots. They form a basis of the root span, and every root is an integer combinationwith all for a positive root and all for a negative root. Positive roots can be decomposed repeatedly until simple roots remain; the finite root set makes this procedure terminate.
For , has simple-root coefficients of both signs and is not a root. It is also nonzero, so the root-space bracket rule givesThe operators have the SU(2) Lie algebra normalization , . In a finite-dimensional representation, a vector killed by is a lowest-weight vector in its SU(2) summands. If its value is , those summands have spin , soOne can also read the termination from successive raising coefficients starting at the lowest weight.
Apply this result in the finite-dimensional Adjoint representation, taking the lowest-weight vector to be . The vanishing bracket just proved is its lowering condition. If , the lowest-weight result forces with a nonnegative integer. It also yieldsThe last identity is exactly the requested nested commutator. This is the SU(2) proof of the Serre relations, and the identities are the Serre relations in these Chevalley basis conventions.
To construct a highest-weight representation, start from its highest-weight vector and apply negative-root operators. Fix an order on the negative roots. The Poincaré-Birkhoff-Witt theorem gives spanning vectorsof weight . The spanning assertion follows by commuting all negative-root operators to the left, Cartan operators to the middle and positive-root operators to the right; commutators supply lower-order words, positive operators kill the highest-weight vector and Cartan operators act there by scalars. In the finite-dimensional highest-weight representation, impose the simple-root string relations and the commutator/Serre relations. At each weight retain a linearly independent set of the resulting words, discarding zero words and dependencies. This gives a basis, with separate independent vectors retained when a weight has multiplicity greater than one. The construction is finite in the assumed finite-dimensional representation; treating all lowering words as automatically independent would overcount.
For SU(3), put , and . The off-diagonal Cartan entries are minus one, so the Serre relations give . With , these implyFor , expand the commutator using Jacobi identity and the distinct-root brackets:since . Similarly,and the same calculation on gives . ThusThese signs also agree with the explicit model , , , , , .
For the SU(3) Casimir in Chevalley generators, setUsing , , and putting Cartan elements on the left, the four terms of areTheir sum is . The remaining terms giveThe last two cancel, so . Also commutes with every Cartan polynomial and with each : their raising and lowering weights cancel in the product. HenceOn , and vanish and therefore vanishes as well. All three terms consequently give zero, leavingThe paper's normalization is relative to the conventional SU(3) quadratic Casimir eigenvalue. For example it gives in the fundamental representation, in the octet and in the decuplet.
Serre relations 2026-10-14
For simple-root generators with , the Serre relations include and for . The off-diagonal Cartan entries are nonpositive integers. These relations restrict which iterated simple-root brackets remain nonzero.
