Fiveable

🔢Category Theory Unit 4 Review

QR code for Category Theory practice questions

4.4 Functor categories and natural transformations

4.4 Functor categories and natural transformations

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

Functor categories take functors as objects and natural transformations as morphisms. They provide a framework for studying relationships between categories, with examples like Set^C and Grp^C representing functors from a category C to sets or groups.

Natural transformations are the key to understanding functor categories. They map between functors, preserving structure through the naturality condition. Composition of natural transformations, both vertical and horizontal, allows for complex relationships between functors to be explored.

Functor Categories

Functor categories and examples

  • A functor category is a category whose objects are functors between two fixed categories CC and DD
    • The morphisms in a functor category are natural transformations between these functors
  • Examples of functor categories include:
    • SetCSet^C: functors from category CC to the category of sets (SetSet)
    • GrpCGrp^C: functors from category CC to the category of groups (GrpGrp)
    • TopCTop^C: functors from category CC to the category of topological spaces (TopTop)
    • VectkCVect_k^C: functors from category CC to the category of vector spaces over a field kk (VectkVect_k)
Functor categories and examples, Bartosz Milewski's Programming Cafe | Category Theory, Haskell, Concurrency, C++ | Page 2

Natural transformations as morphisms

  • In a functor category, the morphisms between functors F,G:CDF, G: C \rightarrow D are natural transformations α:FG\alpha: F \Rightarrow G
    • A natural transformation α\alpha assigns to each object XX in CC a morphism αX:F(X)G(X)\alpha_X: F(X) \rightarrow G(X) in DD
    • These morphisms must satisfy the naturality condition: for every morphism f:XYf: X \rightarrow Y in CC, the following diagram commutes:
      </>Code
      F(X) --F(f)--> F(Y)
       |              |
      αX             αY
       |              |
       v              v
      G(X) --G(f)--> G(Y)
  • The naturality condition ensures that the morphisms αX\alpha_X are compatible with the functorial actions of FF and GG
Functor categories and examples, Adjoint functors - Wikipedia

Composition of natural transformations

  • Natural transformations can be composed in two ways: vertically and horizontally
  • Vertical composition:
    1. Given natural transformations α:FG\alpha: F \Rightarrow G and β:GH\beta: G \Rightarrow H, their vertical composition βα:FH\beta \circ \alpha: F \Rightarrow H is defined componentwise
    2. For each object XX in CC, (βα)X=βXαX(\beta \circ \alpha)_X = \beta_X \circ \alpha_X
    3. The vertical composition of natural transformations is associative and has an identity (the identity natural transformation)
  • Horizontal composition:
    1. Given natural transformations α:FG\alpha: F \Rightarrow G and β:HK\beta: H \Rightarrow K where F,G:CDF, G: C \rightarrow D and H,K:DEH, K: D \rightarrow E, their horizontal composition βα:HFKG\beta * \alpha: HF \Rightarrow KG is defined componentwise
    2. For each object XX in CC, (βα)X=βG(X)H(αX)(\beta * \alpha)_X = \beta_{G(X)} \circ H(\alpha_X)
    3. The horizontal composition of natural transformations is also associative and has an identity

Relationships between functors

  • Natural transformations can establish various relationships between functors:
    • Isomorphism: functors FF and GG are naturally isomorphic (FGF \cong G) if there exist natural transformations α:FG\alpha: F \Rightarrow G and β:GF\beta: G \Rightarrow F such that βα=idF\beta \circ \alpha = id_F and αβ=idG\alpha \circ \beta = id_G
    • Equivalence: functors FF and GG are naturally equivalent if they are naturally isomorphic up to isomorphism in the target category
    • Adjunction: functors F:CDF: C \rightarrow D and G:DCG: D \rightarrow C form an adjunction if there exist natural transformations η:idCGF\eta: id_C \Rightarrow GF (unit) and ε:FGidD\varepsilon: FG \Rightarrow id_D (counit) satisfying certain conditions (triangle identities)
  • These relationships capture the idea of functors being "the same" or "similar" in various ways

Natural isomorphisms and equivalences

  • A natural isomorphism is a natural transformation α:FG\alpha: F \Rightarrow G where each component αX\alpha_X is an isomorphism in the target category DD
    • The inverse of a natural isomorphism α\alpha is a natural transformation α1:GF\alpha^{-1}: G \Rightarrow F with components (α1)X=(αX)1(\alpha^{-1})_X = (\alpha_X)^{-1}
  • Functors FF and GG are naturally isomorphic (FGF \cong G) if there exists a natural isomorphism between them
    • Natural isomorphism is an equivalence relation on functors: it is reflexive, symmetric, and transitive
  • Functors FF and GG are naturally equivalent if they are naturally isomorphic up to isomorphism in the target category
    • Equivalence of functors is a weaker notion than natural isomorphism
    • Naturally equivalent functors share many categorical properties and are often considered "the same" in a broader sense
2,589 studying →