Fiveable

🔢Category Theory Unit 9 Review

QR code for Category Theory practice questions

9.2 Unit and counit of an adjunction

9.2 Unit and counit of an adjunction

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

Adjunctions in category theory connect two categories through functors. The unit and counit are key natural transformations that define this relationship. They map objects between categories, showing how they relate.

Understanding unit and counit is crucial for grasping adjunctions. These transformations satisfy specific conditions, ensuring the adjunction works properly. They help us see how objects in different categories correspond to each other.

Unit and Counit of an Adjunction

Definition of unit and counit

  • Given an adjunction FGF \dashv G between categories C\mathcal{C} and D\mathcal{D}, the unit is a natural transformation η:1CGF\eta: 1_\mathcal{C} \to GF and the counit is a natural transformation ε:FG1D\varepsilon: FG \to 1_\mathcal{D}
  • The unit has a component ηX:XGF(X)\eta_X: X \to GF(X) for each object XX in C\mathcal{C} (C\mathcal{C} could be the category of sets and XX a specific set)
  • The counit has a component εY:FG(Y)Y\varepsilon_Y: FG(Y) \to Y for each object YY in D\mathcal{D} (D\mathcal{D} could be the category of vector spaces and YY a specific vector space)
Definition of unit and counit, Bartosz Milewski's Programming Cafe | Category Theory, Haskell, Concurrency, C++

Role in adjunctions

  • The unit η\eta and counit ε\varepsilon relate objects in C\mathcal{C} and D\mathcal{D} via the adjoint functors FF and GG, establishing a connection between the categories
  • The unit η\eta embeds an object XX in C\mathcal{C} into the image of D\mathcal{D} under GG, i.e., GF(X)GF(X), acting as a "canonical map" from XX to GF(X)GF(X) (e.g., embedding a set into its free vector space)
  • The counit ε\varepsilon projects an object FG(Y)FG(Y) in the image of C\mathcal{C} under FF back to the original object YY in D\mathcal{D}, acting as a "canonical map" from FG(Y)FG(Y) to YY (e.g., projecting a vector space onto its underlying set)
  • The unit and counit satisfy coherence conditions (triangle identities) ensuring compatibility with the adjunction
Definition of unit and counit, n-group (category theory) - Wikipedia

Triangle identities proof

  • Given an adjunction FGF \dashv G with unit η\eta and counit ε\varepsilon, the triangle identities are:
    1. For each object XX in C\mathcal{C}: G(εF(X))ηG(F(X))=1G(F(X))G(\varepsilon_{F(X)}) \circ \eta_{G(F(X))} = 1_{G(F(X))}
    2. For each object YY in D\mathcal{D}: εF(G(Y))F(ηG(Y))=1F(G(Y))\varepsilon_{F(G(Y))} \circ F(\eta_{G(Y)}) = 1_{F(G(Y))}
  • Proof of the first identity:
    1. Start with the adjunction isomorphism: HomD(F(X),Y)HomC(X,G(Y))\text{Hom}_\mathcal{D}(F(X), Y) \cong \text{Hom}_\mathcal{C}(X, G(Y))
    2. Set Y=F(X)Y = F(X) and apply the isomorphism to 1F(X)1_{F(X)} to obtain ηX\eta_X
    3. Apply GG to both sides of εF(X)F(ηX)=1F(X)\varepsilon_{F(X)} \circ F(\eta_X) = 1_{F(X)} to obtain the first identity
  • The second identity is proven similarly by setting X=G(Y)X = G(Y) and applying the adjunction isomorphism to 1G(Y)1_{G(Y)}

Determination of adjunction isomorphism

  • Given functors F:CDF: \mathcal{C} \to \mathcal{D} and G:DCG: \mathcal{D} \to \mathcal{C} with natural transformations η:1CGF\eta: 1_\mathcal{C} \to GF and ε:FG1D\varepsilon: FG \to 1_\mathcal{D} satisfying the triangle identities, the adjunction isomorphism can be reconstructed:
    1. For objects XX in C\mathcal{C} and YY in D\mathcal{D}, define φ:HomD(F(X),Y)HomC(X,G(Y))\varphi: \text{Hom}_\mathcal{D}(F(X), Y) \to \text{Hom}_\mathcal{C}(X, G(Y)) by φ(f)=G(f)ηX\varphi(f) = G(f) \circ \eta_X
    2. Define ψ:HomC(X,G(Y))HomD(F(X),Y)\psi: \text{Hom}_\mathcal{C}(X, G(Y)) \to \text{Hom}_\mathcal{D}(F(X), Y) by ψ(g)=εYF(g)\psi(g) = \varepsilon_Y \circ F(g)
  • To show φ\varphi and ψ\psi are inverses:
    1. For f:F(X)Yf: F(X) \to Y, ψ(φ(f))=εYF(G(f)ηX)=(εYFG(f))F(ηX)=f(εF(X)F(ηX))=f1F(X)=f\psi(\varphi(f)) = \varepsilon_Y \circ F(G(f) \circ \eta_X) = (\varepsilon_Y \circ FG(f)) \circ F(\eta_X) = f \circ (\varepsilon_{F(X)} \circ F(\eta_X)) = f \circ 1_{F(X)} = f
    2. For g:XG(Y)g: X \to G(Y), φ(ψ(g))=G(εYF(g))ηX=(G(εY)GF(g))ηX=G(εY)(GF(g)ηX)=G(εY)ηG(Y)g=1G(Y)g=g\varphi(\psi(g)) = G(\varepsilon_Y \circ F(g)) \circ \eta_X = (G(\varepsilon_Y) \circ GF(g)) \circ \eta_X = G(\varepsilon_Y) \circ (GF(g) \circ \eta_X) = G(\varepsilon_Y) \circ \eta_{G(Y)} \circ g = 1_{G(Y)} \circ g = g
  • Thus, the unit and counit determine the adjunction up to isomorphism (e.g., the free-forgetful adjunction between sets and groups)