Adjoint Functors — Mathematics Knowledge System

Overview

An adjunction is one of the most fundamental and pervasive concepts in mathematics. A functor $F: \mathcal{C} \to \mathcal{D}$ is left adjoint to $G: \mathcal{D} \to \mathcal{C}$ (written $F \dashv G$) when there is a natural bijection $\text{Hom}_{\mathcal{D}}(FC, D) \cong \text{Hom}_{\mathcal{C}}(C, GD)$. Adjunctions capture the notion of 'optimal solution to a problem' — the left adjoint builds the freest or most economical object, while the right adjoint extracts underlying structure. Free groups, tensor products, and the compactification of a space are all left adjoints; forgetful functors are typically right adjoints.

Intuition

An adjunction $F \dashv G$ says: 'giving a map from $FC$ to $D$ is the same as giving a map from $C$ to $GD$'. Think of $F$ as 'freely building' a $\mathcal{D}$-object from a $\mathcal{C}$-object, and $G$ as 'forgetting structure'. Then a map from the free object $FC$ is determined by where the generators (the image of $C$) go — which is exactly a map $C \to GD$. The slogan: 'Free constructions are left adjoints to forgetful functors.'

Formal Definition

Definition

An adjunction between categories $\mathcal{C}$ and $\mathcal{D}$ consists of functors $F: \mathcal{C} \to \mathcal{D}$ and $G: \mathcal{D} \to \mathcal{C}$ together with a natural isomorphism:

\Phi_{C,D}: \text{Hom}_{\mathcal{D}}(FC, D) \xrightarrow{\;\sim\;} \text{Hom}_{\mathcal{C}}(C, GD)

Natural bijection, natural in both C and D

adjunction-hom-bijection

F \dashv G

F is left adjoint to G, G is right adjoint to F

adjunction-notation

\eta: \text{Id}_{\mathcal{C}} \Rightarrow GF \quad\text{(unit)}, \qquad \varepsilon: FG \Rightarrow \text{Id}_{\mathcal{D}} \quad\text{(counit)}

Unit and counit natural transformations

unit-counit

G\varepsilon_D \circ \eta_{GD} = \text{id}_{GD} \quad \text{and} \quad \varepsilon_{FC} \circ F\eta_C = \text{id}_{FC}

Triangle identities (zigzag equations)

triangle-identities

Notation

Notation	Meaning
$F \dashv G$	F is left adjoint to G
$\eta: \text{Id} \Rightarrow GF$	Unit of the adjunction
$\varepsilon: FG \Rightarrow \text{Id}$	Counit of the adjunction
$f^{\sharp}$	The transpose of f: FC→D under the adjunction bijection, a morphism C→GD
$g^{\flat}$	The transpose of g: C→GD, a morphism FC→D

Properties

Right adjoints preserve limits

If F \dashv G and \mathcal{D} has limits of shape J, then G preserves those limits: G(\lim_J D) \cong \lim_J (G \circ D).

Example: The forgetful functor $U: \text{Grp} \to \text{Set}$ preserves products: $U(G \times H) = U(G) \times U(H)$.

Left adjoints preserve colimits

If F \dashv G and \mathcal{C} has colimits of shape J, then F preserves colimits: F(\text{colim}_J C) \cong \text{colim}_J (F \circ C).

Example: The free group functor $F: \text{Set} \to \text{Grp}$ preserves coproducts: $F(S \sqcup T) \cong F(S) * F(T)$ (free product).

Uniqueness of adjoints

Right (resp. left) adjoints are unique up to unique natural isomorphism.

Condition: If $F \dashv G$ and $F \dashv G'$, then $G \cong G'$ via a canonical natural isomorphism.

Unit-counit characterization

An adjunction is equivalently given by natural transformations \eta: \text{Id} \Rightarrow GF \text{ and } \varepsilon: FG \Rightarrow \text{Id} \text{ satisfying the triangle identities.}

Condition: The bijection is recovered by $\Phi(f) = Gf \circ \eta_C$ and $\Phi^{-1}(g) = \varepsilon_D \circ Fg$.

Worked Examples

