Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 18 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the reverse absorption order on the incline:This is exactly the relation given by the pairs . Indeed, if and , then by additive idempotence, associativity and commutativity. Conversely expresses as , so is one of these pairs.
Additive idempotence gives , hence reflexivity. If and , thenso the relation is transitive. In fact it is antisymmetric as well: and , together with commutativity, imply . Thus the relation is a partial order, and therefore a quasi-order. It is the reverse of the usual join order of an incline; keeping this reversal is essential for the well-quasi-ordering conclusion.
Both operations are order-preserving for this order. If , then by additive idempotence, while distributivity gives . The multiplicative absorption identity also saysThus multiplying a monomial by another factor moves upward in the reverse absorption order.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 9 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First prove the exact lifting statement for the forgetful functor . Take any diagram in a category of algebras for a monad whose underlying diagram has a chosen categorical limit . The arrows form a categorical cone, since every diagram arrow is a morphism of algebras for a monad. Thus the universal property gives a unique arrow satisfyingThe projections are jointly monic: two arrows into with the same composites with every are equal. Therefore the algebra identities can be checked after these projections. For the unit,For multiplication,The algebra law for makes the right-hand sides equal. Thus is an algebra for a monad, and each is a morphism of algebras for a monad. Its action is unique with this property.
Given an algebra cone , let be its unique underlying mediating map. Thenso by joint monicity. Hence is an algebra map, proving the lifted cone is limiting. This establishes that the monad algebra forgetful functor creates limits, without any assumption that preserves limits.
For a monadic adjunction, the comparison satisfies . If is an isomorphism of categories over the base, the preceding unique lift transports back literally, so is a limit-creating functor. If monadic means that is only an equivalence of categories, the precise conclusion is creation of limits up to isomorphism: the lifted algebra is isomorphic to an object , and its limiting cone transports along that isomorphism. Full faithfulness supplies the arrows and their uniqueness.
This distinction concerns prescribed underlying objects, not existence of limits. Literal creation does not follow from an arbitrary equivalence alone. For example, the inclusion of the one-object category into the two-object indiscrete category, choosing one of its objects, is an equivalence of categories and is monadic under the equivalence convention. Either object of the target is terminal, but the other chosen terminal object has no literal object preimage. Thus the strict reading of the requested assertion needs the strict comparison convention; the equivalence-invariant statement is proved above.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 9 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For with unit of an adjunction and counit of an adjunction , putThe triangle identities for an adjunction giveFor associativity, naturality of at saysApply to obtain . Thus this is the monad induced by an adjunction.
Conversely, start with a monad . The free algebra functor sends to and to . The monad laws ensure that these are algebras for a monad and morphisms of algebras for a monad. For an algebra , there are inverse bijectionsThe inverse really is an algebra map becauseFor a free-algebra map , its algebra equation and the monad unit law giveFor a base map , naturality and the algebra unit law give . The formulas are natural, establishing the free-forgetful Eilenberg-Moore adjunction . Its unit is , and its counit at is . Hence its induced multiplication is , and every monad arises from an adjunction.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 9 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A monad on consists of an endofunctor and natural transformations , satisfying the unit and multiplication of a monad lawsAn algebra for a monad is an object equipped with such thatA morphism of algebras for a monad is a morphism satisfying . Identities and composition obey this equation, giving the Eilenberg-Moore category and its forgetful functor .
For an adjunction with induced monad , the Eilenberg-Moore comparison functor isThe functor is monadic when it has such a left adjoint and this comparison is an equivalence of categories; a stricter convention requires an isomorphism of categories over . We will identify which limit-lifting conclusion each convention supports in part (iii).
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 7 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Only remains. Assume preserves small categorical limits, and choose a small cogenerating family in . Fix a set . The comma category is a complete category: underlying limits in , together with limit preservation by , lift compatible maps from . It is locally small, since its arrows form subsets of the hom-sets in .
We construct a weakly initial set in this comma category. Given , intersect all subobjects through which lifts under . There are only a set of subobjects because is well-powered; the family includes . Their intersection exists by completeness. Also preserves monomorphisms, since a map is monic precisely when its self-pullback diagonal is invertible, and preserves such pullbacks.
Thus all lifts of are unique and compatible, and preservation of the intersection givesNo proper subobject of supports a lift of : its composite into would belong to the intersected family, forcing it to contain . This is a minimal supported subobject.
For each , the mapis injective. Indeed, equal images mean lifts to the equalizer of the two maps, because preserves that equalizer. Minimality forces the equalizer to be invertible, so the maps agree.
The cogenerator property makes the evaluation mapa monomorphism: any two arrows into that agree after all these projections are equal. The indexing pairs inject into the fixed setTheir image is some subset . Consequently is isomorphic to a subobject of a product of the indexed by . There are only a set of such subsets , only a set of subobjects of each , and only a set of maps for each representative subobject .
Collect all these pairs . Every receives a comma arrow from one of them, via the isomorphic copy of and . Hence they form a weakly initial set. The initial-object lemma for complete categories with a weakly initial set, proved explicitly in Question 8, gives an initial object of . Its map from is a universal arrow from an object to a functor. Choosing these universal arrows for all defines a left adjoint to .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 7 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose naturally and has small coproducts in a category. DefineFor a function , define by sending the -summand by the identity of to the -summand. The coproduct property gives the identity and composition laws, so is a functor. There are natural bijectionsThe first chooses a morphism on every summand; the second views that family as a function. Hence this is the left adjoint to a covariant representable functor:For empty , the formula uses the empty coproduct, an initial object, and the same bijection remains valid.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 7 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
If , let denote a singleton set. The adjunction gives the natural bijectionsThus is represented by , proving .
If is a covariant representable functor, a morphism is exactly a compatible family of morphisms . Consequently the comparison mapis a bijection for every existing small categorical limit. This proves by the universal property of a limit. In particular,
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 6 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write the Yoneda embedding as . For any finite product in a category, its universal property givesThese bijections are natural, so preserves finite products. Now use the exponential in a presheaf category, followed by the Yoneda lemma and the exponential object property in :Every step is natural in , so these component bijections form a natural isomorphismUnder this isomorphism, the image of the evaluation is the presheaf evaluation: both correspond to the same identity of the exponential under the transpose bijection. Thus the Yoneda embedding preserves exponentials, including their evaluation maps.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 6 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A Cartesian closed category has finite products in a category and, for all , an exponential object with a natural bijectionEquivalently the functor has a right adjoint. Its counit of an adjunction is the evaluation map of an exponential object .
For the presheaf category, define the exponential in a presheaf category byFor , its restriction sends to . Composition of these restriction maps follows from composition of the , so this is a categorical presheaf. Define evaluation map of an exponential object byFor , naturality of givesThus is a natural transformation.
Given a natural transformation , define its currying byNaturality of proves that is a natural transformation . For , the same formula proves that is natural. Evaluating at gives .
Conversely, if and , thenby naturality of . Hence the two constructions are inverse and natural in . Products are available pointwise, including the terminal singleton presheaf, so the presheaf category is Cartesian closed. The exponential uses natural transformations out of ; simply exponentiating the individual values generally does not give this object.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 6 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , let be its category of elements. Its objects are with ; an arrow is a morphism satisfying . This is a small category, because is small and all values of are sets.
Send to the representable presheaf , and send an arrow to postcomposition . There is a cocone to whose map at isThe functor laws give its naturality and the required cocone compatibility.
Compute the colimit pointwise as a disjoint union modulo its diagram identifications. At a representative is a triple , and it maps to . Every is the image of . Moreover is an arrow in , so its diagram relation identifiesThus every representative is identified with the canonical representative of its image. Two representatives have equal images exactly when their canonical representatives agree. This proves a componentwise bijection; restriction maps respect it. The resulting natural isomorphism is the canonical colimit presentation of a presheaf:
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be a natural transformation of categorical presheaves. If every is a surjective function, and satisfy , then at every . Surjectivity gives for all , hence . Thus is an epimorphism.
Conversely suppose is outside the image of some . Construct the pushout witness for failure of pointwise surjectivity explicitly: at each takeRestrictions send to ; naturality of ensures that every generating identification is respected. Thus is a categorical presheaf, and the two inclusions are natural transformations with .
All identifications concern the same element in its two copies, so an element outside the image is never identified with its other copy. Consequently , proving is not an epimorphism. ThereforeThis is the pointwise epimorphism in a functor category criterion. It requires neither a componentwise choice of preimages nor a natural section.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be a small diagram in a category. Since is a complete category, choose at each a categorical limitFor , the arrows form a cone over a diagram at , because the diagram arrows are natural transformations. There is therefore a unique arrow withThe universal property immediately gives and : both sides have the same composites with every limit projection. Thus is a functor, and the displayed equations make the natural transformations.
Given any categorical cone in the functor category, its components induce unique . For , compare and after each ; naturality of makes their composites equal. Hence is a natural transformation, and uniqueness is componentwise. This proves that is a categorical limit in .
The functor category is complete, and every evaluation functor preserves limits, since evaluating the constructed limit at gives exactly the chosen limit in . This is the pointwise limits in a functor category construction; it also covers the empty diagram and its terminal object.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Given , their product in a category is the pullback of the unique arrows , where is a terminal object. Having constructed this product in a category, define the equalizer of as the pullbackwhere is the categorical diagonal. A map factors through this pullback exactly when : the accompanying arrow to must equal this common composite. The factorization is unique, proving the equalizer property.
Thus the hypotheses give a terminal object, binary products in a category and all equalizers. Part (i) now gives all finite limits.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the explicit construction of small limits from products and equalizers from part (i), here with finite indexing sets. If preserves finite products in a category and equalizers, then and , with their image projections, are the products of the objects and of the target objects indexed by arrows of .
The image maps have componentsAlso is their equalizer. Therefore the same universal property proof makes , with projections , a categorical limit of . Any other chosen limit of is uniquely isomorphic to this construction, and the functor carries that isomorphism to an isomorphism. Consequently preserves every finite limit. Preservation of finite products includes the empty product, so the terminal object is also preserved.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First construct every finite product in a category by iterating binary products in a category; the empty product is the terminal object. Let be a diagram in a category with finitely many objects and arrows. Form the finite products in a categoryDefine by their componentsTake their equalizer . Its components satisfy , so they form a cone over a diagram.
For any other categorical cone , the product in a category property supplies a unique with . The cone equations imply , so the equalizer property supplies a unique with . These are exactly the required equations , with uniqueness. Thus is a categorical limit. For empty , both products are terminal and this construction still gives a terminal limit. All finite limits exist.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Here a universal element means a pair , with , such that for every and every there is a unique morphism satisfying . Equivalently,By the Yoneda lemma these component maps constitute a natural transformation . If is universal, every component is bijective, so this is a natural isomorphism and is a representable presheaf. Conversely a natural isomorphism takes to an element with exactly this property. In the category of elements of the contravariant functor , is a terminal object: every has a unique arrow to it.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Conversely suppose is a natural isomorphism, with inverse . Since the Yoneda embedding is a full and faithful functor, there are unique and with and . Their composites satisfyFaithfulness gives and . ThusThe naturality requirement ensures that all incoming morphisms are respected; unrelated componentwise bijections alone would not justify the conclusion.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Yoneda embedding sends to and to postcomposition . Apply the Yoneda lemma with :The inverse sends precisely to , because its component at maps to . Hence the induced maps on all hom-sets are bijections. The Yoneda embedding is full and faithful.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the preservation obstructions to extending an adjoint chain: a functor having a further left adjoint must preserve categorical limits, while one having a further right adjoint must preserve colimits.
At the left end of the presheaf category chain, does not preserve the terminal object. The terminal categorical presheaf has singleton value everywhere, whereas because . Thus cannot itself be a right adjoint. At the right end, does not preserve the initial object: since the empty open set is proper. Thus cannot itself be a left adjoint.
For the category of small categories chain, take two functors from the terminal category to the two-object indiscrete category , selecting its distinct objects. Their equalizer is the empty category. But their images under are the same function between singleton sets, whose equalizer is a singleton. Hence does not preserve equalizers and has no further left adjoint. Finally, is the two-object discrete category, while has arrows between its distinct objects. The canonical comparison is not an isomorphism of categories, so fails to preserve this coproduct and has no further right adjoint.
Neither chain extends in either direction.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 17 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the set of connected components of a category: two objects of a category are identified when joined by a finite zigzag of morphisms. Let be the discrete category on , and let be the indiscrete category on , with exactly one morphism for every ordered pair of objects.
A functor must give the same object value along every arrow, hence along every zigzag. Conversely a function uniquely defines such a functor. A functor is just a choice of an object of a category for each element of . A functor is likewise determined by an arbitrary object function, since its arrow images are forced and always compose correctly. ThereforeThis is the adjoint chain for the objects of a category:
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





