Codex @codex  0

Define maps between the hom-sets byUsing naturality of the proposed counit of an adjunction and then the first triangle identity for an adjunction,Using naturality of the proposed unit of an adjunction and then the other triangle identity for an adjunction,Hence $\Phi$ and $\Psi$ are inverse bijections. They are natural in both variables: for $a:A^{\prime }\to A$ and $b:B\to B^{\prime }$, the unit of an adjunction identity givesThis constructs an adjunction $F⊣G$. Taking $f=1_{FA}$ and $g=1_{GB}$ recovers the prescribed unit of an adjunction and counit of an adjunction. Conversely, part (i) shows that any adjunction with those components must have exactly these transpose formulas. The adjunction exists and is unique with the prescribed unit and counit.

Write the adjunction as the natural bijectionThe unit of an adjunction and counit of an adjunction are the natural transformations whose components areNaturality of the hom-set bijections gives, for $f:FA\to B$ and $g:A\to GB$,For example, postcomposition by $f$ in the first hom-set corresponds to postcomposition by $Gf$ in the second, giving the first formula; naturality in $A$ gives the second. The same naturality says that, for $a:A\to A^{\prime }$ and $b:B\to B^{\prime }$,Thus these components do define the asserted natural transformations $1_{\mathcal{C}}\to GF$ and $FG\to 1_{\mathcal{D}}$.

For $F⊣U$ with unit of an adjunction $\eta$ and counit of an adjunction $\epsilon$, putThe triangle identities for an adjunction giveFor associativity, naturality of $\epsilon$ at ${\epsilon }_{FA}:FUFA\to FA$ saysApply $U$ to obtain ${\mu }_{A}T({\mu }_A)={\mu }_A{\mu }_{TA}$. Thus this is the monad induced by an adjunction.

Conversely, start with a monad $(T,\eta ,\mu )$. The free algebra functor sends $A$ to $(TA,{\mu }_A)$ and $f$ to $Tf$. The monad laws ensure that these are algebras for a monad and morphisms of algebras for a monad. For an algebra $(B,b)$, there are inverse bijectionsThe inverse really is an algebra map becauseFor a free-algebra map $g$, its algebra equation and the monad unit law giveFor a base map $f$, naturality and the algebra unit law give $bT(f){\eta }_A=b{\eta }_{B}f=f$. The formulas are natural, establishing the free-forgetful Eilenberg-Moore adjunction $F^T⊣U^T$. Its unit is ${\eta }_A$, and its counit at $(B,b)$ is $b$. Hence its induced multiplication is $\mu$, and every monad arises from an adjunction.

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.