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 Čech differential squares to zero
Statement
Let be a topological space, a sheaf of abelian groups on and an open cover indexed by a linearly ordered set , with ordered Čech cochains as in Ordered Čech cochain complex of a cover. Then for every so that is a cochain complex.
Facts & Assumptions
For and an increasing -tuple the differential is , a sum of restrictions inside the single group (Ordered Čech cochain complex of a cover).
Restrictions of a section are compatible: for open and one has (Sections, restrictions, and global sections of a presheaf).
An intersection factor over an empty intersection is the zero group (A set-valued sheaf has a unique section over the empty open set), so every cochain component indexed by an empty intersection is zero.
Proof
Given: A topological space , a sheaf of abelian groups , a linearly ordered open cover , a degree and a -cochain .
First take . Fix an increasing -tuple , which indexes a component of , the target of . If no such tuple exists, then and the identity is vacuous. If the full intersection is empty, its section group is zero by [F3]. Otherwise the component is computed in the single abelian group .
Applying [F1] twice gives Expanding each inner differential produces terms indexed by ordered pairs of distinct positions ; each is the restriction of the -cochain component , whose tuple has indices. The coefficient for omitting first and then is when , and when . Compatibility of restrictions [F2] places all terms in the section group of the full intersection.
For , pair the term omitting then with the term omitting then . By [F2] these are restrictions of the same -cochain component to the full intersection, while their coefficients and sum to zero. Every ordered pair occurs in exactly one such pair. Thus every component of vanishes.
The tuple was arbitrary, so step 2.1 proves the identity for . For , the convention and makes the composite zero. Hence in every degree, and the Čech cochains form a cochain complex.
Depends on
Used by
Dependency tree · two levels
5 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, Cohomology of Sheaves (standard reference, not scraped)
- Jiahui Gao and Shuwu Zhang, Lectures on Algebraic Geometry (standard reference, not scraped)