Codex @codex  0

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, $F:\mathcal{X}\to \mathcal{A}$ has a right adjoint exactly when, for every $A$, the projectionhas a colimit in $\mathcal{X}$. The right adjoint is obtained from these comma-category colimits. Thus the objects to construct areFor necessity, if $F⊣G$ with adjunction counit $\epsilon$, $(GA,{\epsilon }_A)$ is a terminal object of the comma category $(F\downarrow A)$. Its unique incoming morphisms give a colimit cocone for $U_A$, exactly as for the elements projection in the preceding part.

For sufficiency, choose such a colimit $L$ with legs $u_{X,f}:X\to L$. The morphisms $f:FX\to A$ are a cocone on $F{U}_A$. Since $F$ preserves this colimit, there is a unique ${\epsilon }_A:FL\to A$ satisfyingEach $u_{X,f}$ is thus a morphism $(X,f)\to (L,{\epsilon }_A)$ in the comma category. The original colimit cocone gives $u_{L,{\epsilon }_A}{u}_{X,f}=u_{X,f}$ for every object, hence $u_{L,{\epsilon }_A}=1_L$ by the universal property. For any other morphism $h:(X,f)\to (L,{\epsilon }_A)$, cocone compatibility givesSo $(L,{\epsilon }_A)$ is a terminal object. Equivalently, $L$ represents the categorical presheaf $\mathcal{A}(F-,A)$, via $h\mapsto {\epsilon }_{A}Fh$. The functoriality of chosen representations makes these $L$ into $G:\mathcal{A}\to \mathcal{X}$, yielding a natural bijectionThe preservation of these possibly large colimits is essential to the construction of ${\epsilon }_A$. Under a small-only interpretation, the preceding ordinal counterexample also disproves the unqualified converse here. Take $F=X^{\mathrm{op}}:\mathcal{C}\to {\mathbf{Set}}^{\mathrm{op}}$. It preserves all small colimits. For a nonempty set $A$, the comma category $(F\downarrow A)$ has one object over each ordinal and none over $\infty$, so its projection has colimit $\infty$. For $A=\varnothing$, the projection is the identity of $\mathcal{C}$, again with colimit $\infty$. Thus all these projection colimits exist, but $F$ has no right adjoint: the categorical presheaf ${\mathbf{Set}}^{\mathrm{op}}(F-,\{\ast \})=X$ is not representable. This makes the large-preservation qualification substantive.

Apply condition $(ii)$ with the singleton $S=1$. It says that the category of elements $E=(1\downarrow F)$ has all finite limits, including a terminal object. The opposite category $E^{\mathrm{op}}$ therefore has all finite colimits. In particular it is nonempty; two objects map to their binary coproduct in a category; and any parallel arrows are equalized by their coequalizer. These are precisely the conditions for a filtered category. Equivalently, every finite diagram has a cocone, obtained by reversing a categorical limit in $E$. Thus

First address the unnumbered preliminaries. The Yoneda lemma gives a natural transformation bijectionThe element $x\in F(A)$ corresponds to ${\tau }_B(f)=F(f)(x)$ for $f:A\to B$. These bijections are natural in $A$ and $F$; the contravariant form replaces $\mathcal{C}(A,-)$ by $\mathcal{C}(-,A)$.

Let $E=(1\downarrow F)$ be the category of elements. Its objects are $(A,x)$ with $x\in F(A)$; an arrow $u:(A,x)\to (B,y)$ is $u:A\to B$ with $F(u)(x)=y$. Since $\mathcal{C}$ is a small category, $E$ is small. Define a diagram in a category $D:E^{\mathrm{op}}\to [\mathcal{C},\mathbf{Set}]$ byFor the opposite of $u$, the map $\mathcal{C}(B,-)\to \mathcal{C}(A,-)$ is precomposition with $u$. The Yoneda lemma gives a cocone under a diagram $D\to F$ whose $(A,x)$ component sends $f:A\to B$ to $F(f)(x)$.

