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 2007 iii Paper 25 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Definitions organize category theory, but theorems give that organization mathematical force. I would therefore argue against treating the subject as an exception in which definitions are intrinsically more important than theorems. The distinction is especially misleading here because good categorical definitions are designed to expose hypotheses from which substantial theorems follow.
A category records objects, composable arrows, identities and associative composition. A functor preserves that structure. This language allows one to compare otherwise different mathematical settings, but it does not itself say which constructions exist. For example, the definition of a product in a category is not a recipe for forming a Cartesian product of underlying sets: it requires a universal factorization of pairs of arrows. If two products in a category and exist, the universal properties give unique arrows and respecting projections. The composites and respect the same projections as the identities, so uniqueness forces them to be identities. Thus a definition yields a genuine theorem: products in a category are unique up to unique compatible isomorphism. The proof matters because it licenses replacing a construction by any other realization of the same property.
The Yoneda lemma is a more substantial example. For a covariant representable functor and , a natural transformation is determined by . Naturality forcesConversely this formula defines a natural transformation for every . Hence . The definition of naturality is indispensable, but the theorem identifies every possible transformation, proves representables detect arrows, and explains why universal objects can be studied through hom-sets. Merely knowing the definition does not supply this conclusion.
Similarly, an adjunction is defined by natural hom-set bijections. The construction of a free abelian group gives , because a group homomorphism is determined uniquely by its values on the basis. This makes a universal extension problem transparent. But the Freyd general adjoint functor theorem goes further: it turns categorical limit preservation and a solution set into an actual adjoint. Its smallness hypotheses cannot be discarded as bookkeeping. For instance, the underlying-set functor from finite groups to finite sets has no left adjoint at a singleton. A putative universal finite group with universal element of order could not map that element to a generator of a finite cyclic group of order greater than . The theorem's hypotheses separate existence from attractive notation.
The monoidal coherence theorem offers another example. A monoidal category has associativity and unit isomorphisms satisfying the pentagon identity for a monoidal category and triangle identity for a monoidal category. Coherence proves that every formal reassociation and unit insertion produces the same structural map. This is what justifies calculating without displaying all parentheses; it is not true merely because one has named an associator. Nor does it identify arbitrary additional maps, such as distinct braidings.
Finally, the opposite category construction shows how a definition can economize on proofs: reversing arrows takes products in a category to coproducts in a category, initial objects to terminal objects and monads to comonads. Yet this economy works because theorems and their proofs are invariant under the reversal. The subject is powerful precisely when definitions isolate reusable structure and theorems establish its consequences. Separating their importance obscures that partnership.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 25 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Both alternatives can be proved using the same smallness mechanism. We first establish the initial-object lemma for complete categories with a weakly initial set, then obtain the two adjoint functor existence theorems and their applications.
Let be a locally small category with all small categorical limits and a weakly initial set . Its product in a category is weakly initial: given any object, choose a map from some and compose with the corresponding projection. Take the simultaneous equalizer of every endomorphism of and its identity; local smallness makes this a small categorical limit. Then is also weakly initial. If , form their equalizer and choose . Since is an endomorphism of , the construction of gives . Cancelling the monomorphism yields . Thus is both a monomorphism and a split epimorphism, hence invertible, and . There is therefore exactly one arrow from to every object: is initial.
The Freyd general adjoint functor theorem says that for a functor between locally small categories, with complete, a left adjoint exists exactly when preserves all small categorical limits and satisfies the solution-set condition. That condition requires, for each , a set of arrows such that every factors as for some and .
For sufficiency, the comma category is locally small and complete: form a diagram's categorical limit in , and use categorical limit preservation to obtain its arrow from . The solution set is a weakly initial set in this comma category. The lemma provides an initial object . Its universal property givesFor , define by . Uniqueness proves the identity and composition laws and naturality of the displayed bijections, hence . Conversely, an adjunction makes preserve categorical limits, since the corresponding hom-set functors turn a categorical limit cone into a categorical limit of sets. The single arrow is a solution set. This proves both directions of the theorem.
Now let have small domain and codomain. The functor categories and are locally small, and their categorical limits are pointwise. Thus the precomposition functor preserves categorical limits and its domain is complete. To verify its solution-set condition, fix and an arrow . Let be the subfunctor generated by all elements , where and . Explicitly,These sets are stable under every . If is an infinite cardinal bounding and , every has cardinal at most . Replace each such set by a subset of a fixed set of size . There is only a set of choices of these subsets, of their action maps for the set of arrows of , and of maps from to their restrictions. These coded pairs form a solution set: factors through and then the inclusion . The general theorem now yieldsIts values may also be written , the usual left Kan extension formula.
For the other alternative, the categorical limit form of the Special adjoint functor theorem says that a limit-preserving functor has a left adjoint if is locally small, complete and well-powered, has a cogenerating set , and is locally small. A cogenerating set means that maps into its members distinguish any two parallel arrows. The dual theorem says that a colimit-preserving functor from a locally small, cocomplete, well-copowered category with a small generating family has a right adjoint. These conclusions are also necessary in their preservation clauses.
Here is a proof of the special theorem rather than an invocation of the general theorem without its required solution set. Given , intersect all subobjects through which factors after application of . There are only a set of them by well-poweredness. Their intersection is a wide pullback, preserved by , so gives a smallest supporting pair . If satisfy , their equalizer is a supporting subobject. Minimality makes that equalizer invertible, whence . Consequentlyis injective. The cogenerating property makes the evaluation arrow from into the product in a category of the , one factor for each map , a monic arrow. Its indexing set at each is identified with a subset of the fixed set . Only a set of such products in a category can occur. Each has only a set of subobjects, and each possible subobject has only a set of arrows from into its image under . These pairs give a weakly initial set in , since every original pair receives the arrow from its minimal supporting pair. The complete-category lemma now gives the adjoint. Reversing all arrows proves the colimit form of the special theorem.
Apply that dual form to . Its domain is cocomplete and locally small, and preserves pointwise colimits. The set of covariant representable functors generates the domain: by the Yoneda lemma, maps from these representables probe every element at every object and hence distinguish distinct natural transformations. Finally, epimorphisms in this functor category are pointwise surjective. Indeed, their pointwise images form subfunctors; if an image is proper, the two inclusions into the pointwise pushout of two copies of the target over that image distinguish the original map, contradicting epicity. Quotients of a fixed functor are therefore specified by compatible equivalence relations on its sets of values, and form a set. Thus the domain is a well-copowered category. All special-theorem hypotheses hold, givingHere the Right Kan extension can be written . In particular both requested adjoints exist, although the two proofs use different smallness hypotheses.
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





