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.
Naturality of singular Mayer–Vietoris
Statement
A continuous map with and induces a commuting morphism between the Mayer–Vietoris sequences of the two covers.
Facts & Assumptions
Given: An abelian group , open covers and , and a continuous map with and . Write and .
Proof
Composition with commutes with the singular boundary, since . The cover conditions give chain maps on the overlap, on each summand, and . They commute with and by additivity. Thus they give a morphism of the short exact sequences in Short exact chain Mayer–Vietoris sequence, and The long exact homology sequence is natural gives a commuting ladder of their homology sequences.
Let and be the inclusions. On every small simplex both composites are the same singular simplex , so . The maps are isomorphisms by Cover-small chains compute singular homology. Therefore . Transporting the ladder of step 1.1 along these isomorphisms yields exactly the ordinary homology maps and sequences of Mayer–Vietoris sequence in singular homology.
In particular, for a small cycle , its image is and . Thus the connector sends the image class to the image of , with the same positive U-boundary sign; independence of the chosen small representative and decomposition is supplied by Well-definedness of the Mayer–Vietoris connector and the inclusion isomorphisms. This proves every connecting square as well as the ordinary squares. The argument includes degree zero, the terminal maps to zero, empty overlap or empty cover members, and .
Depends on
Used by
Nothing in the library uses this result yet.
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
- Allen Hatcher, Algebraic Topology, §2.2 (standard reference, not scraped)