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 2013 iii Paper 19 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
First the increasing sequence is cofinal in . Write . Strict increase gives when the sequence is infinite, so its cardinal sum is . The given sum therefore implies and .
For any function , choose an index with for every . There are at most such indices, so they are bounded below . Enlarging the bound if needed gives an index with . ThusConversely each summand is at most , and because . Infinite cardinal multiplication consequently givesCombining the inequalities proves .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put . There is a strictly increasing cofinal map . If , choose a cofinal map . Then is cofinal in , contradicting the definition of as its least cofinal order type. Since always , we obtainFor a nonzero limit ordinal this is an infinite regular cardinal. If the convention includes zero among limit ordinals, its cofinality is zero and the identity is immediate there.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 1 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The structure of hereditarily small sets is transitive. If , all its sets are hereditarily finite, so it cannot satisfy Infinity. Therefore the assumed model has .
Let be a cardinal. The ordinal belongs to , and every actual subset of also belongs to : its transitive closure has size at most . The Power set axiom inside therefore produces the actual , since all subsets relevant to the internal definition are present. This power set itself belongs to , soThus is a strong limit. Its regularity was assumed, and we have proved uncountability. Hence is strongly inaccessible.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let , and work with the set structure . Its ordinal height is an infinite limit: a transitive model of ZFC has no largest ordinal, since it can take the successor of each ordinal it contains. Thus .
Suppose instead that . Enumerate all first-order formulas, and close each finite initial collection under subformulas. Applying Lévy reflection theorem inside , choose a strictly increasing sequence such that agrees with on the first collections. Take . The internal rank levels here are the actual rank levels, because is a transitive rank model.
If with , choose large enough to include this formula and all the parameters in . Reflection supplies a witness in . The Tarski-Vaught test therefore gives . In particular satisfies all of ZFC, contrary to the minimality of .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 8 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
In an abelian category, the image factorization in an abelian category of iswhere the abelian-category axiom identifies coimage with image. Thus is epic and is monic. Any other epi-mono factorization has and . Since epimorphisms are cokernels of their kernels, its middle object is canonically isomorphic to , uniquely compatibly with the two factors.
For a square , define byThe first arrow exists because factors through , so annihilates . Its composite with equals after the epimorphism , proving the second equation. Uniqueness after proves preservation of identities and composition. This gives the functoriality of abelian image factorization as a functor from the arrow category.
For pullback stability of abelian image factorization, state the standard facts that pullbacks preserve monomorphisms, epimorphisms in an abelian category are stable under pullback, and two adjoining pullback squares have pullback outer rectangle. In the given diagram, is therefore monic and is epic, while the composite is the pullback of . Its epi-mono factorization is an image factorization by the uniqueness just proved. Thus the top row is the image factorization of the pulled-back arrow, with its middle object canonically the pullback of the original image subobject.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 8 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the kernel squares in an abelian category argument. If is monic and , satisfy , then , so . The kernel in a category property gives a unique with . The equation and monicity of give . This proves the left square is a pullback in a category.
Now suppose the right square is a pullback, without imposing the earlier monicity hypothesis on . The pair gives a unique with and . Factor through the kernel. Then , so . Also and have the same two pullback projections, hence . Thus and . Therefore is an isomorphism. These arguments use only the relevant kernels, zero arrows and pullback properties; the abelian hypothesis supplies them.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
We prove full faithfulness from counit coequalizers. Let and let be an monad algebra morphism. ThusSet . Its composites with the two arrows of the printed presentation are equal: naturality of givesIn the last equality we used naturality at . The coequalizer property therefore gives a unique satisfying .
Apply to that identity. The algebra-morphism equation gives . The triangle identity makes a split epimorphism with section , so . This proves fullness of .
If have , naturality gives . The counit is epic since it is a coequalizer, so . Thus is a faithful functor. Both parallel arrows matter: the converted TeX loses the second one, , which is visible in the original PDF.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the monad , an algebra for a monad is with and . A morphism of algebras for a monad satisfies . These objects and arrows form the Eilenberg-Moore category .
The free algebra functor sends to and to . The monad identities verify the algebra laws. For the forgetful functor , the free adjunction iswith inverse . The algebra law makes the latter an monad algebra morphism. The identities and prove the bijection.
In the category of adjunctions inducing a fixed monad, objects are adjunctions with their induced monad identified with . A morphism to is a functor between the right-hand categories satisfying , and compatibility with units and counits. With these strict identifications, defineThe triangle identities give the unit algebra law; naturality of at gives the multiplication law. Naturality at makes an monad algebra morphism. Moreover , because , and is the free-adjunction counit at . Hence is a morphism into the Eilenberg-Moore adjunction.
For any other such , its underlying object at must be . Counit compatibility forces its algebra action to be , and the forgetful functor, which is a faithful functor, forces . Thus . This proves terminality of the Eilenberg-Moore adjunction. If adjunctions are specified only up to coherent isomorphisms, the same argument gives uniqueness up to the corresponding compatible natural isomorphism.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 5 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
If is representable, it is a limit-preserving functor, and its universal element gives an initial object of , hence a weakly initial singleton.
Conversely, a limit-preserving makes a complete category. For a small diagram , take in . Its distinguished elements form a compatible family in . Categorical limit preservation gives a unique with . The underlying categorical limit factorization of a categorical cone preserves this element, proving the comma-category universal property. For the empty diagram, this uses . This is the construction of limits in a comma category of a limit-preserving functor.
The comma category is locally small since its arrows are subsets of the hom-sets in . By the previous part, its weakly initial set therefore yields an initial object. Part (b) then yields a representation of . Thus representability from a solution set follows with all small categorical limits, rather than finite categorical limits alone.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
An initial object by itself is a weakly initial set. For the converse, let be a small weakly initial family and form its product in a category . Given , choose an arrow ; its composite with the projection shows that is weakly initial.
Local smallness makes a set, so completeness supplies the simultaneous equalizer of all endomorphisms of with . Thus for every . The object is weakly initial because it maps to .
For parallel arrows , take their equalizer . Weak initiality of supplies . The endomorphism of satisfies , and monicity of gives . Therefore is both a monomorphism and a split epimorphism, hence an isomorphism. Since , we obtain . There is already at least one arrow from to every , so is initial. This proves the initial-object lemma for complete categories with a weakly initial set, with smallness used exactly where the endomorphisms are equalized.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 18 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A representation of a functor for says precisely that for every object of there is a unique arrow with . This is exactly the initial object property for in that comma category. Conversely, an initial object supplies these unique arrows, hence the representing bijections .
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





