Alphabeta Math
TheoremStatement: 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 homology computes singular homology

Statement

For every CW complex X, abelian group G, and n≥0, the cellular complex has an isomorphism Hncell(X;G)≅Hn(X;G), natural with respect to cellular maps.

Facts & Assumptions

Given: A CW complex X, an abelian group G, and n≥0. Write X−1=∅, suppress G in homology notation, and write Cm=Hm(Xm,Xm−1;G).

[F1]

Consecutive relative skeletal homology is concentrated in the cell dimension (Relative homology of consecutive CW skeleta).

[F2]

Each skeletal pair has its long exact homology sequence (Long exact sequence of a pair).

[F3]

Skeletal inclusions induce isomorphisms in degrees below the old skeleton dimension (Skeletal homology stabilizes away from the cell dimension).

[F4]

Every continuous image of a compact space in a CW complex with its supplied characteristic maps lies in a finite CW subcomplex, without a choice premise (Compact CW images have finite cell support without choice).

[F5]

Cellular homology is ker⁡dn/im⁡dn+1 (Cellular homology); dm=im−1∂m, where ∂m:Cm→Hm−1(Xm−1) is the pair connecting map and im−1:Hm−1(Xm−1)→Cm−1 is the relative quotient map (Cellular boundary from three consecutive skeleta).

Proof

technique · direct
1.1F1F2given

For every finite m≥0, Hk(Xm)=0 when k>m: begin with the discrete X0 case of [F1], and use [F2] successively with [F1] to pass from Xm−1 to Xm. The empty skeleton also has zero homology.

2.1F2F5step 1.1algebra

For n≥1, the exact sequence of (Xn,Xn−1) and step 1.1 give an injection in:Hn(Xn)→Cn with image ker⁡∂n. The same argument one degree lower makes in−1 injective, including i0:H0(X0)→H0(X0,∅), which is an isomorphism. Since dn=in−1∂n, we obtain ker⁡dn=ker⁡∂n=inHn(Xn). For n=0 this identity follows directly from i0 being an isomorphism and d0=0.

3.1F1F2F5step 2.1algebra

For (Xn+1,Xn), exactness and Hn(Xn+1,Xn)=0 give the exact tail Cn+1→∂n+1Hn(Xn)⟶Hn(Xn+1)⟶0. Under the injection in of step 2.1, im⁡∂n+1 corresponds exactly to im⁡dn+1 by [F5]. Taking the quotient therefore yields Hncell(X;G)≅Hn(Xn)/im⁡∂n+1≅Hn(Xn+1;G).

4.1F3F4step 3.1

By [F3], all inclusions after Xn+1 induce isomorphisms on Hn. Each singular cycle is a finite sum of simplices; [F4] puts the image of each simplex in a finite subcomplex. Their finite union lies in some skeleton, so every class in Hn(X;G) comes from a skeleton. If a skeletal cycle bounds in X, its finite bounding chain likewise lies in some later skeleton, where that class already vanishes. Singular chain inclusions are injective, so these are respectively surjectivity and injectivity of the natural colimit map. Thus the colimit is Hn(X;G) without any choice premise. Combining with step 3.1 proves the comparison for arbitrary, possibly infinite-dimensional, CW complexes.

5.1step 2.1step 3.1step 4.1given∎

A cellular map preserves all skeleta. Its induced chain maps commute with inclusions, quotient maps and connecting homomorphisms: the latter send a relative cycle represented by c to the class of ∂c, and a chain map commutes with ∂. Consequently every injection, quotient identification and colimit map in steps 2.1--4.1 commutes with cellular maps. The comparison is therefore natural in exactly the stated sense.

Depends on

Used by

…and 30 more results.

Dependency tree · two levels

22 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