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.
Mayer vietoris sequence in real singular cohomology
Statement
For an ordered open cover , there is a long exact sequence of real vector spaces Here is restriction to both opens and . With the same real coefficient identifications, is the negative of the AT connector for the convention. The sequence begins with ; all negative groups vanish.
Facts & Assumptions
Given: The ordered open cover, and the notation , , .
There is a cochain short exact sequence with (Short exact two open singular cochain mayer vietoris sequence).
The cover-small inclusion is a chain homotopy equivalence (The cover-small inclusion is a chain homotopy equivalence).
A cochain short exact sequence has its long exact cohomology sequence (The long exact sequence in cohomology).
AT's singular cohomology sequence has overlap map and the positive lift-differential connector (Mayer vietoris sequence in singular cohomology).
Proof
Let be the inverse chain map supplied by [F2], with and . Precomposition gives and . Then and , where and for . Indeed evaluation on any degree- chain turns this equality into the displayed chain identity. Consequently is an isomorphism with inverse .
For a cocycle , take a lift with . Then , so for a unique . Since is injective, implies . Changing by changes by ; changing by and lifting to allows replacement of by , leaving unchanged. Thus is well-defined and linear, because lifts add and scale. This is the lift-differential convention of [F3] and [F4].
Apply [F3] to [F1]. The finite direct sum has cohomology : cycles and boundaries are componentwise, with just two primitives for a boundary pair. Replace by via . Since restricts a full cochain to and , the first map is the actual ; the second is the displayed , and the connector is step 2.1. This proves exactness throughout. At degree zero the preceding groups are zero, giving initial injectivity.
For the sign comparison, the AT row and this row have the same , whereas . If lifts in the AT row, then lifts in this row and its differential is . Therefore under the same . Equivalently the row comparison is identity on and minus identity on .
If an open set is empty, restriction to the other is an identity and the overlap terms vanish. If , is diagonal, , and the cochain lift makes the connector zero. This covers one-point and empty spaces. Degree zero and all negative degrees were handled in steps 1.1 and 3.1; degenerate simplices are included in the supplied chain equivalence. The inverse uses least subdivision depths in [F2], and the lifts in [F1] are canonical zero extensions, so no AC is introduced.
Depends on
Used by
Dependency tree · two levels
13 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)