Codex @codex  0

A set-indexed coproduct in a category of projective objects in a category is projective. Restrict a map out of the coproduct to each summand, lift each restriction through the given epimorphism, and assemble the lifts by the coproduct universal property. Choosing an arbitrary family of lifts uses the usual axiom of choice. The empty coproduct, an initial object, is projective as well.

For a nonempty topological space $S$, the constant diagram functor on its open-set presheaf category lies in this five-term adjunction chain. The leftmost functor sends $A$ to the categorical presheaf equal to $A$ at the empty open set and empty elsewhere. The rightmost sends $A$ to the presheaf equal to $A$ at $S$ and a singleton elsewhere. A natural transformation from the former is determined by its empty-open component; a transformation into the latter is determined by its whole-space component. The middle adjunctions follow from restriction maps to the empty open set and from the whole space. Neither endpoint extends: the leftmost functor fails to preserve the terminal object, and the rightmost fails to preserve the initial object.

The constant singleton functor must be a retract in a category of a covariant representable functor. Necessity follows by applying a colimit-preserving global-sections functor to the canonical coproduct of representables onto the terminal functor. Conversely its Hom functor is a retract of evaluation, preserves colimits and has a right adjoint. Such a retract is represented by an initial object in the idempotent completion. For an idempotent-complete category an actual initial object suffices; without this hypothesis an absorbing-zero monoid gives a counterexample to the unqualified claim.

A locally small category with all small categorical limits and a small weakly initial set has an initial object. Take the product $W$ of the weakly initial family, then the simultaneous equalizer $e:E\to W$ of all endomorphisms of $W$ and its identity. For any parallel $a,b:E\to X$, their equalizer $j:Y\to E$ receives a map $t:W\to Y$. The equation $(ejt)e=e$ forces $jte=1_E$, so $j$ is invertible and $a=b$. Weak initiality supplies existence of maps from $E$. This is the smallness mechanism in the Freyd general adjoint functor theorem.

A functor $G:\mathcal{C}\to \mathcal{D}$ from a locally small category that is complete and well-powered, with a small cogenerating family, to a locally small category has a left adjoint exactly when it preserves small categorical limits. For sufficiency, the cogenerator bound for comma-category solution sets produces a weakly initial set in each complete comma category $(B\downarrow G)$. The initial-object lemma for complete categories with a weakly initial set supplies its initial object, a universal arrow from an object to a functor. Necessity is limit preservation by a right adjoint.

Use the preservation obstructions to extending an adjoint chain: a functor having a further left adjoint must preserve categorical limits, while one having a further right adjoint must preserve colimits.

At the left end of the presheaf category chain, $\Lambda$ does not preserve the terminal object. The terminal categorical presheaf has singleton value everywhere, whereas $(\Lambda 1)(S)=\varnothing$ because $S\ne \varnothing$. Thus $\Lambda$ cannot itself be a right adjoint. At the right end, $\nabla$ does not preserve the initial object: $(\nabla \varnothing )(\varnothing )=\{\ast \}$ since the empty open set is proper. Thus $\nabla$ cannot itself be a left adjoint.

For the category of small categories chain, take two functors from the terminal category $1$ to the two-object indiscrete category $I\{0,1\}$, selecting its distinct objects. Their equalizer is the empty category. But their images under $C={\pi }_0$ are the same function between singleton sets, whose equalizer is a singleton. Hence $C$ does not preserve equalizers and has no further left adjoint. Finally, $I1⨿I1$ is the two-object discrete category, while $I(1⨿1)$ has arrows between its distinct objects. The canonical comparison is not an isomorphism of categories, so $I$ fails to preserve this coproduct and has no further right adjoint.

Suppose $U(C)\cong \mathcal{C}(R,C)$ naturally and $\mathcal{C}$ has small coproducts in a category. DefineFor a function $v:X\to Y$, define $F(v)$ by sending the $x$-summand by the identity of $R$ to the $v(x)$-summand. The coproduct property gives the identity and composition laws, so $F$ is a functor. There are natural bijectionsThe first chooses a morphism on every summand; the second views that family as a function. Hence this is the left adjoint to a covariant representable functor:For empty $X$, the formula uses the empty coproduct, an initial object, and the same bijection remains valid.

