Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 1 2 Solution Created 2026-10-03 Updated 2026-10-07
A linear map is a nilpotent endomorphism if for some positive integer , and a semisimple endomorphism if it is diagonalizable over . Decompose into its generalized eigenspaces , where . Define on to be , and set . Then is diagonalizable, is nilpotent, and both preserve these vector subspaces and commute. ThusFor uniqueness, suppose with semisimple, nilpotent and . Both commute with , so preserve each . On an eigenspace of of eigenvalue inside , the map is and has only the eigenvalue . Since the same subspace lies in , . Hence on , proving and . This is the additive Jordan–Chevalley decomposition.
We need a polynomial consequence of this decomposition. Hermite interpolation supplies a polynomial with , by prescribing for each eigenvalue. For any endomorphism , its semisimple part can likewise be expressed as a polynomial in with zero constant term: if zero is an eigenvalue, its interpolation condition already forces this; if not, add the independent condition .
On , the maps and commute. The first is diagonalizable, with eigenvalues on . The second is nilpotent, sincewhich vanishes for when . Uniqueness therefore proves adjoint compatibility of additive Jordan decomposition: .
Now assume . The condition implies that both and are invariant under , and every polynomial in with zero constant term maps into . Define to be multiplication by on . It commutes with . On , acts by . Polynomial interpolation on the finite set of differences gives with . The preceding paragraph then expresses as a polynomial in with zero constant term. Consequently , so .
The assumed trace orthogonality nilpotence lemma now follows directly. On , and , while the matrix trace of the nilpotent restriction of is zero. HenceEvery summand is nonnegative, so every eigenvalue of is zero. Its Jordan–Chevalley decomposition therefore has , and is nilpotent. Notice that neither nor was required to be a Lie subalgebra.
Past exam of the mathematics course of the University of Cambridge 2014 ia Paper 1 7C Solution Created 2026-09-24 Updated 2026-10-06
Reading the coefficients of the linear map givesUnder the inverse identification, the four standard real basis vectors map respectively to , , and in . Applying and taking real and imaginary parts therefore gives the columnsThus the real matrix isFor verification, write its blocks as , where is the planar rotation matrix. Block elimination gives . Therefore the determinant identity isThis is an instance of the realification determinant identity. The identification is real-linear; it is not an identification of complex vector-space dimensions.
Past exam of the mathematics course of the University of Cambridge 2014 ib Paper 2 1G Solution Created 2026-09-24 Updated 2026-10-06
For a linear map with finite-dimensional, the rank-nullity theorem statesTo prove it, choose a basis of the kernel of a linear map and use basis extension to obtain as a basis of . The vectors span the image of a linear map: applying to a basis expansion kills the first terms. They are also linearly independent. Indeed, if , then , so it is a combination of . Independence of the full basis forces every . Consequently , proving the theorem.
Here the image of a linear map has dimension , since it lies in . ThusEvery possibility occurs: for , map to . This map has rank and kernel dimension .
Past exam of the mathematics course of the University of Cambridge 2014 ib Paper 4 12F Solution Created 2026-09-24 Updated 2026-10-14
To prove the sufficient condition, take a rectangle about contained in the open domain. Split the increment along its coordinate directions:The one-variable mean value theorem, applicable because the restrictions are differentiable, represents these two terms asThe zero-increment cases are interpreted directly. Subtract . By continuity of both partial derivatives at , the remainder is at most once the increment is small. This is the required little-oh remainder and proves differentiability.
The converse is false. Set for , and . At each point with , its Fréchet derivative is zero, since the function increment has magnitude at most . It is smooth away from this line. Butis not continuous there. Thus a function can be differentiable everywhere while its partial derivatives are discontinuous.
For , every point with is a smooth point. At the origin, , so is differentiable with zero derivative. At with , the putative first partial derivative would require the limit , which does not exist. Consequently the exact set of differentiability is
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 15 3 Solution Created 2026-10-03 Updated 2026-10-06
A fiber metric on a real vector bundle is a smoothly varying positive-definite inner product on each fiber. Choose a trivializing open cover and a smooth partition of unity subordinate to it. The partition theorem gives nonnegative functions summing to one, a locally finite family of subsets of supports, and ; the usual Hausdorff second-countable smooth manifold hypotheses ensure this theorem applies. Transfer the Euclidean inner product to each local vector bundle trivialization, obtaining , and setEach weighted term extends smoothly by zero outside , and local finiteness makes the sum smooth in every vector bundle trivialization. At each some weight is positive, so for every nonzero . This proves existence of a fiber metric, with no orientability or triviality assumption.
A vector bundle morphism covering the identity is a smooth map that preserves base points and is a linear map on each fiber. Its induced map on the module of smooth sections is , and is -linear. We prove the converse by constructing bundle morphisms from maps of smooth sections.
First the given map is local. If a global section vanishes on a neighborhood of , take a smooth bump function supported there with near . Then , so , and hence . Thus sections agreeing near have images agreeing at .
Choose a local frame on , and a bump function equal to one on a smaller neighborhood of and supported in . Multiplying the frame by that bump and extending by zero gives global smooth sections whose restrictions to are the frame. If , write on . A second bump extends each to a global smooth function agreeing near . By locality and -linearity,Every fiber vector is the value of a global smooth section, by the same bumped-frame construction. Define for any such section. The just-proved vanishing statement makes this well-defined. The maps are linear maps, and locally their matrix columns are the smooth sections in a frame of . Thus is smooth, is a vector bundle morphism, and satisfies . Fiberwise evaluation also proves uniqueness.
Finally apply the fiber metric construction to the tangent bundle. A Riemannian metric defines the musical isomorphismPositive definiteness makes it a fiberwise bijection; its inverse is smooth because inverse metric matrices vary smoothly. Hence and are isomorphic as real smooth vector bundles on every such manifold. The isomorphism depends on the chosen metric and is not canonical.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 23 2 b Solution Created 2026-10-03 Updated 2026-10-06
Use the three left-coset representatives for . If a nonzero weight-four cusp form existed, its coset norm of a modular formwould be a nonzero weight-twelve modular form for the full group: right multiplication permutes its factors. At infinity has order at least one in . The other two factors correspond to the zero modular cusp of cusp width two and each have order at least in . Thus has order at least two there.
The ratio is weight zero, holomorphic on the half-plane because has no zeros there, and holomorphic at the modular cusp with value zero. It descends to a holomorphic function on the compact full modular curve. Such a function is constant, hence zero, contradicting . ThereforeConstant terms at the two modular cusps define a linear map whose kernel is this modular cusp space. It is injective, so the dimension is at most two. The forms and are holomorphic weight-four forms for this group. For the second, the same conjugation used in 1(c) proves transformation, and after the weight factor is , proving holomorphy at zero. Their constant terms are both one but their coefficients are respectively and zero, so they are independent. We obtainThis is the weight-four Eisenstein basis at level two.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 3 1 Solution Created 2026-10-03 Updated 2026-10-06
Write a finite quiver as , with vertex and arrow sets and source/target maps. A representation of a quiver assigns a vector space to each vertex and a linear map to each arrow. A quiver representation morphism is a family satisfying .
The path algebra has every directed path, including each length-zero path , as a basis. Multiplication is composition when endpoints match, and zero otherwise; in , the path is traversed first. The orthogonal idempotents satisfy .
The path-algebra module equivalence is explicit. From a representation, form , let project onto , and let each path act by the composite of its arrow maps. Conversely, an -module gives and . An -module homomorphism restricts to the required vertex maps, and a compatible family extends by direct sum. These constructions are mutually inverse up to their evident natural identifications.
is finite-dimensional exactly when is finite and has no oriented cycle. For a finite acyclic quiver, paths have length at most . An oriented cycle has arbitrarily many distinct powers, giving infinitely many basis paths. If arbitrary infinite quivers are allowed, finiteness of both vertices and arrows is also necessary; the unital module correspondence above uses finite .
Choose only the orientation . The interval representations of an equioriented three-vertex quiver have at vertices , zero elsewhere, and identity arrows within that interval. The complete list isHere is an elementary proof, without the Gabriel theorem. For , set . Choose complementing in , complementing in , and complementing in . Then , and is injective on . Lift bases of to a complement of in , and extend the bases of to . These bases split into precisely the six kinds of interval block. Every block has endomorphism ring , hence is indecomposable, and their different supports make them pairwise nonisomorphic. The same basis argument handles arbitrary vertex dimensions; each indecomposable block itself is finite-dimensional.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 12 5 Solution Created 2026-10-03 Updated 2026-10-06
Apply the polynomial method in combinatorics to the finite-field Kakeya set . We will actually obtain the stronger estimateLet be the vector space over the prime field of multivariate polynomials in variables of total degree of a polynomial at most . By the dimension of a bounded-total-degree polynomial space, its monomial basis consists of with and . Adding a slack exponent gives nonnegative exponents summing to ; the stars and bars count shows thatIf , the evaluation linear map has a nonzero element in its kernel of a linear map. Thus there is a nonzero polynomial of total degree of a polynomial vanishing at every point of . Its degree cannot be zero, since contains a line and is nonempty. Write for its nonzero top homogeneous polynomial part.
For every nonzero , the directional hypothesis supplies an affine line in a vector spaceDirections are one-dimensional vector subspaces; rescaling a representative does not change this line. The univariate polynomial has degree at most and vanishes for all values of . The root bound for a polynomial makes it the zero polynomial. Its coefficient of is exactly , so for every nonzero . Because , too.
To finish, we prove the relevant polynomial nonvanishing below the field size. A polynomial over of degree at most in each variable cannot vanish on all of unless it is zero. Induct on . The one-variable case is the root bound for a polynomial. For more variables, writeFixing the first coordinates gives a univariate polynomial with roots of a polynomial, so all its coefficients are zero. Hence every vanishes on , and the induction hypothesis makes every zero. Applying this to , whose total degree of a polynomial is less than , contradicts its choice as nonzero.
Therefore . Finally,which proves the requested lower bound. The crucial observation in the finite-field Kakeya polynomial bound is that complete lines force the highest homogeneous polynomial part to vanish in every direction.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 2 1 Solution Created 2026-10-03 Updated 2026-10-07
A nilpotent endomorphism satisfies for some positive integer . A nilpotent Lie algebra has a terminating lower central series of a Lie algebra: with and , one has for some . These are different conditions: the first concerns a particular linear map, whereas the second concerns repeated Lie brackets.
The representation form of Engel theorem says that if a finite-dimensional Lie subalgebra consists entirely of nilpotent endomorphisms, with , then contains a nonzero vector annihilated by every element of . Consequently there is a basis in which every element of is strictly upper triangular. No assumption on the characteristic of a field or algebraic closure is required.
We prove the common-vector assertion by induction on , simultaneously for every nonzero finite-dimensional representation space. The zero algebra is immediate. First, nilpotence of commutation by a nilpotent endomorphism follows fromIf , the right-hand side vanishes for , in every characteristic of a field. For any proper Lie subalgebra , its Adjoint representation on therefore consists of nilpotent endomorphisms. Its image has dimension at most , so the inductive assertion gives a nonzero class annihilated by . Equivalently and . Thus the Engel normalizer lemma gives .
Choose a maximal proper Lie subalgebra . Its normalizer of a Lie subalgebra must be all of , so is an ideal of a Lie algebra. Moreover has dimension one: otherwise a one-dimensional Lie subalgebra of this quotient would have a proper inverse image strictly between and . By induction the space is nonzero. It is invariant under , since . Write . The restriction of the nilpotent endomorphism to has a nonzero kernel, and any vector in that kernel is annihilated by all of . This completes the induction. Apply the assertion repeatedly to to obtain a complete invariant flag with . A basis adapted to that flag makes every matrix strictly upper triangular.
A nilpotent abstract Lie algebra need not act by nilpotent matrices. For , the scalar algebra is an abelian Lie algebra, hence a nilpotent Lie algebra, but . No change of basis makes strictly upper triangular. The failed implication is precisely the distinction described in nilpotent Lie algebras need not act nilpotently.
If is a nilpotent Lie algebra, then , so every is a nilpotent endomorphism. Conversely, apply Engel theorem to acting on . Its invariant flag is lowered by every Adjoint representation matrix, so every product of such matrices vanishes. Since is spanned by expressions , the lower central series of a Lie algebra terminates. ThereforeFinally suppose is an algebraically closed field. If some is not a nilpotent endomorphism, it has a nonzero eigenvalue and an eigenvector , giving . The vectors are linearly independent and span a nonabelian two-dimensional Lie subalgebra. Conversely, a Lie subalgebra of a nilpotent Lie algebra is nilpotent because its lower central series of a Lie algebra lies termwise in the ambient series. A nonabelian two-dimensional Lie algebra has a basis with : choose spanning the nonzero derived algebra and rescale a complementary vector. Its Adjoint representation has the nonzero eigenvalue , so it is not nilpotent. This proves the two-dimensional subalgebra criterion for Lie algebra nilpotence:
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 3 1 a Solution Created 2026-10-03 Updated 2026-10-06
A representation of a quiver assigns a -vector space to each vertex and a linear map to each arrow . Here and are its source and target. A quiver representation morphism is a family of linear maps such that every arrow square commutes:Composition and identities are defined vertex by vertex. A quiver representation morphism is an isomorphism precisely when every is invertible.
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 2 19G a Solution Created 2026-09-24 Updated 2026-10-06
A linear map between normed spaces is a bounded linear operator if for one finite and every . This implies , hence continuity. Conversely, continuity at zero supplies such that implies . Apply this to to obtain for nonzero . Thus boundedness and continuity are equivalent for linear maps.
The operator norm is , equivalently . The bounded operators form a vector space, since and scalar multiples remain bounded. Taking suprema proves the triangle inequality and absolute homogeneity for the operator norm; forces for every . Thus is a normed space, whether or not are complete.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 10F a Solution Created 2026-09-24 Updated 2026-10-06
Group the matrix entries by columns. Each column of is times the corresponding column of . In the column-ordered basis of matrix units, the linear map consequently has a block diagonal matrix with copies of . The determinant of a block diagonal matrix is the product of its block determinants, givingThis argument does not require to be an invertible matrix.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 10F b Solution Created 2026-09-24 Updated 2026-10-06
Right multiplication by acts separately on the rows. After transposing each row its matrix is , so its determinant is . Composing this linear map with left multiplication and using part (a) givesHere the determinant is taken on the -dimensional complex vector space of matrices.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 10F c Solution Created 2026-09-24 Updated 2026-10-06
If is a Hermitian matrix, then , so preserves . Addition and multiplication by real scalars commute with this operation, making a real linear map.
A real basis of consists of and, for , and . It has elements and is also a complex basis of all matrices. Indeed every matrix is uniquely with Hermitian matrices, by takingReal linear independence of the displayed basis therefore implies complex linear independence. Since its images under are Hermitian matrices, the matrix of in this complex basis has exactly the same real entries as the matrix of in the real basis. Their determinants are equal. There is no further squaring when passing to this real subspace:This is the determinant of Hermitian congruence, including the case of singular .
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 12G b Solution Created 2026-09-24 Updated 2026-10-06
For a linear map , define the operator norm byIt is finite. To see this without assuming continuity of , write : the triangle inequality bounds by . Every norm in finite dimensions is equivalent to the Euclidean norm. One proof first uses this same coordinate bound to establish continuity of the norm on the Euclidean unit sphere; compactness then gives a strictly positive minimum there. Thus the coordinate bound above is at most a fixed multiple of .
Absolute homogeneity and the triangle inequality for this operator norm follow from those for and taking suprema. If , then for every , hence , and the converse is immediate. For any , the defining bound givesThis is submultiplicativity of the operator norm.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 3G a Solution Created 2026-09-24 Updated 2026-10-14
Differentiability here is understood in the sense of the Fréchet derivative: there is a linear map such thatThe map is the Fréchet derivative. In finite dimensions a linear map is bounded, so for some . The defining estimate therefore impliesThis is precisely continuity at : differentiability implies continuity.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 2 3G b Solution Created 2026-09-24 Updated 2026-10-14
First suppose each is differentiable at . Write , where and . Define the linear map . Given , choose a common sufficiently small neighbourhood so that for all , with . ThenThis proves differentiability, withConversely, suppose is differentiable with Fréchet derivative . Along the th coordinate direction , the other summands cancel exactly:Thus is differentiable at , with . The equivalence works because each summand varies in only one coordinate; it is stronger than merely having partial derivatives.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 4 12G a Solution Created 2026-09-24 Updated 2026-10-06
Two norms on the same vector space are equivalent norms, or Lipschitz equivalent, if there are constants such that for every . The constants are uniform over the whole space.
Let be any norm on . The triangle inequality and the Cauchy-Schwarz inequality giveThe reverse triangle inequality then gives , so is Euclidean-continuous; this continuity was derived, rather than assumed. On the compact Euclidean unit sphere, attains a strictly positive minimum , because it vanishes only at zero. Homogeneity yieldsFinally a linear map satisfies , again by Cauchy-Schwarz inequality. The equivalence just proved transfers this bound to any norms on the source and target. Hence every such linear map is continuous.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 4 12G c Solution Created 2026-09-24 Updated 2026-10-06
First , since . Any finite linear dependence among and the has the form for a finite index set . At an index outside , its coordinate equals , so . Each remaining coordinate then gives . Therefore the set is linearly independent, and the prescribed values define a unique linear map on its algebraic span.
Take the tailsThey belong to , satisfy , and haveThus while does not approach . The map is not continuous, and part (b) also shows it is unbounded. This is a discontinuous functional detected by vanishing sequence tails, illustrating why the finite-dimensional conclusion in part (a) cannot be extended to arbitrary normed spaces.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 101 2 Solution Created 2026-10-03 Updated 2026-10-06
The Weak Hilbert Nullstellensatz states that if is an algebraically closed field, every maximal ideal of isEquivalently, every proper ideal has a common zero. We prove the more general field statement, the Zariski lemma: a field finitely generated as a -algebra is a finite field extension of .
Write such a field as . Choose a maximal set of algebraically independent elements among these generators and denote the remaining generators by . Each is an algebraic element over , so is a finite field extension. Clearing the denominators in their monic equations, choose a nonzero such that each is an integral element overBecause is a field and , we have . Thus is an integral extension of .
A subring over which a field is integral must itself be a field. Indeed, for , an integral equation for multiplied by expresses as an element of . But if , the ring is not a field: choose an irreducible polynomial which does not divide . There are infinitely many monic irreducible polynomials in , by the usual product-plus-one argument, whereas only finitely many can divide the nonzero . The prime ideal stays proper after inverting , so has no inverse in . Therefore , proving that is a finite field extension, and in particular an algebraic field extension.
Apply the Zariski lemma to the residue field of a maximal ideal. When is an algebraically closed field, this field is itself. The images of then give , proving the Weak Hilbert Nullstellensatz.
For the real Laurent polynomial ring, the same argument applies because it is the finitely generated algebraEvery residue field at a maximal ideal is consequently a finite field extension of , and so is or . Here we use the fundamental theorem of algebra, which makes the algebraic closure of of degree two. The images of must be nonzero since these elements are units. It follows that the answer iswith and defining the same maximal ideal. If both coordinates are real, evaluation has image ; otherwise its image is . Thus every displayed kernel is maximal, and the Zariski lemma shows that this list is exhaustive.
For explicit generating sets of an ideal, there are three cases. For real nonzero ,If and with ,If with and , thenThe last two quotients are ; the nonzero coordinate condition ensures that the Laurent inverses exist in them. There are no further coincidences in the classification: equal kernels induce an -isomorphism between the evaluation image fields. The only -automorphisms of are the identity and complex conjugation, so the two pairs must agree or be conjugate.
To prove the intersection assertion, fix a prime ideal and an element . The integral domain has nonzero image . Its localization of a ring is nonzero and still a finitely generated algebra over , so it has a maximal ideal . By the Zariski lemma, the field is finite over .
The image of in is a subring containing and is a finite-dimensional -vector space. It is an integral domain, hence a field: multiplication by any nonzero element is an injective linear map of a finite-dimensional vector space and therefore surjective. The kernel of is thus a maximal ideal which avoids , since is invertible in . Its inverse image in is a maximal ideal containing but avoiding . As this works for every ,This is the Jacobson ring property for this Laurent polynomial ring.
For a nonzero finitely generated module , its set of associated primes isHere is the annihilator of the element. The Laurent polynomial ring is a Noetherian ring, so the nonempty collection of annihilators of nonzero elements of has a maximal member, say . It is proper because .
If and , then andMaximality forces , hence . Thus is a prime ideal, proving . This argument in fact only needs that is Noetherian, not the finite generation of .
A proper ideal is -primary when its radical of an ideal is andEquivalently, and imply ; equivalently, every zero divisor of is nilpotent. These formulations distinguish the actual primary ideal property from the weaker assertion that there is only one minimal prime ideal.
For the final example, set and . ThenSince is an integral domain, is a prime ideal. Moreover and , so . Consequently is the unique minimal prime ideal over .
Nevertheless , while and no power of belongs to . For the first assertion, reduce modulo : the image of is in , and is not a multiple of because is a nonunit in this integral domain. For the second, , so for every . Thus is not a -primary ideal: a unique minimal prime does not imply primary. In , the nonzero class of is killed by , a zero divisor which is not nilpotent.