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.
A presheaf category on a small category is cartesian closed
Statement
Let be a small category and let . Then is cartesian closed. For presheaves , one exponential object is the presheaf defined by
with restriction along given by precomposition with .
Facts & Assumptions
Given: A small category and presheaves on .
The Yoneda embedding sends to the representable presheaf (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).
For any presheaf , natural transformations are naturally in bijection with elements of (For a presheaf , naturally in and ).
In , currying gives (Currying gives the adjunction in ).
Products of presheaves are computed pointwise, and the presheaf category is locally small because is small (For small source and index categories, chosen target limits and colimits compute the corresponding functor-category limits and colimits pointwise, If is small and is locally small then is locally small; if both are small it is small).
A cartesian closed category has finite products and exponentials (Cartesian closed category).
Proof
By [L4], binary products in are computed pointwise, so is the presheaf with . The assignment with restriction by precomposition along is therefore a presheaf .
Given , define by sending to the element of corresponding under [L2] to the natural transformation , evaluated at . Conversely, given , use [L2] and the set-level currying of [L3] objectwise to define ; naturality in is exactly the restriction rule from step 1.1.
The two constructions of step 2.1 are inverse because Yoneda identifies a natural transformation out of with its value at , and the set-level currying and uncurrying in [L3] are inverse. Hence naturally in .
Step 3.1 shows that has right adjoint , while [L4] gives the finite products. Therefore [L5] implies that is cartesian closed.
Depends on
- Cartesian closed category
- The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding
- For a presheaf $P$, $\operatorname{Nat}(\mathcal C(-,a),P)\cong P(a)$ naturally in $a$ and $P$
- Currying gives the adjunction $-\times A\dashv(-)^A$ in $\mathbf{Set}$
- For small source and index categories, chosen target limits and colimits compute the corresponding functor-category limits and colimits pointwise
- 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
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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, 2nd ed., Lemma 4.4.11 (standard reference, not scraped)
- Tom Leinster, Basic Category Theory, Exercise 6.3.25 (standard reference, not scraped)