03.12.13 · modern-geometry / homotopy

Cellular homology and cellular approximation

shipped3 tiersLean: none

Anchor (Master): Hatcher §2.2 + §4.1 (cellular approximation); Whitehead 1949 *Combinatorial homotopy II* (originator); Massey *A Basic Course in Algebraic Topology* Ch. IX

Intuition [Beginner]

A CW complex comes with a canonical bookkeeping system: dimension by dimension, count the cells. The miracle of cellular homology is that this bookkeeping is enough to compute the homology of the space. You do not need to triangulate, you do not need to choose a singular chain, you do not need to evaluate any integrals. You list the cells, you record how each cell's boundary wraps around the cells one dimension below, and you read off the homology from the resulting count.

For a sphere presented with one 0-cell and one 2-cell, the count is two cells in dimensions zero and two, nothing in dimension one. The homology comes out to in dimension zero, in dimension two, in dimension one — and that matches the answer the singular theory works much harder to produce.

The reason this matters: most spaces studied in algebraic topology come naturally as CW complexes (spheres, projective spaces, Lie groups, classifying spaces), and the cellular method turns the homology computation into a finite combinatorial problem instead of an infinite-dimensional one. A bonus: every continuous map between CW complexes can be deformed by a homotopy until it respects the cell structure on both sides — the cellular approximation theorem — so cellular methods cover all of homotopy theory, not just the cellular maps.

Visual [Beginner]

A schematic of the cellular chain complex: a row of free abelian groups, one per dimension, generated by the cells of that dimension; arrows between consecutive groups labelled by the cellular boundary. For , the diagram has in dimensions zero, two, four, and zeros in odd dimensions; every arrow is the zero map.

A schematic placeholder diagram of the cellular chain complex with cells in each dimension and boundary arrows between them.

The picture captures the entire computation. Counting cells per dimension gives the chain groups; tracking how each cell wraps around the cells below gives the boundary; reading off kernels modulo images gives the homology.

Worked example [Beginner]

Compute the homology of complex projective space using the cellular method.

Step 1. Recall the minimal CW structure on : one cell in each even dimension , and no cells in odd dimensions.

Step 2. Write down the cellular chain group in each dimension. In even dimension with , there is one cell, so the cellular chain group is . In odd dimensions and in dimensions above , there are no cells, so the group is .

Step 3. Determine the cellular boundary in each dimension. The boundary goes from the chain group in dimension to the chain group in dimension . For , every chain group sits in even dimension and every neighbouring group (one dimension below) sits in odd dimension and is therefore zero. So every cellular boundary is the zero map.

Step 4. Read off the homology. With every boundary zero, kernels equal the whole chain group and images equal . So for , and otherwise.

What this tells us: the homology of is in every even dimension up to and zero elsewhere. The entire computation took four steps and never required a single chain integral. Two cells per even dimension, no cells per odd dimension, all boundaries zero — the ring structure of 's homology pops out of pure cell-counting.

Check your understanding [Beginner]

Formal definition [Intermediate+]

Let be a CW complex with skeleton filtration and let index the -cells of . The cellular chain complex is defined by

where the right-hand side is relative singular homology of consecutive skeleta. As a free abelian group, has one generator per -cell ; this is the Hatcher §2.2 lemma identifying with the free abelian group on -cells via the characteristic-map fundamental classes .

The cellular boundary is defined as the composite

where is the connecting homomorphism in the long exact sequence of the pair and is induced by the inclusion of pairs . That follows because factors through and the composition of two consecutive connecting maps in adjacent long exact sequences vanishes.

Degree formula. With respect to the cell-basis , the cellular boundary is given explicitly by

where is the composition

with the attaching map of the cell , the quotient by the -skeleton (which collapses each -cell to a sphere), and the projection to the -th wedge factor. The integer is the topological degree of this map .

The cellular homology of is

Sign and orientation conventions. Each cell carries a chosen characteristic map , which fixes an orientation on the cell. The degree is computed with respect to the orientations on source and target spheres induced by these characteristic-map orientations.

Counterexamples to common slips

  • The cellular chain complex is not a sub-complex of the singular chain complex; the relation between the two is the agreement theorem below, not a direct inclusion.
  • The boundary is not the singular boundary restricted to cellular chains. It is the composition of with the projection to the next relative homology group.
  • The degree formula requires an oriented choice of characteristic map for each cell. Reversing the orientation flips the sign of every degree involving that cell.
  • An infinite-dimensional CW complex has a cellular chain complex of unbounded length; its cellular homology is computed via the same formula and still equals singular homology, but the agreement theorem requires the weak (colimit) topology to handle the inductive limit properly.

