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.
Local cartesian closure is equivalent to every pullback functor having a right adjoint
Statement
Let be a category with chosen pullback functors. Then the following are equivalent.
- is locally cartesian closed.
- For every morphism , the pullback functor has a right adjoint.
Facts & Assumptions
Given: A category with chosen pullback functors.
Local cartesian closedness means that every slice category is cartesian closed (Locally cartesian closed category).
For each , the functors and between slice categories are the postcomposition and pullback functors (Slice categories, composition, and pullback along a morphism).
Every slice of a locally cartesian closed category is locally cartesian closed, and every locally cartesian closed category has pullbacks (Slices of a locally cartesian closed category are locally cartesian closed, A locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits).
Proof
Assume condition (1), fix , and put . For an object of , regard as a morphism in . By [L1] and [L3], the category is cartesian closed and has pullbacks. Form in the pullback where is induced by and is the transpose of . For , currying identifies a map with a map over ; the pullback equation defining says exactly that is the projection . Hence naturally in and . Thus has right adjoint .
Assume condition (2), and fix an object . Chosen pullbacks give binary products in , and is terminal there. For , the pullback universal property gives , while condition (2) gives . The product functor with on is the composite Consequently it has right adjoint . Since this holds for every , the slice is cartesian closed.
Step 1.1 proves that condition (1) implies condition (2). Step 1.2 proves that each slice is cartesian closed, so condition (2) implies condition (1). Therefore the two conditions are equivalent.
Depends on
Used by
- Set is locally cartesian closed Theorem
Dependency tree · two levels
9 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., Proposition 4.6.6 (standard reference, not scraped)