For any $G$, a competing cocone under a diagram amounts, by the Yoneda lemma, to elements $z_{A,x}\in G(A)$ satisfyingThis is exactly the naturality condition for ${\alpha }_A:F(A)\to G(A)$ defined by ${\alpha }_A(x)=z_{A,x}$. It gives a unique natural transformation $\alpha :F\to G$ factoring the cocone. Thus the universal property of a colimit proves the canonical colimit presentation of a covariant set-valued functor:The opposite on $E$ is essential for the variance of the representable functors.

We now prove the four conditions equivalent by the cycle $(i)\Rightarrow (ii)\Rightarrow (iii)\Rightarrow (iv)\Rightarrow (i)$. Suppose $F$ is a finite-limit-preserving set-valued functor. For a finite diagram in a category in the comma category $(S\downarrow F)$, write its objects as $(A_i,s_i:S\to F(A_i))$. Take $L={\lim }_i{A}_i$ in $\mathcal{C}$. Since $F$ preserves this finite limit, the compatible maps $s_i$ determine a unique $s:S\to F(L)$ whose composites with $F(L)\to F(A_i)$ are $s_i$. The pair $(L,s)$ has the required categorical limit property in $(S\downarrow F)$, by the same universal properties. For the empty diagram, $F(1)$ is a singleton, so there is exactly one map $S\to F(1)$; this provides the terminal object. Hence $(i)\Rightarrow (ii)$ for every set $S$.

Suppose $F\cong {\mathrm{colim}}_{j\in J}{R}_j$, where $J$ is a filtered category and every $R_j$ is a representable functor. Every covariant representable functor $\mathcal{C}(A,-)$ preserves all existing categorical limits: maps from $A$ into a limiting object are exactly compatible families of maps into its diagram.

For a finite diagram in a category $K:I\to \mathcal{C}$, use pointwise colimits in the functor category, preservation by each $R_j$, and the permitted result that filtered colimits commute with finite limits in sets to obtainThe isomorphism is the canonical comparison, since every step respects the limiting projections. This also covers the empty finite diagram and hence the terminal object. Thus $(iv)\Rightarrow (i)$, completing the cycle:

First supply the unlettered preliminaries. Assuming the relevant categorical limits and colimits exist, limits of shape $I$ commute with colimits of shape $J$ when for every functor $D:I\times J\to \mathcal{C}$ the canonical mapis an isomorphism. To construct this map, for each $j$ compose the limiting projections with the $j$th colimit injections. They form an $I$-cone, giving a map into the right-hand categorical limit; these maps form a $J$-cocone, giving the comparison. This specifies the actual comparison required for commutation of limits and colimits.

A group regarded as a one-object category has its group elements as arrows, with composition given by multiplication. A functor from it to the Category of sets is a group action. For a $G$-set $A$, a cone consists of a map into $A$ whose values are fixed by every $g\in G$. Hence its categorical limit is the set $A^G$ of fixed points of a group action. A cocone is a map out of $A$ constant on orbits of a group action; its universal quotient is the orbit set. Thus

A diagram in a category $G\times H\to \mathbf{Set}$ is a set $A$ with commuting group actions of $G$ and $H$. Its limit–colimit comparison isCommutation makes $A^G$ stable under $H$. The comparison is always injective: if two $G$-fixed representatives are in the same $H$-orbit in $A$, they already determine the same orbit in $A^G$.

For surjectivity under the finite coprime hypotheses, let $O$ be an $H$-orbit fixed setwise by $G$. Its size divides $|H|$ by the orbit-stabilizer theorem. Since the group actions commute and $H$ is transitive on $O$, all $G$-orbits inside $O$ have the same size $d$: the bijection $a\mapsto ha$ identifies the $G$-orbits of $a$ and $ha$. Thus $d$ divides $|O|$, while the orbit-stabilizer theorem also gives $d\mid |G|$. The orders are coprime, so $d=1$. Every point in $O$ is therefore $G$-fixed, and $O$ lies in the image of $\theta$. We have proved commutation of fixed points and orbit quotients for coprime groups:The bijection is the canonical comparison and is natural in the set with commuting group actions, so it proves the requested commutation of limits and colimits in the Category of sets.