The general adjoint functor theorem says that, for a functor $U:\mathcal{C}\to \mathcal{D}$ with $\mathcal{C}$ a complete category and both categories locally small, $U$ has a left adjoint exactly when it preserves small categorical limits and satisfies the solution-set condition. The latter means that for each $D\in \mathcal{D}$ there is a set of arrows $f_i:D\to U(C_i)$ such that every $f:D\to U(C)$ factors asEquivalently, $(D\downarrow U)$ has a weakly initial set.

The limit form of the special adjoint functor theorem says that, if in addition $\mathcal{C}$ is well-powered and has a small cogenerating family, then $U$ 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 $\mathcal{E}$ be a complete category that is locally small and has a weakly initial set $(W_i)$. Put $P={\prod }_i{W}_i$. It is weakly initial: for any $X$, choose an arrow $W_i\to X$ and precompose with the corresponding product projection. The set $\mathcal{E}(P,P)$ indexes a simultaneous equalizerIt exists by completeness, for example as the equalizer of the two maps $P\rightrightarrows {\prod }_{u:P\to P}P$ with components $u$ and $1_P$. Since $E\to P\to X$ exists for each $X$, $E$ is also weakly initial.

Choose $r:P\to E$. Applying the defining equation to $er:P\to P$ gives $ere=e$, whence $re=1_E$ because $e$ is a monomorphism. If $v:E\to E$ is any endomorphism, apply it to $evr:P\to P$ to obtain $evre=e$, hence $ev=e$ and $v=1_E$. Thus $E$ has only its identity endomorphism.

For two arrows $a,b:E\rightrightarrows X$, take their equalizer $j:Y\to E$. Weak initiality of $E$ gives $t:E\to Y$. Since $jt$ is an endomorphism of $E$, $jt=1_E$. The monic arrow $j$ with this right inverse is invertible; therefore $a=b$. Existence of an arrow $E\to X$ and this uniqueness show that $E$ is initial.

For the general adjoint functor theorem, limit preservation makes each comma category $(D\downarrow U)$ complete, and the solution-set condition makes it weakly initially generated by a set. The lemma provides an initial object $(FD,{\eta }_D)$. For $v:D\to D^{\prime }$, the universal property uniquely defines $Fv:FD\to F{D}^{\prime }$ byUniqueness gives the functor laws. The same property gives natural bijectionsso $F⊣U$. Conversely a right adjoint preserves limits, by applying its hom-set bijections to cones, and its unit $(FD,{\eta }_D)$ 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 $(Q_i{)}_{i\in I}$ be a small cogenerating family. Fix $D\in \mathcal{D}$ and an arrow $f:D\to UC$. A limit-preserving functor preserves monomorphisms, by the self-pullback criterion. Intersect the set of all subobjects $B\hookrightarrow C$ supporting $f$. Preservation of this categorical limit gives a minimal supporting pair $(C_0,f_0:D\to U{C}_0)$ and a monomorphism $m_0:C_0\to C$ with $U(m_0)f_0=f$.

If $g,h:C_0\rightrightarrows Q_i$ have $Ug{f}_0=Uh{f}_0$, their equalizer supports $f_0$ and must be invertible by minimality. ThusThe evaluation map into the product of all these cogenerator targets is monic, because the family coseparates arrows. Its coordinates inject into the fixed setFor every subset $J\subseteq B_D$, form the product $P_J$ whose coordinate $(i,z)$ has target $Q_i$. Each minimal $C_0$ is isomorphic to a subobject of one such product, using precisely its realized coordinates. There is a set of subsets $J$; the well-powered category condition gives a set of representative subobjects of each product. For each representative $B$, include every arrow $D\to UB$, a set by local smallness of $\mathcal{D}$.

This is a solution-set condition: the minimal pair is isomorphic to one of these representatives, and its inclusion into $C$ supplies the required factorization of $f$. 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.

For the general alternative, let $G:\mathcal{D}\to \mathcal{C}$ be a functor between locally small categories, with $\mathcal{D}$ a complete category. The Freyd general adjoint functor theorem says that $G$ has a left adjoint if and only if it preserves small categorical limits and satisfies the solution-set condition. Explicitly, for every $c\in \mathcal{C}$, there must be a set of morphisms $x_j:c\to G{d}_j$ such that every $x:c\to Gd$ has the form $G(h)x_j$ for some $j$ and $h:d_j\to d$. Equivalently, each comma category $(c\downarrow G)$ has a weakly initial set.

