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 subobject classifier in a presheaf category on the walking arrow
Example
Let be the walking-arrow category , and work in the presheaf category . The subobject classifier sends an object to its set of sieves:
- ,
- .
The truth morphism selects the maximal sieve at each object. For any presheaf and subpresheaf , its characteristic morphism is
Facts & Assumptions
Given: The walking-arrow category , the sieve presheaf , and the subpresheaf defined below.
A subobject classifier classifies subobjects by pullback of truth (Subobject classifier).
Verification
On the walking arrow, the arrows into are only , so its sieves are and . The arrows into are and , and downward closure forces any sieve containing also to contain , giving exactly the three displayed sieves on . Pullback of sieves makes a presheaf, and the maximal sieves define the natural truth morphism above.
Consider the representable presheaf (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding) and the subpresheaf defined by and . Its characteristic map sends the unique element to the maximal sieve , and sends to the sieve .
For a general subpresheaf , the displayed formula defines a sieve and is natural under restriction. Moreover is maximal exactly when : the forward implication tests , and the reverse follows from closure of the subpresheaf under restriction. Thus pulling back along recovers , and this condition uniquely determines . By [L1], is a subobject classifier.
For the concrete of step 2.1, that pullback includes at object because is maximal, and excludes at object because is not maximal. Hence the general classifier calculation gives exactly the displayed example.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- Tom Leinster, Basic Category Theory, Exercise 6.3.27 (standard reference, not scraped)
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., IV.9 (standard reference, not scraped)