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 2003 iii Paper 19 1 i by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 18 7 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We prove both versions. In the general adjoint functor theorem, let be a functor between locally small categories, with complete. Then has a left adjoint if and only if it preserves small limits and satisfies the solution-set condition: for each there is a set of arrows such that every arrow factors as for some and .
First prove the initial-object lemma for complete categories with a weakly initial set. Let be locally small and complete, and have a small weakly initial family . Its product is weakly initial: a map can be composed with the product projection. Take to be the simultaneous equalizer of every endomorphism of and its identity. This is a small limit since is a set. Maps exist by composing with a weakly initial map .
For uniqueness, take any and their equalizer . Weak initiality of gives . The endomorphism of fixes by its defining equalizer property, so . Since is monic, . Thus is both monic and split epic, hence invertible, forcing . Therefore is initial. This proves the lemma without an unproved initial-object assertion.
Now fix . The comma category is locally small. It is complete: take the limit of the underlying diagram in , use preservation by to factor the compatible arrows from , and obtain the universal comma cone. The solution set is exactly a small weakly initial family in this comma category. The lemma provides its initial object . Its universal property is the natural bijection . For , initiality gives the unique satisfying ; uniqueness proves identities and composition. Thus these objects form a left adjoint. Conversely a left adjoint provides the singleton solution set consisting of its unit arrow, and a right adjoint preserves limits: the adjunction bijections identify cones into the image diagram with cones from the corresponding left-adjoint object into the original diagram. This proves both directions of the general theorem.
The limit form of the special adjoint functor theorem assumes instead that is complete, locally small and well-powered, and has a small cogenerating family . For any locally small target, a functor has a left adjoint exactly when it preserves small limits. Necessity is already proved. For sufficiency we construct a solution set, so that the general theorem applies.
Fix . Given , consider all pairs with . There is only a set of these pairs. Intersect their equalizers to obtain a monomorphism . Since preserves this limit and equalizes the images of all pairs, it factors uniquely as for .
For each realized pair with , choose one such . Any other with the same pair restricts to the same map on . The restricted chosen maps jointly separate morphisms into : if two such morphisms become equal after all chosen maps, they become equal after every , and the cogenerating family then makes their composites with equal; monicity of cancels it. Hence the resulting mapis monic, where is a subset of the fixed set .
There is only a set of possible , a set of subobjects of each corresponding product by well-poweredness, and a set of arrows from into of each chosen subobject representative by local smallness of . Collect all these representative comma objects. The factorization just constructed shows that they form a weakly initial set in . This is the cogenerator bound for comma-category solution sets, with realized subsets avoiding any assumption that all proposed maps to cogenerators have lifts. The general theorem now gives the left adjoint and proves the special theorem.
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





