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 constant presheaf need not be a sheaf on a disconnected open set
Statement refuted
Fix a set with distinct elements . The constant presheaf on a space , defined by for every open set and identity restriction maps, is always a sheaf.
Facts & Assumptions
Given: A space containing a disconnected open set with , and a set with .
Identity restriction maps define a presheaf on (A presheaf on a topological space).
The sheafification of a presheaf is defined by the double plus construction (Sheafification of a presheaf).
Locally constant -valued functions form a sheaf (Locally constant functions form a sheaf and have constant stalks).
Counterexample
By [F1], is a presheaf. On the disjoint cover , choose the local sections and . Because , there is no overlap condition to check, so the pair is compatible.
A glued section over would have to be an element whose restriction to is and to is . But every restriction map is the identity, so this would force , contradicting the choice . Therefore is not a sheaf.
The sheafification of records exactly the data obtained by gluing constant local sections on an open cover, which is the same as an -valued locally constant function. By [L1], that sheaf is , so [F2] identifies the locally constant sheaf as the sheafification of the constant presheaf.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- The Stacks Project, Sheaves on Spaces, Definition 3.2 (standard reference, not scraped)
- The Stacks Project, Sheaves on Spaces, Definition 7.4 (standard reference, not scraped)