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 presheaf category on a small category is the free cocompletion
Statement
Let be small, let be the Yoneda embedding, let be locally small and cocomplete, and let be a functor.
For each presheaf , choose a colimit in of the canonical density diagram
These chosen colimits assemble into a functor
and this functor is left adjoint to
Conversely, if is any left adjoint, then with one has
More generally, every functor that preserves all small colimits satisfies Every natural transformation between two functors on extends uniquely to a natural transformation between their small-colimit-preserving extensions.
So is the free cocompletion of under small colimits, with the chosen-colimit clause made explicit in the data.
Facts & Assumptions
Given: A small category , the Yoneda embedding , a locally small cocomplete category , and a functor .
The identity functor on the presheaf category is the pointwise left Kan extension of along (The Yoneda embedding is its own pointwise left Kan extension).
A pointwise Kan extension along a fully faithful functor restricts back by isomorphism to the original functor (A pointwise Kan extension along a fully faithful functor genuinely extends the original functor).
For presheaves , cocones from the canonical density diagram of to are exactly natural transformations (Density theorem for a small category).
Natural transformations are naturally in bijection with elements of (For a presheaf , naturally in and ).
Two left adjoints to the same functor are uniquely naturally isomorphic in a way compatible with the adjunction data (Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data).
The comma-category colimit formula computes the pointwise left Kan extension value at each target object (Comma-category limit and colimit formulae compute Kan extensions).
For small , the Yoneda functor is fully faithful (The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective).
Every left adjoint preserves all colimits that exist (Left adjoints preserve every colimit that exists).
Proof
Fix a presheaf . Under the Yoneda bijection [L4], an object of the comma category is exactly a pair with , and the comma-category morphism condition says that a map is precisely an arrow with , exactly as in the category of elements (The category of elements of a covariant functor or a presheaf, The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding). So is canonically , the same indexing category that appears in the self-Kan presentation [L1], and the displayed diagram is the comma-category diagram used by [L6]. Therefore its chosen colimit is the pointwise left Kan extension value of along at . Because these colimits and their universal cocones are supplied for every , [L6] assembles them into a functor . By [L7] the functor is fully faithful, so [L2] shows that this pointwise extension restricts along to up to the canonical isomorphism.
Let , and define the presheaf on . A morphism is, by the chosen colimit universal property, exactly a cocone from the diagram to the constant diagram at . By [L4], giving such a cocone is equivalently giving, for each object of , an element of natural in morphisms of , that is, a cocone from the canonical density diagram of to . By [L3], these cocones are exactly natural transformations . Hence naturally in and , so .
Now let preserve all small colimits and put . By [L3], every presheaf is the colimit of its canonical density diagram of representables. Applying preserves that colimit, so is the colimit of the diagram . By step 1.1 this is exactly , naturally in . Hence .
Since is a left adjoint by step 2.1, [L8] shows that it preserves all small colimits.
Conversely, let with domain the presheaf category, and put . For any and , adjunction and [L4] give , naturally in and . So , and step 2.1 shows is another left adjoint to the same right adjoint. Therefore [L5] gives .
Given , its components induce a morphism between the two chosen density colimits at every presheaf, and the colimit universal properties make these morphisms natural. Conversely, any natural transformation between small-colimit-preserving extensions is determined at by its components on the representables in the canonical density colimit of [L3]. Therefore extension of is unique, which completes the free-cocompletion universal property.
Depends on
- The Yoneda embedding is its own pointwise left Kan extension
- A pointwise Kan extension along a fully faithful functor genuinely extends the original functor
- Density theorem for a small category
- Comma-category limit and colimit formulae compute Kan extensions
- The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective
- Left adjoints preserve every colimit that exists
- The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding
- The category of elements of a covariant functor or a presheaf
- Small, locally small, and large categories
- If $\mathcal C$ is small and $\mathcal D$ is locally small then $[\mathcal C,\mathcal D]$ is locally small; if both are small it is small
- For a presheaf $P$, $\operatorname{Nat}(\mathcal C(-,a),P)\cong P(a)$ naturally in $a$ and $P$
- Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data
Used by
Dependency tree · two levels
34 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
- E. Riehl, Category Theory in Context, 2nd ed., Proposition 6.5.11 (standard reference, not scraped)
- T. Leinster, Basic Category Theory, §6.2 (standard reference, not scraped)