Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Subdivision compatible continuous polyhedral homology comparison

Statement

The ordered-simplex comparison for an ordinary homology theory on finite simplicial pairs is unchanged by finite subdivision. It is natural for every continuous map of finite simplicial pairs and commutes with pair connecting homomorphisms.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

For finite simplicial pairs (K,L) and any ordinary theory h with coefficient group G, ordered simplex classes identify Ch(K,L)Csimp(K,L;Z)G, with the alternating face differential. Consequently they give a coefficient-normalized isomorphism hn(K,L)Hn(K,L;G), natural for simplicial maps and compatible with pair boundaries. No flatness of G is assumed. (Oriented simplex comparison for an ordinary homology theory)

[F2]

For finite simplicial pairs (K,L) and (P,Q), every continuous map f:(K,L)(P,Q) is homotopic through maps of pairs to a simplicial map (sdrK,sdrL)(P,Q) for some r0. (Finite simplicial approximation for homology comparison)

Proof

1.1

Let K be a finite subdivision of K, with L the induced subdivision of L. The identity realization map is cellular from the old filtration to the new one, since Kr(K)r. On an ordered old r-simplex, the sum of its new oriented r-simplices has all interior faces cancelled in pairs and has boundary the subdivided old boundary. Starting with vertices and using the boundary characterization in F1, it represents the old relative simplex class: the boundary map for the disk pair is injective, with reduced target for r=1. Thus the induced cellular map is the signed subdivision chain map, with coefficient g unchanged.

F1
2.1

The same argument applies to singular homology with G coefficients. Hence the comparison square for the identity between the two triangulations commutes on their relative cell groups and on the skeletal lift isomorphisms. It follows that the homology comparison agrees before and after subdivision. Two successive subdivisions are covered by repetition; two finite linear subdivisions have a common refinement, obtained by triangulating their finite convex intersection cells in increasing face dimension. Applying the same argument to that refinement gives independence of its choice.

F1step 1.1
3.1

For a continuous map of finite pairs choose a simplicial approximation after a common barycentric subdivision of the source, by F2. F1 gives naturality for that simplicial map, the preceding step identifies the subdivided comparison with the original one, and homotopy invariance replaces the approximation by the given map in both theories. Thus the comparison is natural for the actual continuous map and cannot depend on the approximation chosen.

F1F2step 2.1
4.1

The pair-boundary square already commutes for the ordered-simplex comparison in F1. Subdivision and its comparison are maps of pairs and preserve the cone orientation, so they preserve that square. Therefore the resulting continuous natural comparison commutes with pair boundaries as claimed. Empty pairs and zero-dimensional triangulations use the same vertex/direct-sum comparison.

F1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

9 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