The Adjoint Functor Theorem

RAPL settles one direction: a functor with a left adjoint preserves limits. The converse is harder. Limit preservation alone is not enough (the unique functor $B \to 1$ always preserves limits but has a left adjoint only when $B$ has an initial object), yet when $B$ has all limits and $G$ preserves them, a left adjoint exists under mild extra conditions. The results giving those conditions are the adjoint functor theorems, all of the shape:¹

B complete, G : B \to A, plus further conditions ⟹ (G has a left adjoint \leftrightarrow G preserves limits) .

The forward implication is RAPL. The backward one manufactures an adjoint out of limits.

Universal arrows and comma categories

By the universal-arrow description of adjunctions, $G : B \to A$ has a left adjoint if and only if for every $A \in A$ the comma category $(A \Rightarrow G)$ (objects are pairs $(B, f : A \to G (B))$ , maps are maps of $B$ making the triangle commute) has an initial object. The initial object is the unit component $η_{A} : A \to GF (A)$ , and the values $F (A)$ assemble into the left adjoint. So the entire problem reduces to:

produce an initial object of (A \Rightarrow G) for every A \in A .

The target of every adjoint functor theorem: an initial object of the comma category, i.e. a unit map

u_{A}

(the component

η_{A}

in the prose) through which every

f : A \to G (B)

factors by a unique map

g : F (A) \to B

B

The ordered-set case

For ordered sets there is no obstruction. Limits in an ordered set are meets, so completeness means every subset has a meet, and a map preserves limits when it preserves the meets that exist.²

The ordered-set theorem:

F (a)

is the meet of every

b

with

a \leq G (b)

, the least element of the subset

{b : a \leq G (b)}

B

A special case is a classical fact of order theory. Take $A = 1$ ; then $G$ preserves meets automatically, and a left adjoint is a least element of $B$ . The theorem says a poset with all meets has a least element, and more generally all joins, since the join of a subset is the meet of its upper bounds, literally its least upper bound.³

The size obstruction

Copying the ordered-set proof into an arbitrary category, the candidate left adjoint at $A$ is the limit of the projection functor

F (A) = lim P_{A}, P_{A} : (A \Rightarrow G) \to B, (B, f) \mapsto B,

the categorical version of the meet of everything $G$ sends above $A$ . If this limit exists in $B$ and $G$ preserves it, the formula does give a left adjoint. The trouble is size. Completeness of $B$ supplies only small limits, but when $B$ is a large category the comma category $(A \Rightarrow G)$ is typically large too, so $lim P_{A}$ is a large limit that nothing guarantees. Demanding that $B$ have all large limits is useless (essentially no such categories exist), and restricting to small $B$ is also useless: a small category with all small limits is forced to be a complete preorder, so nothing beyond the ordered-set theorem would be gained.⁴

Each adjoint functor theorem imposes a condition under which the large limit can be replaced by a small one. The general theorem uses the weakest such condition.

Weak initiality drops the uniqueness half of initiality and compensates by allowing a whole set of sources. Applied to the comma category $(A \Rightarrow G)$ , a weakly initial set is nothing but the classical solution-set condition: a set of maps $f_{i} : A \to G (B_{i})$ through which every map $A \to G (B)$ factors as $G (t) \circ f_{i}$ for some $i$ . The existence of a weakly initial set is a size restriction on $C$ , comparable to a finiteness condition in algebra.

Proof of GAFT

The core case is $A = 1$ , where the theorem asserts that a complete, locally small category with a weakly initial set has an initial object. The key step mirrors the poset picture: to find the least element of a complete poset one need not meet all elements, only the elements of a weakly initial subset.⁵

The candidate initial object is the limit

0

of the weakly initial set; its projections

p_{S}

compose with a witnessing map

j : S \to C

to reach any object

C

Regard the weakly initial set $S$ as a full subcategory. It is small (local smallness bounds the hom-sets), so the inclusion $S ↪ C$ has a limit cone $(p_{S} : 0 \to S)_{S \in S}$ . The claim is that this vertex $0$ is initial.

