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 2014 iii Paper 18 8 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the displayed square's notation , , , , with and epic. Form the biproduct and the morphismsThe map is an epimorphism, since its restriction to is : equality after implies equality after . The pullback in a category property says exactly that is a categorical kernel of . Indeed , and a map into killed by is a pair with , which factors uniquely through .
Use the standard abelian category property that every epimorphism is the categorical cokernel of its categorical kernel. If and satisfy , then . Hence there is a unique with . Restriction to the two summands gives and . This is the pushout in a category universal property. Thus a pullback of an epimorphism is a pushout in an abelian category.
In this pushout, is the pushout of along . The reflection result of part (b) therefore makes epic. This proves pullback stability of epimorphisms in an abelian category.
Finally, let be an epimorphism and let be its kernel pair. Their pullback square is a pushout by the result just proved. If satisfies , the two copies of form a pushout cocone. There is a unique with . Hence epimorphisms in an abelian category are coequalizers of their kernel pairs, so they are regular epimorphisms.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 8 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be the categorical cokernel of in an abelian category. If is an epimorphism, the equality implies . Since is also an epimorphism, implies . An object with zero identity is a zero object: every morphism to or from it is zero. Hence the cokernel object is zero.
Conversely, suppose the cokernel object is zero. If , additivity gives . The categorical cokernel property makes factor through the zero object, so and . ThusThis is the zero-cokernel criterion for epimorphisms. In a pushout in a category, the two horizontal morphisms have isomorphic cokernels by part (a). Therefore the lower morphism is epic if and only if the upper morphism is epic. In particular pushouts reflect epimorphisms in an abelian category; the same argument also proves preservation.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 8 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
In a pointed category, a zero object defines zero morphisms between all objects. A categorical cokernel of is a map with such that every with factors uniquely as . Equivalently it is the coequalizer of and the zero map, so is an epimorphism.
Write , , and for the vertical arrows, with and . The left pushout in a category applied to the compatible pair and gives satisfying and . The categorical cokernel property of then gives with .
Now . Cancel the epimorphism to obtain . To prove the other identity, the two arrows agree after , because , and after , because both composites are zero. The pushout in a category uniqueness clause gives . Cancelling the epimorphism gives .
Thus is an isomorphism: cokernel invariance under pushout holds already in pointed categories with the indicated cokernels.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 7 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A preadditive category has an abelian group structure on every hom-set, with composition additive in each variable. Neither a zero object nor biproducts are part of this definition.
Fix and use the reflexive pair , , with . Take objects and arrows , with source , target , and identity at equal to . For composable , so , defineThe preadditive category axioms giveThus the formula has the required endpoints. The identities satisfy and , using .
For and , both ways of composing three arrows equalIndeed , while expanding and then composing with gives the same expression. Hence composition is associative.
Every arrow has inverseIts source is and its target is . Substituting in the composition formula gives and . Therefore this is a groupoid.
For , precomposition by preserves sources, targets, identities, composition and inverses by bilinearity. Thus the construction is natural in , giving the requested internal groupoid structure in its hom-set formulation. If the composable-arrow pullback in a category exists, the same formula defines its internal composition morphism. The reflexive-pair groupoid formula in a preadditive category requires no extra additive-category hypotheses.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 7 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
An isomorphism is a morphism with an inverse satisfying and . A groupoid is a category in which every morphism is an isomorphism.
With the given one-sided inverses,Consequently is an isomorphism with . This argument uses only the category axioms.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For an algebra for a monad , consider the fork in the Eilenberg-Moore categoryHere is the counit at , and . The arrow is an algebra morphism by , which also says that it coequalizes the two arrows.
Let be an algebra morphism with . Define . Naturality of at givesSince is an algebra morphism,Thus is an algebra morphism with . Any other such factorization satisfies . This proves the full coequalizer universal property inside the algebra category.
The pair is moreover a reflexive pair: its common section is , with underlying map , because and . Hence every monad algebra is a reflexive coequalizer of free algebras. This reflexive free-algebra presentation of a monad algebra needs no general existence theorem for arbitrary algebra-category colimits.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The free algebra functor isThe monad laws make an algebra action, and naturality of makes a morphism of algebras for a monad. Let forget the action. DefineThe proposed inverse is an algebra morphism becauseNaturality of and the algebra unit law give . If is an algebra morphism, thenThe formulas are natural in both variables, so . Its unit is , and its counit at has underlying map . Thus the monad induced by an adjunction has endofunctor , unit , and multiplication . It is exactly the original monad, not merely a monad with the same endofunctor.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A monad consists of an endofunctor and natural transformations and , the unit and multiplication of a monad, satisfyingAn algebra for a monad is with satisfying and . A morphism of algebras for a monad satisfies . These objects and morphisms form the Eilenberg-Moore category ; its composition works because is a functor.
For the list monad, is the set of finite ordered lists, including the empty list. The map applies to each entry; and concatenates a list of lists. The unit laws say that adding singleton brackets and then flattening changes nothing. Associativity says that flattening a list of lists of lists in either order produces the same ordered sequence. These descriptions also prove naturality.
If is an algebra for a monad, defineThe singleton law gives . Apply the algebra associativity law to and to obtain . Applying it to and showsThus is a monoid. Applying the same law to shows inductively that is necessarily ordered multiplication of its entries, with the empty product .
Conversely, any monoid defines such a list-fold map . The monoid unit proves , and associativity and the unit prove that multiplying flattened lists equals multiplying their individual products, including empty sublists. Hence . An algebra morphism preserves the empty-list value and two-entry-list values, so it is a monoid homomorphism; conversely a monoid homomorphism preserves every ordered product and is an algebra morphism. ThereforeThus list-monad algebras are monoids, with the identification also matching every morphism.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Put . This is a natural transformation . Only the -triangle is assumed. Naturality gives two useful absorption identities:For the second equality in the last line use naturality of at , and then the assumed -triangle. Naturality of at and of at now givesHence is an idempotent in the functor category: this is the one-triangle adjunction idempotent.
For the splitting of an idempotent morphism, suppose this idempotent morphism splits as natural transformations and , with and . DefineThe first absorption identity givesFor the other triangle, naturality of at and of at givesThus the triangle identities for an adjunction prove .
Conversely, suppose , with unit and counit . The unit has target , as its type requires. DefineThese are natural transformations. Transposition under gives . Independently, naturality of at and the assumed -triangle giveThe transpose of is therefore , the transpose of . Injectivity of the hom-set bijection implies . Naturality of at givesConsequently has a left adjoint if and only if splits. This is the criterion for splitting a one-triangle adjunction idempotent. The argument gives both the explicit splitting and the new unit and counit, without assuming the other triangle for .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write and . The characterization concerns an adjunction with the specified unit and counit of an adjunction and . Its triangle identities for an adjunction areAssume these identities. Define the hom-set mapsNaturality of and makes these maps natural in both objects. Naturality and the triangle identities for an adjunction giveThus they are inverse bijections and define .
Conversely, from the natural hom-set bijections of an adjunction, define and . Naturality gives the same formulas for and above. Applying to and to gives the two triangle identities for an adjunction. Therefore these identities are exactly the compatibility conditions on the specified unit and counit. If the printed equivalence were read as mere existence of some adjunction, independently of the supplied transformations, its only-if direction would be false: on the category of abelian groups, are adjoint, but choosing both transformations to be zero does not satisfy either triangle on a nonzero object.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 3 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Choose a representing object and a natural isomorphism . Using the assumed small coproducts in a category, defineFor a function , define by . The coproduct in a category uniqueness clause proves preservation of identities and composition, so this is a functor.
Restriction to the coproduct summands, followed by , givesThese bijections are natural in by the definition of , and natural in by naturality of . They establish , the left adjoint to a covariant representable functor. The empty set is sent to the empty coproduct.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be a representable functor, and let be the categorical limit of a small diagram . A morphism is uniquely equivalent to a family satisfying for every .
Such compatible families are exactly the elements of the categorical limit of the set-valued diagram . Consequently the canonical comparisonis a bijection. Transporting it through the representing natural isomorphism proves that preserves every small limit that exists in . This proves that covariant representables preserve limits. For an empty diagram this says that maps into a terminal object form a singleton.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Suppose is a left adjoint to . The adjunction gives bijections, natural in ,The second map is evaluation at the singleton element, as in part (a). Thus is represented by . This argument uses the one-point set as a generator of the particular set-valued adjunction; it does not claim that every arbitrary right adjoint is representable.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a set , let select . Given any family , define by . Then , and these equations determine every value of , so it is unique.
This is precisely the universal property of a coproduct in a category, givingThe empty set gives the empty coproduct in a category, namely the initial object of the Category of sets.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 18 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A functor is a representable functor if some object admits a natural isomorphism . Here the representable is covariant.
For the identity functor on the Category of sets, choose the singleton . The evaluation mapsare bijections with inverse . For , evaluation of is , proving naturality. Hence the identity functor on sets is represented by a singleton.
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