For a set $S$, $F(S)$ is the free group on $S$: the group of reduced words in symbols $s \in S$ and their formal inverses $s^{-1}$, with concatenation as group operation.
$F(S) = \langle S \rangle = \text{free group on generators } S$
The adjunction bijection: for any group $G$ and set $S$, there is a bijection $\text{Hom}_{\text{Grp}}(F(S), G) \cong \text{Hom}_{\text{Set}}(S, U(G))$.
$\Phi: \text{Hom}_{\text{Grp}}(F(S), G) \xrightarrow{\sim} \text{Hom}_{\text{Set}}(S, U(G))$
Forward direction $\Phi$: given a group hom $\varphi: F(S) \to G$, restrict it to generators: $\Phi(\varphi) = \varphi|_S: S \to U(G)$. This is a set map.
Backward direction $\Phi^{-1}$: given a set map $f: S \to U(G)$, extend it uniquely to a group hom $\tilde{f}: F(S) \to G$ by the universal property of the free group: $\tilde{f}(s_1^{\varepsilon_1} \cdots s_n^{\varepsilon_n}) = f(s_1)^{\varepsilon_1} \cdots f(s_n)^{\varepsilon_n}$.
$\tilde{f}(s_1^{\varepsilon_1} \cdots s_n^{\varepsilon_n}) = f(s_1)^{\varepsilon_1} \cdots f(s_n)^{\varepsilon_n}$
These are inverse bijections, and they are natural in $S$ and $G$. The unit $\eta_S: S \to UF(S)$ is the inclusion of generators $s \mapsto s$. The counit $\varepsilon_G: FU(G) \to G$ sends each generator (element of $G$) to itself in $G$.
$\eta_S: S \hookrightarrow UF(S), \quad s \mapsto s; \qquad \varepsilon_G: FU(G) \to G, \quad g \mapsto g$

Answer: $F \dashv U$: group homs $F(S) \to G$ correspond bijectively to set maps $S \to U(G)$ via restriction/extension. This is the universal property of free groups.

Practice Problems

Difficulty 8/10

Show that the product functor $- \times B: \text{Set} \to \text{Set}$ (for a fixed set $B$) is left adjoint to the function-set functor $B^{-} = \text{Hom}(B, -): \text{Set} \to \text{Set}$. State the adjunction bijection explicitly.

Difficulty 9/10

Prove that right adjoints preserve limits: if $F \dashv G$ and $D: J \to \mathcal{D}$ is a diagram with limit $\lim D$ in $\mathcal{D}$, then $G(\lim D)$ is a limit of $G \circ D$ in $\mathcal{C}$.

Difficulty 8/10

Identify the left and right adjoints in the following pairs, and state the adjunction bijection: (a) Discrete/Constant/Global sections functors between $\text{Set}$ and $\text{Set}/S$ (sets over $S$). (b) The abelianization functor $(-)^{\text{ab}}: \text{Grp} \to \text{Ab}$ and the inclusion $\text{Ab} \hookrightarrow \text{Grp}$.

Common Mistakes

Common Mistake

Left and right adjoints are symmetric — if F ⊣ G then also G ⊣ F.

Adjunctions are not symmetric in general. $F \dashv G$ does not imply $G \dashv F$. For example, the free group functor is left adjoint to the forgetful functor, but the forgetful functor is not left adjoint to the free group functor.

Common Mistake

An adjunction means the categories are equivalent.

An equivalence of categories requires the unit and counit to both be natural isomorphisms. A general adjunction only requires the hom-set bijection. Many useful adjunctions (free/forgetful) do not give equivalences.

Common Mistake

The unit η_C: C → GFC is always the 'inclusion' of C into its free structure.

While this is the intuition for free/forgetful adjunctions, the unit can be any natural transformation. For the product/hom adjunction in Set, the unit sends $a \mapsto (b \mapsto (a,b))$.

Quiz

Summary

An adjunction $F \dashv G$ is a natural bijection $\text{Hom}(FC, D) \cong \text{Hom}(C, GD)$; equivalently, natural transformations (unit $\eta$, counit $\varepsilon$) satisfying triangle identities.
Left adjoints preserve colimits; right adjoints preserve limits — a fundamental result with sweeping consequences.
Key examples: free/forgetful ($F_{\text{free}} \dashv U$), product/exponential ($- \times B \dashv B^{-}$), abelianization/inclusion ($(-)^{\text{ab}} \dashv \text{incl}$).
Adjoints are unique up to unique natural isomorphism; the unit being a natural iso means the right adjoint is fully faithful.
Adjunctions are the categorical formalization of 'universal properties' and 'optimal solutions', unifying free constructions, tensor products, compactifications, and sheafification under one principle.

References

BookMac Lane, S. Categories for the Working Mathematician, 2nd ed. Springer, 1998. Ch. IV.
BookRiehl, E. Category Theory in Context. Dover, 2016. Ch. 4.
WebsiteWikipedia — Adjoint functors
WebsitenLab — adjunction