Existence. For $C \in C$ , weak initiality gives some $S \in S$ and $j : S \to C$ ; then $j \circ p_{S} : 0 \to C$ .
Uniqueness. Let $f, g : 0 \to C$ and form their equalizer $i : E \to 0$ . Weak initiality gives $S \in S$ and $h : S \to E$ . The endomorphism $ih p_{S} : 0 \to 0$ satisfies, for every $S^{'} \in S$ , $p_{S^{'}} \circ (ih p_{S}) = (p_{S^{'}} ih) \circ p_{S} = p_{S^{'}} = p_{S^{'}} \circ 1_{0},$ using that the $p_{S^{'}}$ form a cone. Since limit cones are jointly monic, $ih p_{S} = 1_{0}$ . Now $f$ and $g$ both factor through the equalizer along this identity: $f = f ih p_{S} = g ih p_{S} = g$ .

Uniqueness in the lemma: the equalizer of

f

and

g

absorbs a weakly initial object, producing an endomorphism of the limit vertex that the cone forces to be the identity.

The general case reduces to the lemma through two transfers.

Comma categories inherit completeness. When $G$ preserves limits, each projection $P_{A} : (A \Rightarrow G) \to B$ creates limits: a diagram in $(A \Rightarrow G)$ is a diagram $E$ in $B$ together with a cone on $G \circ E$ with vertex $A$ , and the limit of $E$ in $B$ , carried through $G$ , acquires a unique compatible cone. So $B$ complete forces every $(A \Rightarrow G)$ complete.
Local smallness passes down. Hom-sets of $(A \Rightarrow G)$ are subsets of hom-sets of $B$ .

Each $(A \Rightarrow G)$ is then complete, locally small, and has a weakly initial set by hypothesis, so the lemma hands it an initial object. Initial objects of all the comma categories are exactly a left adjoint, completing the proof.

Algorithm:

\textsc{Gaft}(G)

— building the left adjoint of a limit-preserving

G

1
for each object $A$ of $\mathcal{A}$ do
2
form the comma category $(A \Rightarrow G)$
3
// complete because $P_A$ creates limits; locally small; weakly initial set given
4
take a weakly initial set $\mathbb{S}$ in $(A \Rightarrow G)$
5
take the limit $0_A$ of the inclusion $\mathbb{S} \hookrightarrow (A \Rightarrow G)$
6
// $0_A$ is initial: existence by weak initiality, uniqueness by the equalizer argument
7
set $\bigl(F(A), \; \eta_A : A \to G F(A)\bigr) \gets 0_A$
8
assemble the $F(A)$ into a functor $F$ with unit $\eta$
9
return $F \dashv G$

Applications

Free algebras without formal expressions

For any category $B$ of algebras — $Grp$ , $Vect_{k}$ , $Mon$ , $Ring$ — the forgetful functor $U : B \to Set$ satisfies the hypotheses of GAFT: $B$ is complete and locally small, $U$ preserves limits, and a cardinality estimate produces the weakly initial sets. For groups: a subgroup generated by a family $(g_{a})_{a \in A}$ has cardinality at most $max {∣ N ∣, ∣ A ∣}$ , so the isomorphism classes of groups of bounded cardinality, each equipped with each possible map from $A$ , form a weakly initial set in $(A \Rightarrow U)$ . GAFT concludes that the free group functor exists.⁶

Worked example (GAFT hypotheses for the free group on two generators). Check the four hypotheses of GAFT for $U : Grp \to Set$ at the set $A = {x, y}$ .

$Grp$ complete. Products are direct products and the equalizer of $f, g : G \to H$ is the subgroup ${s \in G : f (s) = g (s)}$ ; products and equalizers together give all small limits.
$Grp$ locally small. The homomorphisms $G \to H$ form a set.
$U$ preserves limits. $U$ has the free-group functor as a left adjoint, so RAPL applies.
Weakly initial set in $(A \Rightarrow U)$ . Any map $f : A \to U (G)$ factors through the subgroup generated by $f (x), f (y)$ , which has cardinality at most $∣ N ∣ = ℵ_{0}$ . The isomorphism classes of at-most-countable groups, each paired with each function $A \to U (G)$ , form a set $S$ , and every object of $(A \Rightarrow U)$ receives a map from a member of $S$ .

GAFT then supplies an initial object of $(A \Rightarrow U)$ , whose group is the free group $F (A)$ on two generators, with unit $η_{A} : A \to U F (A)$ the inclusion of the generators. No formal words are constructed.

This replaces the entire hands-on construction — formal words like $x^{- 1} y x^{2} z y^{- 3}$ , the equivalence relation, the well-definedness checks, the verification of the universal property — with hypothesis checking. What is lost is explicitness. GAFT is an existence theorem; it names no elements of $F (A)$ . And elements are genuinely hard to reach: an element of $F (A)$ is a map into $F (A)$ , but a left adjoint is understood through maps out of its values. The same situation recurs for forgetful functors between categories of algebras ( $Ab \to Grp$ , $Grp \to Mon$ , $Ring \to Mon$ , $Vect_{C} \to Vect_{R}$ ), all of which get left adjoints from GAFT at once.

The special adjoint functor theorem

The special adjoint functor theorem (SAFT) trades wider hypotheses on $B$ (completeness plus conditions involving well-poweredness and a cogenerating set) for the removal of every condition on $G$ : any limit-preserving functor from such a $B$ to a locally small $A$ has a left adjoint.⁷ The classic application is topological. The forgetful functor

U : CptHff ⟶ Top

from compact Hausdorff spaces satisfies SAFT's hypotheses (this requires real topology, Tychonoff's theorem among it), so it has a left adjoint $F$ . For a space $X$ , the space $F (X)$ is the Stone–Čech compactification; under mild separation hypotheses on $X$ the unit $X \to U F (X)$ is an embedding. Since $U$ is a full and faithful inclusion, its left adjoint exhibits $CptHff$ as a reflective subcategory of $Top$ , with $F$ the reflector. SAFT's proof even yields a formula: $F (X)$ is the closure of the image of the canonical map

