2-Yoneda lemma¶

A bicategorical generalization of Yoneda identifying pseudonatural transformations from a representable pseudofunctor to F with the category F assigns to the representing object.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3152
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Higher Category Theory → Mathematics

Core Idea¶

The 2-Yoneda lemma states that evaluation at the identity 1_x yields an equivalence between the category of pseudonatural transformations h_x⇒F and F(x). A transformation is determined up to coherent isomorphism by its component at the representing identity, and any object of F(x) reconstructs such a transformation through pseudofunctorial action. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. All three generators agree: a child-level version reduces to 'a thing is known exactly from one special piece', which is ordinary Yoneda's set-level bijection rather than an equivalence up to coherent isomorphism.

No faithful explanation at this level. All three generators agree: without categories and sameness up to isomorphism, the simplest story becomes exact determination, collapsing into the ordinary set-level Yoneda bijection the 2-categorical statement replaces.

Yoneda Up to Equivalence

In category theory, the Yoneda lemma says that a certain kind of transformation out of a 'representable' functor is completely determined by where it sends one special element — the identity on an object x — and that this gives a perfect one-to-one correspondence. The 2-Yoneda lemma is the version for 2-categories, where there are arrows between arrows. There, the transformations are 'pseudonatural', meaning their rules hold up to specified isomorphisms rather than exactly. The conclusion changes accordingly: evaluating at the identity gives an equivalence of categories, not a one-to-one correspondence of sets. So a transformation is determined by its component at the identity only up to coherent isomorphism, and any object of F(x) can be used to rebuild one.

Let F be a pseudofunctor from a 2-category into Cat and let h_x be the representable 2-functor at x. The 2-Yoneda lemma states that evaluation at the identity 1_x gives an equivalence between the category of pseudonatural transformations h_x ⇒ F (with modifications as morphisms) and the category F(x). In one direction, a transformation is sent to its component at 1_x; in the other, any object of F(x) reconstructs a pseudonatural transformation using F's pseudofunctorial action. These two passages form an equivalence, so a transformation is determined by its component at the representing identity up to coherent isomorphism, not up to equality. This contrasts with the ordinary Yoneda lemma's set-level bijection: here categories, equivalence, pseudonaturality and modifications replace sets, bijection and strict naturality. Applying it correctly requires respecting all the coherence constraints that make evaluation and reconstruction an equivalence.

Scope of Application¶

2-Yoneda lemma belongs to higher category theory and is useful where the analyst can specify a 2-category or bicategory, object x, hom pseudofunctor h_x, target pseudofunctor F, pseudonatural transformations, modifications, and evaluation at identity, then evaluate evaluation and reconstruction form an equivalence of categories with all coherence constraints respected. The scope is broad within that domain but bounded by the need for evaluation and reconstruction form an equivalence of categories with all coherence constraints respected. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making evaluation and reconstruction form an equivalence of categories with all coherence constraints respected the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name 2-Yoneda lemma can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to 2-Yoneda lemma. 2-Yoneda lemma compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a 2-category or bicategory, object x, hom pseudofunctor h_x, target pseudofunctor F, pseudonatural transformations, modifications, and evaluation at identity. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express evaluation and reconstruction form an equivalence of categories with all coherence constraints respected independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of higher category theory because they reuse a 2-category or bicategory, object x, hom pseudofunctor h_x, target pseudofunctor F, pseudonatural transformations, modifications, and evaluation at identity, A transformation is determined up to coherent isomorphism by its component at the representing identity, and any object of F(x) reconstructs such a transformation through pseudofunctorial action., and type the carrier, state every parameter and convention in the definition, test that evaluation and reconstruction form an equivalence of categories with all coherence constraints respected, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction 2-Yoneda lemma Domain-specific

Parents (1) — outgoing typed relations

2-Yoneda lemma is a kind of Representation Prime

What makes it its own entry: Unlike ordinary Yoneda's set-level bijection, the 2-categorical statement uses categories, equivalence, pseudonaturality, and modifications rather than strict equality.

Hierarchy path (1) — routes to 1 parentless root

2-Yoneda lemma → is a kind of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

2-Yoneda lemma sits in a crowded region of the domain-specific corpus (16^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Categorical Constructions & Dualities (33 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25