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

Yoneda Embedding and Full Faithfulness

Research Depth 89 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
406prerequisites beneath it
See this on the map →
Hom-Functors and RepresentabilityNatural Isomorphisms and Universal Constructions+4 more→→Presheaves and Sheaves on Categories
yoneda embedding representable presheaf

Core Idea

The Yoneda embedding is the functor Y: C → [Cop, Set] sending each object X to Hom(−, X), embedding any small category into its presheaf category. This embedding is always fully faithful, meaning it is injective on morphisms and surjective when restricted to hom-sets. The Yoneda embedding allows any category to be realized as a full subcategory of set-valued functors, making presheaves the universal model for categorical structures.

How It's Best Learned

Work through the proof that Yoneda embedding is fully faithful using the Yoneda lemma directly. Apply it to finite posets and small categories, noting which presheaves are representable and which are not. Use the embedding to transfer categorical problems to set-valued functor problems.

Common Misconceptions

The Yoneda embedding is fully faithful but not surjective on objects—many presheaves are not representable. The embedding's usefulness comes from allowing non-representable presheaves to exist and be studied systematically. Full faithfulness means the category is determined by its morphism structure alone.

Explainer

From the Yoneda lemma, you know that for any functor F: Cop → Set and any object X in C, natural transformations Nat(Hom(−,X), F) are in natural bijection with elements of F(X). The Yoneda embedding is the special case where we fix F = Hom(−,Y) for a second object Y. Plugging this in: Nat(Hom(−,X), Hom(−,Y)) ≅ Hom(Y,X)... wait, let us be careful about contravariance. The Yoneda lemma gives Nat(Hom(−,X), F) ≅ F(X), so with F = Hom(−,Y) we get Nat(Hom(−,X), Hom(−,Y)) ≅ Hom(Y, X) — no, that still isn't right. For the covariant embedding Y: C → [Cop, Set] sending X ↦ Hom(−,X), the Yoneda lemma gives Nat(Hom(−,X), Hom(−,Y)) ≅ Hom(X,Y). The bijection sends a morphism f: X → Y to the natural transformation whose component at Z is post-composition with f.

This single computation is the proof of full faithfulness. The embedding Y is faithful (injective on morphisms): if two morphisms f, g: X → Y induce the same natural transformation Hom(−,X) ⟹ Hom(−,Y), then in particular their component at X sends id_X to f and to g respectively, forcing f = g. The embedding is full (surjective on morphisms between representables): every natural transformation Hom(−,X) ⟹ Hom(−,Y) is post-composition with some morphism X → Y, by the Yoneda bijection above. Together: the hom-set Hom_C(X,Y) is in bijection with the hom-set Hom_{[Cop,Set]}(Y(X), Y(Y)). The functor Y does not distort morphisms at all.

The philosophical punch line is: an object X in C is completely determined, up to isomorphism, by the functor Hom(−,X) — that is, by the totality of how other objects map into X. Two objects with naturally isomorphic hom-functors are isomorphic. This is the categorical version of the principle "you are known by your relationships." In your prerequisite on representable functors, you saw that a functor F is representable when it is naturally isomorphic to some Hom(−,X); full faithfulness of the Yoneda embedding means representability is a property of the functor F, uniquely determined up to isomorphism of the representing object X.

The presheaf category [Cop, Set] is much larger than C: it contains C as a full subcategory via Y, but also all the non-representable presheaves — functors that do not arise as Hom(−,X) for any X. Think of these as "formal" or "virtual" objects that behave as if they could be in C but are not. This is analogous to the way the rational numbers embed into the reals: ℚ embeds faithfully into ℝ, but ℝ contains limits of Cauchy sequences that are not rational. The presheaf category is the free cocompletion of C — it adds all the colimits (formal colimits of diagrams in C) that C might be missing. Any functor from C to a cocomplete category extends uniquely along Y to a colimit-preserving functor from [Cop, Set]. This universal property is what makes the Yoneda embedding indispensable in topos theory and modern categorical logic.

A subtlety worth holding onto: Y is fully faithful but not essentially surjective (not every presheaf is representable), so it is not an equivalence of categories. The gap — the non-representable presheaves — is not a deficiency but a resource. Sheaf theory, for example, is the study of presheaves satisfying a local-gluing condition, and the objects of a Grothendieck topos are exactly the sheaves in this extended presheaf world. The Yoneda embedding is the door into this territory: it embeds the category you understand into a larger, richer world where many constructions that were impossible become routine.

Practice Questions 5 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 → Hom-Functors and Representability → Yoneda Embedding and Full Faithfulness

Longest path: 90 steps · 406 total prerequisite topics

Prerequisites (6)

Leads To (1)