Assume the coequalizers from part (b) exist and write them . The underlying arrow of the comparison-adjunction unit is
We first relate it to the monad algebra action. Naturality of , the coequalizer equation and a monad unit law give
In , is itself a split coequalizer of . Indeed,
For an explicit universal-property proof, if satisfies , then obeys
Its uniqueness follows by composing any equation with .
Now equalizes and . If it is a coequalizer, then and are coequalizers of the same pair. Their unique comparison map is , since , and is therefore invertible. Conversely, if is invertible, is an isomorphic copy of the coequalizer , so it is a coequalizer too.
The forgetful functor reflects isomorphisms: if an monad algebra morphism has an inverse as an underlying arrow, the equation rearranges to , making that inverse an monad algebra morphism. Thus underlying invertibility here is exactly invertibility of the unit component. For all monad algebras together, the comparison-adjunction unit criterion is
Equivalently, the necessary-and-sufficient conditions for a left adjoint with invertible unit are existence of the coequalizers in part (b) and their preservation by . No preservation of arbitrary coequalizers is required.
For each algebra for a monad , consider the specific pair in
Then the exact condition is
Each pair is reflexive, with common section : the two composite identities follow from and . Thus existence of all reflexive coequalizers is sufficient, but the displayed specified pairs give the necessary-and-sufficient condition.
To prove it, take and its adjoint transpose . The transpose of is , by naturality of . The transpose of is
Moreover counit naturality and a triangle identity give
Because transposition is bijective, the coequalizing equation is therefore equivalent to
The right side says exactly that is a monad algebra morphism.
For sufficiency, choose a coequalizer for every monad algebra. Its universal property and the equivalence just proved give natural bijections
To see explicitly that the chosen objects form a functor, an monad algebra morphism makes coequalize the pair for : use and naturality of the counit. Hence there is a unique with . Uniqueness proves its identity and composition laws and the naturality of the displayed bijections. Thus .
Conversely, suppose with unit . Transpose its underlying arrow through to obtain . Since the unit is an monad algebra morphism, the equivalence above shows that coequalizes the specified pair. Any coequalizing transposes to an monad algebra map , which factors uniquely through the unit by . Transposing back gives a unique factorization of through . Thus is the required coequalizer. This proves both directions of the Left adjoint to the Eilenberg-Moore comparison functor criterion.
With , unit and multiplication , the Eilenberg-Moore comparison functor is
Here is the monad algebra action, and the underlying functor satisfies . The triangle identities and counit naturality provide the monad algebra laws and the compatibility of , as required for this definition.
Define the free algebra functor by
The monad laws say precisely that defines an monad algebra structure on , while naturality of makes an monad algebra morphism. We construct the adjunction explicitly.
For an monad algebra and a morphism , put . It is an monad algebra morphism because
Conversely, from an monad algebra morphism obtain . These operations are inverse: naturality of and the monad algebra unit law give
and the algebra-morphism equation together with the monad unit law gives
The formulas commute with precomposition in and composition with monad algebra morphisms in , so the bijections are natural. Therefore the free-forgetful Eilenberg-Moore adjunction is
Its unit is and its counit at is the monad algebra action .
Write the adjunction unit as and the adjunction counit as . Define the monad induced by an adjunction by
with unit . Naturality of makes a natural transformation.
The triangle identities for an adjunction give the two unit laws:
For associativity, apply naturality of to the arrow in :
Applying yields
Thus the induced data satisfy all the monad laws, rather than merely supplying an endofunctor and two transformations.
A monad on consists of an endofunctor and natural transformations and satisfying, at every object ,
These are the unit and associativity laws for the unit and multiplication of a monad.
An algebra for a monad is a pair with satisfying
A monad algebra morphism is a morphism with . Identities satisfy this condition, and composing two such maps preserves it by functoriality of . The resulting Eilenberg-Moore category is denoted . Its forgetful functor sends to and leaves the underlying arrows unchanged.
For a categorical presheaf on the open subsets, define the functors on objects by
To prove , a natural transformation must satisfy
for every open , since the restrictions of are identities. Thus it is determined by the function . Conversely such a function defines all by that equation, and the categorical presheaf restriction laws make the components compatible. Hence
For the other adjunction, a transformation is determined by its component , since
Every function supplies compatible components by this formula. Therefore , giving the adjoints to constant presheaves on open sets:
These are adjoints of the stated constant-presheaf functor, with its value at every open set including the empty one; no sheafification is involved.
For , define
Both are monotone maps . For ,
so direct image is a left adjoint to inverse image. Also,
so the fiberwise universal condition gives the right adjoint. Therefore
An empty fiber satisfies the universal condition vacuously, so every point outside belongs to , regardless of . This is essential when is not surjective.
Since the hom-sets in these categories are either empty or singleton, an adjunction is precisely the condition
The hom-set bijections are then the unique possible ones, and naturality is automatic. This is a Galois connection between the two posets.
Equivalently, the monotone functions satisfy the unit and counit inequalities and . The equivalence implies these by taking and . Conversely, if the inequalities hold, implies , while implies .
By the canonical colimit presentation of a presheaf, write
with structure maps . Since is a 0-presentable object, the canonical map
is bijective. Every element of a set-valued colimit has a representative in some component. In particular is the image of a transformation for some , so
Thus is a retract of . The representable retract criterion from part (c), using the assumed equalisers in , now gives is representable. Only existence of the representative of is needed; no stronger uniqueness-of-factorization assertion about individual colimit injections has been assumed.
Use 0-presentable object in the specified sense: its hom-functor preserves all small colimits. For a representable , the Yoneda lemma identifies this hom-functor with evaluation at . Given any small diagram , pointwise colimits give
These are the canonical comparison bijections, including for an empty diagram. Therefore every representable presheaf is 0-presentable, or a small projective object in this sense.
By part (b), is the equaliser of and . Full faithfulness of the Yoneda embedding writes for a unique endomorphism . Choose an equaliser of and in .
For each , the maps are precisely the maps with . Thus is the pointwise equaliser of and , hence their equaliser in the presheaf category. Both and have the same universal property, so their vertices are isomorphic. This proves the representable retract criterion:
The equations give , so equalizes and . If satisfies , put . Then . If is another such factorization, applying gives . This proves
In particular the inclusion in a retract in a category is a monomorphism.
The Yoneda embedding sends to the representable presheaf . On a morphism , it sends a map to , giving .
The Yoneda lemma states that for every categorical presheaf there is a bijection, natural in both variables,
Its inverse sends to the transformation . Apply it to to obtain
Under this bijection corresponds exactly to , so the map induced by the embedding on each hom-set is bijective. Therefore the Yoneda embedding is full and faithful.
The Yoneda embedding preserves categorical products: for any , maps correspond naturally to pairs of maps and . Hence . Using the exponential in a presheaf category, the Yoneda lemma and the exponential universal property in gives
Every bijection is natural in , since it is given by precomposition or the natural exponential adjunction. Thus these component bijections are a natural isomorphism of categorical presheaves:
A Cartesian closed category has finite categorical products and, for every , an exponential object with an evaluation morphism such that composition with evaluation gives natural bijections
Finite categorical products in the presheaf category are pointwise; in particular its terminal object is the constant singleton categorical presheaf. For categorical presheaves define
For , restriction sends to . Composition and identity laws follow from those of the Yoneda embedding, so this is a categorical presheaf.
Define evaluation at by . For , naturality of gives , which is the evaluation of the restricted pair. Hence evaluation is a natural transformation.
Given , its currying sends to the transformation whose component at is
Naturality in follows from that of , and naturality in follows by composing with the relevant arrow. Evaluating at recovers . Conversely, if , naturality of along says that evaluating at gives . Thus currying the evaluation of recovers . These constructions are inverse and natural, proving the universal property. This is the exponential in a presheaf category, and proves the presheaf category is Cartesian closed.
Write . The category of elements of a categorical presheaf has objects with ; a morphism is satisfying . It is a small category because is small and each is a set. Consider the diagram sending to and to the natural transformation given by postcomposition with .
There is a canonical cocone with
Functoriality makes it a natural transformation, and the equation makes these transformations a cocone.
To prove its universal property, let be any categorical presheaf with a compatible cocone . Define
For and , compatibility with the arrow gives
Thus is natural. Naturality of each shows . Conversely any transformation with these equations must have the displayed values , so it is unique. We have proved the canonical colimit presentation of a presheaf:
Let be the unique arrow to the terminal object of . Define
This is a functor into the slice category , because , and . The terminal object of this slice is , exactly , so preserves the terminal object.
The composite preserves pullbacks by hypothesis, and reflects pullbacks by part (b). Part (a), restricted to the pullback shape, therefore shows that preserves pullbacks. The allowed finite-limit criterion now gives that preserves all finite categorical limits, and hence equalisers. Since preserves equalisers, their composite does too. Thus
This is equalizer preservation by pullback-preserving functors. The factorization supplies terminal-object preservation only in the slice; none is asserted for the original .
Write an object of the slice category as . Its morphisms are arrows in commuting with these structure maps, and the forgetful functor removes the structure map.
Suppose a square in the slice becomes a pullback square in , with vertex . Given a compatible pair of slice arrows and , the underlying pullback gives a unique with the required projection equations. If is one projection, then
where is the structure map. Thus is automatically a slice morphism, and underlying uniqueness gives uniqueness in the slice. Hence reflects pullbacks.
Now let be an equaliser of slice arrows . Consider any underlying arrow with . Give the structure map . Then is a slice arrow into , and the slice equaliser gives a unique with . Conversely any underlying with that equation automatically obeys , so there are no additional factorization possibilities outside the slice. Therefore has the ordinary equaliser universal property in . This proves preserves equalisers.
Take any limiting cone in of the given shape. Since preserves such categorical limits, the cone is limiting in . It is the image under of the cone in . Reflection by therefore says that is limiting in . Since this works for every diagram and every limiting cone of the specified shape, preserves categorical limits of that shape.

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