The general adjoint functor theorem says that, for a functor with a complete category and both categories locally small, has a left adjoint exactly when it preserves small categorical limits and satisfies the solution-set condition. The latter means that for each there is a set of arrows such that every factors as
Equivalently, has a weakly initial set.
The limit form of the special adjoint functor theorem says that, if in addition is well-powered and has a small cogenerating family, then has a left adjoint exactly when it preserves small limits. These are the limit/left-adjoint forms; their duals interchange limits with colimits, left with right adjoints, and cogenerators with generators.
For the first route, let be a complete category that is locally small and has a weakly initial set . Put . It is weakly initial: for any , choose an arrow and precompose with the corresponding product projection. The set indexes a simultaneous equalizer
It exists by completeness, for example as the equalizer of the two maps with components and . Since exists for each , is also weakly initial.
Choose . Applying the defining equation to gives , whence because is a monomorphism. If is any endomorphism, apply it to to obtain , hence and . Thus has only its identity endomorphism.
For two arrows , take their equalizer . Weak initiality of gives . Since is an endomorphism of , . The monic arrow with this right inverse is invertible; therefore . Existence of an arrow and this uniqueness show that is initial.
For the general adjoint functor theorem, limit preservation makes each comma category complete, and the solution-set condition makes it weakly initially generated by a set. The lemma provides an initial object . For , the universal property uniquely defines by
Uniqueness gives the functor laws. The same property gives natural bijections
so . Conversely a right adjoint preserves limits, by applying its hom-set bijections to cones, and its unit is already an initial object of each comma category, hence a singleton solution set. This proves necessity as well as sufficiency.
For the second route, assume the general adjoint functor theorem and the additional hypotheses of the Special adjoint functor theorem. Let be a small cogenerating family. Fix and an arrow . A limit-preserving functor preserves monomorphisms, by the self-pullback criterion. Intersect the set of all subobjects supporting . Preservation of this categorical limit gives a minimal supporting pair and a monomorphism with .
If have , their equalizer supports and must be invertible by minimality. Thus
The evaluation map into the product of all these cogenerator targets is monic, because the family coseparates arrows. Its coordinates inject into the fixed set
For every subset , form the product whose coordinate has target . Each minimal is isomorphic to a subobject of one such product, using precisely its realized coordinates. There is a set of subsets ; the well-powered category condition gives a set of representative subobjects of each product. For each representative , include every arrow , a set by local smallness of .
This is a solution-set condition: the minimal pair is isomorphic to one of these representatives, and its inclusion into supplies the required factorization of . The general adjoint functor theorem now gives the left adjoint. This is the cogenerator bound for comma-category solution sets proof of the special theorem. Necessity follows again because a right adjoint preserves limits. Both alternative proof routes are therefore supplied.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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