Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 1 3 Solution Created 2026-10-03 Updated 2026-10-07
A finite-dimensional complex Lie algebra is a semisimple Lie algebra when its solvable radical is zero, equivalently when it has no nonzero solvable ideals. Its Killing form is the symmetric bilinear formThe cyclic trace identity and giveThus the Killing form is an invariant bilinear form on a Lie algebra. In particular its radical is an ideal.
We supply the trace argument needed for nondegeneracy rather than assuming the Cartan criterion for semisimplicity. The matrix form of the Cartan solvability criterion says: if and for every , , then is solvable. To prove this direction, fix . Let be its generalized eigenspace decomposition, and define to act on by the scalar . On , the semisimple part of has eigenvalue , whereas acts by . Polynomial interpolation on the finitely many eigenvalues, with all derivatives through the sizes of the nilpotent blocks set to zero, therefore givesHere the same difference always has the same conjugate, so the interpolation is consistent; the prescribed zero derivatives remove every nilpotent block. Since , it follows that .
Write . By cyclicity and the trace hypothesis,On the other hand, . Thus all eigenvalues of vanish, and every element of is nilpotent. The Engel theorem makes nilpotent as a Lie algebra, hence solvable; is abelian, so is solvable. This is the Conjugate-spectrum proof of Cartan solvability.
Apply this to the Killing radical . For , the adjoint actions preserve and act as zero on , because is an ideal. Computing traces in a basis adapted to givesThe matrix Lie algebra consequently satisfies the trace criterion and is solvable. Its kernel is , an abelian ideal; a central extension of a solvable algebra is solvable. Thus is solvable. This proves the reusable assertion that the Killing radical is a solvable ideal. Semisimplicity forces , and hence is nondegenerate.
A Cartan subalgebra is a nilpotent subalgebra which is self-normalizing:For a complex semisimple algebra this is equivalently a maximal toral subalgebra. The nilpotent, self-normalizing definition permits a proof of the restricted nondegeneracy without first assuming the toral characterization.
Use the generalized-weight decomposition for a nilpotent Lie algebra for the adjoint action of :For completeness, the stability underlying this decomposition follows directly from nilpotence of . For fixed , every on is nilpotent. If and in a finite-dimensional representation, then for sufficiently large . The identityshows that preserves each generalized eigenspace of . Starting with a basis of , refine these primary decompositions successively; all summands remain -invariant. Each resulting summand has only one eigenvalue for each basis element. The Lie theorem triangularizes the action on that summand, so those eigenvalues extend to a single linear character on all of . This proves the displayed decomposition and nilpotence of all shifted operators there.
Since is nilpotent, . The space is a subalgebra: repeated use of the derivation rule for shows that the bracket of two generalized zero-eigenvectors is another such vector. If , the adjoint action of on this quotient consists entirely of nilpotent maps. The Engel theorem supplies a nonzero coset with , contradicting self-normalization. Therefore the zero generalized weight space of a Cartan subalgebra is exactly .
Finally, when . Choose with and put . On , a power vanishes. On , is invertible. For and , write ; invariance givesIf is orthogonal to , it is now orthogonal to every summand of , so nondegeneracy of implies . The restriction is nondegenerate. This establishes the nondegeneracy of the Killing form on a Cartan subalgebra for every Cartan subalgebra, without requiring a chosen root basis.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 iii Solution Created 2026-10-03 Updated 2026-10-14
Choose real monic orthogonal polynomials of degree , , for on , and letExtend each by zero to negative . The resulting functions form an orthonormal set in . Define the orthogonal polynomial projection kernelThe formula on the right is for nonnegative arguments; the kernel is zero when either argument is negative. With , the kernel evaluation matrix is . By the determinant multiplication identity and the preceding monic basis change,Thus initially .
Use the symmetric labelled joint probability density on the full orthant. Expanding the two copies of into permutations and integrating all variables, orthonormality makes a term vanish unless the two permutations agree. Each of the surviving terms integrates to . HenceIf the eigenvalues are instead listed in increasing order on a single ordered chamber, that chamber's density is times this symmetric density. We keep the full-orthant convention throughout.
An explicit choice is in terms of the Generalized Laguerre polynomials. To verify the normalization independently, their Rodrigues' formula givesIntegrating by parts times proves orthogonality to every lower-degree polynomial. The boundary terms vanish at zero and infinity for . Taking the other factor to be and using gives , where is the Gamma function. The Laguerre projection kernel is thereforefor .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 1 v Solution Created 2026-10-03 Updated 2026-10-07
For , the correlation function of a point process associated with the eigenvalues isThe factorial factor counts ordered selections of distinct eigenvalues, so this is a factorial moment density, rather than the ordinary probability density of particular labels. Equivalently, for a nonnegative measurable test function ,Repeated projection kernel determinant integration, with , gives a factor on integrating an -by- kernel determinant down to size . Together with the normalizing in , the factors cancel:In particular and . Set and for . The eigenvalue configuration is thus a determinantal point process with a rank- finite-rank projection kernel.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 iii Solution Created 2026-10-03 Updated 2026-10-07
The Hoffman–Wielandt inequality says that for normal matrices with eigenvalues , there is a permutation such thatwhere is the Frobenius norm and denotes the conjugate transpose. For Hermitian matrices, the increasingly ordered real eigenvalues may be paired directly: this ordering minimizes the sum of squared distances over all permutations, by removing crossed pairs. In particular, for the real symmetric matrices in this question,The square on the right is justified by symmetry. For arbitrary matrices, the appropriate expression is the conjugate-transpose product, not the ordinary square.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 ii Solution Created 2026-10-03 Updated 2026-10-07
The empirical spectral measures of the two real symmetric matrices arewhere is the Dirac measure at . Thus . Pair the eigenvalues in the specified increasing order and apply the triangle inequality followed by Lipschitz continuity with bound :This deterministic estimate uses only the Lipschitz bound; no entry independence or distributional hypothesis is needed here.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 2 iv Solution Created 2026-10-03 Updated 2026-10-07
Put . Apply the Cauchy-Schwarz inequality to the average of the nonnegative eigenvalue differences, and then the Hoffman–Wielandt inequality:Taking nonnegative square roots gives the spectral Lipschitz bound from Frobenius distanceThe factor is essential: the empirical spectral measure has total mass , not .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 31 3 iv Solution Created 2026-10-03 Updated 2026-10-07
Put . For a real eigenvalue ,The spectral theorem for real symmetric matrices therefore gives and , since is a sum of with nonnegative coefficients given by squared eigenvector coordinates of . This is the positive imaginary part of a Stieltjes matrix resolvent. HenceApply the triangle inequality to the identity above, and add and subtract the minor trace:The allowed principal minor resolvent trace bound, with the printed normalization, bounds the second average by . Thus the explicit conclusion isIn particular, the final term is with a constant independent of . The upper-half-plane restriction gives the displayed positive denominators; in the lower half-plane the analogous bound uses .
The chosen centering also has a probabilistic meaning. The column vector is independent of the minor, has mean zero and coordinate variance , so its conditional expectation satisfiesThis explains why the bound isolates fluctuations of a quadratic form around the minor trace. Mean centering alone is not a concentration estimate; no unrequested limiting assertion is being assumed.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 3 4 Solution Created 2026-10-03 Updated 2026-10-07
For a partition with at most parts, let be the Schur module constructed in Question 3, equivalently the image of a Young symmetrizer on . For a weakly decreasing integer tuple , put and . Define the rational Schur module byHere is the one-dimensional representation . This is rational, and it is irreducible under the permitted irreducibility assumption; for nonnegative it is the original polynomial Schur module. Larger shifts give the same module, as will also follow from the character formula below.
Write and . For a permutation of the given cycle type, the trace of a permuted tensor power isIn a tensor basis, the trace contracts the matrix entries of around each cycle of ; a cycle of length contributes . This proof applies to nondiagonalizable endomorphisms as well. The eigenvalues give .
The Schur–Weyl duality decomposition, on which and act on the two respective factors, gives the same trace asFor a partition, the character extends polynomially to all endomorphisms because the tensor-power action does. This extension is not asserted for determinant-twisted modules at singular matrices.
We now derive the alternant character formula for the general linear group. Put andUse the permitted symmetric-group character result, the Frobenius alternant character formula:It concerns characters of , rather than assuming the character formula we seek for the general linear group. Substitute the proved trace identity and setThen for every conjugacy class. Independence of the irreducible symmetric-group characters forces .
Each character on diagonal matrices is a symmetric homogeneous polynomial of degree , since conjugation by permutation matrices permutes its arguments. Thus is alternating of degree . Every alternating polynomial of this degree has a unique expansion in alternants : a monomial with repeated exponents has zero coefficient, while each strictly decreasing nonnegative exponent vector is uniquely for a partition of with at most parts. Its coefficient at is the coefficient of that alternant. The identities for therefore give . We have derived the Weyl character formulaFor partitions the quotient is the Schur polynomial, with removable apparent singularities when eigenvalues coincide. For arbitrary dominant integer tuples, multiply the formula for by ; this shifts every numerator exponent by and yields the same boxed formula. The variables must then be nonzero. The expression also shows independence of the shift used to define the determinant twist. Equality of characters identifies these irreducible modules: the group-algebra image on a direct sum of two irreducibles is finite-dimensional and semisimple, and its span of group operators detects the traces on every simple block.
Finally, the character of a dual representation evaluates the original character at . Reverse the numerator's columns after making this substitution. The exponents become . Factoring converts these into for . The denominator undergoes the identical column reversal and factor, so both signs and factors cancel. Hence , andThis tuple is again weakly decreasing, so it is precisely the required dominant label.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 43 2 Solution Created 2026-10-03 Updated 2026-10-07
A futures contract fixes a maturity and underlying quantity, but its quoted delivery price is marked to market: gains and losses from quote changes are settled through the margin account, typically daily. A newly settled position has zero contract value; the quoted futures price is not an upfront purchase price for that position. At maturity the quote equals the spot price. In the continuous-settlement idealization, discounted futures gains must be local martingales under the money-market risk-neutral measure. Thus the quote has zero pricing-measure drift. Assuming the relevant integrability makes it a true martingale, .
This is a futures pricing formula. In contrast, an unsettled forward contract has delivery quote , where . Stochastic interest rates can make the two quotes differ. Contango means the futures quote is above spot for the maturity considered, while backwardation means it is below spot; futures curves are correspondingly described as rising or falling when comparing maturities.
For the Multivariate Ornstein-Uhlenbeck process, multiplication by the matrix exponential gives , henceFor deterministic , the Gaussian distribution has mean and covarianceEquivalently , . No symmetry or invertibility of is required. This covariance can also be evaluated from a single block matrix exponential: if the upper-right block of is , then . If is random, these assertions hold conditionally on ; the unconditional law need not be Gaussian. A stationary Gaussian law exists when the eigenvalues of have positive real parts, but stability is unnecessary for the finite-time formulas.
For , the conditional mean of is and its conditional covariance is . The Gaussian exponential-moment formula therefore gives the explicit quoteIt tends to as , as required.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 48 1 Solution Created 2026-10-03 Updated 2026-10-07
Set and let . A concrete irreducible spin representation is the symmetric powerStart with copies of the defining SU(2) doublet and restrict their tensor product representation to the completely symmetric subspace. Its orthonormal basis consists of symmetric states with up components and down components, where . There are such states. The total generators are , acting on this subspace, where are the Pauli matrices. This also constructs the trivial representation when .
The spin ladder operators satisfyThe Casimir operator commutes with every generator. On the highest-weight vector , the identity gives its eigenvalue . With phases chosen to make the lowering coefficients positive,The squared norm of the lowered state follows from . The ladder stops exactly at . Every weight is connected to every other by these operators, and has distinct eigenvalues. Hence any invariant subspace contains a weight vector and then the whole ladder: the representation is irreducible.
For , successive lowering has squared normThus the normalized highest-weight lowering formula isAll factorial arguments are nonnegative integers, including for half-integral .
The unitary representation of an isospin rotation isIts matrix in the weight basis is . Insert the completeness relation between two operators to obtainThese verify the group representation and unitarity properties, and the ladder argument gives irreducibility. Here rotations carry their SU(2) lifts: . Integer descends to the ordinary SO(3) group; half-integral is a representation of its double cover, not a single-valued representation of .
For , order the basis as . The lowering and raising coefficients give the spin-one half-turn matrixMultiplication shows . Reduce the matrix exponential using this identity:At it becomesThus its matrix elements are . In the pion phases , , this isospin rotation exchanges the two charged states with positive coefficients and negates the neutral state.
Charge conjugation is linear and unitary here. Similarity preserves commutators, soConsequently the conjugated generators obey the same Lie algebra. The specified signs also give . Since and the neutral state has positive charge conjugation eigenvalue,The signs depend on the chosen charged-state phases, which have been fixed by the ladder convention.
Conjugation by changes to , exactly as charge conjugation does. Their product, the G parity operator, therefore satisfiesThe Schur lemma makes scalar on each irreducible isospin multiplet, hence independent of . On the neutral pion, . Therefore the pion G-parity is