Fiveable

🔢Category Theory Unit 13 Review

QR code for Category Theory practice questions

13.4 Applications of the Yoneda lemma

13.4 Applications of the Yoneda lemma

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

The Yoneda Lemma is a powerful tool in category theory with wide-ranging applications. It establishes a deep connection between objects and their representable functors, allowing us to study complex structures through simpler functorial representations.

From algebraic geometry to sheaf theory, the Yoneda Lemma provides a unifying framework for understanding diverse mathematical concepts. It's crucial for proving the existence of adjoint functors and plays a key role in the theory of Kan extensions.

Yoneda Lemma Applications in Category Theory

Applications in algebraic geometry

  • Yoneda lemma establishes a connection between an object and its representable functor
    • For an object AA in a category C\mathcal{C}, the representable functor HomC(A,)\text{Hom}_{\mathcal{C}}(A, -) is fully faithful captures all the information about the object AA
    • Allows studying objects in a category through their functors provides a powerful tool for understanding the structure of objects
  • In algebraic geometry, schemes can be studied via their functors of points
    • A scheme XX represented by the functor hX:SchopSeth_X : \text{Sch}^{\text{op}} \to \text{Set}, where hX(S)=HomSch(S,X)h_X(S) = \text{Hom}_{\text{Sch}}(S, X) associates to each scheme SS the set of morphisms from SS to XX
    • Yoneda lemma ensures that this functor fully captures the scheme XX allows for a complete understanding of the scheme through its functor of points
  • Yoneda lemma used to prove the existence of the Hilbert scheme parametrizes closed subschemes of a given scheme with a fixed Hilbert polynomial
    • Hilbert functor HilbP(t)(X):SchopSet\text{Hilb}_{P(t)}(X) : \text{Sch}^{\text{op}} \to \text{Set} associates to each scheme SS the set of closed subschemes of X×SX \times S with Hilbert polynomial P(t)P(t)
    • If this functor is representable, the representing object is the Hilbert scheme by the Yoneda lemma
Applications in algebraic geometry, Hilbert curve - Wikipedia

Proofs for adjoint functors

  • Yoneda lemma is a powerful tool for proving the existence of adjoint functors establishes a correspondence between certain functors and their adjoints
  • Given functors F:CDF : \mathcal{C} \to \mathcal{D} and G:DCG : \mathcal{D} \to \mathcal{C}, FF is left adjoint to GG (and GG is right adjoint to FF) if there is a natural isomorphism:
    • HomD(F(C),D)HomC(C,G(D))\text{Hom}_{\mathcal{D}}(F(C), D) \cong \text{Hom}_{\mathcal{C}}(C, G(D)) for all objects CC in C\mathcal{C} and DD in D\mathcal{D} establishes a bijection between morphisms in the two categories
  • To prove the existence of a left adjoint to a functor GG, it suffices to show that the functor HomD(,G())\text{Hom}_{\mathcal{D}}(-, G(-)) is representable
    • By the Yoneda lemma, the representing object of this functor is the left adjoint of GG provides a concrete way to construct the adjoint functor
  • Dually, to prove the existence of a right adjoint to a functor FF, it suffices to show that the functor HomC(F(),)\text{Hom}_{\mathcal{C}}(F(-), -) is representable by the Yoneda lemma
Applications in algebraic geometry, The Hilbert curve

Role in sheaves and stacks

  • Yoneda lemma is fundamental in the theory of sheaves and stacks provides a way to study geometric objects through their functors
  • A presheaf on a topological space XX is a contravariant functor F:Open(X)opSetF : \text{Open}(X)^{\text{op}} \to \text{Set} associates to each open set of XX a set, and to each inclusion of open sets a restriction map
    • The category of presheaves on XX is denoted by PSh(X)\text{PSh}(X) is an important object of study in sheaf theory
  • A sheaf is a presheaf satisfying the gluing axiom allows for the construction of global sections from local data
    • The category of sheaves on XX is denoted by Sh(X)\text{Sh}(X) is a full subcategory of PSh(X)\text{PSh}(X)
  • Yoneda lemma implies that the Yoneda embedding y:Open(X)PSh(X)y : \text{Open}(X) \to \text{PSh}(X), given by y(U)=HomOpen(X)(,U)y(U) = \text{Hom}_{\text{Open}(X)}(-, U), is fully faithful
    • Allows for studying open sets of XX through their representable presheaves provides a way to understand the topology of XX through functors
  • A stack is a generalization of a sheaf, where the gluing axiom is replaced by a weaker condition involving groupoids allows for the study of geometric objects with automorphisms
    • Yoneda lemma plays a crucial role in the theory of stacks, as it allows for studying geometric objects through their functors of points provides a powerful tool for understanding moduli problems

Connection to Kan extensions

  • Yoneda lemma is closely related to the theory of Kan extensions provides a way to extend functors along other functors
  • Given functors F:CDF : \mathcal{C} \to \mathcal{D} and K:CEK : \mathcal{C} \to \mathcal{E}, a left Kan extension of FF along KK is a functor LanKF:ED\text{Lan}_K F : \mathcal{E} \to \mathcal{D} together with a natural transformation η:FLanKFK\eta : F \Rightarrow \text{Lan}_K F \circ K satisfying a universal property
  • Yoneda lemma can be used to prove the existence of left Kan extensions
    • Left Kan extension of FF along KK can be computed as (LanKF)(E)=CCHomE(K(C),E)F(C)(\text{Lan}_K F)(E) = \int^{C \in \mathcal{C}} \text{Hom}_{\mathcal{E}}(K(C), E) \cdot F(C) is a weighted colimit
    • Yoneda lemma ensures that this formula defines a functor LanKF:ED\text{Lan}_K F : \mathcal{E} \to \mathcal{D} satisfying the required universal property
  • Dually, Yoneda lemma can be used to prove the existence of right Kan extensions
    • Right Kan extension of FF along KK can be computed as (RanKF)(E)=CCHomE(E,K(C))F(C)(\text{Ran}_K F)(E) = \int_{C \in \mathcal{C}} \text{Hom}_{\mathcal{E}}(E, K(C)) \pitchfork F(C) is a weighted limit
    • Yoneda lemma ensures that this formula defines a functor RanKF:ED\text{Ran}_K F : \mathcal{E} \to \mathcal{D} satisfying the required universal property