Fiveable

๐Ÿ”ขCategory Theory Unit 9 Review

QR code for Category Theory practice questions

9.1 Definition and examples of adjoint functors

9.1 Definition and examples of adjoint functors

Written by the Fiveable Content Team โ€ข Last updated August 2025
Written by the Fiveable Content Team โ€ข Last updated August 2025
๐Ÿ”ขCategory Theory
Unit & Topic Study Guides

Adjoint functors are powerful tools in category theory, linking categories through paired functors. They establish a natural bijection between hom-sets, creating a deep connection between objects and morphisms in different categories.

Left adjoints preserve colimits, while right adjoints preserve limits. This property makes adjoint functors crucial for understanding how structures transfer between categories, playing a key role in many mathematical and computational contexts.

Adjoint Functors

Definition of adjoint functors

  • Pair of functors F:Cโ†’DF: \mathcal{C} \to \mathcal{D} and G:Dโ†’CG: \mathcal{D} \to \mathcal{C} between categories C\mathcal{C} and D\mathcal{D} that establish a bijection (natural isomorphism) between hom-sets HomD(F(C),D)โ‰…HomC(C,G(D))\text{Hom}_{\mathcal{D}}(F(C), D) \cong \text{Hom}_{\mathcal{C}}(C, G(D)) for every pair of objects CโˆˆCC \in \mathcal{C} and DโˆˆDD \in \mathcal{D}
    • Bijection is natural in both CC and DD, meaning it is compatible with morphisms in C\mathcal{C} and D\mathcal{D}
  • FF is the left adjoint functor and GG is the right adjoint functor
  • Adjoint functors come with natural transformations ฮท:1Cโ‡’GF\eta: 1_{\mathcal{C}} \Rightarrow GF (unit) and ฮต:FGโ‡’1D\varepsilon: FG \Rightarrow 1_{\mathcal{D}} (counit) satisfying triangle identities, which express the compatibility between the unit, counit, and the functors
  • Left adjoints preserve colimits (coproducts, coequalizers) while right adjoints preserve limits (products, equalizers)
Definition of adjoint functors, May | 2014 | Bartosz Milewski's Programming Cafe

Examples in various categories

  • Category of sets (Set\mathbf{Set})
    • Free functor F:Setโ†’GrpF: \mathbf{Set} \to \mathbf{Grp} is left adjoint to forgetful functor U:Grpโ†’SetU: \mathbf{Grp} \to \mathbf{Set}, constructing the free group on a set and forgetting the group structure
    • Powerset functor P:Setโ†’Setop\mathcal{P}: \mathbf{Set} \to \mathbf{Set}^{\text{op}} is left adjoint to itself, mapping a set to its powerset and vice versa
  • Category of topological spaces (Top\mathbf{Top})
    • Functor โˆฃโˆ’โˆฃ:Topโ†’Set|-|: \mathbf{Top} \to \mathbf{Set} forgetting the topology is right adjoint to discrete topology functor D:Setโ†’TopD: \mathbf{Set} \to \mathbf{Top}, equipping a set with the discrete topology
    • Functor โˆฃโˆ’โˆฃ:Topโ†’Set|-|: \mathbf{Top} \to \mathbf{Set} is left adjoint to indiscrete topology functor I:Setโ†’TopI: \mathbf{Set} \to \mathbf{Top}, equipping a set with the indiscrete topology
  • Category of vector spaces (VectK\mathbf{Vect}_K) over field KK
    • Tensor product functor โˆ’โŠ—KV:VectKโ†’VectK- \otimes_K V: \mathbf{Vect}_K \to \mathbf{Vect}_K is left adjoint to hom functor HomK(V,โˆ’):VectKโ†’VectK\text{Hom}_K(V, -): \mathbf{Vect}_K \to \mathbf{Vect}_K for any vector space VV, capturing the adjunction between tensor product and linear maps
Definition of adjoint functors, ๊ทนํ•œ (๋ฒ”์ฃผ๋ก ) - ๋ฆฌ๋ธŒ๋ ˆ ์œ„ํ‚ค

Left vs right adjoint functors

  • If F:Cโ†’DF: \mathcal{C} \to \mathcal{D} is left adjoint to G:Dโ†’CG: \mathcal{D} \to \mathcal{C}, then GG is right adjoint to FF, denoted FโŠฃGF \dashv G
  • Unit ฮท:1Cโ‡’GF\eta: 1_{\mathcal{C}} \Rightarrow GF and counit ฮต:FGโ‡’1D\varepsilon: FG \Rightarrow 1_{\mathcal{D}} satisfy triangle identities (ฮตF)โˆ˜(Fฮท)=1F(\varepsilon F) \circ (F \eta) = 1_F and (Gฮต)โˆ˜(ฮทG)=1G(G \varepsilon) \circ (\eta G) = 1_G, expressing the compatibility between the unit, counit, and the functors
  • Adjoint functors are unique up to natural isomorphism, meaning if FโŠฃGF \dashv G and FโŠฃGโ€ฒF \dashv G', then Gโ‰…Gโ€ฒG \cong G'

Preservation of categorical structures

  • Left adjoint functors preserve colimits
    • For diagram D:Jโ†’CD: \mathcal{J} \to \mathcal{C}, left adjoint F:Cโ†’DF: \mathcal{C} \to \mathcal{D} satisfies F(colimย D)โ‰…colimย (Fโˆ˜D)F(\text{colim } D) \cong \text{colim } (F \circ D)
    • Preserves coproducts and coequalizers
  • Right adjoint functors preserve limits
    • For diagram D:Jโ†’DD: \mathcal{J} \to \mathcal{D}, right adjoint G:Dโ†’CG: \mathcal{D} \to \mathcal{C} satisfies G(limย D)โ‰…limย (Gโˆ˜D)G(\text{lim } D) \cong \text{lim } (G \circ D)
    • Preserves products and equalizers
  • Adjoint functors preserve exponential objects in cartesian closed categories
    • If F:Cโ†’DF: \mathcal{C} \to \mathcal{D} is left adjoint to G:Dโ†’CG: \mathcal{D} \to \mathcal{C} and C\mathcal{C}, D\mathcal{D} are cartesian closed, then F(CA)โ‰…(FC)(GA)F(C^A) \cong (FC)^{(GA)} for objects A,CโˆˆCA, C \in \mathcal{C}