Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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 f,g:KL are contiguous simplicial maps, then f=g:Hnsimp(K)Hnsimp(L) for every n.

Proof

Given: Contiguous simplicial maps f,g:KL.

1.1

Let z be an n-cycle. Its support generates a finite subcomplex Kz of K. Choose a total ordering of the finite vertex set of Kz, and use the increasing vertex order as the preferred oriented generator of every simplex of Kz. On these generators define Pk[v0,,vk]:=i=0k(1)i[f(v0),,f(vi),g(vi),,g(vk)], omitting a summand when its displayed vertices are not pairwise distinct, and extend linearly. This is a well-defined homomorphism on Ck(Kz) because it is defined on a chosen free basis, and contiguity makes every nondegenerate summand a simplex of L.

givenconstruct
2.1

For each preferred generator of Ck(Kz), expand the boundary of the ith prism simplex from step 1.1. Consecutive interior faces cancel, the two outer faces give g#f#, and the remaining faces give P. Terms with repeated image vertices cancel in the corresponding normalized formula. Hence P+P=g#f# on the chains of Kz.

step 1.1algebra
3.1

Applying step 2.1 to the cycle z gives g#zf#z=(Pz), because z=0. Thus f#z and g#z represent the same homology class. Every homology class has such a finitely supported cycle representative, so f=g in every degree.

step 1.1step 2.1algebra

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