Fiveable

🔢Category Theory Unit 4 Review

QR code for Category Theory practice questions

4.1 Definition and types of functors

4.1 Definition and types of 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, mapping objects and morphisms between categories while preserving structure. They come in two flavors: covariant, which keep the direction of morphisms, and contravariant, which flip them.

Examples of functors include the identity functor, power set functor, and forgetful functor. Functors preserve composition and identity morphisms, ensuring the structure of the source category is maintained in the target category.

Functors

Functors as structure-preserving maps

  • Functors map objects to objects and morphisms to morphisms between categories while preserving the categorical structure
  • For categories CC and DD, a functor F:CDF: C \to D consists of:
    • Object function assigns each object XX in CC to an object F(X)F(X) in DD
    • Morphism function assigns each morphism f:XYf: X \to Y in CC to a morphism F(f):F(X)F(Y)F(f): F(X) \to F(Y) in DD
  • Functors preserve the composition of morphisms
    • For morphisms f:XYf: X \to Y and g:YZg: Y \to Z in CC, F(gf)=F(g)F(f)F(g \circ f) = F(g) \circ F(f)
  • Functors preserve the identity morphisms
    • For any object XX in CC, F(idX)=idF(X)F(id_X) = id_{F(X)}
Functors as structure-preserving maps, Adjoint functors - Wikipedia

Covariant vs contravariant functors

  • Covariant functors preserve the direction of morphisms
    • For f:XYf: X \to Y in CC, covariant functor FF maps it to F(f):F(X)F(Y)F(f): F(X) \to F(Y) in DD
  • Contravariant functors reverse the direction of morphisms
    • For f:XYf: X \to Y in CC, contravariant functor FF maps it to F(f):F(Y)F(X)F(f): F(Y) \to F(X) in DD
    • Contravariant functors still preserve composition, but in the opposite order
      • For f:XYf: X \to Y and g:YZg: Y \to Z in CC, F(gf)=F(f)F(g)F(g \circ f) = F(f) \circ F(g)
Functors as structure-preserving maps, Bartosz Milewski's Programming Cafe | Category Theory, Haskell, Concurrency, C++

Examples of category functors

  • Identity functor 1C:CC1_C: C \to C maps each object and morphism in CC to itself
  • Power set functor P:SetSet\mathcal{P}: \mathbf{Set} \to \mathbf{Set} maps each set to its power set and each function to its induced function between power sets
  • Dual functor ()op:CCop(\cdot)^{op}: C \to C^{op} maps each object in CC to itself and each morphism f:XYf: X \to Y to its opposite fop:YXf^{op}: Y \to X
  • Forgetful functor U:GrpSetU: \mathbf{Grp} \to \mathbf{Set} maps each group to its underlying set and each group homomorphism to its underlying function

Preservation of morphism properties

  • Given functor F:CDF: C \to D and morphisms f:XYf: X \to Y, g:YZg: Y \to Z in CC:
    1. F(gf)=F(g)F(f)F(g \circ f) = F(g) \circ F(f), demonstrating functors preserve composition
  • For any object XX in CC:
    • F(idX)=idF(X)F(id_X) = id_{F(X)}, showing functors preserve identity morphisms
  • These properties ensure the structure of the source category is maintained in the target category under the functor mapping
2,589 studying →