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.
Simplicial subdivision is a chain map and homology isomorphism
Statement
For an abstract simplicial complex with a specified total order on its vertices, is a chain-homotopy equivalence of ordinary and augmented integral simplicial chains, with inverse up to chain homotopy . It induces isomorphisms on ordinary and augmented reduced homology, including degree . The inverse homology map is independent of the chosen order.
Source locators
4.3.9 and subdivision discussion following 4.3.10, pp.119–120.
Facts & Assumptions
Subdivision commutes with augmented and ordinary boundaries. Oriented simplicial subdivision commutes with boundary.
The last-vertex map is carried and augmentation-preserving. Last vertex map is carried by original simplices.
Nested specified cone carriers give a carried chain homotopy. Simplicial chain maps carried by specified cones are chain homotopic.
Chain homotopy gives equality on homology. Chain-homotopic maps induce the same map on homology.
Proof
Given: A complex with a given vertex order, its subdivision operator , and its last-vertex chain map .
Both and commute with boundary and augmentation. For a nonempty original face , carry and by the full simplex on , a cone with apex its greatest vertex. Indeed stays over and lands in . These carriers are nested under faces. The specified cone contractions and the carried-homotopy lemma give .
For a face chain carry and by , a cone with apex . The identity lies there; either vanishes or is a face of , whose subdivision lies there as well. Removing any chain vertex leaves the same or a smaller maximum, so the carriers are nested. The carried-homotopy lemma gives . Its homotopies have , so restriction also gives ordinary chain homotopies.
Chain-homotopic maps induce equal homology maps, hence and . These equations hold in every augmented degree and every ordinary degree. If has no vertices, both augmented degree groups are and both maps are the identity. Any other vertex order produces another two-sided inverse to the same ; then , proving independence.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- C. R. F. Maunder, Algebraic Topology (standard reference, not scraped)