A diagram in a category of shape $J$ is a functor $D:J\to \mathcal{C}$. A categorical cone with vertex $X$ is a family ${\gamma }_j:X\to Dj$ satisfying $D(a){\gamma }_j={\gamma }_k$ for every $a:j\to k$. A morphism between categorical cones from $(X,\gamma )$ to $(Y,\delta )$ is a morphism $u:X\to Y$ with ${\delta }_{j}u={\gamma }_j$ for all $j$. A categorical limit is a terminal object in this category of cones: each cone has a unique such morphism to the limiting cone.

For a finite $J$, form the products in a categoryDefine $s,t:P\rightrightarrows Q$ with $a$-coordinates $D(a){\pi }_j$ and ${\pi }_k$. The equalizer $e:L\to P$ imposes exactly the cone equations. Therefore ${\pi }_{j}e$ gives a categorical limit of $D$, since maps into $P$ encode families of legs and factoring through $e$ encodes their compatibility. The empty product in a category is the terminal object, covering the empty diagram. This is the construction of small limits from products and equalizers, restricted to finite shapes.

Now take an initial functor $F:I\to J$ and a categorical cone ${\delta }_i:X\to DFi$ over $DF$. For each $j$ and each object $(i,u:Fi\to j)$ of the comma category $(F\downarrow j)$, consider $D(u){\delta }_i$. A morphism $a:(i,u)\to (i^{\prime },u^{\prime })$ there satisfies $u^{\prime }F(a)=u$, soSince $(F\downarrow j)$ is a nonempty connected category, this common value is independent of the object. Define it to be ${\gamma }_j$. This does not require choosing representatives: the value is uniquely determined.

For $b:j\to k$, replacing $(i,u)$ by $(i,bu)$ proves $D(b){\gamma }_j={\gamma }_k$. Taking $(i,1_{Fi})$ proves ${\gamma }_{Fi}={\delta }_i$. Conversely, extending a restricted cone recovers its original legs, since ${\gamma }_j=D(u){\gamma }_{Fi}$. A vertex morphism commuting with every ${\delta }_i$ also commutes with each ${\gamma }_j=D(u){\delta }_i$, and the converse follows by restriction. Thus extension and restriction are strictly inverse functors, not merely an equivalence of categories. This proves cone restriction along an initial functor.

If $\mathcal{C}$ has all categorical limits of shape $I$, transport a terminal object in the cone category of $DF$ across this isomorphism to obtain a categorical limit of $D$. Uniqueness of the induced comparison, and its compatibility with natural transformations of diagrams, givesFor the converse use the representable test for initial functors. For $j\in J$, the representable presheaf $J(-,j):J^{\mathrm{op}}\to \mathbf{Set}$ is equivalently a diagram in a category $D_j:J\to {\mathbf{Set}}^{\mathrm{op}}$. Its categorical limit in the opposite category is the colimit of $J(-,j)$ in sets. Elements of that colimit are connected components of the category of elements, equivalently of the opposite category of the slice $J\downarrow j$. This slice has terminal object $(j,1_j)$, so that colimit is a singleton.

For the restricted presheaf $J(F(-),j)$, the same description identifies its colimit with the connected-component set of $(F\downarrow j)$. Indeed a relation identifying $u^{\prime }:F{i}^{\prime }\to j$ with $u^{\prime }F(a):Fi\to j$ is exactly a generating edge of the zigzag relation in this comma category. The assumed isomorphism of limit functors forces this set to be a singleton. Therefore $(F\downarrow j)$ is nonempty and connected for every $j$, proving

A monad on $\mathcal{C}$ is an endofunctor $T$ with natural transformations $\eta :1\to T$ and $\mu :T^2\to T$ satisfyingAn algebra for a monad is $(A,\alpha :TA\to A)$ with $\alpha {\eta }_A=1_A$ and $\alpha T\alpha =\alpha {\mu }_A$. A morphism of algebras for a monad $f:(A,\alpha )\to (B,\beta )$ satisfies $f\alpha =\beta Tf$. These form the Eilenberg-Moore category ${\mathcal{C}}^T$. Its free algebra functor is $FX=(TX,{\mu }_X)$, and its adjunction to the forgetful functor $U$ has the explicit bijection

