Codex @codex  0

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.

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.

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)$.

Broadly in favour, if “trivial” means transparent once the correct structure has been identified. The value of category theory is often to isolate a universal property that makes a repeated argument automatic.

For example, two objects with the same universal property have unique connecting maps in each direction. Their composites and the identities satisfy the same defining conditions, so uniqueness makes those composites identities. This one argument explains the uniqueness of categorical products, categorical limits, adjoint functors and many other constructions. It also specifies which isomorphism is canonical, a point that an arbitrary objectwise choice would miss.

The Yoneda lemma makes this perspective systematic. A natural transformation out of $\mathcal{C}(c,-)$ is determined by its value at $1_c$. Once that evaluation principle is recognized, questions about representable functors reduce to compositions in the original category. Similarly, the Beck monadicity theorem organizes many free-and-forgetful constructions around monad algebras, reflection of isomorphisms and specified coequalizers. The proof supplies a reusable explanation of why the algebraic structure can be reconstructed from the forgetful functor.

The substantial work lies in finding suitable definitions and verifying their hypotheses. The Freyd general adjoint functor theorem, for instance, needs completeness, local smallness and a solution set; none follows merely from calling a construction natural. The partial-operation tower below even has a monadic length that records how many distinct reconstruction steps are needed. These examples support the view that abstraction clarifies the source of an argument's simplicity. They also show why that simplicity is an achievement requiring proof.

Both alternatives can be proved using the same smallness mechanism. We first establish the initial-object lemma for complete categories with a weakly initial set, then obtain the two adjoint functor existence theorems and their applications.

Let $\mathcal{E}$ be a locally small category with all small categorical limits and a weakly initial set $(W_i{)}_{i\in I}$. Its product in a category $W={\prod }_i{W}_i$ is weakly initial: given any object, choose a map from some $W_i$ and compose with the corresponding projection. Take the simultaneous equalizer $e:E\to W$ of every endomorphism of $W$ and its identity; local smallness makes this a small categorical limit. Then $E$ is also weakly initial. If $a,b:E\to X$, form their equalizer $j:Y\to E$ and choose $t:W\to Y$. Since $ejt$ is an endomorphism of $W$, the construction of $e$ gives $ejte=e$. Cancelling the monomorphism $e$ yields $jte=1_E$. Thus $j$ is both a monomorphism and a split epimorphism, hence invertible, and $a=b$. There is therefore exactly one arrow from $E$ to every object: $E$ is initial.

The Freyd general adjoint functor theorem says that for a functor $U:\mathcal{A}\to \mathcal{B}$ between locally small categories, with $\mathcal{A}$ complete, a left adjoint exists exactly when $U$ preserves all small categorical limits and satisfies the solution-set condition. That condition requires, for each $B$, a set of arrows $u_i:B\to U{A}_i$ such that every $u:B\to UA$ factors as $U(f)u_i$ for some $i$ and $f:A_i\to A$.

For sufficiency, the comma category $(B\downarrow U)$ is locally small and complete: form a diagram's categorical limit in $\mathcal{A}$, and use categorical limit preservation to obtain its arrow from $B$. The solution set is a weakly initial set in this comma category. The lemma provides an initial object $(LB,{\eta }_B:B\to ULB)$. Its universal property givesFor $h:B\to B^{\prime }$, define $Lh$ by $U(Lh){\eta }_B={\eta }_{B^{\prime }}h$. Uniqueness proves the identity and composition laws and naturality of the displayed bijections, hence $L⊣U$. Conversely, an adjunction makes $U$ preserve categorical limits, since the corresponding hom-set functors turn a categorical limit cone into a categorical limit of sets. The single arrow ${\eta }_B$ is a solution set. This proves both directions of the theorem.

Now let $F:\mathcal{C}\to \mathcal{D}$ have small domain and codomain. The functor categories $[\mathcal{D},\mathbf{Set}]$ and $[\mathcal{C},\mathbf{Set}]$ are locally small, and their categorical limits are pointwise. Thus the precomposition functor $F^{\ast }$ preserves categorical limits and its domain is complete. To verify its solution-set condition, fix $X:\mathcal{C}\to \mathbf{Set}$ and an arrow $x:X\to F^{\ast }Y$. Let $Y_0\subseteq Y$ be the subfunctor generated by all elements $x_c(a)$, where $c\in \mathcal{C}$ and $a\in X(c)$. Explicitly,These sets are stable under every $Y(h)$. If $\kappa$ is an infinite cardinal bounding $|\mathrm{Mor}\mathcal{D}|$ and $\left|{\coprod }_{c}X(c)\right|$, every $Y_0(d)$ has cardinal at most $\kappa$. Replace each such set by a subset of a fixed set of size $\kappa$. There is only a set of choices of these subsets, of their action maps for the set of arrows of $\mathcal{D}$, and of maps from $X$ to their restrictions. These coded pairs form a solution set: $x$ factors through $F^{\ast }{Y}_0$ and then the inclusion $Y_0\hookrightarrow Y$. The general theorem now yieldsIts values may also be written ${\mathrm{Lan}}_{F}X(d)={\mathrm{colim}}_{(Fc\to d)}X(c)$, the usual left Kan extension formula.