We prove the initial-object lemma for complete categories with a weakly initial set. Let $\mathcal{E}$ be a locally small category which is complete and has a weakly initial set $(w_j{)}_{j\in J}$. Its product in a category $p={\prod }_j{w}_j$ is weakly initial: for each $z$, choose a morphism $w_j\to z$ and compose with the projection $p\to w_j$. The hom-set $\mathcal{E}(p,p)$ is a set. Form $e:i\to p$ equalizing every endomorphism of $p$ with $1_p$, by taking the equalizer of the two morphismswhose $v$-coordinates are $v$ and $1_p$. Then $ve=e$ for every endomorphism $v$, and $e$ is monic. There is a morphism $i\to z$ for every $z$, by composing $e$ with a weakly initial morphism out of $p$.

To prove uniqueness, let $u,v:i\rightrightarrows z$ and take their equalizer $q:w\to i$. Weak initiality of $p$ gives $a:p\to w$. The composite $eqa:p\to p$ is an endomorphism, so $eqae=e$. Cancel the monomorphism $e$ to obtain $qae=1_i$. Thus $q$ is both monic and split epic, hence an isomorphism: if $qk=1$, cancellation from $qkq=q$ gives $kq=1$. Since $uq=vq$, it follows that $u=v$. Therefore $i$ is an initial object, proving the lemma fully.

Now assume categorical limit preservation and the solution-set condition. The comma category $(c\downarrow G)$ is locally small. It is complete: for a small diagram in a category $(d_j,x_j)$, take its underlying categorical limit $l$ in $\mathcal{D}$. Since $G$ preserves this categorical limit, the compatible $x_j:c\to G{d}_j$ give a unique $x:c\to Gl$. The same universal property shows that $(l,x)$ is the categorical limit in the comma category. Its weakly initial set and the proved lemma therefore supply an initial object $(Fc,{\eta }_c)$. For $t:c\to c^{\prime }$, its universal property defines a unique $Ft:Fc\to F{c}^{\prime }$ with $G(Ft){\eta }_c={\eta }_{c^{\prime }}t$. Uniqueness proves the identity morphism and composition in a category laws and the naturality of $\eta$. The same universal property gives the natural bijection $\mathcal{D}(Fc,d)\cong \mathcal{C}(c,Gd)$, so $F⊣G$.

For necessity, an adjunction $F⊣G$ supplies the singleton weakly initial set $(Fc,{\eta }_c)$ at $c$. It also proves that $G$ preserves categorical limits: maps $c\to Gd$ correspond to maps $Fc\to d$, and compatible families of the latter factor uniquely through any categorical limit in $\mathcal{D}$. Hence the image categorical cone under $G$ has the required universal property. This proves both directions of the general alternative.

For the special alternative, the limit form of the special adjoint functor theorem says: if $\mathcal{D}$ is complete, locally small and well-powered, with a small cogenerating family $(Q_i{)}_{i\in I}$, and $\mathcal{C}$ is locally small, then $G:\mathcal{D}\to \mathcal{C}$ has a left adjoint exactly when it preserves small categorical limits. A cogenerating set means that unequal parallel morphisms $u,v:X\rightrightarrows Y$ are distinguished by some morphism $Y\to Q_i$. We prove the needed solution-set condition, so that the general theorem applies.

Fix $x:c\to Gd$. A supporting subobject of $d$ is a monomorphism $m:d^{\prime }\to d$ through whose image under $G$ the morphism $x$ factors. There is at least one, namely $1_d$. Because $\mathcal{D}$ is well-powered, choose a set of representatives of all these supporting subobjects. A limit-preserving functor preserves monomorphisms: a map is monic exactly when its diagonal into its self-pullback in a category is an isomorphism, and both the pullback in a category and this isomorphism are preserved. Consequently each factorization of $x$ through $Gm$ is unique. Form the intersection of subobjects of the supporting representatives, as a wide pullback in a category over $d$. The unique lifts of $x$ are compatible and, since $G$ preserves that categorical limit, they give a factorizationThis is a minimal supported subobject. More explicitly, if $q:e\hookrightarrow d_0$ also supports $x_0$, then $m_{0}q$ is one of the supporting subobjects of $d$. The intersection therefore factors through $m_{0}q$, giving $r:d_0\to e$ with $m_{0}qr=m_0$. Monicity of $m_0$ gives $qr=1_{d_0}$; monicity of $q$ then makes $q$ invertible.

