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.
For a presheaf , naturally in and
Statement
Let be locally small, let be an object, and let be a presheaf. Evaluation at the identity gives a bijection
whose inverse sends to the natural transformation with -component . It is natural in both variables. In particular, for and ,
and postcomposition by a natural transformation corresponds to its component at .
Facts & Assumptions
Given: The locally small category , object , presheaf , and the morphisms and natural transformations in the statement.
For a covariant functor , evaluation at the identity is a bijection whose inverse sends to the transformation with component (Evaluation at the identity gives and proves that the natural-transformation collection is a set), and this bijection is natural in and in (The Yoneda bijection is natural in both and ).
The opposite category has the same objects and satisfies (Opposite category ).
A theorem derived from category axioms has a formal dual obtained by reversing morphisms and composition (Every theorem about categories has a formal dual obtained by reversing morphisms and composition).
A presheaf is a functor (Presheaves, covariantly and contravariantly representable functors, and representations).
Proof
Apply [L1] to , the object , and the covariant functor of [F2]; by [F1], its hom-functor is , and the inverse formula becomes .
Under the same translation, a morphism in is reversed in , so naturality in the object becomes the displayed equation with and ; naturality in is unchanged.
Steps 1.1 and 1.2 prove the bijection, its inverse formula, and both naturalities.
Depends on
- Evaluation at the identity gives $\operatorname{Nat}(\mathcal C(a,-),F)\cong F(a)$ and proves that the natural-transformation collection is a set
- The Yoneda bijection $\operatorname{Nat}(\mathcal C(a,-),F)\cong F(a)$ is natural in both $a$ and $F$
- Opposite category $\mathcal C^{\mathrm{op}}$
- Every theorem about categories has a formal dual obtained by reversing morphisms and composition
- Presheaves, covariantly and contravariantly representable functors, and representations
Used by
- A presheaf category on a small category is cartesian closed Theorem
- A representation is equivalently a universal element with a unique factorisation property Theorem
- Density theorem for a small category Theorem
- The end of the function-set functor on a representable is evaluation Theorem
- The presheaf category on a small category is the free cocompletion Theorem
- The Yoneda embedding is its own pointwise left Kan extension Theorem
- The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective Theorem
- Weighting by a representable evaluates the diagram Theorem
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Emily Riehl, Category Theory in Context, Exercise 2.2.i (standard reference, not scraped)
- Tom Leinster, Basic Category Theory, Theorem 4.2.1 (standard reference, not scraped)