Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 13 5 Solution Created 2026-10-03 Updated 2026-10-14
Identify with the Jacobian variety using the base point and the translation of Solution 4. A line bundle of degree corresponds to the point for any divisor representation . The Riemann singularity theorem isIn particular, the theta divisor is singular exactly at the degree- line bundles with at least two independent sections. We prove the equality, including the upper bound on multiplicity.
Choose a fixed effective divisor of degree , and a local holomorphic family representing nearby points of . Such a family can be constructed locally from the holomorphic exponential sequence, by varying line-bundle transition functions through exponentials of Čech cohomology representatives. By Serre duality, is dual to , whose degree is , so it vanishes. The Riemann-Roch theorem gives . By cohomology and base change for line bundles on a curve, these spaces form a holomorphic vector bundle of rank . The spaces form another holomorphic vector bundle of rank . Evaluation gives a holomorphic square matrix locally, with exact sequenceConsequently exactly when has a nonzero section, namely on the support of the theta divisor.
At the point , put , the equality being Riemann-Roch theorem. An invertible minor of size persists near this point. Holomorphic row and column operations, or the Schur complement, givewhere is an holomorphic matrix. This is the Schur complement presentation of a theta singularity. Its linear term in a tangent direction is the cup product mapTo see this concretely, vary transition functions of to . A section lifts to precisely when its first-order compatibility equation can be solved; the obstruction is the cocycle . This is . Passing to the kernel and cokernel of gives exactly the derivative of the reduced matrix , proving the assertion without assuming a multiplicity formula.
Before extracting the order of , we verify that is a reduced equation of the theta divisor. Generic points of have by Solution 3. At such a point, both and are one-dimensional. Their nonzero sections have nonzero product . Choose with under Serre duality. The scalar is nonzero, so has a simple zero generically on the irreducible theta divisor. Since its support is exactly that irreducible hypersurface, it defines the reduced divisor. Solution 4 independently proved the same reduced structure for the Riemann theta function. On the smooth ambient Jacobian variety, local equations of the same reduced divisor differ by a nonvanishing holomorphic unit. Hence the orders of the local theta equation and agree everywhere.
Every entry of vanishes at the point, so each term in its determinant has order at least . This proves . To obtain equality, we exhibit an invertible cup-product direction for a line bundle on a curve. Set and , both of dimension . There are distinct points at which evaluation is an isomorphism for : choose them inductively, since a surviving nonzero section has only finitely many zeros. The same holds for . The nonvanishing of each evaluation determinant defines a nonempty open subset of the irreducible variety . Their intersection, also avoiding the diagonals, is therefore nonempty. Choose points in it and local coordinates and compatible trivializations of and at each point.
Let be the connecting homomorphism class of the meromorphic principal parts at these points, with all . The residue form of Serre duality givesIf and are the two invertible evaluation matrices, the matrix of this pairing is , and is invertible. Thus the cup product map is an isomorphism. Along the corresponding analytic parameter line,with nonzero leading coefficient. The order is at most , completing the proof of the Riemann singularity theorem.
This argument also identifies the tangent cone to a theta divisor: its degree- equation is , which is not the zero polynomial. For , the tangent hyperplane is , in agreement with the annihilator description of the derivative of the Abelian sum map. For all first derivatives vanish, proving singularity. In genus the theta divisor is a single smooth point of multiplicity . In genus the effective degree- locus is empty, so there is no singularity statement at a point of it.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 17 3 Solution Created 2026-10-03 Updated 2026-10-14
Interpret the connectivity hypothesis in its usual based sense: is -connected, with for the nontrivial suspension range. Form the suspension as two cones and meeting in . Both cones are contractible. Their relative homotopy sequences give in the relevant degrees, so both cone pairs are -connected.
The homotopy excision theorem says that if two CW pairs meeting in a connected subcomplex are - and -connected, , the map from the first relative pair to the union relative to the second part is an isomorphism in degrees and a surjection in degree . Here , givingas an isomorphism for and a surjection for . Contractibility identifies the domain with and the target with . The comparison under these identifications is the suspension map: a sphere representative is coned in each half and the two cones give its suspended sphere representative. Hence the Freudenthal suspension from two cones provesFor connected CW complexes, reduced and unreduced suspension have the same based homotopy type, so either standard suspension convention gives this result. In the low-dimensional range, pointed sets are used where necessary; the displayed positive-degree homomorphism assertion concerns the usual groups.
For with , cellular approximation makes every sphere map of degree below null-homotopic: it can be homotoped into the point skeleton of the CW structure having cells only in degrees zero and . The Hurewicz theorem therefore identifies its first possible nonzero homotopy group with homology. Its cellular chain complex gives . For , lifting a based loop to the universal cover classifies it by an integer endpoint displacement, so ; the degree-one Hurewicz map is abelianization and is an isomorphism here. ThusAlternatively, after the Hurewicz base case, the suspension isomorphisms above propagate the generator to every higher sphere.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 17 4 Solution Created 2026-10-03 Updated 2026-10-14
Use finitely generated right projective modules throughout. The group K0 of a ring is the Grothendieck group of their direct-sum monoid, with . The group K1 of a ring is , equivalently the abelianization of the stable general linear group. Stabilization is ; is generated by elementary transvections. The stable elementary subgroup is the commutator subgroup: elementary transvections are commutators using a third index, and stable block interchange and elementary row identities make the quotient abelian.
Write for the lower-right ring, printed as in the source. A Milnor square has unital commuting maps, is a pullbackand has at least one of surjective. Interchange the two sides if necessary so that is surjective.
We first establish the patching fact used in the proof. For projective and an isomorphism , setFor free modules denote the result by . The block matrix identityexpresses as elementary matrices. Their entries lift through , and their elementary lifts remain invertible. A change of basis on the first side then trivializes this gluing. Thus , proving that is finitely generated projective. Notice that we lifted elementary matrices, not arbitrary invertible matrices.
For general , choose and . The reductions of and are isomorphic: insert the common reduced and reorder the two complements. Patch them by such an isomorphism. The sum with now patches two free modules of equal size, so is projective by the free case, making each summand projective. The same free change of basis followed by these direct-summand projections shows that extension to recovers . Conversely, write an -projective as the image of an idempotent over a finite free module. Since matrices over the pullback are compatible pairs of matrices, applying the compatible idempotents to the free pullback reconstructs this projective from its two reductions. Compatible module isomorphisms patch as well. This proves Milnor patching of projective modules in the form needed below.
The diagonal maps in the sequence are extension of scalars; the two maps to are differences . Define the connecting map byIt is unchanged by stabilization or elementary multiplication: an elementary factor lifts through and changes a free basis in the gluing. The identity and the preceding elementary factorization show after matching sizes. Thus is an additive homomorphism on .
Exactness at . If the two reduced classes agree, choose stabilized representatives of the same size. Their reductions differ by an elementary matrix over . Lift to an elementary matrix over and adjust without changing its class. Its reduction now equals that of . The compatible pair and its compatible inverse give an invertible matrix over , so the original pair of classes is in the diagonal image. The reverse containment follows from commutativity of the square.
Exactness at . A gluing obtained from a change of basis over either upper ring patches a free module, so the difference-map image is killed by . Conversely, means that becomes free after adding a common projective summand. Add a complement of that summand to obtain an actual isomorphism . Its two local bases express . Therefore , which lies in the image of the difference map. This uses stable equality of projective classes, not cancellation of arbitrary projectives.
Exactness at . Connecting classes reduce to zero on both sides. Conversely, write a class in the kernel as by adding a complement to its negative projective term. Its reductions have the same classes as . Equality in becomes an isomorphism after a finite common free summand, by taking a complement to the auxiliary projective. Use one sufficiently large free summand on both sides. The stabilized is then locally free with gluing , so the original class is .
Exactness at . Write a kernel pair as , using complements and padding to make the free sizes equal. Their reduced positive classes agree. Adding a common finite free summand makes those reductions isomorphic. Patch the resulting projectives, and subtract the matching free -module. Its restrictions are the desired pair. The reverse containment is immediate because both reductions to agree.
These arguments prove the Mayer-Vietoris sequence in algebraic K-theoryNo zero is inserted at either end; this fragment does not assert injectivity at the first term or surjectivity at the last.
For the group ring of the cyclic group, take the cyclotomic Milnor squareThe maps send the cyclic generator to and to ; the lower map sets , and the right map reduces modulo . Since , . To verify the pullback, represent an element by a polynomial of degree at most . If both evaluations vanish, it is a constant multiple of the minimal polynomial of an algebraic element , and evaluation at one forces that constant to be zero. Conversely, represent by of degree below . For a compatible integer , is divisible by ; replacing by yields the pair . The right map is surjective, so this is a Milnor square.
The hinted cyclotomic units are . If with , the geometric sum is their inverse, because . Their residues are , covering every unit of the common field. Gaussian elimination identifies with by determinant. Thus is surjective, and the connecting map vanishes.
The remaining exact sequence injects into , with image . Here , and reduction of a projective over the integral domain has dimension its rank: localize at , where the projective is free, and compare its residue-field dimension with its fraction-field dimension. Projection onto the second factor is therefore a bijection on this kernel. Hence extension along the cyclotomic evaluation givesThe essential step is reduction of cyclotomic units at the ramified prime; surjectivity of a ring map alone would not imply surjectivity on .
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 20 4 ii Solution Created 2026-10-03 Updated 2026-10-14
Choose for each a categorical limit of , with projections . For , the morphisms form a categorical cone over , since the two actions of the product functor commute. Define by the equationsExistence and uniqueness follow from the universal property. The identity morphism of satisfies the equations for , and satisfies those for , so uniqueness gives and . Hence is a functor.
If with projections are other choices, there is a unique isomorphism carrying every projection to the corresponding projection. The same equations show , because their composites with all agree. Thus the choices give a unique natural isomorphism compatible with the chosen categorical limit categorical cones. Without the compatibility condition, uniqueness of an arbitrary natural isomorphism is not asserted.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 20 4 i Solution Created 2026-10-03 Updated 2026-10-14
For , define the functor bywhere is the constant diagram functor; a morphism into acts by precomposition on every categorical cone leg. A categorical limit is a representation of a functor of the formThe image of is the universal categorical cone . By naturality of the representing isomorphism, the image of is . Thus this definition is exactly existence and uniqueness of factorization of every categorical cone through . Conversely that universal property gives the representing natural bijection.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 20 4 iv Solution Created 2026-10-03 Updated 2026-10-14
A precise commutation of iterated categorical limits statement is the following. For small categories and , if every column categorical limit and the resulting -limit exist, thenIf every row categorical limit and the resulting -limit also exist, thenEach isomorphism is the unique one identifying all projections to . Indeed, the preceding part proves that each iterated categorical limit has the universal property of the whole product diagram in a category. Its uniqueness gives the canonical isomorphism. Equivalently, categorical cones with vertex over the product diagram in a category are exactly compatible families, indexed by , of categorical cones over ; regrouping the same compatibility equations cannot change their representing object. In a complete category all the stated existence hypotheses hold for small . The theorem is about categorical limits with categorical limits, and makes no unconditional claim about commuting a categorical limit with a colimit.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 20 9 Solution Created 2026-10-03 Updated 2026-10-14
For the general alternative, let be a functor between locally small categories, with a complete category. The Freyd general adjoint functor theorem says that has a left adjoint if and only if it preserves small categorical limits and satisfies the solution-set condition. Explicitly, for every , there must be a set of morphisms such that every has the form for some and . Equivalently, each comma category has a weakly initial set.
We prove the initial-object lemma for complete categories with a weakly initial set. Let be a locally small category which is complete and has a weakly initial set . Its product in a category is weakly initial: for each , choose a morphism and compose with the projection . The hom-set is a set. Form equalizing every endomorphism of with , by taking the equalizer of the two morphismswhose -coordinates are and . Then for every endomorphism , and is monic. There is a morphism for every , by composing with a weakly initial morphism out of .
To prove uniqueness, let and take their equalizer . Weak initiality of gives . The composite is an endomorphism, so . Cancel the monomorphism to obtain . Thus is both monic and split epic, hence an isomorphism: if , cancellation from gives . Since , it follows that . Therefore is an initial object, proving the lemma fully.
Now assume categorical limit preservation and the solution-set condition. The comma category is locally small. It is complete: for a small diagram in a category , take its underlying categorical limit in . Since preserves this categorical limit, the compatible give a unique . The same universal property shows that is the categorical limit in the comma category. Its weakly initial set and the proved lemma therefore supply an initial object . For , its universal property defines a unique with . Uniqueness proves the identity morphism and composition in a category laws and the naturality of . The same universal property gives the natural bijection , so .
For necessity, an adjunction supplies the singleton weakly initial set at . It also proves that preserves categorical limits: maps correspond to maps , and compatible families of the latter factor uniquely through any categorical limit in . Hence the image categorical cone under has the required universal property. This proves both directions of the general alternative.
For the special alternative, the limit form of the special adjoint functor theorem says: if is complete, locally small and well-powered, with a small cogenerating family , and is locally small, then has a left adjoint exactly when it preserves small categorical limits. A cogenerating set means that unequal parallel morphisms are distinguished by some morphism . We prove the needed solution-set condition, so that the general theorem applies.
Fix . A supporting subobject of is a monomorphism through whose image under the morphism factors. There is at least one, namely . Because is well-powered, choose a set of representatives of all these supporting subobjects. A limit-preserving functor preserves monomorphisms: a map is monic exactly when its diagonal into its self-pullback in a category is an isomorphism, and both the pullback in a category and this isomorphism are preserved. Consequently each factorization of through is unique. Form the intersection of subobjects of the supporting representatives, as a wide pullback in a category over . The unique lifts of are compatible and, since preserves that categorical limit, they give a factorizationThis is a minimal supported subobject. More explicitly, if also supports , then is one of the supporting subobjects of . The intersection therefore factors through , giving with . Monicity of gives ; monicity of then makes invertible.
For any , if , the equalizer of supports , because preserves that equalizer. Minimality makes it invertible, so . We have therefore obtained injective functionsLet be the realized image subset of the fixed set . Use the unique morphism corresponding to each to form the evaluation embedding into cogenerator productsThis morphism is monic: if two morphisms into have identical product composites, every morphism from to every gives identical composites, and the cogenerating property makes the two morphisms equal. There is only a set of possible families of subsets , and hence a set of possible products . Each has only a set of subobjects by well-poweredness, and each chosen subobject has only a set of morphisms by local smallness. Take all these pairs as a weakly initial set. Every original receives a morphism from a pair representing its , through . Thus the set is weakly initial in .
The general theorem now supplies a left adjoint. Necessity again follows from preservation of categorical limits by a right adjoint. This proves the special alternative, including its size argument. Using only the realized subsets avoids assuming that an arbitrary object admits a morphism into every cogenerator. Both adjoint functor theorem alternatives are proved.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 21 1 Solution Created 2026-10-03 Updated 2026-10-14
We use rooted-tree homeomorphic embedding: an injective vertex map preserves ancestors and lowest common ancestors, while an edge may map to a longer path. The root may map below the host root. Write for this relation. The assertion of Kruskal's tree theorem is that finite rooted trees form a well-quasi-ordering: every infinite sequence has with .
We first supply the word lemma needed in the proof. In a well-quasi-order , every sequence has an infinite nondecreasing subsequence. Indeed, if no term had infinitely many later terms above it, successive choices beyond the finite sets of later dominators would give a bad sequence. Some term therefore has infinitely many later dominators; repeat the argument inside that infinite subsequence, which is still well-quasi-ordered, to build a chain.
Now order finite words over by subsequence embedding with coordinatewise increase. Suppose a bad word sequence exists and choose one minimally: at each position use a word of least length allowing a bad continuation of the fixed prefix. No word is empty. Write , removing its last letter. Choose indices with . The sequencewould also be bad. An old word embedding into embeds into , contrary to the original badness; and would extend, using the last-letter comparison, to . But is shorter than , contradicting minimality. This proves Higman lemma, including its empty-word case.
Suppose next that there is a bad sequence of finite rooted trees, and choose a minimal bad sequence by vertex count. Let consist of all proper rooted subtrees hanging below vertices of the . This collection is well-quasi-ordered. Otherwise choose a bad sequence in . Its containing-tree indices can be selected strictly increasing, say is a proper subtree of : a finite initial collection of containing trees has only finitely many proper subtrees, and a bad sequence cannot repeat an isomorphism class. Thenis bad. No earlier can embed into , because and this would contradict the original sequence. The new tail is bad by construction. Since , this contradicts minimality.
List each tree's immediate root subtrees in any chosen order. These are finite words in the well-quasi-order , so the word lemma gives for which the child word of embeds into that of . Send the root of to the root of , and use the chosen embeddings inside the selected, distinct target branches. The connecting paths from the target root to the images of the source children have disjoint interiors; lowest common ancestors in different branches are preserved. This constructs , the final contradiction. Thus finite rooted trees are well-quasi-ordered by homeomorphic embedding. If labels lie in an arbitrary well-quasi-order, the same proof uses label-monotone embeddings; compare root labels and child words in their product well-quasi-order. The product property follows by taking a nondecreasing subsequence in the first coordinate and a good pair in the second.
For Friedman's finite form of Kruskal's theorem, fix . Consider all finite bad prefixes satisfying , up to rooted-tree isomorphism. They form a prefix tree. At each node there are finitely many possible next trees, because there are only finitely many rooted-tree isomorphism types on at most vertices. If prefixes of arbitrary length existed, the König infinity lemma would give an infinite branch, hence an infinite bad sequence, contrary to what we proved. Its height is therefore bounded. ConsequentlyThe same finite-prefix argument works with a fixed finite label alphabet, and more generally with any prescribed size bound having only finitely many possibilities at each position. These are finite existence statements; no numerical estimate on is needed for the conclusion.