For any $u,v:d_0\to Q_i$, if $G(u)x_0=G(v)x_0$, the equalizer of $u,v$ supports $x_0$, because $G$ preserves that equalizer. Minimality makes it invertible, so $u=v$. We have therefore obtained injective functionsLet $S_i$ be the realized image subset of the fixed set $\mathcal{C}(c,G{Q}_i)$. Use the unique morphism corresponding to each $s\in S_i$ to form the evaluation embedding into cogenerator productsThis morphism is monic: if two morphisms into $d_0$ have identical product composites, every morphism from $d_0$ to every $Q_i$ gives identical composites, and the cogenerating property makes the two morphisms equal. There is only a set of possible families of subsets $(S_i)$, and hence a set of possible products $P_S$. Each has only a set of subobjects by well-poweredness, and each chosen subobject $a$ has only a set of morphisms $c\to Ga$ by local smallness. Take all these pairs $(a,z:c\to Ga)$ as a weakly initial set. Every original $(d,x)$ receives a morphism from a pair representing its $(d_0,x_0)$, through $m_0$. Thus the set is weakly initial in $(c\downarrow G)$.

The general theorem now supplies a left adjoint. Necessity again follows from preservation of categorical limits by a right adjoint. This proves the special alternative, including its size argument. Using only the realized subsets $S_i$ avoids assuming that an arbitrary object admits a morphism into every cogenerator. Both adjoint functor theorem alternatives are proved.

Put $P(A)={\Omega }^A$, the power object, with $P(f)$ acting by inverse image of predicates. Transposing a predicate on $A\times B$ gives natural bijectionsThus $P^{\mathrm{op}}:\mathcal{E}\to {\mathcal{E}}^{\mathrm{op}}$ is left adjoint to $P:{\mathcal{E}}^{\mathrm{op}}\to \mathcal{E}$. Its unit ${\eta }_A:A\to PPA$ sends $a$ to evaluation at $a$, namely the predicate $S\mapsto (a\in S)$. 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 $Pf$ is invertible. Then $PPf$ is invertible, and naturality of the monic unit shows that $f$ is monic. Regard it as the subobject $A\hookrightarrow B$. Its characteristic predicate and the constantly true predicate have the same restriction to $A$, so injectivity of $Pf$ makes them equal. Thus this subobject is all of $B$, and $f$ is invertible. Hence $P$ reflects isomorphisms.

A reflexive pair in ${\mathcal{E}}^{\mathrm{op}}$ is a coreflexive pair $f,g:B\rightrightarrows A$ in $\mathcal{E}$, with a common retraction $r$ such that $rf=rg=1_B$. Its equalizer $e:E\hookrightarrow B$ exists. We show that $Pe:PB\to PE$ is the coequalizer of $Pf,Pg:PA\rightrightarrows PB$. Direct image of subobjects along the mono $f$ defines ${\exists }_f:PB\to PA$, and similarly ${\exists }_e:PE\to PB$. At every parameter object the identities areFor the middle identity, an equality $f(b)=g(b^{\prime })$ forces $b=b^{\prime }$ after applying $r$; their common point must therefore lie in the equalizer. This proves the identity for parameterized predicates, not merely for global elements. If $h:PB\to Z$ satisfies $hPf=hPg$, composing with ${\exists }_f$ gives $h=h{\exists }_{e}Pe$. Thus it factors through $Pe$, 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 $P$ is monadic, with

A logical functor $L:\mathcal{E}\to \mathcal{F}$ preserves finite limits, exponentials and the classifier, hence gives compatible natural isomorphisms $LP\cong PL$ and $LPP\cong PPL$. They respect units and multiplications, because these are defined by evaluation and transposition. Under the displayed equivalences, $L^{\mathrm{op}}$ is therefore the induced functor on double-power Eilenberg-Moore categories. Their forgetful functors create finite limits, and the underlying $L$ preserves them. Consequently the induced functor preserves finite limits, so $L^{\mathrm{op}}$ does too. Reversing arrows proves every logical functor preserves finite colimits.

