How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Yoneda embedding of the walking-arrow category computed objectwise
Example
Let be the walking-arrow category . Its only morphisms are . The Yoneda embedding has the table
and has components at and the empty function at .
Facts & Assumptions
Given: The category with the two objects and three morphisms displayed above.
A category has identity morphisms, associative composition, and the two identity laws (Category, object, morphism, domain, codomain, identity, composition, and hom-collection).
For a small category, the Yoneda functor sends to and to postcomposition (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).
The Yoneda functor is fully faithful: postcomposition gives a bijection (The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective).
A function gives one value for each domain element; no function has a nonempty domain and empty codomain, while there is exactly one empty function (A function is a relation with and implying ; , the value , domain and codomain).
Verification
The hom-sets are , , , and . These are exactly the four object values in the displayed table.
A presheaf represented by acts on by precomposition with . For this is the empty function ; for it sends to by [F1].
By [F2], is postcomposition with . At it sends to , and at it is the unique empty function. This proves the asserted component table, including the empty hom-set.
There is one natural transformation and one , namely the identity and . There is no transformation because its component at would be a function , forbidden by [F3].
A transformation has forced singleton-to-singleton components, and the naturality square commutes by [F1], so it is the identity. Hence the four natural-transformation sets have the same empty-or-singleton table as the four hom-sets, exactly as [L1] asserts.
Composition in the image has only the identity composites and composed with an identity; by [F1] and step 2.2 these reproduce the composition of in .
Depends on
- The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding
- The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective
- Category, object, morphism, domain, codomain, identity, composition, and hom-collection
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 45 results over 19 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Tom Leinster, Basic Category Theory, Definition 4.1.21 and Corollary 4.3.7 (standard reference, not scraped)