Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

Cellular maps induce cellular chain maps

Statement

For every abelian group G, a cellular map f:X→Y, meaning f(Xn)⊆Yn, induces a chain map C∗cell(X;G)→C∗cell(Y;G). Assuming the Axiom of Choice, its map on cellular homology corresponds to f∗ on singular homology under the natural cellular comparison for arbitrary CW complexes. If X and Y are finite CW complexes, this compatibility holds without the Axiom of Choice.

Facts & Assumptions

Given: An abelian group G and a cellular map f:X→Y. Assume the Axiom of Choice only for the arbitrary-CW singular-homology comparison.

Proof

technique · direct
1.1given

The restrictions f:(Xn,Xn−1)→(Yn,Yn−1) induce maps of relative groups, hence maps on cellular chains.

2.1step 1.1∎

Naturality of pair connecting maps makes these maps commute with the differentials, without a choice assumption. Under the Axiom of Choice, Cellular homology computes singular homology compares cellular and singular homology naturally for arbitrary CW complexes, so the induced maps agree with f∗. For finite X and Y, use the finite skeletal exact-sequence calculations in that theorem, followed by finitely many skeletal stabilization isomorphisms: above the last cell dimension each space equals its final skeleton, so no infinite colimit is needed. Every pair and inclusion map in these finite calculations commutes with f, giving the same compatibility without choice.

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