advanced38 min studyLesson 485 in Mathematics

Cellular homology and computations

Use skeleton-relative generators and attaching-map degrees to compute homology while preserving integral torsion.

On this page

What you’ll understand

  • Identify cellular chains through relative homology of consecutive skeleta.
  • Compute cellular boundaries from attachment degrees.
  • Compare integer and field coefficients without discarding torsion.

Singular homology has a generator for every continuous simplex, which makes invariance natural but direct computation unwieldy. A CW structure compresses the calculation to one chain generator for each cell. The boundary coefficients are degrees derived from attaching maps, not merely a record of which cells touch. The resulting cellular complex computes singular homology, yet it retains less information than the whole attaching construction. In particular a zero cellular boundary does not mean that the corresponding attaching map is homotopically trivial.

Skeleta supply a smaller chain complex

For a CW complex X, let XnX^n denote its n-skeleton. With integer coefficients, Cncell(X)=Hn(Xn,Xn−1;Z)C_n^{\mathrm{cell}}(X)=H_n(X^n,X^{n-1};\mathbb Z) is free abelian on the oriented n-cells. For an infinite CW complex this is a direct sum: cellular chains still have finite support. The boundary is built by combining the connecting map of a skeletal pair with the next relative map. Exact-sequence compatibility forces consecutive boundaries to compose to zero.

The cellular homology theorem identifies the homology of this complex with singular homology of X. It is not a theorem that the cellular and singular chain groups are identical. The proof uses the special relative homology of cell attachments and the filtration by skeleta. A change of CW structure may alter every displayed matrix while leaving the resulting groups isomorphic. Finite CW structures are particularly convenient because their boundary matrices permit a complete finite integer calculation in each degree.

Cncell(X;Z)=Hn(Xn,Xn−1;Z)≅⨁enZ,Hn(C∗cell)≅Hn(X;Z)C_n^{\mathrm{cell}}(X;\mathbb Z)=H_n(X^n,X^{n-1};\mathbb Z)\cong\bigoplus_{e^n}\mathbb Z,\qquad H_n(C_*^{\mathrm{cell}})\cong H_n(X;\mathbb Z)
The direct sum has one generator per oriented cell. The homology identification is a theorem, not equality of the two chain constructions.↔ Scroll wide equations horizontally.

Degrees, not visual incidence, determine coefficients

To find the coefficient of a chosen lower cell in a boundary, take the attaching sphere of an upper cell, map into the preceding skeleton, and collapse everything outside the chosen lower cell to obtain a sphere map. Its degree is the integer coefficient, with orientations fixed. In dimension two, a loop attachment traversing one loop edge several times contributes the signed traversal count. Opposite traversals can cancel in the cellular boundary even when the full attaching word is nontrivial.

For a standard torus cell structure with one vertex, two loop edges, and one face attached by a commutator, the exponent sum of each edge in that word is zero. Both cellular differentials vanish, yielding the familiar free homology groups. This does not make the torus a wedge of two circles and a sphere: the attaching word and later cup product retain additional information. Cellular homology efficiently extracts additive invariants, while a chain matrix alone does not reconstruct the entire homotopy type.

0⟶Z→×mZ→0Z⟶0⟹H1≅Z/mZ, H2=0(m≠0)0\longrightarrow\mathbb Z\xrightarrow{\times m}\mathbb Z\xrightarrow{0}\mathbb Z\longrightarrow0\quad\Longrightarrow\quad H_1\cong\mathbb Z/m\mathbb Z,\ H_2=0\quad(m\ne0)
This cellular complex comes from a circle with one two-cell attached by nonzero degree m; the groups are in degrees two, one, and zero.↔ Scroll wide equations horizontally.

Integer operations preserve torsion information

Over the integers, invertible row and column operations must be unimodular to preserve the integral module structure. Smith normal form exposes diagonal divisibility data and therefore finite cyclic summands. Dividing a row by a nonunit integer, as one might do during real Gaussian elimination, changes the integral quotient. A boundary map multiplying by six is injective over the integers but has a six-element cokernel; its real-linear version is an isomorphism and loses that torsion completely.

With coefficients in a ring, tensor the free cellular complex with that ring and compute its homology. Reducing a differential modulo a prime can make it vanish, creating homology in adjacent degrees. It is not generally correct to tensor only the final integer homology groups and stop; the universal coefficient theorem includes a Tor correction. Euler characteristic supplies a useful consistency check for finite complexes through alternating cell counts or field Betti numbers, but it alone cannot detect every torsion group or identify all maps.

A degree-six cell attachment

Build X from one vertex, one loop edge, and one two-cell attached by a degree-six map of the circle. Compute its integer homology and its homology with F2 coefficients.

  1. The integer cellular groups in degrees two, one, and zero are each Z. The one-cell boundary is zero, and the two-cell boundary is multiplication by six. The degree-two kernel is zero, while the degree-one quotient is Z/6Z.

  2. Thus H2(X;Z)=0, H1(X;Z)=Z/6Z, and H0(X;Z)=Z. There are no higher cells and therefore no higher homology.

  3. Tensor the cellular complex with F2. Multiplication by six becomes zero, so every differential is zero. The three homology groups H0, H1, and H2 are now each F2. In particular the new H2 cannot be obtained by simply tensoring the zero integer H2 with F2.

The result

Changing coefficients can reveal a degree-shifted torsion contribution. The integral Euler characteristic is 1−1+1=1, matching 1−1+1 over F2.

Explore the model

Interactive lab

Interactive lab · modular

Read the order of a torsion class

Pause and Reset, then set both controls to modulus m=6 and additive step a=1. Predict return to zero after six Steps, matching the generator's order in Z/6Z. Reset and set m=6 and a=2; predict the orbit 0,2,4,0 and order three. The residue instrument shows the resulting additive group, not the cellular boundary matrix or its coefficient change to F2.

Read the order of a torsion classAddition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Current readings: Residue r0: 0; Orbit period · m/gcd(m,a): 12; Distinct residues visited: 1 of 12. All parameters are adjustable with the labeled controls below.Repeated addition modulo 12: the current residue is 0, and the orbit period is 12.01234567891011+ 5mod 12An additive orbitn = 0rₙ = 0Period = 12Cycle starts at 0:0 → 5 → 10 → 3 →8 → 1 → 6 → 11 →4 → 9 → 2 → 7 → 0Exact residues · two additions per second
Additive orbitCurrent residue / next edge
Residue r0
0
Orbit period · m/gcd(m,a)
12
Distinct residues visited
1 of 12
t = 0 s

Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forDifferent representatives of one finite cyclic homology group can have different orders.

Check your understanding

Why is real Gaussian elimination insufficient for a complete integral homology calculation?

Try it yourself

Use the standard CW structure of RP2 with one cell in each dimension zero, one, and two, where d2 is multiplication by two and d1 is zero. Compute integer homology and homology with F3 coefficients.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

First work over Z. Then reduce the actual boundary map modulo three, where multiplication by two is a unit.

Compare with the solution

Over Z, multiplication by two is injective with cokernel Z/2Z. Thus H0=Z, H1=Z/2Z, and H2=0. Over F3 the map multiplying by two is an isomorphism, so both H1 and H2 vanish, while H0=F3 remains. The two-cell has not disappeared; its boundary map is invertible over this coefficient field. The result illustrates why homology statements must include the coefficient system.

Take it with you

  • Cellular boundaries are determined by attaching-map degrees.
  • Small chain complexes compute additive invariants without preserving every attachment feature.
  • Integral torsion and coefficient changes require more than real rank calculations.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.