Write the adjunction unit and adjunction counit of as . Its induced monad is , with multiplication . The Eilenberg-Moore comparison functor is
The unit law for is , a triangle identity for an adjunction. Naturality of at gives ; applying gives . Naturality at gives the monad algebra morphism equation for . Thus is well-defined.
For each , consider the fork in
It commutes by the naturality equation just used. Its image under is the fork of the preceding question, with parallel morphisms and final map . It is split using and . By the assumed reflection, is the coequalizer of this pair in .
For faithfulness, if for , naturality gives . A coequalizer is an epimorphism, so .
For fullness, let be a monad algebra morphism. Thus satisfies . Set . We verify explicitly that equalizes the two morphisms of the displayed fork. The monad algebra morphism equation gives
Naturality of first at and then at gives
The coequalizer therefore supplies a unique with . Applying yields . The map is split epic with section , so cancellation gives . This proves fullness, and the earlier cancellation proves faithfulness. Hence
No claim that is essentially surjective is needed; that stronger conclusion needs the corresponding existence hypotheses.
For , a functor-split coequalizer pair is a parallel pair such that its image admits a split coequalizer in . In one orientation this means morphisms , and satisfy
These equations prove that is a coequalizer: if , then , so factors ; uniqueness follows from . They remain true under every functor, making a split coequalizer an absolute colimit.
To say that reflects such coequalizers means that any fork in whose image is a split coequalizer is itself a coequalizer in . This is a reflection assertion about an existing fork; it does not by itself require lifting every split fork from , or creating its splitting maps in .
Let . A categorical end is an object with morphisms satisfying, for every ,
It is universal among such families: any satisfying the same equations is uniquely for one . This is a universal dinatural transformation from the constant value , and is written .
Dually a categorical coend is with morphisms satisfying
Any family satisfying these equations is uniquely for one . Write . For small , the categorical end can be constructed as the equalizer of when these objects exist. The categorical coend is the coequalizer of when those objects exist. The two morphisms impose exactly the displayed equations for a dinatural transformation.
A regular category has finite limits, factorizations of every arrow as a regular epimorphism followed by a monomorphism, and pullback-stable regular epimorphisms. Equivalently one may require coequalizers of kernel pairs and pullback stability of the resulting quotients. A regular epimorphism is a coequalizer of some parallel pair; an extremal epimorphism is an epimorphism such that , with monic, forces to be invertible.
First, every regular epimorphism is extremal without assuming regularity of the whole category. Suppose coequalizes and . Since is monic, , so the universal property gives with . Then ; cancellation of the epimorphism gives . Monicity of now gives , so is an isomorphism. Conversely, in a regular category, factor an extremal as with regular epic and monic. Extremality makes invertible, so is regular epic. Thus covers and regular epimorphisms coincide.
For a counterexample, work in the category of small categories, which has finite limits constructed on objects and arrows. Let be two disjoint walking arrows and . Let be the walking isomorphism, with two objects and inverse arrows , . Define by , , , . These images generate all of , so two functors agreeing after agree everywhere; thus is epic.
A monic functor is injective on objects and faithful, as tested by functors from the terminal category and from the walking arrow. If factors through such a functor , its image contains both objects and both arrows . Faithfulness forces their lifted composites to be the identities, so the image contains every arrow of and is an isomorphism. Hence is extremal.
It is not regular. Its kernel pair identifies the endpoint pairs and but has no relation forcing the composites of the images of to be identities. Concretely, send all four objects to the one-object category with endomorphism monoid , , and send both to . This functor equalizes the kernel pair: corresponding identities agree, and the only nonidentity arrow pairs in the kernel pair are an arrow paired with itself. It cannot factor through , because images of would have to be inverse, whereas . In a category with kernel pairs, every regular epimorphism is the coequalizer of its kernel pair: its original coequalized pair factors through that kernel pair, giving the universal property. Therefore is an extremal but nonregular epimorphism, the promised nonregular extremal epimorphism in the category of categories.
Put , the power object, with acting by inverse image of predicates. Transposing a predicate on gives natural bijections
Thus is left adjoint to . Its unit sends to evaluation at , namely the predicate . This unit is monic: two generalized elements having the same evaluation on all predicates agree by testing the singleton predicate of the first, or equivalently its graph in the relevant parameter product.
We verify a sufficient form of Beck's monadicity theorem: a right adjoint is monadic if it reflects isomorphisms and its domain has, and it preserves, coequalizers of reflexive pairs. Suppose is invertible. Then is invertible, and naturality of the monic unit shows that is monic. Regard it as the subobject . Its characteristic predicate and the constantly true predicate have the same restriction to , so injectivity of makes them equal. Thus this subobject is all of , and is invertible. Hence reflects isomorphisms.
A reflexive pair in is a coreflexive pair in , with a common retraction such that . Its equalizer exists. We show that is the coequalizer of . Direct image of subobjects along the mono defines , and similarly . At every parameter object the identities are
For the middle identity, an equality forces after applying ; their common point must therefore lie in the equalizer. This proves the identity for parameterized predicates, not merely for global elements. If satisfies , composing with gives . Thus it factors through , and the last displayed identity gives uniqueness. This proves that power objects turn coreflexive equalizers into coequalizers. All hypotheses of the monadicity criterion have now been checked, so is monadic, with
A logical functor preserves finite limits, exponentials and the classifier, hence gives compatible natural isomorphisms and . They respect units and multiplications, because these are defined by evaluation and transposition. Under the displayed equivalences, is therefore the induced functor on double-power Eilenberg-Moore categories. Their forgetful functors create finite limits, and the underlying preserves them. Consequently the induced functor preserves finite limits, so does too. Reversing arrows proves every logical functor preserves finite colimits.
For the first counterexample, the constant-terminal functor has the constant-empty functor as left adjoint: both sets of maps in the adjunction are singletons. It preserves exponentials, since with the canonical comparison. It does not preserve the initial object, because . Thus preservation of exponentials alone is insufficient.
For the second, take the fixed-point functor for . Its left adjoint gives a set the trivial action. The classifier of -sets is the two-element set with trivial action, so preserves it and its truth map. Let be the free two-element -set. The coequalizer of its identity and its swapping automorphism is the singleton -set. Applying gives two maps followed by , whereas their coequalizer in sets is . Thus preserves the classifier but not all finite colimits. These examples also explain why both requirements in logicalness matter.
Let . An end of a functor is an object with maps satisfying for every , universal among all such families. Thus every compatible family with vertex factors uniquely through . Write it as . These are the wedge equations for a dinatural transformation from a constant functor to .
Dually, a coend of a functor is an object with maps satisfying as maps from , universal among compatible families with a common target. Write it as . These are cowedge equations, and every cowedge to factors uniquely through .
For small , if the needed products and equalizers exist, the end is the equalizer of . If the needed coproducts and coequalizers exist, the coend is the coequalizer of . The two arrows in each construction are precisely the two sides of the compatibility equation. This explains both the mixed variance and the universal property, rather than treating the integral notation as an ordinary numerical integral.
For , define the Eilenberg-Moore comparison functor
The algebra unit law is a triangle identity. Naturality of the counit at gives its algebra associativity law; naturality at gives , making an algebra morphism.
Suppose first that reflects G-split coequalizers. For every , consider the counit presentation
It equalizes the pair by counit naturality. After applying it becomes , with parallel maps . This is split: take and . The identities , and follow from the algebra law, a monad unit law, and naturality of . Reflection therefore makes a coequalizer in .
For faithfulness, if then naturality gives . Coequalizers are epic, so .
For fullness, let be an algebra morphism, so . Put . Its two composites with the counit-presentation pair are equal: by counit naturality they are and . Hence there is a unique with . Applying gives . Since is split epic, . This proves full faithfulness directly by descent.
Conversely suppose is full and faithful. We need the following explicit algebra lifting fact. For algebra morphisms with a split underlying coequalizer , the arrow equalizes . The split diagram is preserved by , so is their coequalizer and there is a unique with . Precomposing the unit equation with the epimorphism gives ; precomposing the associativity equation with the epimorphism gives equality by . Thus is an algebra action. If an algebra map equalizes , its unique underlying factor satisfies . Cancelling shows . This proves monad algebra forgetful functor creates split coequalizers.
Now take any existing equalizing arrow in whose image is such a coequalizer. The lifting fact makes the unique compatible action on its already given action , since preserves that action. Hence is a coequalizer of in the algebra category. For any arrow equalizing the pair, its unique algebra factor lifts to an arrow by fullness of ; faithfulness gives its factorization equation and uniqueness. Therefore is a coequalizer in . We have proved the full comparison and reflection of split coequalizers equivalence