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.
The singular augmentation commutes with the boundary
Statement
For every topological space and every abelian group , Consequently , so the reduced singular chain complex of Augmentation at 0-simplices and reduced singular homology is well defined.
Facts & Assumptions
Given: A topological space and an abelian group .
The augmentation sends every -simplex tensor to (Augmentation at 0-simplices and reduced singular homology).
The singular boundary of a -simplex is the terminal -face minus the initial -face (The singular boundary operator).
Proof
Let be a singular -simplex and let . By [L2], Applying [L1] gives
The generators span , so step 1.1 proves on all of . Therefore every -boundary lies in , which is exactly the compatibility needed in degree for the reduced chain complex.
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 (standard reference, not scraped)