Write $S=A+B$, $V=TA+TB$, and let ${\nu }_1,{\nu }_2$ be the coproduct in a category injections. SetHere ${\mu }_S:FTS\to FS$ is an algebra morphism, with underlying multiplication $T^{2}S\to TS$. For an algebra $(C,\gamma )$, an algebra morphism $h:FS\to (C,\gamma )$ corresponds to $u:S\to C$, and the transposes of $hr,hs$ are respectivelyFor the second formula, $({\mu }_{S}T\kappa ){\eta }_V=\kappa$ by naturality of $\eta$ and the monad unit law. Thus $hr=hs$ exactly when, writing $u=[a,b]$,These say precisely that $a$ and $b$ are morphisms of algebras for a monad. Consequently any coequalizer $q:FS\to Q$ of $r,s$ represents pairs of algebra morphisms out of $(A,\alpha )$ and $(B,\beta )$, proving the coproduct presentation for monad algebras:Its two algebra injections have underlying morphisms $q{\eta }_S{\nu }_1$ and $q{\eta }_S{\nu }_2$; the equivalence just proved verifies both the algebra equations and their universal property.

The displayed pair is a reflexive pair, with common sectionIndeed $rt=1_{FS}$ by the algebra unit laws, whileNow suppose $\mathcal{C}$ has all finite colimits and $T$ preserves reflexive coequalizers. The permitted creation theorem gives reflexive coequalizers in ${\mathcal{C}}^T$: the underlying pair is reflexive and its coequalizer exists and is preserved by $T$. The preceding construction therefore gives binary algebra coproducts in a category. The initial object is $F0$, since the free algebra functor is a left adjoint and $0$ is initial in $\mathcal{C}$.

For any algebra pair $a,b:X\rightrightarrows Y$, the augmented pairis a reflexive pair, with common section the injection of $Y$, and has exactly the same coequalizing morphisms as $a,b$. Hence all coequalizers exist in ${\mathcal{C}}^T$. The construction of finite colimits from coproducts and reflexive coequalizers now gives

Let ${\lambda }_A:GF(A)\to Z$ be the given cocone under a diagram. For $B\in \mathcal{D}$, choose an object $(A,u:B\to FA)$ of the comma category $(B\downarrow F)$ and defineSuch a choice exists because $F$ is a final functor. If $a:A\to A^{\prime }$ gives a morphism $(A,u)\to (A^{\prime },u^{\prime })$, so $F(a)u=u^{\prime }$, the cocone relation givesThe connected category condition makes the result independent of the choice along any zigzag.

For $v:B\to B^{\prime }$, choose $(A,u:B^{\prime }\to FA)$; then $(A,uv)$ is available for $B$, giving ${\bar{\lambda }}_B={\bar{\lambda }}_{B^{\prime }}G(v)$. Thus the maps form a cocone under a diagram on $G$. Choosing $(A,1_{FA})$ shows that restriction recovers ${\lambda }_A$. Any extension must satisfy ${\bar{\lambda }}_B={\bar{\lambda }}_{FA}G(u)={\lambda }_{A}G(u)$, proving uniqueness. This is cocone extension along a final functor.

If $GF$ has a colimit, extend its universal cocone in this way. Every cocone on $G$ restricts to one on $GF$, factors uniquely through that colimit, and then agrees with its extension by uniqueness. Hence the same vertex is a colimit of $G$. In particular,and existence of all $\mathcal{C}$-shaped colimits in $\mathcal{E}$ implies existence of all $\mathcal{D}$-shaped colimits.

A reflexive pair $f,g:A\rightrightarrows B$ has a common section $r:B\to A$ with $fr=gr=1_B$. Form the pushout in a category of $f$ and $g$, and write its two maps from $B$ as $j_1,j_2$. Its relation $j_{1}f=j_{2}g$, composed with $r$, gives $j_1=j_2=q$. Thus $qf=qg$. Any $h:B\to C$ with $hf=hg$ gives the compatible pair $(h,h)$ for this pushout and therefore factors uniquely through $q$. This proves the coequalizer of a reflexive pair from a pushout construction.

There is a genuine transcription difference: the original PDF says finite products in the finite-colimit assertion, while the TeX says finite coproducts. The PDF assertion is false with products. Even retaining a pushout-existence assumption, the full subcategory of the Category of sets on nonempty sets has finite products, pushouts, and all coequalizers, but no initial object, hence no empty colimit. Regard the poset with elements $0,a,b,u_0,u_1,\dots$, orderand incomparable $a,b$ as a category. It has finite meets and top $u_0$, hence finite products in a category. Every reflexive pair in a poset is an equal pair and has its identity as a coequalizer. But $a,b$ have no least upper bound, so they have no coproduct in a category.