Key theorem with proof [Intermediate+]

Theorem (cellular = singular). Let be a CW complex. Then there is a natural isomorphism between cellular and singular homology, for every .

Proof. Fix . The strategy is to compute by climbing the skeleton filtration, using the long exact sequences of the pairs for near , and to identify the resulting expression with .

Step 1 (singular vanishing on skeleta). For , the relative homology , because attaching -cells changes only and . Specifically, is a good pair, so , and has reduced homology concentrated in degree . So for .

Step 2 (singular homology stabilises beyond dimension ). From the long exact sequence of in degrees near ,

both end terms vanish for by Step 1. So for , the inclusion-induced map is an isomorphism, and the colimit stabilises: for any .

Step 3 (extract the cellular kernel). From the long exact sequence of ,

The first term because has cells only in dimensions (apply Step 1 inductively to the filtration and use that is preserved by attaching cells of dimension ). So is injective, giving .

Step 4 (extract the cellular image). From the long exact sequence of ,

The last term is by Step 1. So .

Step 5 (assemble). Combining Steps 2–4,

The bottom has its target inside (the image lands in where is the connecting map from down — cellular two-step boundary).

Now identify the right-hand side with cellular homology. The numerator's denominator is replaced by its quotient via , which is injective on the relevant subgroups (using Step 3 applied to dimension ). So the kernel of in the singular long exact sequence becomes the kernel of the cellular boundary . The image of in dimension becomes the image of the cellular boundary via the same identification. Therefore

Naturality in follows because every step uses functorial constructions (the long exact sequence is functorial in the pair, the colimit is functorial in the filtered diagram).

Bridge. This builds toward the cellular approximation theorem stated in the next section: the agreement of cellular and singular homology is what makes the cellular boundary formula a genuine computational tool, and the same skeleton-by-skeleton argument appears again in 03.12.05 (Eilenberg-MacLane spaces), where the inductive cell-attachment construction relies on cellular homology to verify the homotopy groups at each stage. The foundational reason cellular homology works is exactly the long-exact-sequence pattern of the pair : the relative homology of consecutive skeleta isolates a single dimension, which generalises to an instance of a more general organising idea — that filtrations on a space induce spectral sequences computing the homology of the colimit. Putting these together, the bridge is the recognition that cellular homology is the spectral sequence of the skeleton filtration, collapsed at because the relative groups are concentrated in a single row; the cellular chain complex is precisely the page, and the cellular boundary is the differential. This is exactly the same as the Atiyah-Hirzebruch spectral sequence specialised to ordinary homology and CW filtrations.

Exercises [Intermediate+]

Lean formalization [Intermediate+]

Mathlib does not yet ship a dedicated cellular-homology API. The closest existing infrastructure is the chain-complex framework in Mathlib.Algebra.Homology.HomologicalComplex and the singular-homology functor as an unstable construction. A schematic statement of the cellular chain complex would read:

[object Promise]

Compiling this requires the CWComplex structure (gap from 03.12.10) and a definition of singular homology as a Mathlib-citizen functor. The lean_mathlib_gap field in the frontmatter records the concrete formalisation roadmap.

Advanced results [Master]

Theorem (cellular approximation; Hatcher 4.8). Every continuous map between CW complexes is homotopic to a cellular map — a map sending into for every . Moreover, if is already cellular on a subcomplex , the homotopy can be chosen to fix .

The proof proceeds by induction on the skeleta of , using the homotopy extension property (HEP) of CW pairs to extend each successive deformation. The technical core is a transversality argument: any continuous map of a compact -dimensional space into a CW complex meets only finitely many cells, and any meeting with a cell of dimension strictly greater than can be deformed off that cell because the image is too low-dimensional to fill it. Iterating dimension by dimension, with HEP gluing the per-cell deformations into a global homotopy, produces the cellular map.

Corollary (homotopy groups of spheres in low dimensions). For , . Apply cellular approximation to a representative map . Give the minimal CW structure (one 0-cell, one -cell) and the minimal CW structure (one 0-cell, one -cell). The cellular approximation sends 's -skeleton (which is all of ) into 's -skeleton, which is just the 0-cell because . So is homotopic to a constant map.

