Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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, S 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 −1. 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

[F1]

Subdivision commutes with augmented and ordinary boundaries. Oriented simplicial subdivision commutes with boundary.

[F2]

The last-vertex map is carried and augmentation-preserving. Last vertex map is carried by original simplices.

[F3]

Nested specified cone carriers give a carried chain homotopy. Simplicial chain maps carried by specified cones are chain homotopic.

[F4]

Chain homotopy gives equality on homology. Chain-homotopic maps induce the same map on homology.

Proof

Given: A complex K with a given vertex order, its subdivision operator S, and its last-vertex chain map λ#.

1.1F1F2F3

Both S and λ# commute with boundary and augmentation. For a nonempty original face σ, carry λ#S and 1 by the full simplex on σ, a cone with apex its greatest vertex. Indeed S stays over σ and λ lands in σ. These carriers are nested under faces. The specified cone contractions and the carried-homotopy lemma give λ#S≃1.

2.1F2F3step 1.1

For a face chain η=(σ0<⋯<σq) carry Sλ# and 1 by sd⁡σq, a cone with apex σq. The identity lies there; λ#η either vanishes or is a face of σq, 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 Sλ#≃1. Its homotopies have h−1=0, so restriction also gives ordinary chain homotopies.

3.1F4step 1.1step 2.1∎

Chain-homotopic maps induce equal homology maps, hence H(λ#)H(S)=1 and H(S)H(λ#)=1. These equations hold in every augmented degree and every ordinary degree. If K has no vertices, both augmented degree −1 groups are Z and both maps are the identity. Any other vertex order produces another two-sided inverse J to the same H(S); then J=JH(S)H(λ#)=H(λ#), proving independence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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