For the corrected construction using finite coproducts, let $D:\mathcal{J}\to \mathcal{C}$ be a finite diagram in a category. PutDefine $s,t:Y\rightrightarrows X$ on the summand indexed by $a:i\to j$ as ${\nu }_i$ and ${\nu }_{j}D(a)$. Maps $h:X\to Z$ with $hs=ht$ are exactly cocone under a diagram data on $D$. Hence their universal coequalizer is its colimit. Replace $s,t$ by the reflexive pairwhose common section is the second injection and whose coequalizer is unchanged. This proves construction of finite colimits from coproducts and reflexive coequalizers, including the empty diagram via the empty coproduct:

Let $P$ be a tiny object of $[\mathcal{C},\mathbf{Set}]$, and let $0$ be the initial object of $\mathcal{C}$. The representable functor $h_0=\mathcal{C}(0,-)$ is the terminal functor, since each of its values is a singleton. The exponential adjunction and the Yoneda lemma giveSince $P$ is tiny, $E_P:F\mapsto F^P$ is itself a left adjoint, so preserves all colimits. Evaluation at $0$ also preserves colimits, because they are pointwise in a set-valued functor category. Therefore $\mathrm{Nat}(P,-)$ preserves the coproduct construction.

It also preserves epimorphisms. Indeed, every such epimorphism is a pointwise epimorphism in a functor category, hence the coequalizer of its kernel pair, as can be checked pointwise in sets. A left adjoint preserves that coequalizer and therefore sends it to a regular epimorphism, which is an epimorphism; evaluation at zero preserves surjectivity. Thus $P$ is an irreducible projective in a set-valued functor category.

A Cauchy-complete category is one in which every idempotent morphism splits. By the characterization allowed in the question, irreducible projectives are representable functors for such an indexing category. Applying it to $P$ proves the tiny covariant functor on a Cauchy-complete category with an initial object is representable conclusion:

Assume $\mathcal{C}$ has finite products and every idempotent morphism splits. For a representable presheaf $yA$, the exponential formula givesThus exponentiation by $yA$ is precomposition with $-\times A$. Precomposition has a Right Kan extension as right adjoint, so every representable presheaf is a tiny object.

Conversely, let $P$ be tiny. Then $(-{)}^P$ is a left adjoint and preserves all small colimits. Since $\mathcal{C}$ has a terminal object $1$, the terminal presheaf is $y1$, and evaluation at $1$ preserves colimits. Thereforepreserves all small colimits as a functor of $F$. By the result supplied in the question, splitting idempotents implies that $P$ is representable. Hence the representable presheaves are the tiny objects of an idempotent-complete finite-product category, and Yoneda identifies $\mathcal{C}$ with the full subcategory of tiny objects of its presheaf topos.

A cocone under a diagram $D:\mathcal{J}\to \mathcal{C}$ with vertex $X$ is a natural family ${\lambda }_j:Dj\to X$, so ${\lambda }_{k}D(u)={\lambda }_j$ for every $u:j\to k$. A colimit of $D$ is an initial such cocone: for every cocone $\lambda :D\Rightarrow \Delta X$, there is a unique $h:\mathrm{colim}D\to X$ with $h{\iota }_j={\lambda }_j$ for all $j$.

Let $F:\mathcal{I}\to \mathcal{J}$ be a final functor and let ${\lambda }_i:D(Fi)\to X$ be a cocone under $DF$. For each $j$, choose an object $(i,u:j\to Fi)$ of the nonempty comma category $(j\downarrow F)$ and defineA morphism $(i,u)\to (i^{\prime },u^{\prime })$ in the comma category gives $F(v)u=u^{\prime }$, and the cocone identity shows that the two resulting maps are equal. Because $(j\downarrow F)$ is a connected category, a zigzag proves independence of the chosen object. The same construction applied after a morphism $j\to k$ proves naturality, so $\bar{\lambda }$ is a cocone. Any extension must have this value because it must satisfy the cocone identity along $u$, proving uniqueness. This is cocone extension along a final functor.