X ⟶ [0, 1]^{Top (X, [0, 1])} .

Theorem	Conditions on $B$	Conditions per object of $A$	Typical use
Ordered-set AFT	complete poset	none	Galois connections, closure operators
GAFT	complete, locally small	weakly initial set in $(A \Rightarrow G)$	free algebras
SAFT	complete, locally small, well-powered, cogenerating set	none	Stone–Čech compactification

Checklist for applying GAFT

Verifying the hypotheses is mechanical; forgetting one is the standard error.

$B$ complete — usually via a known limit construction (products plus equalizers).
$B$ locally small — automatic for categories of structured sets.
$G$ preserves limits — often because limits are computed underneath the forgetful functor.
Weakly initial sets — the genuinely case-specific step; almost always a cardinality bound showing that small witnesses suffice.

The failure mode when the last condition is dropped is not hypothetical. $Field$ is locally small, and the forgetful functor to $Set$ preserves the limits that exist, yet no free field exists; completeness fails ( $Field$ has no products, no terminal object), so no adjoint functor theorem applies, consistent with the direct argument that $Field$ has no initial object.

Leinster, Basic Category Theory, §6.3 — the template for adjoint functor theorems, the completeness definition, and the counterexample $B \to 1$ showing limit preservation alone is insufficient. ↩
Leinster, Basic Category Theory, §6.3, Proposition 6.3.7 — the adjoint functor theorem for ordered sets, with the left adjoint given by $F (a) = ⋀ {b : a \leq G (b)}$ . ↩
Leinster, Basic Category Theory, §6.3, Example 6.3.8 — the case $A = 1$ : a complete poset has a least element, and all-meets implies all-joins via meets of upper bounds. ↩
Leinster, Basic Category Theory, §6.3 — why the naive limit $lim P_{A}$ over the comma category can be large, why demanding large limits or small $B$ both fail (complete small categories are complete preorders), and the role of size conditions. ↩
Leinster, Basic Category Theory, Appendix — proof of GAFT: Lemma A.1 (a complete, locally small category with a weakly initial set has an initial object, by the limit-of-the-set and equalizer argument) and Lemma A.2 (projections of comma categories create limits). ↩
Leinster, Basic Category Theory, §6.3, Examples 6.3.11–6.3.12 and Exercise 6.3.24 — GAFT applied to forgetful functors of algebras; the cardinality argument for weakly initial sets and the resulting existence of free groups without formal expressions. ↩
Leinster, Basic Category Theory, §6.3, Theorem 6.3.13 and Example 6.3.14 — the special adjoint functor theorem and the Stone–Čech compactification as its classic application, with the explicit closure formula. ↩

Universal arrows and comma categories

The ordered-set case

The size obstruction

Proof of GAFT

Applications

Free algebras without formal expressions

The special adjoint functor theorem

Checklist for applying GAFT

Footnotes