Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

Homotopic maps induce the same map on singular homology

Statement

If f,g:XY are homotopic continuous maps, then for every n0 and every abelian group G the induced homomorphisms on singular homology agree: Hn(f#)=Hn(g#):Hnsing(X;G)Hnsing(Y;G).

Facts & Assumptions

Given: A homotopy between continuous maps f,g:XY, an abelian group G, and an integer n0.

[L1]

The prism operator of a homotopy satisfies g#f#=PH+PH (The singular chain homotopy formula).

[L2]

A family sn with gnfn=dn+1sn+sn1dn is a chain homotopy (A chain homotopy).

[L3]

Chain-homotopic chain maps induce the same map on homology (Chain-homotopic maps induce the same map on homology).

Proof

technique · direct
1.1

Extend the prism operator by PH,1=0 on the zero group C1(X;G). By [L1], f#g#=(PH)+(PH), so the family PH satisfies the defining identity of [L2] for a chain homotopy from f# to g#. Thus the two induced singular chain maps are chain-homotopic.

L1L2givenconstruct
2.1

Applying [L3] to the singular chain complex yields Hn(f#)=Hn(g#) for every n0.

L3step 1.1

Depends on

Used by

Dependency tree · two levels

15 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