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.
Presheaves, covariantly and contravariantly representable functors, and representations
Definition
Let be a locally small category. A presheaf on is a functor , with opposite category as in Opposite category and as in Sets and functions form the large locally small category .
A covariant functor is covariantly representable when there are an object and a natural isomorphism
The pair is a representation of , and is a representing object.
A presheaf is contravariantly representable when there are an object and a natural isomorphism
The same terms are used for and . The hom-functors exist by The assignments and are functors to , and natural transformations and natural isomorphisms have the meanings of Natural transformation and its components and Natural isomorphism. When the variance is clear, representable is used without an adjective.
Depends on
Used by
- For a presheaf P, Nat(mathcal C(-,a),P)≅ P(a) naturally in a and P Corollary
- The functor D(X)=X sqcup X on Set is not covariantly representable Counterexample
- The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding Definition
- Universal elements of covariant functors and presheaves Definition
- A Cartesian product represents X mapstoSet(X,A)timesSet(X,B) Example
- A representable presheaf on a poset is the indicator of a principal down-set Example
- A tagged disjoint union represents X mapstoSet(A,X)timesSet(B,X) Example
- The free group on X represents G mapstoSet(X,U(G)) Example
- The free word monoid on X represents M mapstoSet(X,U(M)) Example
- The function set B^A represents X mapstoSet(X× A,B) Example
- The one-point space represents the underlying-set functor on Top Example
- Two singleton sets give canonically isomorphic representations of the identity functor on Set Example
- ℤ[x] represents the underlying-set functor on unital rings Example
- Initial and terminal objects are exactly the representations of the constant singleton functor Proposition
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 27 results over 13 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
- Emily Riehl, Category Theory in Context, Definition 2.1.4 (standard reference, not scraped)
- Tom Leinster, Basic Category Theory, Definitions 4.1.3 and 4.1.17 (standard reference, not scraped)