ConceptComplete

Adjoint Functors

Adjunctions are arguably the most important concept in category theory after the notion of a category itself. An adjunction F⊣GF \dashv G captures the idea that FF is a "best approximation" from the left and GG from the right. Free constructions, forgetful functors, tensor-hom duality, and sheafification are all instances of adjunctions.


Definition

Definition2.16Adjunction

An adjunction between categories C\mathcal{C} and D\mathcal{D} consists of functors F:C→DF : \mathcal{C} \to \mathcal{D} (the left adjoint) and G:D→CG : \mathcal{D} \to \mathcal{C} (the right adjoint), written F⊣GF \dashv G, together with a natural bijection

HomD(F(C),D)≅HomC(C,G(D))\mathrm{Hom}_{\mathcal{D}}(F(C), D) \cong \mathrm{Hom}_{\mathcal{C}}(C, G(D))

natural in both C∈CC \in \mathcal{C} and D∈DD \in \mathcal{D}.

Definition2.17Unit and Counit

An adjunction F⊣GF \dashv G determines natural transformations:

  • Unit: η:IdC⇒G∘F\eta : \mathrm{Id}_{\mathcal{C}} \Rightarrow G \circ F, with ηC:C→GF(C)\eta_C : C \to GF(C) corresponding to idF(C)\mathrm{id}_{F(C)} under the adjunction bijection.
  • Counit: ε:F∘G⇒IdD\varepsilon : F \circ G \Rightarrow \mathrm{Id}_{\mathcal{D}}, with εD:FG(D)→D\varepsilon_D : FG(D) \to D corresponding to idG(D)\mathrm{id}_{G(D)}.

These satisfy the triangle identities:

εF(C)∘F(ηC)=idF(C),G(εD)∘ηG(D)=idG(D)\varepsilon_{F(C)} \circ F(\eta_C) = \mathrm{id}_{F(C)}, \qquad G(\varepsilon_D) \circ \eta_{G(D)} = \mathrm{id}_{G(D)}

Theorem2.6Equivalent formulations of adjunctions

The following data are equivalent:

  1. A natural bijection Hom(FC,D)≅Hom(C,GD)\mathrm{Hom}(FC, D) \cong \mathrm{Hom}(C, GD).
  2. A pair of natural transformations η:Id⇒GF\eta : \mathrm{Id} \Rightarrow GF and ε:FG⇒Id\varepsilon : FG \Rightarrow \mathrm{Id} satisfying the triangle identities.
  3. For each CC, a universal arrow from CC to GG (i.e., an initial object in the comma category (C↓G)(C \downarrow G)).

Examples

ExampleFree-Forgetful adjunction for groups

The free group functor F:Set→GrpF : \mathbf{Set} \to \mathbf{Grp} is left adjoint to the forgetful functor U:Grp→SetU : \mathbf{Grp} \to \mathbf{Set}:

HomGrp(F(S),G)≅HomSet(S,U(G))\mathrm{Hom}_{\mathbf{Grp}}(F(S), G) \cong \mathrm{Hom}_{\mathbf{Set}}(S, U(G))

A group homomorphism from the free group on SS is determined by a function from SS to U(G)U(G). The unit ηS:S→U(F(S))\eta_S : S \to U(F(S)) is the inclusion of generators.

ExampleFree-Forgetful for modules

F:Set→R-ModF : \mathbf{Set} \to R\text{-}\mathbf{Mod} (free module) is left adjoint to the forgetful functor UU: HomR(R(S),M)≅HomSet(S,U(M))\mathrm{Hom}_R(R^{(S)}, M) \cong \mathrm{Hom}_{\mathbf{Set}}(S, U(M)).

ExampleTensor-Hom adjunction

For a ring RR and a right RR-module MM, the functors M⊗R−:R-Mod→AbM \otimes_R - : R\text{-}\mathbf{Mod} \to \mathbf{Ab} and HomZ(M,−):Ab→R-Mod\mathrm{Hom}_{\mathbb{Z}}(M, -) : \mathbf{Ab} \to R\text{-}\mathbf{Mod} form an adjunction:

HomZ(M⊗RN,A)≅HomR(N,HomZ(M,A))\mathrm{Hom}_{\mathbb{Z}}(M \otimes_R N, A) \cong \mathrm{Hom}_R(N, \mathrm{Hom}_{\mathbb{Z}}(M, A))

This is the tensor-Hom adjunction, fundamental in homological algebra.

ExampleAbelianization

The abelianization functor ab:Grp→Ab\mathrm{ab} : \mathbf{Grp} \to \mathbf{Ab} sending G↦G/[G,G]G \mapsto G/[G,G] is left adjoint to the inclusion ι:Ab↪Grp\iota : \mathbf{Ab} \hookrightarrow \mathbf{Grp}:

HomAb(Gab,A)≅HomGrp(G,ι(A))\mathrm{Hom}_{\mathbf{Ab}}(G^{\mathrm{ab}}, A) \cong \mathrm{Hom}_{\mathbf{Grp}}(G, \iota(A))

ExampleSheafification