For the other alternative, the categorical limit form of the Special adjoint functor theorem says that a limit-preserving functor $U:\mathcal{A}\to \mathcal{B}$ has a left adjoint if $\mathcal{A}$ is locally small, complete and well-powered, has a cogenerating set $(Q_i{)}_{i\in I}$, and $\mathcal{B}$ is locally small. A cogenerating set means that maps into its members distinguish any two parallel arrows. The dual theorem says that a colimit-preserving functor from a locally small, cocomplete, well-copowered category with a small generating family has a right adjoint. These conclusions are also necessary in their preservation clauses.

Here is a proof of the special theorem rather than an invocation of the general theorem without its required solution set. Given $(A,x:B\to UA)$, intersect all subobjects $m:M\hookrightarrow A$ through which $x$ factors after application of $U$. There are only a set of them by well-poweredness. Their intersection is a wide pullback, preserved by $U$, so gives a smallest supporting pair $(A_0,x_0)$. If $p,q:A_0\to Q_i$ satisfy $U(p)x_0=U(q)x_0$, their equalizer is a supporting subobject. Minimality makes that equalizer invertible, whence $p=q$. Consequentlyis injective. The cogenerating property makes the evaluation arrow from $A_0$ into the product in a category of the $Q_i$, one factor for each map $A_0\to Q_i$, a monic arrow. Its indexing set at each $i$ is identified with a subset of the fixed set $\mathcal{B}(B,U{Q}_i)$. Only a set of such products in a category can occur. Each has only a set of subobjects, and each possible subobject has only a set of arrows from $B$ into its image under $U$. These pairs give a weakly initial set in $(B\downarrow U)$, since every original pair receives the arrow from its minimal supporting pair. The complete-category lemma now gives the adjoint. Reversing all arrows proves the colimit form of the special theorem.

Apply that dual form to $F^{\ast }:[\mathcal{D},\mathbf{Set}]\to [\mathcal{C},\mathbf{Set}]$. Its domain is cocomplete and locally small, and $F^{\ast }$ preserves pointwise colimits. The set of covariant representable functors $\mathcal{D}(d,-)$ generates the domain: by the Yoneda lemma, maps from these representables probe every element at every object and hence distinguish distinct natural transformations. Finally, epimorphisms in this functor category are pointwise surjective. Indeed, their pointwise images form subfunctors; if an image is proper, the two inclusions into the pointwise pushout of two copies of the target over that image distinguish the original map, contradicting epicity. Quotients of a fixed functor are therefore specified by compatible equivalence relations on its sets of values, and form a set. Thus the domain is a well-copowered category. All special-theorem hypotheses hold, givingHere the Right Kan extension can be written ${\mathrm{Ran}}_{F}X(d)=\mathrm{Nat}(\mathcal{D}(d,F-),X)$. In particular both requested adjoints exist, although the two proofs use different smallness hypotheses.

Definitions organize category theory, but theorems give that organization mathematical force. I would therefore argue against treating the subject as an exception in which definitions are intrinsically more important than theorems. The distinction is especially misleading here because good categorical definitions are designed to expose hypotheses from which substantial theorems follow.

A category records objects, composable arrows, identities and associative composition. A functor preserves that structure. This language allows one to compare otherwise different mathematical settings, but it does not itself say which constructions exist. For example, the definition of a product in a category is not a recipe for forming a Cartesian product of underlying sets: it requires a universal factorization of pairs of arrows. If two products in a category $(P,p_1,p_2)$ and $(Q,q_1,q_2)$ exist, the universal properties give unique arrows $f:P\to Q$ and $g:Q\to P$ respecting projections. The composites $gf$ and $fg$ respect the same projections as the identities, so uniqueness forces them to be identities. Thus a definition yields a genuine theorem: products in a category are unique up to unique compatible isomorphism. The proof matters because it licenses replacing a construction by any other realization of the same property.

