3 Adjunctions

Definition 3.1 (Adjunction, D. Kan 1958). Let C and D be categories. An adjunction between C and D consists of functors F:C→D and G:D→C together with, for each A∈ob⁡C and B∈ob⁡D, a bijection between morphisms FA→B in D and morphisms A→GB in C, which is natural in A and B. (If C and D are locally small, this means that D(F∙,∙) and C(∙,G∙) are naturally isomorphic functors Cop×D→Set.)

We say F is left adjoint to G, or G is right adjoint to F, and we write (F⊣G).

Example 3.2.

Theorem 3.3. Assuming that:

  • G:D→C is a functor

  • for A∈ob⁡C, let (A↓G) be the category whose objects are pairs (B,f) where B∈ob⁡D and f:A→GB, and whose morphisms (B,f)→(B′,f′) are morphisms g:B→B′ making
     A        GB


ffG′g        GB ′
    commute.

Then specifying a left adjoint for G is equivalent to specifying an initial object of (A↓G) for each A.

Proof. First suppose (F⊣G). For each A∈ob⁡C, let ηA:A→GFA be the morphism corresponding to 1FA:FA→FA. Then (FA,ηA) is an initial object of (A↓G): given any f:A→GB, the diagram

  A        GF A

ηfGAg         GB
commutes if and only if g corresponds to f under the adjunction, by naturality of the adjunction bijection.

So there’s a unique morphism (FA,ηA)→(B,f) in (A↓G).

Conversely, suppose given in initial object (FA,ηA) in (A↓G) for each A. We make F into a function C→D: given A→fB, Ff is the unique morphism (FA,ηA)→(FB,ηBf) in (A↓G). Functoriality comes from uniqueness: given B→gC, (Fg)(Ff) and F(gf) are both morphisms (FA,ηA)→(FC,ηCgf) in (A↓G). The adjunction bijection sends A→fGB to the unique morphism (FA,ηA)→(B,f) in (A↓G), with inverse sending FA→gB to (Gg)ηA:A→GB. This is natural in A since η is a natural transformation 1C→GF and natural in B since G is functorial. □

Corollary 3.4. Assuming that:

Then there is a canonical natural isomorphism α:F→F′.

Proof. (FA,ηA) and (F′A,ηA′) are both initial in (A↓G), so there’s a unique isomorphism αA between them. α is natural: given A→fB, (F′f)αA and αB(Ff) are both morphisms (FA,ηA)→(F′B,ηB′f) in (A↓G), so they’re equal. □

As a result of this, we will often talk about “the” left adjoint of a functor (when it exists), because we don’t usually care about which one in the isomorphism class we use.

Lemma 3.5. Assuming that:

  • C⇄GFD⇄KHE

  • (F⊣G) and (H⊣K)

Then (HF⊣GK).

Proof. Given A∈ob⁡C, C∈ob⁡E, we have bijections between morphisms HFA→C, morphisms FA→KC, and morphisms A→GKC which are both natural in A and C, D. □

Corollary 3.6. Assuming that:

Then the square of left adjoints commutes up to natural isomorphism.

Proof. By Lemma 3.5, both ways round are left adjoint to HF=KG, so by Corollary 3.4 they’re isomorphic. □

We saw in Theorem 3.3 that an adjoint (F⊣G) gives rise to a natural transformation η:1C→GF, called the unit of the adjunction. Dually, we have 𝜀:FG→1D, the counit of (F⊣G).

Theorem 3.7. Assuming that:

Then specifying an adjunction (F⊣G) is equivalent to specifying a natural transformation η:1C→GF and 𝜀:FG→1D satisfying the two commutative diagrams:
 F         FGF            G        GF G

F1𝜀FηF        aFnd           η1GGG𝜀         G

Proof. Suppose (F⊣G). We defined η in the proof of Theorem 3.3, and 𝜀 is defined dually. Since 𝜀FA corresponds to 1GFA, the composite 𝜀FA(FηA) corresponds to 1GFAηA=ηA. But by definition 1FA corresponds to ηA. The other identity is dual.

Conversely, suppose given η and 𝜀 satisfying the triangular identities. Given FA→fB, we define Φ(f)=(Gf)ηA:A→GFA→GB. Dually, given A→gGB, we define Ψ(g)=𝜀B(Fg). Then ΨΦ(f)=Ψ((Gf)ηA)=𝜀B(FGf)FηA=f(𝜀FA)(FηA)=f, and dually ΦΨ(g)=g. Naturality of Φ and Ψ follows from naturality of η and 𝜀. □

In Definition 1.9, we had natural isomorphisms α:1C→GF and β:FG→1D. These look like the unit and counit of an adjunction (F⊣G): do they satisfy the triangular identities? No, but we can always change them:

Proposition 3.8. Assuming that:

Then there exist isomorphisms α′:1C→GF and β′:FG→1D satisfying the triangular identities. In particular, (F⊣G⊣F).

Proof. We define α′=α and take β′ to be the composite

FG→(FGβ)−1FGFG→(FαG)−1FG→β1D.

Note that FGβ=βFG, since

    FGF G      FG


FβββGFβG FG         1𝒟
commutes by naturality of β, and β is monic. Similarly, GFα=αGF.

To verify the triangular identities, consider

 F         FGF         FGF GF


           F           FGF

 −1−1−−11       −1
F1(F((1βαFβFαFβFFFGα)FG)F) =(FGFα)         F
which commutes by naturality of β−1.

For the second triangular identity, we have

  G        GF G        GF GF G


           G           GF G

 −1−1 −−11      −1
α1(α((1GGGGGGGGβFFβGα)βG)) = (αGFG)         G β
Hence by Theorem 3.7 we have (F⊣G). But (β′)−1 and α−1 also satisfy the triangular identities for and adjunction (G⊣F). □

Lemma 3.9. Assuming that:

Then

Proof.

Definition 3.10 (Reflection). By a reflection, we mean an adjunction such that the right adjoint is full and faithful (equivalently: the counit is an isomorphism). We say D⊆C is a reflective subcategory if it’s full and the inclusion D→C has a left adjoint.

Example 3.11.