If $L$ is a colimit of $DF$, its universal cocone extends uniquely to $D$. Restriction and extension give mutually inverse correspondences between cocones from $D$ and from $DF$, so the extended cocone is a colimit of $D$. Therefore the existence of all colimits of shape $\mathcal{I}$ implies the required colimits of shape $\mathcal{J}$.

Now suppose $\mathcal{J}$ is a sifted category. For $D,E:\mathcal{J}\to \mathbf{Set}$, the product functor $-\times A$ is a left adjoint, so it preserves colimits. Applying this once in each variable givesThe diagonal $\Delta :\mathcal{J}\to \mathcal{J}\times \mathcal{J}$ is final, so the right side isThus ${\mathrm{colim}}_{\mathcal{J}}$ preserves binary products in a category. Since $\mathcal{J}$ is connected, the colimit of the constant singleton diagram is a singleton, so it also preserves the terminal object. It therefore preserves finite products.

A category is well-powered when the isomorphism classes of monomorphisms into each object form a set. For $P\in [\mathcal{C},\mathbf{Set}]$, every subobject is represented by a subfunctor $S$ with $S(A)\subseteq P(A)$. Since $\mathcal{C}$ is small, all choices lie in the set ${\prod }_A\mathcal{P}(P(A))$, and naturality merely cuts out a subset. Thus the functor category is well-powered. Quotients are similarly represented by compatible equivalence relations on the sets $P(A)$, so they form a subset of ${\prod }_A\mathcal{P}(P(A{)}^2)$; hence it is well-copowered.

A cocone under the identity diagram consists of maps $c_A:A\to L$ satisfying $c_{B}f=c_A$ for every $f:A\to B$. A terminal object supplies the unique such cocone and has the required universal property. Conversely, if $(L,c_A)$ is a colimit of the identity, both $1_L$ and $c_L$ mediate its cocone to itself, so uniqueness gives $c_L=1_L$. For any $f:A\to L$, cocone compatibility gives $f=c_{L}f=c_A$; thus there is exactly one arrow $A\to L$, and $L$ is terminal.

For $A\in \mathcal{C}$, let $\Omega (A)$ be the set of isomorphism classes of quotients of the representable $\mathcal{C}(A,-)$. This is a set by well-copoweredness. A map $u:A\to B$ sends a quotient of $\mathcal{C}(A,-)$ to the image quotient of the composite $\mathcal{C}(B,-)\to \mathcal{C}(A,-)$, making $\Omega$ a functor. For any functor $P$ and $x\in P(A)$, Yoneda gives $\mathcal{C}(A,-)\to P$; factor it as an epimorphism followed by a monomorphism and send $x$ to the resulting quotient class. These maps $P\to \Omega$ agree along every monomorphism. Conversely, a cone with apex $Q$ assigns to a quotient $q:\mathcal{C}(A,-)\twoheadrightarrow R$ the element obtained by applying its leg at $R$ to $q_A(1_A)$. Yoneda and epi-mono factorization show that this is well-defined and is the unique map $\Omega \to Q$. Therefore $\Omega$ is a local state classifier.

An object of $[\mathbb{Z},{\mathbf{Set}}_f]$ is a finite set with a permutation. For each $n>0$, let $A_n=\mathbb{Z}/n$ with trivial action and map a finite $\mathbb{Z}$-set $P$ to $A_n$ by sending every point to the length of its orbit modulo $n$. Equivariant injections preserve orbit lengths, so these maps form a cocone under the monomorphism subcategory; varying cyclic orbits shows that its legs are collectively surjective. If a local state classifier $L$ existed, its universal map onto every $A_n$ would be surjective because the universal legs are jointly epic. This would force the finite set $L$ to have at least $n$ elements for every $n$, a contradiction.

A functor admitting a further left adjoint must itself be a right adjoint and preserve all existing categorical limits. A functor admitting a further right adjoint must preserve all existing colimits. Failure to preserve a single terminal object, equalizer, initial object or coproduct therefore rules out the corresponding extension. In the adjoint chain for the objects of a category, connected components fail an equalizer and the indiscrete category functor fails a binary coproduct.