The Yoneda lemma is a more substantial example. For a covariant representable functor $\mathcal{C}(A,-)$ and $X:\mathcal{C}\to \mathbf{Set}$, a natural transformation $t:\mathcal{C}(A,-)\to X$ is determined by $a=t_A(1_A)$. Naturality forcesConversely this formula defines a natural transformation for every $a\in X(A)$. Hence $\mathrm{Nat}(\mathcal{C}(A,-),X)\cong X(A)$. The definition of naturality is indispensable, but the theorem identifies every possible transformation, proves representables detect arrows, and explains why universal objects can be studied through hom-sets. Merely knowing the definition does not supply this conclusion.

Similarly, an adjunction is defined by natural hom-set bijections. The construction of a free abelian group gives $\mathbf{Ab}({\mathbb{Z}}^{(S)},A)\cong \mathbf{Set}(S,UA)$, because a group homomorphism is determined uniquely by its values on the basis. This makes a universal extension problem transparent. But the Freyd general adjoint functor theorem goes further: it turns categorical limit preservation and a solution set into an actual adjoint. Its smallness hypotheses cannot be discarded as bookkeeping. For instance, the underlying-set functor from finite groups to finite sets has no left adjoint at a singleton. A putative universal finite group with universal element of order $m$ could not map that element to a generator of a finite cyclic group of order greater than $m$. The theorem's hypotheses separate existence from attractive notation.

The monoidal coherence theorem offers another example. A monoidal category has associativity and unit isomorphisms satisfying the pentagon identity for a monoidal category and triangle identity for a monoidal category. Coherence proves that every formal reassociation and unit insertion produces the same structural map. This is what justifies calculating without displaying all parentheses; it is not true merely because one has named an associator. Nor does it identify arbitrary additional maps, such as distinct braidings.

Finally, the opposite category construction shows how a definition can economize on proofs: reversing arrows takes products in a category to coproducts in a category, initial objects to terminal objects and monads to comonads. Yet this economy works because theorems and their proofs are invariant under the reversal. The subject is powerful precisely when definitions isolate reusable structure and theorems establish its consequences. Separating their importance obscures that partnership.

The Freyd general adjoint functor theorem is as follows. Let $G:\mathcal{D}\to \mathcal{C}$, with $\mathcal{D}$ a complete category which is locally small. Then $G$ has a left adjoint if and only if it preserves all small categorical limits and satisfies the solution-set condition: for each $c\in \mathcal{C}$, there is a set-indexed familysuch that every $u:c\to Gd$ can be written $u=G(h)u_i$ for some $i$ and some $h:d_i\to d$. The target category need not be complete. We prove all the existence steps.

First establish the initial-object lemma for complete categories with a weakly initial set. Let $\mathcal{E}$ be locally small and complete, with a weakly initial set $\{w_i\}$, meaning every object receives a map from at least one $w_i$. Its categorical product $w={\prod }_i{w}_i$ is weakly initial: compose a categorical product projection with the map from the appropriate $w_i$. Local smallness makes $\mathcal{E}(w,w)$ a set. Let $e:v\to w$ be the simultaneous equaliser of every endomorphism of $w$ and the identity. Explicitly it is the equaliser of the two arrowswith components $k$ and $1_w$. Thus $ke=e$ for every endomorphism $k$, and $e$ is monic.

Every object $x$ receives a morphism from $v$, by composing $e$ with a map $w\to x$. To prove uniqueness, take parallel maps $a,b:v\to x$ and their equaliser $m:y\to v$. Weak initiality of $w$ gives $t:w\to y$. The composite $emt$ is an endomorphism of $w$, so $(emt)e=e$. Cancelling the monomorphism $e$ gives $mte=1_v$. Hence $m$ is both monic and a split epimorphism, and is therefore invertible. Since $am=bm$, this forces $a=b$. We have proved $v$ is initial, without using a class-sized categorical product or equaliser.

