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.
Fixed-cover Čech cohomology
Definition
Let be a topological space, a sheaf of abelian groups on , and an open cover indexed by a linearly ordered set, with ordered Čech cochain complex (Ordered Čech cochain complex of a cover, The Čech differential squares to zero). The Čech cohomology of the fixed cover with values in is the -th cohomology group of the cochain complex in the sense of Cohomology object of a cochain complex. Since and , one has , and for the group is because , so both the kernel in degree and the image in degree are zero. A cochain in is called a Čech -cocycle and a cochain in a Čech -coboundary.
Depends on
Used by
- Refinement choices differ on cochains but not on cohomology Counterexample
- The one-member cover of the circle has no Čech H1, but the sheaf H1 is nonzero Counterexample
- Refinement-colimit Čech cohomology Definition
- Čech cohomology of the two-arc cover of the circle Example
- Cohomology of the empty space and the empty cover Example
- Three-open Čech sign cancellation Example
- Čech complex for a two-open cover Lemma
- Čech H0 equals global sections Lemma
- Cofinal Čech vanishing implies derived acyclicity Lemma
- Fixed-cover Čech can miss derived cohomology Remark
- Canonical map from fixed-cover Čech to sheaf cohomology Theorem
- Leray acyclic-cover comparison Theorem
- Refinement choices induce the same Čech map 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
- The Stacks Project, Cohomology of Sheaves (standard reference, not scraped)
- Jiahui Gao and Shuwu Zhang, Lectures on Algebraic Geometry (standard reference, not scraped)