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.
Contiguous simplicial maps induce the same map on simplicial homology
Statement
If are contiguous simplicial maps, then for every .
Proof
Given: Contiguous simplicial maps .
Let be an -cycle. Its support generates a finite subcomplex of . Choose a total ordering of the finite vertex set of , and use the increasing vertex order as the preferred oriented generator of every simplex of . On these generators define omitting a summand when its displayed vertices are not pairwise distinct, and extend linearly. This is a well-defined homomorphism on because it is defined on a chosen free basis, and contiguity makes every nondegenerate summand a simplex of .
For each preferred generator of , expand the boundary of the th prism simplex from step 1.1. Consecutive interior faces cancel, the two outer faces give , and the remaining faces give . Terms with repeated image vertices cancel in the corresponding normalized formula. Hence on the chains of .
Applying step 2.1 to the cycle gives because . Thus and represent the same homology class. Every homology class has such a finitely supported cycle representative, so in every degree.
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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)
- Vidit Nanda, Computational Algebraic Topology, Lecture 02: Homotopy (standard reference, not scraped)