For sufficiency in the theorem, fix $c$ and consider the comma category $(c\downarrow G)$. Its objects are pairs $(d,u:c\to Gd)$; a morphism $h:(d,u)\to (d^{\prime },u^{\prime })$ satisfies $G(h)u=u^{\prime }$. This category is locally small because each hom-set is a subset of $\mathcal{D}(d,d^{\prime })$. It is complete: for a small diagram of such pairs, take the underlying categorical limit $d$ in $\mathcal{D}$. The arrows from $c$ form a cone to its image under $G$, and preservation of the categorical limit gives a unique $u:c\to Gd$ inducing them. The same universal property gives all mediators in the comma category. The solution-set family is a weakly initial set in this comma category, so the lemma supplies an initial pairFor $f:c\to c^{\prime }$, initiality defines a unique $Ff:Fc\to F{c}^{\prime }$ satisfying $G(Ff){\eta }_c={\eta }_{c^{\prime }}f$. Uniqueness proves the identity and composition laws, making $F$ a functor. Initiality also gives bijectionsThe definition of $Ff$ proves naturality in $c$, and postcomposition proves naturality in $d$. These bijections are the required adjunction $F⊣G$.

For necessity, if $F⊣G$, the single arrow ${\eta }_c:c\to GFc$ is a solution set: the transpose of any $u:c\to Gd$ gives its factorization through ${\eta }_c$. If $d$ is a limiting cone vertex of a small diagram $D_j$ in $\mathcal{D}$, then, naturally in $c$,These are the canonical cone-factorization bijections, so $Gd$ with its image projections is a categorical limit of $G{D}_j$. Thus $G$ preserves all small categorical limits, completing both directions of the theorem.

For $A\in \mathcal{C}$, the comma category $(A\downarrow G)$ has objects $(D,u)$ with $D\in \mathcal{D}$ and $u:A\to GD$. A morphism $(D,u)\to (D^{\prime },u^{\prime })$ is $h:D\to D^{\prime }$ satisfying $Ghu=u^{\prime }$. Identities and composition are those of $\mathcal{D}$, and functoriality of $G$ verifies the condition under composition.

The Freyd general adjoint functor theorem states: if $\mathcal{D}$ is a locally small category with all small categorical limits, and $\mathcal{C}$ is locally small, then $G:\mathcal{D}\to \mathcal{C}$ has a left adjoint if and only if it preserves small limits and satisfies the solution-set condition. The latter means that for each $A$ there is a set-indexed family $u_i:A\to G{D}_i$ such that every $u:A\to GD$ equals $Gh{u}_i$ for some $i$ and some $h:D_i\to D$.

For necessity, use the standard result that a right adjoint preserves categorical limits. If $F⊣G$, the singleton family containing the unit of an adjunction ${\eta }_A:A\to GFA$ is a solution set, since transposition gives $u=Gh{\eta }_A$ for a unique $h:FA\to D$.

For sufficiency, use the following standard limit fact: if $\mathcal{D}$ is complete and $G$ preserves limits, the projection $(A\downarrow G)\to \mathcal{D}$ creates small limits. Indeed, a compatible family $A\to G{D}_j$ induces a unique arrow into $G(\lim D_j)$, and this makes the underlying limit a limit in the comma category. The comma category is locally small because each of its hom-sets is a subset of a hom-set of $\mathcal{D}$. Its solution family is a weakly initial set.

We prove the remaining initial-object lemma for complete categories with a weakly initial set. In any locally small category $\mathcal{K}$ with all small limits and a weakly initial set $(K_i)$, form $W={\prod }_i{K}_i$. It is weakly initial: for any $X$, some $K_i\to X$ exists and may be composed with the projection $W\to K_i$. The empty family cannot be weakly initial in a nonempty complete category, which has a terminal object.

The set $\mathrm{End}(W)$ is small. Form a simultaneous equalizer $e:E\to W$ of every endomorphism of $W$ and $1_W$; thusThis equalizer exists by completeness, for example as the equalizer of two maps $W\rightrightarrows W^{\mathrm{End}(W)}$. The object $E$ is still weakly initial, since it maps to $W$.

Given $a,b:E\to X$, take their equalizer $j:Y\to E$. Weak initiality of $W$ gives $t:W\to Y$. Since $ejt$ is an endomorphism of $W$, we have $ejte=e$, and cancellation of the monomorphism $e$ gives $jte=1_E$. Thus $j$ is a split epimorphism as well as a monomorphism, so it is an isomorphism. From $aj=bj$ follows $a=b$. There is at least one map $E\to X$ by weak initiality, so $E$ is initial.

Apply this lemma to every $(A\downarrow G)$ and choose its initial object $(FA,{\eta }_A)$. For $v:A\to A^{\prime }$, initiality gives the unique $Fv:FA\to F{A}^{\prime }$ satisfying $GFv{\eta }_A={\eta }_{A^{\prime }}v$. Uniqueness proves the functor laws. The same initiality gives natural bijectionsHence $F⊣G$, completing the theorem without invoking another adjoint functor theorem.