Theorem (homotopy invariance of cellular homology). Cellular homology is a homotopy-invariant functor on CW complexes. Combining cellular = singular with the homotopy invariance of singular homology gives the result; alternatively, use cellular approximation to show that homotopic maps induce chain-homotopic cellular chain maps.

Computational consequences.

  • Spheres. in dimensions and , elsewhere.
  • Real projective space. has summands in odd dimensions and a in dimension when is odd. With coefficients, in every dimension (all boundaries become zero mod 2).
  • Complex projective space. in even dimensions , elsewhere; the cup-product structure is with .
  • Surfaces. Closed orientable surfaces of genus : . Closed non-orientable surfaces of non-orientable genus : .
  • Lens spaces. has cellular structure with one cell in each dimension and homology .
  • Lie groups. Compact Lie groups admit CW structures (via Bott's Morse theory or Schubert decomposition of ). The cellular complex computes and exhibits the well-known result that is an exterior algebra on odd-degree generators.

Computational advantage over singular. For a finite CW complex with cells in dimension , the cellular chain complex has — finitely generated, often very small. The singular chain complex by contrast has uncountable rank in every dimension. Cellular homology turns the homological algebra of into a finite computation; singular homology turns it into a colimit of infinite-dimensional vector spaces. The agreement theorem says these compute the same answer, and cellular is by orders of magnitude the better road for explicit calculation.

Synthesis. Cellular homology identifies the homology of a CW complex with the homology of a finite, explicit chain complex generated by cells. The foundational reason this works is the long-exact-sequence pattern of consecutive skeleta: the relative groups are concentrated in a single row, so the spectral sequence of the skeleton filtration collapses at and the cellular chain complex is exactly the page. The cellular boundary is the differential, computed by the degree formula. This is exactly the same as a special case of the Atiyah-Hirzebruch spectral sequence — for ordinary homology and CW filtrations, the spectral-sequence machinery degenerates to cellular homology — and generalises to a generalised cohomology theory where the page is the cellular chain complex with coefficients in the coefficient ring of the theory.

Putting these together, the bridge is the recognition that cellular methods are not a separate computational gadget but the simplest case of a general filtration-spectral-sequence-converges-to-the-colimit pattern. The same colimit-cell pattern appears again in the cellular cochain complex (which computes singular cohomology by the same agreement theorem), in cellular cohomology with local coefficients (which couples the cell structure to a representation of ), and in the spectral sequence of a fibration (where the page reads off cells of the base with coefficients in the cohomology of the fibre). The cellular approximation theorem is what guarantees that the cellular methods cover all of homotopy theory: every map between CW complexes is homotopic to one that respects the cell structure, so every homological invariant of every continuous map can be computed cellularly. This is the same identification used in 03.12.05 (Eilenberg-MacLane spaces) to verify the homotopy groups of cellular constructions, and recurs in the postnikov-tower construction of every CW complex as an inverse limit of cellularly-attached fibrations.

Full proof set [Master]

Theorem (cellular approximation), full proof. Let be continuous between CW complexes. Inductively assume has been homotoped so that lands in . Consider an -cell of with characteristic map . The image is compact in ; by the standard CW result that compact subsets of CW complexes meet only finitely many open cells, this image meets only finitely many cells of .

If any of those cells has dimension , deform off the cell as follows. Pick a point in the open cell that is not in — such a point exists because the boundary image is contained in by inductive hypothesis, while the open cell is disjoint from . The image of the small ball around the preimage of has dimension , so a generic-position argument (smooth approximation if is smooth, simplicial approximation if it is piecewise-linear, or the polyhedral neighborhood argument in the general continuous case — see Hatcher Lemma 4.10) deforms to miss and then radially deforms within the cell to push the entire image off the open cell. This homotopy is supported on a small ball in that is mapped to a small neighbourhood of in the cell, so it leaves unchanged outside.

Iterate over the finitely many higher-dimensional cells meeting to deform entirely into . Use the homotopy extension property of the CW pair to extend the per-cell deformation back to a homotopy of on that fixes . Iterate over , then increment . The colimit structure of ensures the inductive homotopies assemble into a global homotopy on all of . The result is a cellular map homotopic to .

Theorem (cellular = singular), proof of naturality and chain-map property. The construction in the Intermediate-tier proof gives an isomorphism on homology objects. To verify it comes from a chain map , observe that the diagram

commutes by definition of . Functoriality in follows because every long exact sequence is functorial in pairs and every cell index is functorial under cellular maps.

Theorem (degree formula for the cellular boundary), proof. Let be an -cell with attaching map . Under the identification , the cell corresponds to , the pushforward of the relative fundamental class.

The connecting map sends to . Then projects this to the relative group , which under good-pair isomorphism is .

Composing with the quotient gives a map . Apply and use the wedge decomposition to write . The image of the fundamental class under this composition decomposes coordinate-wise as where is the projection to the -th wedge factor and is the topological degree. So .

Stated without proof — see Hatcher §2.2 and §4.1 [Hatcher §2.2 and §4.1] and Massey Ch. IX [Massey Ch. IX]. The cellular cochain complex (dual construction computing singular cohomology); cellular homology with local coefficients (twisted by a -representation); the relationship between cellular homology and the spectral sequence of a CW filtration (collapses at ); the cellular Mayer-Vietoris sequence for a CW complex written as a union of two subcomplexes.

Connections [Master]

  • Eilenberg-MacLane spaces 03.12.05. The construction of proceeds by attaching cells dimension by dimension to kill all homotopy groups except ; cellular homology is exactly the tool used to verify that the resulting space has the desired homology and homotopy. The cellular chain complex of in low dimensions reads off the integer Eilenberg-MacLane invariants.

  • Whitehead tower 03.12.07. The successive killing of low homotopy groups in the Whitehead tower is performed by attaching cells, and cellular homology is what verifies that the homology of each tower stage tracks the prescribed homotopy filtration. Combined with the Hurewicz theorem, cellular homology turns the abstract tower construction into a finite computation per stage.

  • Singular homology 03.12.11. The agreement theorem identifies cellular and singular homology; this is the source of cellular homology's power. The proof of the theorem turns the singular long exact sequence of consecutive skeleta into the cellular boundary by a connecting-map argument.

  • CW complex 03.12.10. The cellular chain complex is the canonical algebraic invariant of the cellular structure; the existence of a CW structure on a space is what makes cellular methods applicable. Whitehead's theorem (a weak homotopy equivalence between CW complexes is a homotopy equivalence) closes the loop: cellular invariants detect homotopy type for CW complexes.

  • Spectral sequences (planned future unit). Cellular homology is the simplest case of the spectral sequence of a filtration: the page is the cellular chain complex, the differential is the cellular boundary, the spectral sequence collapses at for ordinary homology, and the abutment is singular homology. For generalised cohomology theories, the same filtration produces the Atiyah-Hirzebruch spectral sequence, which does not collapse in general.

  • Postnikov towers (within 03.12.05). Every CW complex is the inverse limit of its Postnikov sections, each obtained by attaching cells to kill higher homotopy groups; cellular homology of the Postnikov stages is the bookkeeping tool that controls obstruction theory and the -invariant classification.

Historical & philosophical context [Master]

J. H. C. Whitehead developed cellular methods in his 1949 paper Combinatorial homotopy II (Bull. AMS 55, 453-496) [Whitehead 1949 II] as the algebraic companion to the CW-complex theory introduced in Combinatorial homotopy I. The cellular chain complex appears there in essentially modern form, with the boundary computed via attaching-map degrees. The motivation was computational: simplicial methods required at least vertices to triangulate , and the resulting chain complex for any reasonable space was unmanageably large. Whitehead's cellular reformulation gave a chain complex with two non-zero entries, a chain complex with entries, and Lie groups chain complexes whose entries matched the Schubert decomposition of the corresponding flag varieties.

The agreement of cellular and singular homology was made precise in the Eilenberg-Steenrod axiomatic framework: Eilenberg and Steenrod 1952 Foundations of Algebraic Topology [Eilenberg-Steenrod] proved the uniqueness theorem stating that any homology theory satisfying their axioms (homotopy, exactness, excision, dimension) is determined on CW pairs by its values on a point. Cellular homology satisfies the axioms; singular homology satisfies the axioms; they agree on a point; therefore they agree on all CW pairs. The uniqueness theorem retroactively justified Whitehead's cellular methods as a computational presentation of the same invariant produced abstractly by the axioms.

The cellular approximation theorem was proved in essentially the same period; Hatcher attributes the modern proof to Whitehead, with the technical refinements (PL transversality, smooth approximation) developed by Whitney and others through the 1950s. The combination — cellular homology to compute, cellular approximation to handle morphisms, agreement to identify cellular with the abstract axiomatic theory — became the standard computational toolkit of algebraic topology in the era after Eilenberg-Steenrod, and remains the standard toolkit today.

Bibliography [Master]

[object Promise]