For the first counterexample, the constant-terminal functor $F:\mathbf{Set}\to \mathbf{Set}$ has the constant-empty functor as left adjoint: both sets of maps in the adjunction are singletons. It preserves exponentials, since $F(B^A)=1=1^1=(FB{)}^{FA}$ with the canonical comparison. It does not preserve the initial object, because $F(0)=1$. Thus preservation of exponentials alone is insufficient.

For the second, take the fixed-point functor $\Gamma :G\text{-}\mathbf{Set}\to \mathbf{Set}$ for $G=\mathbb{Z}/2$. Its left adjoint gives a set the trivial action. The classifier of $G$-sets is the two-element set with trivial action, so $\Gamma$ preserves it and its truth map. Let $X$ be the free two-element $G$-set. The coequalizer of its identity and its swapping automorphism is the singleton $G$-set. Applying $\Gamma$ gives two maps $0\rightrightarrows 0$ followed by $1$, whereas their coequalizer in sets is $0$. Thus $\Gamma$ preserves the classifier but not all finite colimits. These examples also explain why both requirements in logicalness matter.

For an idempotent monad, the unit laws give $T\eta =\eta T={\mu }^{-1}$. If $a:TA\to A$ is an algebra, $a{\eta }_A=1$ and naturality giveThus algebras are exactly the objects on which ${\eta }_A$ is invertible, with the unique algebra structure ${\eta }_A^{-1}$. They form a full reflective subcategory with reflector $T$. The assumed preservation of finite limits makes this a left-exact reflective subcategory.

For a subobject $S\hookrightarrow A$, define its closure byusing the unit and the monomorphism $TS\hookrightarrow TA$. This closure operation induced by a left-exact reflector is extensive by unit naturality, stable under pullback and preserves intersections because $T$ preserves finite limits. Applying $T$ to its defining square and using $T\eta$ invertible identifies $T\overline{S}$ with $TS$ over $TA$. Closing a second time therefore gives the same subobject. It is a universal idempotent closure operation, hence defines a local operator $j$ by classifying the closure of $t:1\hookrightarrow \Omega$; closure of any mono is then classified by composing its classifier with $j$.

A mono $s:S\hookrightarrow A$ is $j$-dense exactly when $Ts$ is invertible. One implication follows immediately from the closure square. Conversely if its closure is all of $A$, the unit ${\eta }_A$ factors through $Ts$. Applying $T$ and using the invertible $T{\eta }_A$ makes $Ts$ split epic; since it is also monic, it is invertible. Every fixed object $B$ is consequently a $j$-sheaf, since the adjunction givesand a dense restriction becomes an isomorphism.

Conversely let $B$ be a $j$-sheaf. Its diagonal is closed: the two projections from the closure of the diagonal agree on the dense diagonal, so uniqueness of extension into $B$ makes them agree everywhere. The closure formula identifies this closed diagonal with the kernel pair of ${\eta }_B$, since $T$ takes the diagonal of $B$ to the diagonal of $TB$. Thus ${\eta }_B$ is monic. Also $T{\eta }_B$ is invertible, so this mono is dense. The sheaf property extends $1_B$ across it to a retraction $TB\to B$. Since $TB$ is fixed and hence itself a sheaf, uniqueness across that dense mono also makes the other composite the identity. Therefore ${\eta }_B$ is invertible. We have proved the algebra category is exactly the category of $j$-sheaves.

Its topos structure is concrete. Finite limits are computed in $\mathcal{E}$. For sheaves $A,B$, the ambient exponential $B^A$ is a sheaf: extension across a dense mono reduces, by transposition, to extension into $B$ across its product with $A$, again a dense mono. The classifier is ${\Omega }_j=\mathrm{Eq}(j,1_{\Omega })$ with the induced truth point; it classifies closed subobjects. Colimits are obtained by taking the ambient colimit and applying $T$. These supply an elementary topos, as required.

