Write and , with adjunction counit . The induced monad has and . Define the Eilenberg-Moore comparison functor by
The action satisfies by a triangular equation. Naturality of at gives
Applying yields , the other algebra identity. For , naturality gives
so is a monad algebra morphism. Identities and compositions are respected because is a functor. Finally,
and the same equalities hold on morphisms. Thus both comparison identities hold, strictly when is the specified induced monad:
For the monad define the free algebra functor by
The unit and associativity identities of the monad make an algebra for a monad, and naturality of makes a morphism of algebras for a monad. Let be the forgetful functor. For in the Eilenberg-Moore category, set
The inverse candidate is a monad algebra morphism, since
The two composites are identities:
These use respectively the unit law for a monad algebra, the algebra-morphism equation, and a unit identity of the monad. The formulas commute with precomposition in and postcomposition by monad algebra morphisms, so they form a natural bijection. Therefore the free-algebra functor is left adjoint to forgetting:
Its adjunction unit is , and its adjunction counit at is .
Let exhibit a reflective subcategory, with reflector , and let be a small diagram in a category. Completeness of gives a categorical limit of . For every , the universal property of this categorical limit and the reflection adjunction give
The composite is precomposition with , so satisfies the hom-set condition from the preceding part. Its proof of invertibility of did not require repleteness. Thus whether or not the chosen full reflective subcategory is replete.
Transport the ambient limit cone along . Its legs lie in the full subcategory, and their ambient universal property, restricted to objects of , is exactly the internal categorical limit property. Hence every small diagram in the reflective subcategory has a limit:
For a replete subcategory, the ambient limit object itself belongs to . This argument includes the empty diagram and requires no limit-preservation hypothesis on the reflector.
Write , , with adjunction unit and adjunction counit . The adjunction gives
For , precomposition with followed by this bijection gives
by the triangle identities for an adjunction. Thus is fully faithful exactly when precomposition with is bijective for every .
A morphism with this property is an isomorphism. Surjectivity for target supplies with . Since , injectivity for target gives . Conversely, precomposition with an isomorphism is always bijective. Applied to every , this proves the fully faithful right-adjoint criterion:
When the adjunction counit is invertible, the inverse to is explicitly .
It is enough to prove the solution-set condition and then apply the general adjoint functor theorem. Fix and a morphism . We will factor it through one object in a set depending only on .
First construct a minimal supported subobject. Among the subobjects for which for some , include and take their intersection . This is a small intersection, by well-poweredness. It exists by completeness as the categorical limit of the diagram consisting of these monomorphisms into . Its map to is a monomorphism: two maps with the same composite to have equal projections to every , since each is monic, and are then equal by the categorical limit property. One can equivalently construct these intersections by pullbacks in a category and small products in a category, using stability of monomorphisms under pullback in a category.
Choose the factorizations . They form a compatible categorical cone into the image diagram under , all with common composite to . Preservation of small categorical limits yields with . If is another subobject through which factors after applying , then is among the original supported subobjects. The intersection property gives with . Since is monic, ; since is monic, also . Thus every supported subobject of is invertible.
For each member of the small cogenerating family, consider
This map is injective. If , preservation of the equalizer of makes factor through the image of that equalizer. Minimality makes its inclusion an isomorphism, so .
Write ; it is a set by local smallness of . Let be the image of . For each , there is exactly one corresponding . These maps define the evaluation embedding into cogenerator products
It is a monomorphism: if and , cogeneration supplies some distinguishing ; that is one of the projections of , a contradiction. The product is small. It is important to use the subfamilies , since some missing coordinate in need not correspond to a morphism out of .
There are only a set of possible families . For each such family form , choose a set of representatives of its subobjects, and take all pairs . Local smallness of and well-poweredness make their union a set. In the case just constructed, identifies with one chosen representative . Transporting to and composing the inverse identification with gives a factorization of the original through that pair. Therefore these pairs form a weakly initial set in .
The general adjoint functor theorem now supplies a left adjoint to . Conversely, a right adjoint preserves small categorical limits, either by the adjunction hom-set bijections and the hom-set detection of categorical limits, or directly from their universal properties. Hence the stated special theorem is proved in both directions.
A small cogenerating family , with a set, distinguishes unequal parallel morphisms by postcomposition: for , some has . Being well-powered means that the subobjects of each object form a set up to the usual equivalence of monomorphisms. These hypotheses make the solution-set condition automatic.
The dual formulation uses a cocomplete category, being a well-copowered category and having a small generating family, and concludes that every small-colimit-preserving functor has a right adjoint.
The general adjoint functor theorem has the following limit form. Let be a functor, where is a complete category and both categories are locally small. Then has a left adjoint exactly when it preserves small limits and satisfies the solution-set condition.
The solution-set condition requires that, for each , there be a set of pairs such that every factors as
Equivalently, each comma category has a weakly initial set. All completeness and preservation requirements here concern small categorical limits. Dually, a small-colimit-preserving functor from a cocomplete category has a right adjoint precisely when each has a weakly terminal set.
The right-adjoint criterion using comma-category colimits is as follows. Under the given colimit-preservation hypothesis, with preservation including the possibly large colimits below, has a right adjoint exactly when, for every , the projection
has a colimit in . The right adjoint is obtained from these comma-category colimits. Thus the objects to construct are
For necessity, if with adjunction counit , is a terminal object of the comma category . Its unique incoming morphisms give a colimit cocone for , exactly as for the elements projection in the preceding part.
For sufficiency, choose such a colimit with legs . The morphisms are a cocone on . Since preserves this colimit, there is a unique satisfying
Each is thus a morphism in the comma category. The original colimit cocone gives for every object, hence by the universal property. For any other morphism , cocone compatibility gives
So is a terminal object. Equivalently, represents the categorical presheaf , via . The functoriality of chosen representations makes these into , yielding a natural bijection
The preservation of these possibly large colimits is essential to the construction of . Under a small-only interpretation, the preceding ordinal counterexample also disproves the unqualified converse here. Take . It preserves all small colimits. For a nonempty set , the comma category has one object over each ordinal and none over , so its projection has colimit . For , the projection is the identity of , again with colimit . Thus all these projection colimits exist, but has no right adjoint: the categorical presheaf is not representable. This makes the large-preservation qualification substantive.
Use the orientation and . An adjunction is equivalently specified by the natural transformations
called the unit and counit of an adjunction, satisfying the triangle identities for an adjunction
The corresponding natural bijection is , with and inverse . The two triangular equations are the required compatibility conditions. No proof of equivalence of the formulations is needed here.
Regard the bifunctor as . Its pointwise categorical limit satisfies
with its action on morphisms obtained by the construction in part (a). Applying the limit-preservation result from part (d) gives
The comparison isomorphism is canonical relative to the chosen categorical limit cones: it is the unique morphism identifying all the projections to . This proves commutation of iterated categorical limits, including an empty or . Equivalently, both iterated constructions have the universal property of the categorical limit of on .
For every , the preceding part identifies the composite with the covariant representable functor . A covariant representable functor preserves every existing categorical limit, since a morphism into a categorical limit is the same as a compatible family of morphisms into the diagram objects. The limit functor preserves limits. The hom-set detection of categorical limits gives
In particular, it preserves all small categorical limits. They exist in : compute each one at every using completeness of , and use the uniqueness of the pointwise mediating morphisms to obtain its functor structure and universal natural transformations. Another expression of the same result is the adjunction .
The representing object in the functor category is the constant diagram in a category . If is the chosen categorical limit cone, the natural bijection is
A natural transformation from the constant diagram in a category is precisely a categorical cone with vertex , and its inverse is the unique mediating morphism from the universal property of the categorical limit. For , the defining equations for show that postcomposition by corresponds to postcomposition by on the right. This establishes naturality in and proves representability by the constant diagram.

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