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 connecting class
Definition
Fix an abelian group , an open cover , and . For a cover-small -cycle with and , define This is the connecting-class convention compatible with .
Indeed, implies . As a chain lying in both subcomplexes, this is a chain on , and makes it a cycle. For this uses the ordinary zero boundary on -chains; if the overlap is empty the chain is zero.
The well-definedness obligation is discharged by Well-definedness of the Mayer–Vietoris connector ↗. Explicitly, replacing by another decomposition changes by an overlap chain and hence by an overlap boundary. If in the small complex, where lies in and in , then is an overlap chain and its boundary is . The cover-small homology identification used in Mayer–Vietoris sequence in singular homology therefore makes this a class depending only on . Lifting to gives boundary , so the sign agrees with that sequence.
Depends on
Used by
Dependency tree · two levels
4 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)