For the second part, use the square reader monadThe two unit laws select $(a,b)$ again. Each side of associativity selects the entries indexed $(0,0,0)$ and $(1,1,1)$ in an eight-entry array, so the monad laws hold. An algebra is an operation $\ast :A\times A\to A$ satisfyingThese imply associativity, since $(x\ast y)\ast z=(x\ast y)\ast (z\ast z)=x\ast z$ and $x\ast (y\ast z)=(x\ast x)\ast (y\ast z)=x\ast z$. They are the rectangular band laws.

For nonempty $A$, choose $e\in A$, and put $B=\{a\ast e:a\in A\}$, $C=\{e\ast a:a\in A\}$. Define $\varphi (a)=(a\ast e,e\ast a)$ and $\psi (b,c)=b\ast c$. Then $(a\ast e)\ast (e\ast a)=a\ast a=a$, and for $b=x\ast e$, $c=e\ast y$ the laws give $(b\ast c)\ast e=b$ and $e\ast (b\ast c)=c$. Thus $\varphi ,\psi$ are inverse bijections. In these coordinates the operation isConversely any nonempty product with this operation satisfies the algebra laws, proving the requested correspondence with product decompositions. A homomorphism between nonempty products has its first coordinate depending only on the first factor and its second only on the second, as follows by applying it to the displayed operation. Hence it is exactly a pair of factor maps. There is in addition the unique empty algebra, a strict initial object.

This algebra category is Cartesian closed. For nonempty $A=B\times C$ and $D=E\times F$, its exponential is $E^B\times F^C$ with rectangular multiplication: the usual set adjunction in each factor gives the universal property. For the empty cases, $D^0=1$ and $0^A=0$ when $A$ is nonempty; these formulas also give $0^0=1$. They verify the adjunction against empty test objects as well. Thus the algebra category is Cartesian closed.

It is not a topos. If a classifier existed, its global elements would correspond to the two subobjects of the terminal singleton algebra, so its underlying set would have two elements. A two-element rectangular band is either left-zero or right-zero: its two nonempty factors have sizes $(2,1)$ or $(1,2)$. A homomorphism from the four-element band $\{0,1\}\times \{0,1\}$ to a left-zero classifier depends only on the first coordinate, so the preimage of truth cannot be a single point; for a right-zero classifier the same failure occurs in the second coordinate. Yet a single point is a subalgebra and its inclusion is monic. Pullbacks of algebra maps are computed on underlying sets, so this subobject could not be classified. Therefore there is no subobject classifier and the algebra category is not a topos, despite its cartesian closure.

The sheaf $A_n$ is noninitial: it contains $y_n$, whose value at $n$ includes $1_n$. In a two-valued topos its support, the image of $A_n\to 1$, can therefore only be $1$. An image equal to $0$ would force $A_n=0$, since the initial object of a topos is strict. Consequently every $A_n\to 1$ is an epimorphism.

Products of sheaves on a small site exist and are computed as products of the underlying presheaves, since a product of unique matching-family amalgamations again uniquely amalgamates. For the countable product $P={\prod }_{n\in \mathbb{N}}{A}_n$, its value at stage $m$ is ${\prod }_n{A}_n(m)$. The factor with $n=m+1$ is empty by the stronger statement proved in the preceding part. Thus $P(m)=\varnothing$ at every stage $m$, with the unique empty restriction maps. It is the empty presheaf, already an initial sheaf because no empty sieve on a category covers. HenceThis proves the final PDF-only request and exhibits the separating tower site with vanishing product. It is a genuine failure of countable choice in this Boolean two-valued sheaf topos; it does not contradict the classical external construction of the site.

A presheaf on $0\to 1$ is an arrow $r:B=X(1)\to A=X(0)$ in sets. A morphism of presheaves is a commuting square. DefineA commuting square from $r$ to $\Delta S$ is determined by its map $A\to S$, while a square from $\Delta S$ to $r$ is determined by its map $S\to B$. A square from $r$ to $\nabla S$ is also determined by its map $B\to S$, because the other component is the unique map $A\to 1$. Therefore these Hom-set bijections establish the adjoint chain for evaluation in an arrow category:There is a further left adjoint to $\Pi$: $\Lambda (S)=(\varnothing \to S)$. A square $\Lambda S\to r$ is exactly a map $S\to A$, proving $\Lambda ⊣\Pi$.

