Past exam of the mathematics course of the University of Cambridge 2006 ii Paper 2 25J c Solution Created 2026-09-24 Updated 2026-10-14
Convergence to a finite real limit is equivalent to the Cauchy property. The convergence set is thereforeEach set in braces is measurable, and sigma-algebras are closed under all the displayed countable operations. Completeness of ensures that the Cauchy property gives a finite limit, proving the claim.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 26 2 Solution Created 2026-10-03 Updated 2026-10-14
Theorems matter at least as much as definitions: they show when a categorical description captures actual mathematical structure. Definitions in category theory are exceptionally economical, but economy alone does not explain their applications.
An adjunction compresses a universal mapping property into natural hom-set bijections. The free-group adjunction, for example, records that assigning images to generators extends uniquely to a homomorphism. That is a useful definition, but proving that a free group exists and satisfies this property still requires mathematics. The definition organizes that proof rather than replaces it.
The Yoneda lemma offers a sharper example. A representable functor is easy to define; the theorem identifying natural transformations out of it with elements of another functor gives the definition its computational force. The representation of a set-valued functor as a colimit of representables is then a substantive consequence, and the theorem that filtered colimits commute with finite limits turns it into a criterion for finite-limit preservation. None of these conclusions follows merely from choosing attractive terminology.
Likewise a monad packages operations and their compatibility, while the Eilenberg-Moore category defines the corresponding algebras. The Beck monadicity theorem answers a different question: whether a given category is really recovered by that algebraic description. Applying it to compact Hausdorff spaces needs a topological argument about closed quotient relations. The definitions would not by themselves predict or justify the result.
Finally, abelian categories put kernels in a category, cokernels in a category and exactness into a setting where homological arguments can be reused. Some consequences, such as image factorization, become short because strong structural content has deliberately been included in the definition. Yet left derived functors, long exact sequences and the detection of projective objects supply information about obstructions to exactness which the terminology alone cannot provide.
Definitions and theorems therefore play complementary roles. A good definition states what should be invariant across examples; a theorem proves which constructions preserve it, which examples satisfy it, and what can be deduced from it. Category theory makes that partnership unusually visible, rather than making proofs less important.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 26 3 iii Solution Created 2026-10-03 Updated 2026-10-14
Every covariant representable functor preserves categorical limits: arrows from its representing object into a limiting object are exactly compatible cones of arrows into the diagram. Apply the density formula proved in the root solution. For any finite diagram ,The middle isomorphism uses exactly the permitted theorem that filtered colimits commute with finite limits in sets; it applies because is filtered. All maps are the natural comparison maps, so preserves finite limits, including the terminal object. This proves and completes the equivalence.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 26 3 ii Solution Created 2026-10-03 Updated 2026-10-14
Take . By assumption has finite limits, so has finite colimits. A filtered category is nonempty, admits a cocone over every pair of objects, and admits a coequalizing arrow for every parallel pair. The initial object of gives nonemptiness, its binary coproducts give the required two-object cocones, and its coequalizers equalize parallel arrows. Consequently . These statements also handle the otherwise possible empty category of elements.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 26 3 i Solution Created 2026-10-03 Updated 2026-10-14
Assume preserves finite limits. Fix any set and a finite diagram of objects in . Let be the categorical limit of its underlying diagram in , with projections . Preservation gives . The maps form a compatible cone, so determine a unique with .
The object is the categorical limit in the comma category. Indeed a cone from gives a unique underlying , and the identities for all force by the categorical limit's uniqueness. For the empty diagram, is terminal and is a one-element set, giving the unique map from . Thus has all finite limits. This proves .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 24 1 Solution Created 2026-10-03 Updated 2026-10-14
Use the elementary, or weak, topos axioms: finite limits and a power object for every object , naturally representing . No arbitrary products or coproducts are assumed. In particular is the subobject classifier. Inverse image of the membership relation defines for .
Interchanging the factors in a relation gives natural bijectionsThus the contravariant power-object functor has left adjoint . Its adjunction unit sends a generalized element to the predicate on given by membership of .
This unit is monic. If have the same image under , membership of and agrees in every -parameterized subobject of . Apply this to the graph of in : membership of is true, so membership of is true, which means . This argument uses parameterized relations, not an assumption that global elements detect morphisms.
The functor reflects isomorphisms. Suppose is invertible. Then is invertible, and naturality together with monicity of shows that is monic. Regard as a subobject of . Its inverse image along itself is the whole of , just as for the whole subobject of . Those two subobjects correspond to maps ; since is monic, they coincide. Therefore the subobject is all of , and is an isomorphism.
We now prove the preservation condition for the crude monadicity theorem. A reflexive pair in is a coreflexive pair in , with for some . Let be its equalizer. For any monomorphism , define on power objects by composing a parameterized subobject with ; no general image construction is needed because is monic. Inverse image followed by this extension obeys .
Here both are monic. For a parameterized subobject of , an element belongs to exactly when for some . Applying gives , so this condition is precisely and . Consequently, as morphisms of power objects,If equalizes , these identities giveIt therefore factors uniquely through , which is a split epimorphism with section . Since , also equalizes . Hence is their coequalizer. This proves explicitly that power objects turn coreflexive equalizers into coequalizers.
Finite equalizers in give all coequalizers of reflexive pairs in , and we have shown that preserves them and reflects isomorphisms. The crude monadicity theorem now yields
Fix a set of cardinality . If has -indexed products in a category, its Eilenberg-Moore category for the double-power monad has them, since the forgetful functor creates existing limits. The displayed equivalence then gives -products in , hence -coproducts in a category in .
For the converse, suppose those coproducts exist. The diagonal is a logical functor, because all the elementary topos structure in is pointwise, and it has left adjoint . Apply power-object monadicity to both toposes. Under their monadic identifications, is the lift of to the double-power Eilenberg-Moore categories. The base functor is a right adjoint to , so the adjoint lifting theorem for monad algebra functors gives a left adjoint to its algebra lift. Its required reflexive coequalizers exist in , since they are opposites of finite equalizers in . Taking opposites gives a right adjoint to , which is exactly the -product functor. Thus the products and coproducts of fixed cardinality in a topos satisfy
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 24 2 Solution Created 2026-10-03 Updated 2026-10-14
Let be a Cartesian comonad, so its endofunctor preserves finite limits. A coalgebra for a comonad is with , and . Its morphisms satisfy . Write for the forgetful functor and for the cofree coalgebra. Transposition isThe forgetful functor creates finite limits, since preserves them. We construct both exponential objects and the subobject classifier.
For coalgebras , set and in the ambient topos. Define by transposingwhere . Their cofree transposes are coalgebra morphismsLet be their coalgebra equalizer. For a coalgebra , an arrow corresponds to a map . Its evaluation respects coalgebra structure exactly whenUnder the displayed transpositions this is precisely the condition that it equalize . Thus naturally, and is the required exponential in a coalgebra topos.
Let classify . In take the equalizerThe truth map into is and factors through this equalizer. To verify its universal property, take an underlying subobject of a coalgebra. It carries a compatible coalgebra structure exactly when maps into . Such a structure, if it exists, is unique because is monic; its laws follow by cancellation of . Moreover always: applying to a point of lands in . Thus stability is equivalent to .
If classifies , this last equality is exactlyThe cofree transpose satisfies this equation precisely when it factors through . Indeed transposing the equality gives the equation above. Pulling back its truth map recovers , because classifies . Hence is the subobject classifier of a coalgebra topos. We have obtained finite limits, exponentials and a classifier, proving is a topos.
Now let be a geometric morphism, and put , , with unit . Both functors preserve finite limits, so is a Cartesian comonad on . Put . Its comparison functoris left exact and has right adjointTo check the adjunction, transpose an underlying map to . The coalgebra-morphism equation becomes exactly the equality of the two composites into , so the transposed arrow factors uniquely through the displayed equalizer.
The counit is invertible. Applying to the defining equalizer gives the equalizer of . The structure map is exactly that equalizer: it equalizes by coassociativity; if equalizes, apply to obtain , giving its unique factorization through . Thus the underlying comparison counit is an isomorphism, and the forgetful functor reflects isomorphisms. Therefore is full and faithful.
The adjunctions and defineHere is faithful, so is a surjective geometric morphism; is full and faithful, so is a geometric embedding. Their inverse-image composite is , establishing the surjection-embedding factorization of a geometric morphism.
For uniqueness, let be the class of arrows in inverted by . In any surjection-embedding factorization , conservativity of shows that is also the class inverted by . The essential image of the fully faithful consists exactly of the -local objects , namely those for which is bijective for every in . One direction follows from the adjunction. For the converse, the reflector unit belongs to ; locality gives a retraction, and locality of the reflected object makes that retraction also a right inverse. Thus the unit is invertible. The image subcategory is consequently determined by , independently of the factorization. The two intermediate toposes are equivalent over , and their inverse-image composites with the embeddings determine the surjection legs. This proves uniqueness up to equivalence.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 24 4 Solution Created 2026-10-03 Updated 2026-10-14
A signature specifies sorts, finite-arity function symbols and finite-arity relation symbols. A coherent formula is built from atomic relations and equality using , finite conjunction, finite disjunction and existential quantification. A coherent theory consists of coherent sequents in finite typed contexts. The context expresses universal quantification of the free variables; unrestricted universal quantification or negation is not a formula constructor here.
Construct the coherent syntactic category as follows. Objects are formulas in context , modulo renaming and provable equivalence. An arrow to is a formula , modulo provable equivalence, for which the theory provesThese say that the relation is supported on the specified objects, total and single-valued. The identity is equality on the context, and composition isThe logical rules give associativity and the identity laws. The empty-context true formula is terminal; conjunction in disjoint contexts gives products; conjunction with equality of the two functional relations gives equalizers. Existential quantification gives images, and finite disjunction gives unions of subobjects. Substitution preserves these constructions, so images and unions are stable under pullback. This makes a coherent category.
Let be a -model in a topos . Interpret each context as a finite product of its sort objects and each formula as its corresponding subobject. DefineThe interpretation of an arrow relation is a total single-valued relation between these objects. Its projection to the domain is both an epimorphism, by totality, and a monomorphism, by single-valuedness, hence invertible in a topos. Its other projection therefore determines a unique morphism. Composition agrees with relational composition, so is a functor. Finite limits interpret equality and conjunction; images interpret existential quantification; finite unions interpret disjunction, including the empty union for . Consequently is a coherent functor.
Conversely there is a canonical syntactic model in . Interpret a sort by , a function symbol by its term graph, and a relation symbol by its atomic formula-in-context subobject. Induction on formulas identifies the interpretation of every in with its formula-in-context object. Every axiom is then an inclusion of the associated subobjects, because it is provable in .
For a coherent functor , set . Preservation of finite limits, images and unions proves inductively that preserves all coherent interpretations, so every axiom holds in . The same induction supplies natural isomorphismscompatible with the functional relations defining arrows. Thus ; directly on the sorts, operations and relations, .
Finally these constructions agree on morphisms. A model homomorphism induces maps on finite contexts. Atomic relations are preserved by definition; finite conjunction and disjunction and existential witnesses then show that each formula object maps to the corresponding formula object. Compatibility with functional relations makes these maps a natural transformation . Conversely a natural transformation between coherent functors restricts to its components on sort objects; naturality for term graphs preserves operations, and naturality for relation inclusions preserves relations. It is therefore a model homomorphism. The two correspondences are inverse. We have proved the categorical, not merely objectwise, equivalence
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 24 7 Solution Created 2026-10-03 Updated 2026-10-14
Use one ring sort with and the usual unital commutative ring equations. Write for the coherent formula . Add the coherent sequentsThis presents the coherent theory of local rings. For an ordinary nonzero ring satisfying these axioms, the nonunits form an ideal: a multiple of a nonunit cannot be a unit; and if nonunits had unit sum, multiplying by would make two nonunits sum to , contradicting the second axiom. They are also closed under additive inverses. This proper ideal contains every proper ideal, since a proper ideal contains no unit, and its quotient is a field; it is the unique maximal ideal. Conversely in a local ring, and cannot both belong to the unique maximal ideal, so one is a unit. The first sequent excludes the zero ring. In a topos, the disjunction asserts that these unit alternatives hold locally.
Let be a small skeleton of the opposite of the category of finitely presented unital commutative rings; write for the object corresponding to . The Zariski coverage on finitely presented rings is generated byand the empty cover of . Localization is finitely presented, and its compatibility with base change proves the covering axioms.
Here is the classifying argument. For an internal commutative ring and a presentation , define as the subobject of satisfying the polynomial equations . Ring maps induce maps of these solution objects in the site direction. This is independent of presentation, and it preserves finite limits: finite colimits of finitely presented rings correspond to joining finite generators and equations, whose solution objects are finite limits. Conversely a left-exact functor reconstructs a commutative ring using the polynomial maps for addition, multiplication, constants and additive inverse. Presentations by generators and equations then show . Thus flat functors on correspond to internal commutative rings.
Under , the localization arrow above identifies its domain with the locus where evaluates to a unit; the inverse witness is unique. The family is jointly epimorphic exactly when these unit loci cover the solution object for . The locality axiom implies this for every unit-ideal family: from a finite sum , repeatedly apply the two-summand unit alternative, rescaling a unit partial sum when necessary; some , hence some , is a unit locally. Conversely the cover of by its localizations at and gives precisely the locality axiom, while the empty cover of the zero ring gives . Therefore continuous flat functors are exactly models of the displayed coherent theory. The Diaconescu equivalence for geometric morphisms now identifiesnaturally in . This proves the asserted classifying topos identification.
Since the site is subcanonical, the generic local ring is the representable sheafIts ring operations are induced by polynomial substitution. Its infinitesimal subobject is likewise representable:Products of representables correspond to tensor products of their rings. For every finitely presented , exponential adjunction and the Yoneda lemma giveEvery element of this ring has a unique expression , because form an -basis. This holds even when has nilpotents or zero divisors. The expression is natural under every ring homomorphism , which sends its two coefficients to their images. The canonical morphism , transposed from , is consequently a bijection at every stage , with a natural inverse extracting the coefficients. ThereforeThis proves the Kock-Lawvere axiom for the generic local ring. The uniqueness is an internal sheaf assertion tested at all finitely presented rings, including the ring with its generic square-zero element; restricting the test to fields would lose that element and would not prove uniqueness.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 21 6 Solution Created 2026-10-03 Updated 2026-10-14
A regular category has finite limits, coequalizers of kernel pairs, and regular epimorphisms stable under pullback. Equivalently, every morphism factors as a regular epimorphism followed by a monomorphism, and these factorizations are stable under pullback. A regular functor preserves finite limits and regular epimorphisms, hence also preserves these image factorizations.
For this question, the capital regular category convention is the one in which every well-supported object is a well-pointed object in a category. Here an object is well-supported if is a regular epimorphism. It is well-pointed if a subobject through which every point factors must be the whole object. This convention is documented in Definitions 1.1–1.3. It imposes no such point-detection requirement on objects whose support is a proper subobject of . In particular, it should not be replaced here by the stronger assertion that reflects every isomorphism.
First prove two facts about a capital regular category . Every well-supported object has a point. Otherwise is well-supported and has no points, so its diagonal contains all points and is invertible. That makes a subterminal object; the regular epimorphism is then also monic and hence invertible, contradicting the absence of a point. If is a regular epimorphism and is a point, its pullback in a category is a well-supported object over , so it has a point lifting . Thus the representable functorpreserves regular epimorphisms; it already preserves all existing limits. Hence is a regular functor. Second, if is a singleton, its unique point is a monomorphism, is well-supported, and contains all points of . Well-pointedness makes invertible. Thus reflects terminal objects, even though it need not reflect arbitrary isomorphisms.
Now let be a small category that is a regular category. For each object , its slice category is small and regular: finite limits, images and the stability of regular epimorphisms are computed using the corresponding constructions in . By the permitted capitalization result choose a conservative functor that is regular,with a small capital regular category. The base-change functor , given by , preserves finite limits and regular epimorphisms. So doesTaking these as the coordinates defines a regular functorThe exponent is a set of indices, so this is a power of the Category of sets, with finite limits and regular epimorphisms computed coordinatewise.
To prove reflection of isomorphisms, suppose is invertible for . In , the object is the pullback of along the point given by the diagonal . Applying shows that is the fibre of the bijection over this diagonal point, and is a singleton. The preceding lemma gives through its canonical arrow to . Since reflects isomorphisms, is invertible. Its underlying morphism is . Therefore
In the small-category setting of this representation result, the elementary condition for replacing the power by one copy of is:This is almost total support for a regular category. “Strict initial” means initial and every arrow into it is invertible; the condition allows the case in which all objects are well-supported and no initial object exists.
For necessity, let be regular and conservative. If , factor through its support of an object in a regular category . Preservation of images gives . Conservativity makes invertible, so is well-supported. If , then for every the projection is sent to the bijection , hence is invertible. Its inverse followed by the other projection supplies an arrow . For any two such arrows, their equalizer is sent to a bijection onto , hence is invertible, proving uniqueness. Thus is initial. If exists, then exists, so and that arrow is sent to a bijection. Conservativity makes it invertible. Hence is strict initial.
For sufficiency, choose the permitted conservative regular functor into a small capital regular category, and put . This is regular. A well-supported object of is sent to a well-supported object of , which has a point. A non-well-supported object is strict initial by the condition, and is consequently a proper subterminal object. The functor preserves subterminality and reflects the noninvertibility of its arrow to ; its image is a proper subterminal object and has no points. Thus is empty exactly on the non-well-supported objects.
Suppose is a bijection for . If both sets are empty, and are strict initial objects and is invertible. Otherwise are well-supported. Factor as a regular epimorphism followed by a monomorphism . Surjectivity of makes every point of factor through ; capitality of makes invertible. Hence is a regular epimorphism. Its kernel pair is well-supported, because and are regular epimorphisms. Injectivity of implies that every point of has equal coordinates, and therefore factors through the diagonal . Since is well-pointed, this diagonal is invertible. Thus is also monic, hence an isomorphism, and conservativity of makes invertible. This proves sufficiency with actual point and image arguments, rather than asserting that global sections of every capital regular category is conservative.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 75 1 Solution Created 2026-10-03 Updated 2026-10-14
Use the elementary topos definition: a category with finite limits, exponential objects, and a subobject classifier. The indexing category is assumed small, as usual, and denotes its presheaf category. A finite limit of categorical presheaves is formed objectwise: at take the corresponding limit of sets, and apply the universal property to induce restriction maps. The terminal categorical presheaf is the constant singleton, so this supplies all required finite limits.
For categorical presheaves , write and defineFor , restriction is precomposition with . Evaluation sends at to . Given , its transpose sends to the natural transformation whose component at isNaturality of proves this is a natural transformation; naturality in proves it is a map . Conversely evaluation recovers , and these constructions are inverse. Thereforeso the presheaf category is Cartesian closed.
Define to be the set of sieves on a category with codomain . For , let , and let select the maximal sieve at each object. For a subobject , define its characteristic map byThe restriction closure of makes this a sieve on a category, and the formula commutes with pullback of sieves on a category, so is natural. It is maximal exactly when belongs to it, equivalently when ; hence the pullback of along is . Uniqueness is also explicit: naturality forces exactly when the restriction lies in the truth pullback at . Thus the sieve presheaf is a subobject classifier, and every small presheaf category is an elementary topos.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 75 2 Solution Created 2026-10-03 Updated 2026-10-14
Here Cartesian category means a category with all finite limits. Let be a monomorphism, and let be universal membership for a power object . Pull it back to and then regard the result as a subobject of . Its unique classifier is an endomorphism : on a parameterized subobject it intersects with . Intersecting twice has the same result as intersecting once, so uniqueness of classification gives .
Take the equalizer of and the identity, and restrict membership to . For any subobject , its composite with is a subobject of , hence is uniquely classified by . Since it is contained in , its intersection with that subobject changes nothing, so and factors uniquely through . Conversely every map gives the original kind of family by pulling back the restricted membership. These inverse operations givenaturally in . Thus is a power object of a subobject, even if no power objects other than were assumed.
Now consider the slice category , which has finite limits formed by ambient pullbacks and has terminal object . The constant family has slice power object : for ,and a classifier is equivalently the map over . Every family is a subobject of this constant family through its monic graph . Apply the first construction inside the slice. Consequently every slice of a Cartesian category with power objects again has power objects.