Fiveable

🔢Category Theory Unit 4 Review

QR code for Category Theory practice questions

4.3 Faithful, full, and essentially surjective functors

4.3 Faithful, full, and essentially surjective 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 are the backbone of category theory, allowing us to compare and connect different mathematical structures. In this section, we dive into three key properties of functors: faithfulness, fullness, and essential surjectivity.

These properties are crucial for understanding equivalence of categories, a fundamental concept that helps us identify when two seemingly different mathematical structures are essentially the same. We'll explore how these properties combine to define category equivalence.

Functors and Equivalence of Categories

Definition of faithful functors

  • A functor F:CDF: C \to D is faithful if it is injective on the hom-sets between any two objects
    • If for any two objects X,YX, Y in CC and any two parallel morphisms f,g:XYf, g: X \to Y in CC, F(f)=F(g)F(f) = F(g) implies f=gf = g
  • The forgetful functor U:GrpSetU: Grp \to Set is faithful
    • Maps group homomorphisms to functions
    • If two group homomorphisms are mapped to the same function, they must be the same homomorphism
  • The inclusion functor I:AbGrpI: Ab \to Grp from the category of abelian groups to the category of groups is faithful
    • Embeds AbAb as a subcategory of GrpGrp
Definition of faithful functors, functions - Injective & Surjective - Mathematics Stack Exchange

Definition of full functors

  • A functor F:CDF: C \to D is full if it is surjective on the hom-sets between any two objects
    • For any two objects X,YX, Y in CC and any morphism h:F(X)F(Y)h: F(X) \to F(Y) in DD, there exists a morphism f:XYf: X \to Y in CC such that F(f)=hF(f) = h
  • The functor F:SetSetF: Set \to Set that maps each set to its power set and each function to its induced function between power sets is full
  • The inclusion functor I:AbGrpI: Ab \to Grp is not full
    • There are group homomorphisms between abelian groups that are not homomorphisms in the category AbAb (the inversion map xx1x \mapsto x^{-1} in a non-abelian group)
Definition of faithful functors, Functors and monads for analyzing data

Definition of essentially surjective functors

  • A functor F:CDF: C \to D is essentially surjective if every object in the codomain category is isomorphic to an object in the image of the functor
    • For every object YY in DD, there exists an object XX in CC such that F(X)F(X) is isomorphic to YY
  • The functor F:FinSetFinSetF: FinSet \to FinSet that maps each finite set to its double (the disjoint union of the set with itself) and each function to its induced function between the doubled sets is essentially surjective
  • The inclusion functor I:AbGrpI: Ab \to Grp is not essentially surjective
    • There are groups (non-abelian groups) that are not isomorphic to any abelian group

Equivalence of categories proof

  • An equivalence of categories is a functor F:CDF: C \to D for which there exists a functor G:DCG: D \to C such that GF1CG \circ F \cong 1_C and FG1DF \circ G \cong 1_D
    • 1C1_C and 1D1_D are the identity functors on CC and DD, respectively
  • Proof:
    1. (\Rightarrow) If FF is an equivalence of categories, then it is faithful, full, and essentially surjective:
      • Faithful: If F(f)=F(g)F(f) = F(g), then G(F(f))=G(F(g))G(F(f)) = G(F(g)). Since GF1CG \circ F \cong 1_C, we have f=gf = g
      • Full: For any h:F(X)F(Y)h: F(X) \to F(Y) in DD, there exists a morphism k:XG(F(Y))k: X \to G(F(Y)) in CC such that F(k)=hφYF(k) = h \circ \varphi_Y, where φ:FG1D\varphi: F \circ G \Rightarrow 1_D is the natural isomorphism. Then, f=G(φY)kf = G(\varphi_Y) \circ k satisfies F(f)=hF(f) = h
      • Essentially surjective: For any YY in DD, F(G(Y))F(G(Y)) is isomorphic to YY via the natural isomorphism φ:FG1D\varphi: F \circ G \Rightarrow 1_D
    2. (\Leftarrow) If FF is faithful, full, and essentially surjective, then it is an equivalence of categories:
      • Define G:DCG: D \to C as follows:
        • For each YY in DD, choose an object G(Y)G(Y) in CC such that F(G(Y))F(G(Y)) is isomorphic to YY (which exists by essential surjectivity)
        • For each morphism h:YYh: Y \to Y' in DD, define G(h)G(h) as the unique morphism G(Y)G(Y)G(Y) \to G(Y') such that F(G(h))=φYhφY1F(G(h)) = \varphi_{Y'} \circ h \circ \varphi_Y^{-1}, where φY:F(G(Y))Y\varphi_Y: F(G(Y)) \to Y and φY:F(G(Y))Y\varphi_{Y'}: F(G(Y')) \to Y' are the chosen isomorphisms (which exists by fullness and faithfulness)
      • The natural isomorphisms φ:FG1D\varphi: F \circ G \Rightarrow 1_D and ψ:1CGF\psi: 1_C \Rightarrow G \circ F can be defined using the chosen isomorphisms and the fullness and faithfulness of FF, making FF and GG quasi-inverses and thus an equivalence of categories