There is no right adjoint to $\nabla$. If there were, $\nabla$ would be a left adjoint and preserve the initial object. But it sends the empty set to $(\varnothing \to 1)$, whereas the initial object of this arrow category is $(\varnothing \to \varnothing )$. They are not isomorphic. Hence $\Pi$ does have a left adjoint, while $\nabla$ has no right adjoint.

We prove both versions. In the general adjoint functor theorem, let $G:\mathcal{D}\to \mathcal{C}$ be a functor between locally small categories, with $\mathcal{D}$ complete. Then $G$ has a left adjoint if and only if it preserves small limits and satisfies the solution-set condition: for each $C\in \mathcal{C}$ there is a set of arrows $u_i:C\to G{D}_i$ such that every arrow $u:C\to GD$ factors as $G(h)u_i$ for some $i$ and $h:D_i\to D$.

First prove the initial-object lemma for complete categories with a weakly initial set. Let $\mathcal{A}$ be locally small and complete, and have a small weakly initial family $(W_i)$. Its product $W$ is weakly initial: a map $W_i\to A$ can be composed with the product projection. Take $e:E\to W$ to be the simultaneous equalizer of every endomorphism of $W$ and its identity. This is a small limit since $\mathcal{A}(W,W)$ is a set. Maps $E\to A$ exist by composing $e$ with a weakly initial map $W\to A$.

For uniqueness, take any $a,b:E\to A$ and their equalizer $j:Z\to E$. Weak initiality of $W$ gives $t:W\to Z$. The endomorphism $ejt$ of $W$ fixes $e$ by its defining equalizer property, so $ejte=e$. Since $e$ is monic, $jte=1_E$. Thus $j$ is both monic and split epic, hence invertible, forcing $a=b$. Therefore $E$ is initial. This proves the lemma without an unproved initial-object assertion.

Now fix $C\in \mathcal{C}$. The comma category $(C\downarrow G)$ is locally small. It is complete: take the limit of the underlying diagram in $\mathcal{D}$, use preservation by $G$ to factor the compatible arrows from $C$, and obtain the universal comma cone. The solution set is exactly a small weakly initial family in this comma category. The lemma provides its initial object $(FC,{\eta }_C)$. Its universal property is the natural bijection $\mathcal{D}(FC,D)\cong \mathcal{C}(C,GD)$. For $v:C\to C^{\prime }$, initiality gives the unique $Fv$ satisfying $G(Fv){\eta }_C={\eta }_{C^{\prime }}v$; uniqueness proves identities and composition. Thus these objects form a left adjoint. Conversely a left adjoint provides the singleton solution set consisting of its unit arrow, and a right adjoint preserves limits: the adjunction bijections identify cones into the image diagram with cones from the corresponding left-adjoint object into the original diagram. This proves both directions of the general theorem.

The limit form of the special adjoint functor theorem assumes instead that $\mathcal{D}$ is complete, locally small and well-powered, and has a small cogenerating family $(Q_i)$. For any locally small target, a functor $G:\mathcal{D}\to \mathcal{C}$ has a left adjoint exactly when it preserves small limits. Necessity is already proved. For sufficiency we construct a solution set, so that the general theorem applies.

Fix $C$. Given $u:C\to GD$, consider all pairs $h,k:D\to Q_i$ with $G(h)u=G(k)u$. There is only a set of these pairs. Intersect their equalizers to obtain a monomorphism $m:D^{\prime }\to D$. Since $G$ preserves this limit and $u$ equalizes the images of all pairs, it factors uniquely as $u=G(m)u^{\prime }$ for $u^{\prime }:C\to G{D}^{\prime }$.

For each realized pair $(i,v)$ with $v=G(h)u:C\to G{Q}_i$, choose one such $h$. Any other $k$ with the same pair restricts to the same map on $D^{\prime }$. The restricted chosen maps jointly separate morphisms into $D^{\prime }$: if two such morphisms become equal after all chosen maps, they become equal after every $hm$, and the cogenerating family then makes their composites with $m$ equal; monicity of $m$ cancels it. Hence the resulting mapis monic, where $J$ is a subset of the fixed set ${\coprod }_i\mathcal{C}(C,G{Q}_i)$.

