Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 19F Solution Created 2026-09-24 Updated 2026-10-14
The circle group is under multiplication. For continuous finite-dimensional complex representations, its irreducibles are the one-dimensional charactersA group representation is a continuous homomorphism to the invertible linear maps; it is irreducible when it has no proper nonzero invariant subspace. Compactness permits an invariant Hermitian inner product by averaging. Since the resulting unitary operators commute for , simultaneous diagonalization reduces an irreducible to a character, and the continuous characters of the circle have the stated integer winding number.
The group consists of unitary two-by-two complex matrices of determinant one. Each has the unique formidentifying it homeomorphically with the unit 3-sphere in . This is the Spin group . A unitary matrix is conjugate to , and its conjugacy class is determined by , or equivalently its trace .
The irreducible representations of SU2 are for integers , with dimension . The symmetric power can be realized as homogeneous degree- polynomials in two variables, with the induced linear action. On the diagonal torus its eigenvalues are for , so its character, the trace of the representing operator, isAt the endpoints use the continuous values and . The highest-weight classification says this list is complete.
For the final action, multiplication of block matrices gives , so conjugation is a linear group representation. Decompose the underlying three-dimensional space as . Its endomorphism space isThe two off-diagonal blocks are each , since the invariant alternating form identifies with . The scalar part of is and its traceless part is : the same alternating form identifies traceless endomorphisms with symmetric tensors of degree two. The lower scalar block is a second . ThusThe dimensions add to , and its character is .
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 20G Solution Created 2026-09-24 Updated 2026-10-14
A rational root of the monic cubic would be one of , and substitution excludes all four. A reducible cubic over would have a rational root, so the polynomial is irreducible andIts polynomial discriminant is . The integer 239 is prime: it has no prime divisor among , the primes not exceeding its square root.
The discriminant-index formula for an integral lattice for an integral primitive element isBoth discriminants are integers, and the left side is . Its squarefreeness forces the positive index to be one. Since is an algebraic integer by its monic equation,
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 23G iii Solution Created 2026-09-24 Updated 2026-10-14
A rational function with no poles away from is regular on the smooth affine curve. Its ring of regular functions is the coordinate ringso it has a unique expression with polynomials . This regular-function assertion uses smoothness, hence normality, of the affine curve, not Riemann-Roch theorem.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 2F Solution Created 2026-09-24 Updated 2026-10-14
Here is a direct Chebyshev alternation theorem argument proving optimality, without assuming the theorem. At the five ordered pointsthe error takes the alternating values . If a polynomial of degree at most three had strictly smaller uniform error, then would have alternating strictly positive and strictly negative values at these points. The intermediate value theorem would give a distinct root in each of the four intervening intervals. A nonzero polynomial of degree at most three cannot have four distinct roots. This contradiction proves the required minimax inequality.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 39A a Solution Created 2026-09-24 Updated 2026-10-14
For an explicit Runge-Kutta method, write its strictly lower-triangular stage matrix as , weight vector as , and . Applied to the scalar test equation, its stage vector satisfiesSince , inversion is a finite Neumann series. Putting givesThis proves degree at most . The printed statement of degree exactly needs a nondegeneracy assumption: a two-stage explicit scheme with is simply Euler's method with an unused second stage, and has polynomial of degree one.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 39A b Solution Created 2026-09-24 Updated 2026-10-14
Order applied to this particular differential equation forces the local stability polynomial to agree with the exact exponential through degree :As its degree is at most , the nonzero coefficient cannot be present for . ThereforeThe implication is a necessary stability-polynomial condition; it does not assert that every such polynomial automatically gives the full nonlinear order conditions.
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 4 39A c Solution Created 2026-09-24 Updated 2026-10-14
An A-stable method must satisfy for every with nonpositive real part. A consistent explicit Runge-Kutta method has , so its stability polynomial is nonconstant. Along the negative real axis the leading term of any nonconstant polynomial has magnitude tending to infinity. HenceThe positive order assumption in the question supplies the required consistency.
Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 2 1A a Solution Created 2026-09-24 Updated 2026-10-14
Substitution of into the linear recurrence relation gives . Since , division by proves the sequence is a solution exactly when .
For a nonzero triple root of a polynomial , the repeated characteristic root of a linear recurrence rule gives the three independent solutions . One way to see the polynomial factors is to write : the recurrence becomes the third forward difference operator applied to equal to zero, so is a quadratic polynomial. ThusThese three constants give arbitrary initial values , hence the full third-order solution. If , the recurrence instead reduces to : the first three values are arbitrary and every subsequent value is zero. The nonzero-root formula must not be used to discard those initial values.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 1 2F ii Solution Created 2026-09-24 Updated 2026-10-14
For each integer , put . Every derivative is an entire function and cannot be identically zero: otherwise repeated integration would make a polynomial. By the identity theorem for holomorphic functions, its zero set has empty interior, and continuity makes a closed set. Thus is nowhere dense.
The complex plane with its usual metric is a complete metric space, so the Baire category theorem gives . The Taylor series there has coefficients
Set using part (a). At every node,If , the error vanishes. Otherwise any degree-at-most- polynomial with strictly smaller error would make have alternating nonzero signs at the increasingly ordered nodes (reversed globally if ). It would then have at least distinct roots by the intermediate value theorem, impossible. Hence
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 3 12F i Solution Created 2026-09-24 Updated 2026-10-14
Let . If , minimality is immediate. Otherwise suppose a polynomial of degree at most has strictly smaller error. At each alternation point,Thus changes sign between every pair of consecutive . By the intermediate value theorem it has at least distinct roots of a polynomial, contradicting its degree bound. ThereforeThis is the sufficiency direction of the Chebyshev alternation theorem.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 3 1I i Solution Created 2026-09-24 Updated 2026-10-14
Lagrange theorem for polynomial congruences says that a nonzero polynomial of degree over a field has at most distinct roots of a polynomial. It follows by repeatedly factoring out at a root. Over the finite field , the only solutions of are and : these are distinct because is odd, and the root bound excludes any others.
Every nonzero element has a unique multiplicative inverse. Pair each element of with its inverse. All pairs of distinct elements contribute to the product; the only unpaired elements are and . Thus Wilson theorem follows:If Lagrange's theorem is formulated for finite groups, it states that the order of a subgroup divides the order of the group; in particular every element of has order dividing . The inverse-pairing proof above establishes the required congruence directly.
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 3 2F ii Solution Created 2026-09-24 Updated 2026-10-14
Yes. Take exterior poles . By part (i), choose a polynomial withFor any fixed , , and therefore . The triangle inequality provesThis is pointwise convergence. It is not uniform convergence on : every polynomial is bounded on the closed diamond, whereas is unbounded as along .
Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 3 2F i Solution Created 2026-09-24 Updated 2026-10-14
Let . Choose a unit complex number normal to a supporting side of this convex set, withSuch a choice exists explicitly: take , where are the signs of the real and imaginary parts of ; then and the strict inequality is exactly the hypothesis. Set . Since on ,For sufficiently large , the former is strictly smaller than the latter uniformly on . Consequently .
The geometric series now supplies actual approximating polynomials:Choose so the right-hand side is below . This proves the required uniform approximation without assuming a general approximation theorem.
Past exam of the mathematics course of the University of Cambridge 2012 ia Paper 4 7D iii Solution Created 2026-09-24 Updated 2026-10-07
For , the derivative is positive everywhere, so the mean value theorem makes strictly increasing. Since a polynomial is a continuous function, the intermediate value theorem and the values , locate its unique real root in . By the rational root theorem, a rational root of a monic integer polynomial must be an integer. There is no integer in , so the unique real root is an irrational number. The denominator part of that theorem also follows directly: if in lowest terms were a root, would force , hence .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 1 2 Solution Created 2026-10-03 Updated 2026-10-07
Use the derived series of a Lie algebraA solvable Lie algebra has for some . For a two-dimensional algebra with basis , alternating bilinearity shows that is contained in the line spanned by . A one-dimensional Lie algebra is abelian, so . Every two-dimensional complex Lie algebra is solvable, with derived length at most two. This dimension argument actually works over any field with the alternating definition of a Lie bracket.
There is a genuine qualification in the last request: the assertion about all Irreducible Lie algebra representations is true for finite-dimensional representations. Without that restriction, the infinite-dimensional simple module for the two-dimensional affine Lie algebra is a counterexample. Take , with , and let it act on byThen , so this is a Lie algebra representation. Any nonzero submodule is stable under multiplication by , hence is an ideal . Stability under implies . The two polynomials have the same degree; their leading coefficients also agree, so . In characteristic zero this forces to be constant. Thus is infinite-dimensional and irreducible, while is solvable. The literal unrestricted assertion is false.
Here is a proof of the intended finite-dimensional assertion, including the essential Lie theorem argument. We prove that a nonzero finite-dimensional representation of a complex solvable algebra has a common eigenvector, by induction on . If , any nonzero vector works. Otherwise ; choose a hyperplane containing . It is a solvable ideal, and . Induction gives and with for all . Write and suppress on elements of .
Let and let be the first index for which lies in the span of . The space is -invariant. Repeatedly using and proves inductively thatThus is -invariant, and every has constant diagonal in this basis. The trace of a commutator is zero, soSince we work over , for all . Therefore the nonzero simultaneous eigenspaceis -invariant: . A complex linear operator on a nonzero finite-dimensional space has an eigenvector. An eigenvector of is consequently a common eigenvector for .
Its span is a one-dimensional submodule. If is irreducible, that span must be all of . Hence every finite-dimensional irreducible representation of a finite-dimensional complex solvable Lie algebra has dimension one. Conversely a one-dimensional representation is given by a linear functional on , because every commutator acts by zero. Passing repeatedly to quotients also gives the simultaneous triangularization of a Lie algebra representation. Neither the eigenvector step nor the trace argument extends to the infinite-dimensional counterexample above.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 13 1 iii Solution Created 2026-10-03 Updated 2026-10-07
Take the three-dimensional affine quadric coneThe polynomial is an irreducible polynomial: as a polynomial in over , it is primitive because and are coprime elements of a unique factorization domain, and it is a linear irreducible polynomial over . Gauss lemma for polynomials then applies. Thus is an irreducible variety that is an affine variety, of algebraic dimension by the principal hypersurface dimension lemma in affine space .
The coordinate rings of and are respectively and . Both are affine planes, hence irreducible closed subsets of algebraic dimension . Their intersection is precisely the origin. ThereforeThe origin is the singular point of an algebraic variety of this three-dimensional affine quadric cone. The example shows why a smoothness of an algebraic variety hypothesis matters in intersection dimension estimates.