Codex @codex  0

A poset $P$ becomes a category with the elements of $P$ as objects and exactly one morphism $x\to y$ when $x\le y$, with no morphism otherwise. Reflexivity supplies the identity morphisms and transitivity supplies composition in a category; uniqueness of morphisms proves associativity. A functor $f:P\to Q$ is exactly a monotone function: it must send $x\le y$ to $f(x)\le f(y)$, and this condition suffices because all the required morphisms are unique. Antisymmetry says that isomorphic objects of this category are equal.

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.

The Yoneda embedding is the functor $H_{\bullet }:\mathcal{C}\to [{\mathcal{C}}^{\mathrm{op}},\mathbf{Set}]$ sending $A$ to $H_A=\mathcal{C}(-,A)$ and $f:A\to B$ to postcomposition, $(H_f{)}_U(h)=fh$. Composition and identities are preserved by associativity and the identity laws in $\mathcal{C}$.

Apply the Yoneda lemma with $X=H_B$. It gives a bijection $\mathrm{Nat}(H_A,H_B)\cong \mathcal{C}(A,B)$. The inverse sends $f$ precisely to $H_f$, since $H_B(h)(f)=fh$. Hence every transformation between the representables comes from exactly one morphism of $\mathcal{C}$. This proves that $H_{\bullet }$ is a full and faithful functor.

Choose a limit $L_j$ for each diagram $F(-,j)$, with legs $p_{i,j}:L_j\to F(i,j)$. For an arrow $v:j\to j^{\prime }$, the maps $F(1_i,v)p_{i,j}$ form a cone over $F(-,j^{\prime })$, since the two-variable functor respects the commuting arrows in $I\times J$. The limit property therefore gives a unique arrow $L(v):L_j\to L_{j^{\prime }}$ satisfyingThe arrows $L(1_j)$ and $1_{L_j}$ have identical composites with all projections, so they are equal. The same uniqueness shows $L(v^{\prime }v)=L(v^{\prime })L(v)$. Hence the assignment extends to a functor $L:J\to \mathcal{D}$.

For the chosen limit objects and cones it is uniquely determined, literally, by these equations. Changing the choices gives a unique family of isomorphisms between the limits compatible with their projections; the equations above show that this family is a natural isomorphism of the resulting functors. Thus it is unique up to a unique cone-compatible natural isomorphism, not independent of choices as an equality of objects.

For a small diagram $F:I\to \mathcal{D}$ in a locally small category, define its cone functor on ${\mathcal{D}}^{\mathrm{op}}$ bywhere $\Delta A$ is the constant diagram. Precomposition acts on cone vertices. A categorical limit is a representation of this functor: an object $L$ with natural bijections $\mathcal{D}(A,L)\cong {\mathrm{Cone}}_F(A)$. The image of $1_L$ is the universal cone, and the inverse bijection supplies the unique mediating arrow for every cone. Thus the representable functor formulation and the usual terminal-cone universal property coincide.

The categorical commutation of iterated categorical limits theorem is the following. For small categories $I,J$ and a two-variable functor $F:I\times J\to \mathcal{D}$, if the two collections of inner limits and their outer limits exist, then there are canonical isomorphismsIn particular all these limits exist if $\mathcal{D}$ has all $I$-shaped and all $J$-shaped limits. The isomorphisms are natural in $F$ and uniquely characterized by preserving every projection to $F(i,j)$.

Part (iii) proves that each iterated limit represents the functor of cones on the product diagram, with the same flattened projections. Two such representations have unique inverse cone-compatible arrows, proving the isomorphisms. For a natural transformation $F\to F^{\prime }$, the two composites in any naturality square have the same product-diagram projections, hence agree by limit uniqueness. This proves naturality as well. Completeness of $\mathcal{D}$ is a convenient sufficient hypothesis, rather than a necessary one for this individual diagram.

For fixed $U$, the categorical coend on the right is the quotient of ${\coprod }_W\mathcal{C}(U,W)\times X(W)$ by the identificationsDefine ${\Phi }_U([h,x])=X(h)x$. This is well defined because the contravariant functor law gives $X(fh)x=X(h)X(f)x$. Its proposed inverse sends $y\in X(U)$ to $[1_U,y]$. The composite to $X(U)$ is the identity. In the other direction the coend relation, applied with $f=h$ and initial map $1_U$, gives $[h,x]=[1_U,X(h)x]$. Thus the inverse is genuine andFor $a:U^{\prime }\to U$, the coend map replaces $h$ by $ha$; its image is $X(ha)x=X(a)X(h)x$, proving naturality in $U$. A morphism of presheaves acts on $x$ and commutes with every $X(h)$ by naturality, proving naturality in $X$. This is the density formula for presheaves.

Let $T:{\mathcal{C}}^{\mathrm{op}}\times \mathcal{C}\to \mathcal{D}$. An end of a functor is an object $E$ with maps $e_C:E\to T(C,C)$ satisfying $T(1_C,f)e_C=T(f,1_D)e_D$ for every $f:C\to D$, universal among all such families. Thus every compatible family with vertex $A$ factors uniquely through $E$. Write it as ${\int }_{C}T(C,C)$. These are the wedge equations for a dinatural transformation from a constant functor to $T$.

Dually, a coend of a functor is an object $Q$ with maps $i_C:T(C,C)\to Q$ satisfying $i_{C}T(f,1_C)=i_{D}T(1_D,f)$ as maps from $T(D,C)$, universal among compatible families with a common target. Write it as ${\int }^{C}T(C,C)$. These are cowedge equations, and every cowedge to $A$ factors uniquely through $Q$.

For small $\mathcal{C}$, if the needed products and equalizers exist, the end is the equalizer of ${\prod }_{C}T(C,C)\rightrightarrows {\prod }_{f:C\to D}T(C,D)$. If the needed coproducts and coequalizers exist, the coend is the coequalizer of ${\coprod }_{f:C\to D}T(D,C)\rightrightarrows {\coprod }_{C}T(C,C)$. 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.

Let $D(S)$ be the discrete category on $S$, and $I(S)$ the indiscrete category, with exactly one morphism between each ordered pair of objects. A functor $D(S)\to \mathcal{A}$ is precisely a map $S\to O(\mathcal{A})$; a functor $\mathcal{A}\to I(S)$ is precisely a map $O(\mathcal{A})\to S$. Thus $D⊣O⊣I$.

Let $C(\mathcal{A})={\pi }_0\mathcal{A}$ be the set of connected components, where objects are related by finite zigzags of morphisms in either direction. A functor $\mathcal{A}\to D(S)$ must take the endpoints of every morphism to the same point, so it is exactly a map ${\pi }_0\mathcal{A}\to S$. This gives the adjoint chain for the objects of a categoryIt cannot extend to the left. The two functors from the terminal category to $I(\{0,1\})$ selecting distinct objects have empty equalizer in $\mathbf{Cat}$. Applying $C$ gives two identical maps between singleton sets, whose equalizer is a singleton. Thus $C$ does not preserve equalizers and cannot be a right adjoint.

It cannot extend to the right either. The coproduct of two copies of $I(1)$ in $\mathbf{Cat}$ is the discrete two-object category. But $I(1⨿1)$ is the indiscrete two-object category, with morphisms between its distinct objects. They are not isomorphic, or even equivalent. Hence $I$ does not preserve binary coproducts and cannot be a left adjoint. Neither end of this chain has a further 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.