Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-07 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Cellular homology computes singular homology

Statement

For every CW complex X, abelian group G, and n0, 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 n0. Write X1=, suppress G in homology notation, and write Cm=Hm(Xm,Xm1;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]

The natural colimit of skeletal homology is singular homology of X, also for infinite CW complexes (Homology of an infinite CW complex is the colimit of skeletal homology).

[F5]

Cellular homology is kerdn/imdn+1 (Cellular homology); dm=im1m, where m:CmHm1(Xm1) is the pair connecting map and im1:Hm1(Xm1)Cm1 is the relative quotient map (Cellular boundary from three consecutive skeleta).

Proof

technique · direct
1.1

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

F1F2given
2.1

For n1, the exact sequence of (Xn,Xn1) and step 1.1 give an injection in:Hn(Xn)Cn with image kern. The same argument one degree lower makes in1 injective, including i0:H0(X0)H0(X0,), which is an isomorphism. Since dn=in1n, we obtain kerdn=kern=inHn(Xn). For n=0 this identity follows directly from i0 being an isomorphism and d0=0.

F2F5step 1.1algebra
3.1

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

F1F2F5step 2.1algebra
4.1

By [F3], all inclusions after Xn+1 induce isomorphisms on Hn. By [F4], their colimit is Hn(X;G). Combining with step 3.1 proves the comparison for arbitrary, possibly infinite-dimensional, CW complexes.

F3F4step 3.1
5.1

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.

step 2.1step 3.1step 4.1given

Depends on

Used by

Dependency tree · two levels

18 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