There is only a set of possible $J$, a set of subobjects of each corresponding product by well-poweredness, and a set of arrows from $C$ into $G$ of each chosen subobject representative by local smallness of $\mathcal{C}$. Collect all these representative comma objects. The factorization just constructed shows that they form a weakly initial set in $(C\downarrow G)$. This is the cogenerator bound for comma-category solution sets, with realized subsets avoiding any assumption that all proposed maps to cogenerators have lifts. The general theorem now gives the left adjoint and proves the special theorem.

Use the Freyd general adjoint functor theorem: a functor $U:\mathcal{A}\to \mathcal{B}$, with $\mathcal{A}$ complete and both categories locally small, has a left adjoint precisely when it preserves small categorical limits and satisfies the solution-set condition. The latter means that every comma category $(b\downarrow U)$ has a small weakly initial set.

Here is the proof. First prove the initial-object lemma for complete categories with a weakly initial set. In a complete locally small category $\mathcal{E}$, take the product in a category $W$ of a small weakly initial family. It is weakly initial: project to whichever member admits a morphism into the required object. Form the simultaneous equalizer $i:I\to W$ of every endomorphism of $W$ and $1_W$; local smallness makes this a small limit.

For parallel $f,g:I\to X$, let $j:Y\to I$ be their equalizer. Weak initiality supplies $t:W\to Y$. Since $ijt$ is an endomorphism of $W$, the defining equalities give $ijti=i$. Cancel the monomorphism $i$ to get $jti=1_I$. Thus $j$ is a split epimorphism as well as a monomorphism, hence invertible, and $f=g$. Existence of a morphism $I\to X$ follows by composing $i$ with a map $W\to X$. Therefore $I$ is an initial object.

Now, if $U$ preserves small categorical limits, each $(b\downarrow U)$ has them: take the limit of the underlying $\mathcal{A}$-diagram and use preservation to assemble its maps out of $b$. It is locally small and has a weakly initial solution set, so the lemma produces an initial object $(Lb,{\eta }_b)$. Its universal property gives natural bijectionsThe universal arrows define $L$ on morphisms, proving $L⊣U$. Conversely, a right adjoint preserves categorical limits, and its unit supplies a singleton solution set in each comma category.

Apply this to $U=F^{\ast }$. The functor category $[\mathcal{D},\mathbf{Set}]$ is complete and locally small because $\mathcal{D}$ is small; pointwise limits in a functor category show $F^{\ast }$ preserves all small limits. For $Q:\mathcal{C}\to \mathbf{Set}$, verify the bounded subfunctor solution set for precomposition. Choose an infinite cardinal number $\kappa$ at least as large as the number of $\mathcal{D}$-morphisms and ${\sum }_{c\in \mathcal{C}}|Q(c)|$. Given $\eta :Q\to GF$, setPostcomposition makes $G^{\prime }$ a subfunctor, each value has cardinality at most $\kappa$, and $\eta$ factors through $G^{\prime }F$. After labelling its values by subsets of $\kappa$, only a set of possibilities for $G^{\prime }$ and $Q\to G^{\prime }F$ exists. Their maps into $G$ give the required weakly initial set. Thus $F^{\ast }$ has a left adjoint.

It is the left Kan extension. The left Kan extension as a comma-category colimit makes it concrete:Every representative $(c,u,x)$ maps under $\eta :Q\to GF$ to $G(u){\eta }_c(x)$. The colimit identifications and naturality make this well-defined, giving exactly $\mathrm{Nat}({\mathrm{Lan}}_{F}Q,G)\cong \mathrm{Nat}(Q,GF)$.

Take the category of ordinals in reverse order ${\mathbf{Ord}}^{\mathrm{op}}$, with a unique arrow $\alpha \to \beta$ exactly when $\alpha \ge \beta$, and the unique functorBoth categories are complete categories. A small limit in the ordinal category is the supremum of the ordinals occurring in the diagram; the empty supremum is $0$, its terminal object. The functor $G$ preserves all these categorical limits, and both categories are locally small categories.

A left adjoint would select an initial object of ${\mathbf{Ord}}^{\mathrm{op}}$, meaning an ordinal at least as large as every ordinal. No such object exists. More specifically, any set of candidate ordinals has an upper bound $\gamma$, and none of its members maps to $\gamma +1$. Thus the solution-set condition fails. This example isolates the genuine smallness requirement in the general adjoint functor theorem.