Sheafification a:PSh(X)→Sh(X)a : \mathbf{PSh}(X) \to \mathbf{Sh}(X) is left adjoint to the inclusion ι:Sh(X)↪PSh(X)\iota : \mathbf{Sh}(X) \hookrightarrow \mathbf{PSh}(X). The unit ηF:F→ι(aF)\eta_{\mathcal{F}} : \mathcal{F} \to \iota(a\mathcal{F}) is the canonical map from a presheaf to its sheafification.

ExampleProduct-Diagonal adjunction

The diagonal functor Δ:C→C×C\Delta : \mathcal{C} \to \mathcal{C} \times \mathcal{C} sending A↦(A,A)A \mapsto (A, A) has a right adjoint (when products exist): the product functor ×:C×C→C\times : \mathcal{C} \times \mathcal{C} \to \mathcal{C}. We have Δ⊣×\Delta \dashv \times:

Hom((A,A),(B,C))≅Hom(A,B×C)\mathrm{Hom}((A,A), (B,C)) \cong \mathrm{Hom}(A, B \times C)

ExampleLocalization

For a multiplicative set S⊆RS \subseteq R, the localization functor S−1(−):R-Mod→S−1R-ModS^{-1}(-) : R\text{-}\mathbf{Mod} \to S^{-1}R\text{-}\mathbf{Mod} is left adjoint to the restriction of scalars S−1R-Mod→R-ModS^{-1}R\text{-}\mathbf{Mod} \to R\text{-}\mathbf{Mod}.

ExampleDirect image and inverse image of sheaves

For a continuous map f:X→Yf : X \to Y, the inverse image functor f−1:Sh(Y)→Sh(X)f^{-1} : \mathbf{Sh}(Y) \to \mathbf{Sh}(X) is left adjoint to the direct image f∗:Sh(X)→Sh(Y)f_* : \mathbf{Sh}(X) \to \mathbf{Sh}(Y):

HomSh(X)(f−1G,F)≅HomSh(Y)(G,f∗F)\mathrm{Hom}_{\mathbf{Sh}(X)}(f^{-1}\mathcal{G}, \mathcal{F}) \cong \mathrm{Hom}_{\mathbf{Sh}(Y)}(\mathcal{G}, f_*\mathcal{F})

ExampleGalois connection

An adjunction between poset categories (viewed as categories) is a Galois connection: f(a)≤b  ⟺  a≤g(b)f(a) \leq b \iff a \leq g(b) for order-preserving maps f:P→Qf : P \to Q and g:Q→Pg : Q \to P. The classical Galois correspondence between subfields and subgroups is a Galois connection.

ExampleStone-Cech compactification

The Stone-Cech compactification functor β:Top→CHaus\beta : \mathbf{Top} \to \mathbf{CHaus} is left adjoint to the inclusion ι:CHaus↪Top\iota : \mathbf{CHaus} \hookrightarrow \mathbf{Top}: HomCHaus(βX,K)≅HomTop(X,K)\mathrm{Hom}_{\mathbf{CHaus}}(\beta X, K) \cong \mathrm{Hom}_{\mathbf{Top}}(X, K) for compact Hausdorff KK.

ExampleForgetful functor from Top to Set

The forgetful functor U:Top→SetU : \mathbf{Top} \to \mathbf{Set} has both a left adjoint (discrete topology) and a right adjoint (indiscrete topology). This means Disc⊣U⊣Indisc\mathrm{Disc} \dashv U \dashv \mathrm{Indisc}.

ExampleSuspension-Loop adjunction

In pointed topological spaces, the suspension functor Σ\Sigma is left adjoint to the loop space functor Ω\Omega: [ΣX,Y]∗≅[X,ΩY]∗[\Sigma X, Y]_* \cong [X, \Omega Y]_*. This adjunction is the foundation of stable homotopy theory.


Key Properties

Theorem2.7RAPL (Right Adjoints Preserve Limits)

If G:D→CG : \mathcal{D} \to \mathcal{C} has a left adjoint FF, then GG preserves all limits that exist in D\mathcal{D}. Dually, left adjoints preserve all colimits.

Proof

For a diagram D:J→DD : \mathcal{J} \to \mathcal{D} with limit LL, we have

Hom(C,G(L))≅Hom(FC,L)≅lim←⁡jHom(FC,D(j))≅lim←⁡jHom(C,GD(j))\mathrm{Hom}(C, G(L)) \cong \mathrm{Hom}(FC, L) \cong \varprojlim_j \mathrm{Hom}(FC, D(j)) \cong \varprojlim_j \mathrm{Hom}(C, GD(j))

so G(L)G(L) satisfies the universal property of lim←⁡G∘D\varprojlim G \circ D.

■
RemarkUniqueness of adjoints

Left (or right) adjoints, when they exist, are unique up to natural isomorphism. This follows from the Yoneda Lemma: if F⊣GF \dashv G and F′⊣GF' \dashv G, then Hom(FC,−)≅Hom(C,G−)≅Hom(F′C,−)\mathrm{Hom}(FC, -) \cong \mathrm{Hom}(C, G-) \cong \mathrm{Hom}(F'C, -), so FC≅F′CFC \cong F'C naturally.

RemarkLooking ahead

The Freyd Adjoint Functor Theorem provides conditions guaranteeing the existence of an adjoint. In homological algebra, the most important adjunction is the tensor-Hom adjunction, which underlies the relationship between Tor\mathrm{Tor} and Ext\mathrm{Ext} as derived functors.