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 moreAdjoint 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsInjective, Surjective, and Bijective FunctionsCategories and MorphismsFunctorsCommutative Diagrams in Category TheoryCommutative Diagrams and CompositionNatural Transformations2-Categories and Weak FunctorsNatural Isomorphisms Between FunctorsIsomorphisms in CategoriesUniversal PropertiesInitial and Terminal ObjectsProducts and CoproductsEqualizers and CoequalizersLimits and ColimitsThe Yoneda Lemma

Longest path: 88 steps · 403 total prerequisite topics

Prerequisites (12)

Leads To (6)