Fiveable

🔢Category Theory Unit 6 Review

QR code for Category Theory practice questions

6.2 Essentially surjective and fully faithful functors

6.2 Essentially surjective and fully faithful 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

Functors and equivalence are key concepts in category theory, linking different mathematical structures. They help us understand how categories relate to each other, with essentially surjective functors "reaching" all objects and fully faithful functors preserving morphism structures.

Equivalence of categories is a powerful tool, combining essential surjectivity and full faithfulness. It allows us to view seemingly different categories as essentially the same, preserving both objects and morphisms. This concept is crucial for understanding deep connections in mathematics.

Functors and Equivalence

Definition of essentially surjective functors

  • A functor F:CDF: \mathcal{C} \to \mathcal{D} is essentially surjective if for every object DD in the codomain category D\mathcal{D}, there exists an object CC in the domain category C\mathcal{C} such that F(C)F(C) is isomorphic to DD
    • Intuitively means every object in the codomain category is "essentially" reached by the functor, up to isomorphism
  • The forgetful functor U:GrpSetU: \mathbf{Grp} \to \mathbf{Set} is essentially surjective
    • For any set XX in Set\mathbf{Set}, there exists a group (X,)(X, *) in Grp\mathbf{Grp} such that U((X,))=XU((X, *)) = X
  • The functor F:AbGrpF: \mathbf{Ab} \to \mathbf{Grp} that includes abelian groups into groups is essentially surjective
    • Every group is isomorphic to an abelian group, so the functor "essentially" reaches all objects in Grp\mathbf{Grp}
Definition of essentially surjective functors, Functor - Wikipedia

Definition of fully faithful functors

  • A functor F:CDF: \mathcal{C} \to \mathcal{D} is fully faithful if for any two objects C1,C2C_1, C_2 in the domain category C\mathcal{C}, the map FC1,C2:HomC(C1,C2)HomD(F(C1),F(C2))F_{C_1, C_2}: \text{Hom}_{\mathcal{C}}(C_1, C_2) \to \text{Hom}_{\mathcal{D}}(F(C_1), F(C_2)) is bijective
    • Intuitively means the functor induces a bijection between the hom-sets of the source and target categories, preserving the morphism structure
  • The inclusion functor I:AbGrpI: \mathbf{Ab} \to \mathbf{Grp} is fully faithful
    • For any two abelian groups A,BA, B, the group homomorphisms between AA and BB are exactly the same as the group homomorphisms between I(A)I(A) and I(B)I(B)
  • The forgetful functor U:VectRSetU: \mathbf{Vect}_{\mathbb{R}} \to \mathbf{Set} is not fully faithful
    • There exist functions between the underlying sets of two vector spaces that are not linear transformations, so the functor does not induce a bijection on hom-sets
Definition of essentially surjective functors, Category Theory | Bartosz Milewski's Programming Cafe

Equivalence of functors

  • A functor F:CDF: \mathcal{C} \to \mathcal{D} is an equivalence if and only if it is both fully faithful and essentially surjective
  • If FF is an equivalence, then:
    1. By definition, FF has a quasi-inverse G:DCG: \mathcal{D} \to \mathcal{C} such that FG1DFG \cong 1_{\mathcal{D}} and GF1CGF \cong 1_{\mathcal{C}}
    2. Essential surjectivity follows from FG1DFG \cong 1_{\mathcal{D}}, as every object in D\mathcal{D} is isomorphic to an object in the image of FF
    3. Full faithfulness follows from the isomorphisms FG1DFG \cong 1_{\mathcal{D}} and GF1CGF \cong 1_{\mathcal{C}}, which induce bijections on hom-sets
  • If FF is fully faithful and essentially surjective, then:
    1. Essential surjectivity allows choosing, for each DDD \in \mathcal{D}, an object CDCC_D \in \mathcal{C} and an isomorphism αD:F(CD)D\alpha_D: F(C_D) \to D
    2. Define a functor G:DCG: \mathcal{D} \to \mathcal{C} by G(D)=CDG(D) = C_D and G(f)=F1(αDfαD1)G(f) = F^{-1}(\alpha_{D'} \circ f \circ \alpha_D^{-1}) for f:DDf: D \to D'
    3. The natural isomorphisms α:FG1D\alpha: FG \to 1_{\mathcal{D}} and β:GF1C\beta: GF \to 1_{\mathcal{C}} (induced by full faithfulness) make GG a quasi-inverse of FF, proving FF is an equivalence

Natural isomorphisms in surjective functors

  • Natural isomorphisms play a crucial role in defining essential surjectivity
    • A functor F:CDF: \mathcal{C} \to \mathcal{D} is essentially surjective if for every DDD \in \mathcal{D}, there exists CCC \in \mathcal{C} and an isomorphism αD:F(C)D\alpha_D: F(C) \to D
    • The collection of these isomorphisms αD\alpha_D forms a natural isomorphism α:FG1D\alpha: F \circ G \to 1_{\mathcal{D}}, where G:DCG: \mathcal{D} \to \mathcal{C} is a quasi-inverse of FF
  • The natural isomorphism α:FG1D\alpha: F \circ G \to 1_{\mathcal{D}} encodes the idea that every object in D\mathcal{D} is "essentially" reached by FF, up to isomorphism
  • Naturality of α\alpha ensures the isomorphisms αD\alpha_D are compatible with the morphisms in C\mathcal{C} and D\mathcal{D}
    • For any morphism f:DDf: D \to D' in D\mathcal{D}, the following diagram commutes: F(G(D)) @>F(G(f))>> F(G(D')) \\\\ @V\alpha_DVV @VV\alpha_{D'}V \\\\ D @>>f> D' \end{CD}$$