Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 101 6 Solution Created 2026-10-03 Updated 2026-10-14
For a finitely generated module over the graded ring , with each of degree one, its Poincare series of a graded module isThis is also its Hilbert series. One usually takes ; allowing an integer grading also permits finitely many negative degrees. Homogeneous generators of degrees give a surjection , where the graded shift is defined by . Consequently every is a finite-dimensional vector space and for all sufficiently negative .
The Hilbert-Serre theorem in the standard grading saysFor a nonnegatively graded , the numerator is in . Equivalently, the only possible pole of this rational expression is at , with order at most .
We prove the Hilbert-Serre theorem by induction on the number of variables. For , and is a finite-dimensional graded module; thus is a Laurent polynomial. Suppose and putThe Hilbert basis theorem makes a Noetherian ring, so is a finitely generated module, as is . Both are graded modules killed by , hence finitely generated over .
The graded exact sequenceidentifies the kernel and cokernel of multiplication by . Taking the alternating sum of the finite-dimensional degree components yieldssoBy induction the right side has denominator , which proves the required denominator . Since has no negative powers when is nonnegatively graded, its Laurent polynomial numerator is an ordinary polynomial in that case.
For , this also implies the usual Hilbert polynomial consequence. Writing and usinggives, for all sufficiently large ,a polynomial in of degree at most . For , the graded pieces are eventually zero.
For the final request, a free resolution of is an exact sequencewith each a free module. In the graded setting we take finite direct sums of shifts and maps preserving degree. The resolution has length at most if for every . The syzygy modules are the successive kernels which record the relations among generators, then relations among those relations, and so on.
Put , the homogeneous maximal ideal with . Choose a homogeneous -basis of and lift it to . These lifts generate by the graded Nakayama lemma: a bounded-below graded module satisfying must be zero, since a nonzero homogeneous element of least degree could not be a sum of variables times elements of lower degrees. Apply this to the quotient by the submodule generated by the chosen lifts. This gives a surjection inducing an isomorphism modulo .
Its kernel is finitely generated because is a Noetherian ring. Repeat the construction for that kernel, then for each subsequent kernel. We obtain a minimal graded free resolution, meaningIndeed, at each stage the free cover induces an isomorphism modulo , so its kernel lies in times its source. The sequence is exact by construction, though it may at first appear infinite.
The Koszul complex on iswith basis vectors given degree one, and differentialThe hat means omission of that factor. Every pair of terms in cancels with opposite signs, so this is a chain complex. The sequence is a regular sequence: after quotienting by the first variables, the next variable is a non-zero-divisor in the remaining polynomial ring.
The Koszul complex is consequently exact in positive degrees and has , so it is a Koszul resolution of of length . For completeness, one proves this by induction: for one variable it is . Appending constructs the mapping cone of multiplication by on the previous chain complex. Its homology is zero in positive degrees because acts injectively on ; its degree-zero homology is the further quotient. Here a mapping cone combines a chain complex with a shifted copy and adds the given multiplication map to the differential, thereby measuring its kernel and cokernel on homology.
The Tor functor is defined as the degree- homology of for a free resolution of . It can equally be computed as the homology of , using the Koszul resolution of . To see the equality, form the double complex . Taking homology first along leaves , since each is a free module; taking homology first along leaves , since each is free. The finite sums along each total degree identify both with the homology of the total complex. This also explains the symmetry used in computing the Tor functor.
Since for , we have for . On the other hand, all differentials of the minimal graded free resolution become zero after tensoring with , soThus for , and the graded Nakayama lemma implies for those . We have proved the required Hilbert syzygy theorem:where some initial may be zero. The argument supplies finitely generated graded free modules, which is stronger than merely giving an ungraded free resolution.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 103 3 iii Solution Created 2026-10-03 Updated 2026-10-06
For , define when their Gelfand–Tsetlin basis lines occur in the same irreducible representation. This is well defined: contains the centre of , whose primitive central idempotents separate the irreducible modules, and part 1(ii) says these central elements are polynomials in the . Consequently the same weight cannot label two different irreducible modules.
For content vectors of standard Young tableaux, an admissible adjacent swap of a standard Young tableau exchanges coordinates whose difference has absolute value greater than . Define as the equivalence relation generated by such swaps within .
Equivalently, after reconstructing the tableaux, means that the two tableaux have the same final Young diagram. Indeed, an admissible swap exchanges consecutive entries in incomparable cells, preserves the diagram and leaves a standard Young tableau. Conversely, tableaux of a fixed shape are linear extensions of a partially ordered set, with the cells ordered by their row and column requirements; any two linear extensions are connected by adjacent swaps of incomparable elements. We explain this connectivity and its spectral consequence in part (v).
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 103 4 c Solution Created 2026-10-03 Updated 2026-10-06
Set , for . These are distinct nonnegative integers with . Using the falling factorial, the matrix entry can be writtenWhen , the falling factorial vanishes, agreeing with the stipulated convention for a negative factorial argument.
The column polynomials are monic of successive descending degrees. Subtracting lower-degree combinations of columns turns them into without changing the determinant. The Vandermonde determinant therefore givesThe positive sign comes from reversing the usual increasing-degree Vandermonde columns at the same time as writing the differences as .
We now match this denominator with the hook-length formula. The hook lengths in row are preciselyTo verify the claim, the first hook in the row has length . As the column index passes from to , its hook length drops by plus the number of lower rows ending at column . The skipped lengths are exactly for those rows: if , then . At the right-hand end, lower rows having the same length as row account for the missing smallest lengths by the same formula. This describes all omitted values, and the remaining count is .
ConsequentlyCombining the two identities with the hook-length formula proves the determinantal dimension formula
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 106 4 Solution Created 2026-10-03 Updated 2026-10-14
The definitions in a unital C-star algebra areThus a Hermitian element of a C-star algebra is self-adjoint, a Unitary element of a C-star algebra has inverse , and a Normal element of a C-star algebra commutes with its adjoint. We derive the needed C-star algebra facts directly from , as required.
First gives , andgives ; applying the same argument to gives equality. Thus the involution is an isometry. For a Unitary element of a C-star algebra ,The general Banach algebra spectrum bound gives for . Such a is nonzero, and the inverse spectral mapping theorem gives , so also . Hence
If , the convergent exponential series and the isometric involution give . These commuting exponentials multiply to , so is unitary for real . By the exponential spectral mapping theorem, if then . Taking gives , soOnly general Banach algebra spectral mapping theorem and the defining C-star identity were used.
Now prove spectral permanence for C-star algebras. Let be the norm-closed C-star subalgebra with the same identity. The algebraic inclusion always gives . For , both spectra lie in . If , choose nonreal . Since , each belongs to . By continuity of inversion in a Banach algebra, these inverses converge in to , which belongs to because is closed. Thus , proving equality for hermitian elements.
For the requested normal , suppose is invertible in . The element is hermitian and invertible in , so the equality just proved places in . ConsequentlySince already has a two-sided inverse in , multiplying by that inverse gives . Hence its inverse belongs to , and
We need one more elementary consequence of the C-star identity: the spectral radius norm equality for normal elements. If , then . If is normal, commutativity of givesEvery power of is a Normal element of a C-star algebra. Induction gives . The general spectral radius formula therefore implies
The continuous functional calculus is the unique unital -homomorphism taking the coordinate function to . For bounded linear operators on a Hilbert space, the adjoint identity gives . ThereforeThis proves the C-star identity for directly; completeness and submultiplicativity come from the operator norm. LetBecause is a normal operator, this is a commutative unital C-star algebra. Every element of is a Normal element of a C-star algebra, so the preceding norm identity says its Gelfand transform is isometric:Here is the compact character space from the general Gelfand representation theorem for commutative Banach algebras.
Each algebra character preserves the involution. Indeed, write with hermitian; and similarly for , so . Therefore the continuous mapis injective: its value determines and hence its value on all the dense polynomials. It is surjective because the general character description of the spectrum gives , and spectral permanence for C-star algebras identifies this with . A continuous function that is a bijection from a compact space to a Hausdorff space is a homeomorphism, so we identify with .
Under this identification, the Gelfand transform sends to and to . Its image is an isometric, and therefore closed, unital self-adjoint subalgebra of . It separates points because it contains . The complex Stone-Weierstrass theorem makes the image dense, hence equal to all of . Inverting the Gelfand transform and including into givesan isometric unital C-star homomorphism with .
To prove uniqueness without assuming automatic continuity of C-star homomorphisms, let be any other such map. Since every is normal, is normal. A unital algebra homomorphism preserves inverses, soUsing the normal-element norm identity yields . Thus is contractive. It agrees with on polynomials in , since both send them to the same polynomials in . These polynomials are dense by the Stone-Weierstrass theorem, so continuity proves . This establishes the continuous functional calculus with no unproved theorem specific to C-star algebras.
A disconnected spectrum gives a nontrivial closed invariant subspace. Write with nonempty and both open and closed in . The indicator function is continuous on , even though no such continuity is needed across the gap outside . Let . The continuous functional calculus givesIts isometry gives and , so . The linear projection has closed range . Its range is nonzero and proper, and proves invariance. Since it also commutes with , the same subspace is reducing. This proves disconnected spectrum gives a reducing subspace.
A disconnected spectrum and its continuous indicator, which produces a nontrivial reducing projection
. Details. The figure can be realized without any eigenvalues: take , where is planar area on the two closed disks, and let multiply by . Its adjoint multiplies by , so it is a normal operator. An eigenvector for would be supported on the area-zero singleton , hence would be zero in . Outside , multiplication by is a bounded inverse to . For , normalized indicator functions of have , excluding a bounded inverse. Thus its spectrum is exactly . The linear projection in the figure multiplies by , and its range consists of functions supported on the left disk.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 109 4 Solution Created 2026-10-03 Updated 2026-10-06
We prove both the general modular intersection bound for a set family and its sharper uniform version, the Frankl-Wilson theorem. Let be prime, let have size , and let be a family of subsets of . Suppose each member's cardinality modulo is outside , whereas every intersection of two distinct members has cardinality modulo in . Then the general modular intersection bound iswith for . If every member has the same size and , the uniform Frankl-Wilson theorem sharpens this toHere , so in particular . Primality matters because the argument takes place over the finite field .
For each , define the polynomialAt the indicator vector of another member , this polynomial is zero if and nonzero if . Replace every positive power of by in its expanded monomials, obtaining a multilinear polynomial of degree at most . This multilinear reduction on the Boolean cube preserves values at every zero-one vector.
The resulting polynomials are linearly independent. Indeed, if , evaluating at leaves ; the nonzero diagonal value forces for every . But multilinear polynomials of degree at most lie in the vector space with basis , whose dimension is . The bound on the dimension of a vector space gives the general modular intersection bound for a set family. This is the polynomial method in combinatorics: the intersection conditions produce an evaluation matrix with nonzero diagonal and zero off-diagonal entries.
To prove the sharper uniform bound, we first establish injectivity of inclusion between adjacent set layers. Over a field with field characteristic zero or greater than , suppose coefficients , indexed by -sets in , satisfyThen all coefficients are zero. For this is immediate. For , fix distinct and subtract the equations for and , where is a -set avoiding . The result isApply mathematical induction with degree on the remaining coordinates; its size condition holds because . This forces for every such . Since all -sets are linked by one-element exchanges, all coefficients equal some . An original equation then gives , and the characteristic assumption gives .
For every with , now form the multilinear polynomialThis is the multilinear reduction of , so it vanishes at every indicator vector of a -set. These are linearly independent: in a nonzero linear relation choose the largest degree of a coefficient-bearing . The degree- terms have coefficients . The inclusion lemma makes these nonzero unless all degree- coefficients vanish, a contradiction. It applies because , , and .
The are also independent jointly with the . Evaluating a relation at the indicator vectors of the family first forces every coefficient of to vanish, since the vanish there; their own independence then kills the remaining coefficients. All these polynomials have degree at most , soSubtracting the lower-degree contribution proves the sharp Frankl-Wilson theorem. For the general bound already gives , so no auxiliary polynomials are needed.
For the even cross-intersection assertion, work instead in the vector space over a finite field and letThe parity assumption is exactly in . By bilinearity, all vectors in are orthogonal to all vectors in , giving . The coordinate dot product is nondegenerate over , so . There is no requirement that be zero; only this dimension formula is used. Each distinct set has a distinct indicator vector, and a dimension- binary vector space has elements. Therefore the even cross-intersection bound isThis is the even cross-intersection bound, including empty families, for which the product is zero.
For odd intersections, append a final coordinate one to every indicator vector:Their dot product is in . Applying the same orthogonal complement over the binary field argument to their spans, now in dimension , gives the required odd cross-intersection bound:Appending the coordinate preserves distinctness of the vectors, so the span-cardinality estimates remain valid. This proves the odd cross-intersection bound directly by reducing the odd condition to an even one in a larger vector space.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 117 1 Solution Created 2026-10-03 Updated 2026-10-14
Use the nonnegative sign convention for the Laplace-Beltrami operator; the ambient Laplacian has the same sign convention. Changing both signs changes the signs of the eigenvalues below. Let be an orthonormal basis of , and let be the unit-speed geodesic with and . The geodesic Hessian formula givesIndeed, the second derivative along a geodesic is , because its covariant acceleration is zero. Taking the trace of the Hessian matrix in this orthonormal basis gives the displayed Laplace-Beltrami operator.
For the sphere, put , where , and write for a smooth ambient function. The Euclidean metric becomes and its volume form is . The coordinate formula for the Laplace-Beltrami operator therefore gives the polar-coordinate Laplacian identityFor , restriction to yieldsThis relation also has a direct geodesic proof. At a point , complete an orthonormal basis of the tangent space by the radial vector . Each great-circle geodesic satisfies . The chain rule gives . Summing and comparing with the ambient trace gives precisely the radial correction above.
Let be the space of homogeneous polynomials of degree on , and let be its subspace of harmonic polynomials. For , homogeneity gives . Substituting in the polar-coordinate Laplacian identity proves that its restriction is a spherical harmonic withRestriction is injective on : if , homogeneity makes zero away from the origin, hence everywhere.
To count and exhaust these eigenfunctions, use the harmonic decomposition of homogeneous polynomialsHere is an algebraic proof rather than an assumption about the spectrum. On polynomials put the Fischer inner product . Multiplication by is adjoint to , so multiplication by is adjoint to . In finite-dimensional inner product spaces, the orthogonal complement of the image of multiplication by is . This proves the decomposition. Multiplication by is injective, sowhere the second term is zero for .
Iterating the harmonic decomposition of homogeneous polynomials and restricting to expresses every polynomial restriction as a finite sum of spherical harmonics. Polynomial restrictions contain constants and separate points of the sphere, so the Stone-Weierstrass theorem makes them uniformly dense in the continuous functions, and hence dense in . The Laplace-Beltrami operator is self-adjoint, and eigenfunctions with different eigenvalues are orthogonal. If a smooth eigenfunction had an eigenvalue not in the list, it would be orthogonal to a dense subspace and would vanish. If it had a listed eigenvalue, subtracting its orthogonal projection onto the corresponding finite-dimensional gives the same contradiction. Thus, for , the spectrum of the Laplacian on a sphere isIn particular, the zero eigenvalue has multiplicity one; on each positive eigenvalue has multiplicity two; on the multiplicity is .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 123 2 b Solution Created 2026-10-03 Updated 2026-10-06
Let and let be a primitive cube root of unity. The splitting field is . The polynomial is an Eisenstein polynomial, so . Meanwhile shows that is quadratic: is not a square because its valuation is odd. A quadratic field cannot lie in the degree-three field. Consequently , and the action on the three roots identifies its Galois group with the symmetric group .
A useful uniformizer isSince , we obtainThus is a root of the Eisenstein polynomial . Its degree is six, so , the extension is totally ramified, and is a uniformizer. With ,This is the Eisenstein sextic presentation of the splitting field of X3 minus 3 over Q3.
Let , , and let , . Then has order three, has order two, and . Their actions on the uniformizer areThe two nonidentity elements of therefore satisfyEach transposition sends to for some , so its displacement has valuation one: is a unit, reducing to modulo the maximal ideal. The uniformizer criterion for lower ramification groups now givesFor real indices, this is on , on , and for . In particular the lower breaks are and .
On the index is two; beyond three it is six. Thus the Herbrand function isThe positive lower break becomes the upper break . ThereforeThe fractional upper break is allowed because the full extension is nonabelian. As a check, the different exponent from ramification groups is . The derivative of the minimal polynomial gives the same result: . This is the case of ramification groups of the splitting field of Xp minus p over the p-adic numbers.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 123 3 a Solution Created 2026-10-03 Updated 2026-10-06
Normalize by and put . Write , with and . In the usual coefficient-exponent convention, the Newton polygon is the lower boundary of the convex hull of the upward vertical rays starting atIt runs from to , with nondecreasing slopes from left to right. Zero coefficients contribute no finite point. Equivalently it is the largest convex piecewise-linear function lying below all these coefficient points.
The Newton polygon root valuation theorem says that a segment of slope and horizontal length accounts for exactly roots of valuation , counted with multiplicity, using the extended valuation on an algebraic closure. The nonzero constant coefficient excludes a zero root.
For a short justification, use the weighted Gauss valuation for . It is multiplicative: after scaling by an element of valuation in a valued extension, the initial nonzero residue polynomials multiply without vanishing. Rational suffice. Factoring a monic polynomial into linear factors gives . This supporting-line function changes derivative at precisely the root valuations; its derivative drops count their multiplicities. Supporting lines to the lower polygon have slope , proving the sign and horizontal-length assertion.
Slope convention for part (b). Reflecting the horizontal axis, by plotting , produces the reflected Newton polygon convention; its slopes are the root valuations themselves. Part (b)'s wording with instead of is correct under this positive-root-valuation convention. The proof below gives both forms explicitly, so the result does not depend on silently changing the sign.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 123 3 b Solution Created 2026-10-03 Updated 2026-10-14
The denominator is ; dividing by removes the zero at . A uniformizer of a degree- totally ramified extension generates the field: its valuation over is , so already has ramification index at least . Hence , its minimal polynomial has degree , and its conjugates are the distinct for .
Factor the minimal polynomial over . The reduced ramification polynomial isEvery displayed root is nonzero and integral, since two uniformizers have a difference of valuation at least one. Thus is monic of degree , has nonzero constant coefficient, and belongs to . For it is the constant polynomial , with no slopes and no ramification jumps.
Here is also a justification of the uniformizer criterion for lower ramification groups in this setting. The powers are a -basis. In an expansion , the nonzero terms have valuations , distinct modulo ; therefore there is no cancellation at the least valuation. If is integral, all those values are nonnegative, which forces . Thus . For , is divisible by , with the remaining factor integral. Consequently every has valuation at least , and equality is attained at .
For a nonidentity automorphism, write . By the defining inequality for the lower ramification numbering,The Newton polygon root valuation theorem therefore proves the ramification breaks from a reduced ramification polygon relation:The segment's horizontal length is exactly . Equivalently, in the reflected Newton polygon convention required for a positive-slope formulation,All occurring root valuations are nonnegative integers. For negative indices, extend ; total ramification means that there are no negative-index jumps, so the reflected formulation remains true for all integers.
The sign distinction is substantive. Using the uniformizer from question 2, whose minimal polynomial is , givesIts coefficient valuations are , because . The usual lower hull has vertices and slopes , of lengths . These correspond exactly to the drops and . With the reflected axis the slopes are , as in the printed positive- wording. If the coefficient-exponent definition is used throughout, the printed assertion needs the minus sign shown above.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 328 3 iv Solution Created 2026-10-03 Updated 2026-10-06
Label the sides by , and parametrize the two vertical sides by , the horizontal sides by . Their outward normal derivatives are , , and . Let denote the prescribed side values. Assume compatible, sufficiently regular boundary traces; the square's corners have zero arclength measure and do not require separate normal values.
For sine collocation of square modified Helmholtz global relations, use Legendre polynomials for the known Dirichlet boundary condition and a Fourier sine series for the unknown normal derivative:The known coefficients are . The sine functions have and form a complete basis in . Choosing them for the normal derivative does not impose zero flux at a corner: the expansion is an representation, and endpoint values are not determined by it. If preserving corner values of the approximated Dirichlet trace is necessary, subtract its endpoint-interpolating line before polynomial approximation, and add that line back. All subsequent known-data integrals can alternatively be evaluated with the exact .
Define the entire function basis transformsAt the quotient is evaluated by its removable limit or by the defining integral. For example, , and polynomial expansion of expresses every in derivatives of . PutFor compactness write and . Substituting these expansions into the first global relation for a linear boundary value problem givesThe signs are fixed by the outward normal vectors, rather than by a choice of traversal direction. The second approximate global relation for a linear boundary value problem replaces by , leaving unchanged:Here records omitted boundary-expansion tails. In a finite spectral method the selected equations are set equal to zero to solve for the unknown real coefficients . For real data the two families obey the same complex conjugation relation as their exact counterparts.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 328 3 v Solution Created 2026-10-03 Updated 2026-10-06
A particularly simple constructive choice uses paired collocation points for a global relation. For , putFour suitable sets, one for each side, areThe braces in each set range over all . For large , compute to avoid cancellation. The corresponding pairs are, respectively,Each pair has the same exponentially growing normal direction and opposite tangential frequencies. Take the phase-weighted difference of the two collocated global relations for a linear boundary value problem. For example, the bottom pair gives the adjoint testThe other three phase-weighted differences giveThus the four spectral sets supply four real sine-tested equations per mode. We retain these equations; requiring every uncombined complex equation as well would instead form an overdetermined finite approximation. For real traces each retained equation is the appropriate real combination of its conjugate pair.
The key advantage is that vanish on the vertical sides, while vanish on the horizontal sides. Orthogonality then eliminates all off-mode unknowns. Define the known right-hand sidesThe retained global relations for a linear boundary value problem areFor example, with , the bottom and top right-hand sides are explicitlyFor completeness the left and right right-hand sides areAll these integrals use known polynomial approximations or the exact Dirichlet boundary condition.
Scale each row by . Every block becomesThere is just one off-diagonal entry in each row. This proves diagonal dominance of paired square global-relation collocation. Therefore the assembled system is strictly diagonally dominant, with row margin . This proof applies to the explicitly paired and scaled collocation system, rather than assuming arbitrary raw spectral rows are diagonally dominant. Each block is a positive-definite matrix and have spectral condition number of a positive-definite matrixFor instance, setting gives the concise answerwith the identical formula for the opposite vertical sides. If the known-data integrals use exact , these are exactly the first sine coefficients of the true normal traces: no discarded unknown mode contributes to a retained row. With a finite Legendre polynomial approximation, the error is solely that of the known-data approximation and the final normal-trace truncation. These square modified Helmholtz Dirichlet-to-Neumann coefficients determine the unknown boundary normal derivative; Green's third identity or the separated-variable construction can then recover the interior solution.

