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.
Short exact two open singular cochain mayer vietoris sequence
Statement
For an ordered open cover , put with differential . There is a short exact sequence of cochain complexes where and . The first complex is the dual of cover-small chains; it is not the full cochain complex .
Facts & Assumptions
Given: The ordered open cover of .
The small-chain sequence has , and is exact with chain-map arrows (Short exact two open cover small singular chain sequence).
Degreewise zero extension is a linear section of restriction, without any cochain-map claim (Canonical extension by zero of a singular cochain on a simplex basis).
Proof
Since commute with boundary, precomposition by them commutes with coboundary. Their dual maps are exactly and with the displayed signs. Also on small chains, so the first term is a cochain complex, including zero groups in negative degrees.
If both restrictions of vanish then vanishes on every small generator, so is injective. A pair is in precisely when the functions agree on overlap simplices. Define on a small simplex to be on simplices and on the others. Agreement makes its restrictions the given pair. Extending by finite real sums gives a unique functional. Conversely restrictions of a single functional agree on the overlap, proving .
For , by [F2], proving degreewise surjectivity with the required minus sign. This lift is not used as a cochain map. Empty opens or overlap give zero terms and the same formulas; if , agreeing pairs are and . This includes a one-point space. The argument applies in degree zero, on repeated simplices, and on the zero groups in negative degrees, without any AC.
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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)