A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

The Yoneda Lemma

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
42topics build on this
403prerequisites beneath it
See this on the map →
Natural TransformationsRepresentable Functors+10 more→→Adjoint FunctorsEquivalence of Categories+4 more
Yoneda lemma Yoneda embedding natural transformations presheaf representability

Core Idea

The Yoneda lemma states that for any functor F: C → Set and any object A in C, there is a bijection Nat(Hom(A,-), F) ≅ F(A) that is natural in both A and F. This means natural transformations from a representable functor to any functor F are completely determined by a single element of F(A). The Yoneda embedding A ↦ Hom(A,-) is a fully faithful functor from C to [Cop, Set], showing every category embeds into a presheaf category and that an object is completely determined by how morphisms map into it from all other objects.

How It's Best Learned

Work through the proof step by step: given a natural transformation η: Hom(A,-) ⇒ F, evaluate at A and apply to id_A to get an element of F(A). Verify this map is an inverse to the map F(A) → Nat(Hom(A,-), F) given by the Yoneda construction. Appreciate the slogan 'an object is determined by its relationships with all other objects'.

Common Misconceptions

Explainer

To understand the Yoneda lemma, start with what a natural transformation from Hom(A,-) to F actually is. Hom(A,-) is a functor that sends each object X to the set of morphisms A → X. A natural transformation η: Hom(A,-) ⇒ F assigns to each object X a function η_X: Hom(A,X) → F(X), subject to naturality squares commuting for every morphism in C. The question is: how much freedom do you have in choosing such an η?

The Yoneda lemma gives a surprising answer: none at all, once you fix one thing. The naturality conditions are so rigid that the entire natural transformation η is completely determined by a single element of F(A) — specifically, by η_A(id_A), the image of the identity morphism on A. Every component η_X is then forced by the functoriality of F and the naturality condition. This means the (potentially enormous) collection of all natural transformations Nat(Hom(A,-), F) is in bijection with the set F(A), which may be much smaller and more concrete.

The bijection goes both ways. Given any element s ∈ F(A), you construct a natural transformation η^s by defining η^s_X(f) = F(f)(s) for any morphism f: A → X. Naturality is automatic from the functoriality of F. The proof that these two constructions are inverse to each other is a short diagram chase that repays close reading — following id_A through both directions reveals why the whole argument works.

The Yoneda embedding takes this further. The assignment A ↦ Hom(A,-) defines a functor from Cop into the functor category [C, Set]. The Yoneda lemma implies this functor is fully faithful: morphisms between objects in C correspond exactly to natural transformations between their representable functors. This means C embeds into [Cop, Set] without losing any structural information — every object is completely determined by how morphisms map out of it into every other object. The slogan is: an object is its relationships.

This principle has far-reaching consequences. Representability becomes a way to define objects by universal properties rather than by internal construction. Limits, colimits, and adjunctions can all be characterized Yoneda-style. In more advanced contexts, the Yoneda lemma underlies the theory of sheaves, stacks, and the entire approach of algebraic geometry via functor-of-points. It is not an isolated lemma — it is the lens through which category theory sees everything.

Practice Questions 3 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Commutative Diagrams in Category Theory → Commutative Diagrams and Composition → Natural Transformations → 2-Categories and Weak Functors → Natural Isomorphisms Between Functors → Isomorphisms in Categories → Universal Properties → Initial and Terminal Objects → Products and Coproducts → Equalizers and Coequalizers → Limits and Colimits → The Yoneda Lemma

Longest path: 88 steps · 403 total prerequisite topics

Prerequisites (12)

Leads To (6)