The unknown thing to be known appeared to me as some stretch of earth or hard marl, resisting penetration… the sea advances
insensibly in silence, nothing seems to happen, nothing moves, the water is so far off you hardly hear it… yet it finally surrounds
the resistant substance.
Several times in this book a computation did something odd, and we checked it and moved on. Working mod 2, the projective plane
acquired an H2 that it does not have over the integers (§3.4 Computing Homology). In cohomology, the torsion of H1 turned up one degree higher, in H2 (§4.2 Cohomology Groups). And simplicial, singular and cellular
homology, three quite different definitions, kept giving the same answers. None of these is a quirk of a particular space. They
are all consequences of the algebraic machine that homology runs on — chain complexes, kernels modulo images, exact sequences —
and this chapter takes that machine out of its case to see how it works.
Let us restate the definitions from Part III in the abstract, without any space in sight.
Chain complexes and chain maps form a category, Ch (composition is done degree by degree; the identity is the identity in each
degree). And homology is a functor on it, Hn:Ch→Ab: a chain map sends cycles to cycles (∂fz=f∂z=0) and boundaries to boundaries (f∂c=∂fc), so it induces f∗[z]=[fz], and (g∘f)∗=g∗∘f∗. The homology of a simplicial complex was the composite of two functors: first chains, then homology.
Here is the sentence that organises this entire chapter. A complex is called exact at Cn if im∂n+1=ker∂n — exactly the condition met in §1.4 Abelian Groups and Formal Sums. In a chain complex we always have im∂n+1⊆ker∂n, and the homology Hn(C) is the quotient of the second by the first. So:
Chain homotopy
In §3.5 Maps, Invariance, and First Triumphs we proved that homotopic maps induce the same map on homology.
The algebraic heart of that proof
is worth isolating, because it will reappear below.
A chain homotopy
Figure 5.2.1 Two chain maps f,g (vertical) between the rows C and D, and the diagonal maps s that raise degree by one. For
spaces, s is the “prism” swept out by a homotopy from §3.5 Maps, Invariance, and First Triumphs: the boundary of the prism over a chain
is the difference of the two images, plus the prism over the chain’s boundary.
Geometry enters only once: the homotopy between two maps of spaces gives a prism, and the prism gives s. After that, everything is
algebra. This division of labour — a geometric input, then an algebraic machine — is the theme of the chapter.
The snake lemma and long exact sequences
The single most useful tool of homological algebra is a lemma about one commutative diagram. It manufactures a map out of nothing,
and that map is the connecting homomorphism you used to build every long exact sequence in §3.6 Exact Sequences and Mayer–Vietoris.
Before the proof, read the picture. The kernels of the three vertical maps sit in a row above the diagram, the cokernels in a row
below. The connecting map δ joins the right end of the top row to the left end of the bottom row; drawn in, it winds through
the diagram like a snake, which is where the name comes from. The figure follows one element along the snake, in a concrete example
where every group is Z or Z/m and you can check every step with arithmetic.
Chasing the snakeStep through with ‹ › · change m, n and the starting element
0→Z×4Zmod4Z/4→0
Both rows are exact, and every square commutes (multiplying by 6 commutes with everything). Kernels on top, cokernels below.
The diagram
m4
n6
start at x∈kerc:
Figure 5.2.2 The rows are the short exact sequence 0→Z×mZ→Z/m→0 twice, and every vertical map multiplies by n. Start at an element x of kerc — an x∈Z/m with nx≡0 — then lift it to B, push it down with b, pull it back to A′ and read off its class in cokera=Z/n. The gold trail is the diagram chase; the gold snake is
the map δ it defines. Step 7 shows that a different choice of lift gives the same answer.
From short exact sequences of complexes to long ones
A short exact sequence of chain complexes 0→AiBpC→0 is a pair of chain maps that is
short exact in every degree: 0→An→Bn→Cn→0 exact for each n. You met two in §3.6 Exact Sequences and Mayer–Vietoris:
the chains of a subspace, of the whole space, and of the pair; and the Mayer–Vietoris sequence of chains of U∩V, of U and V, and of U∪V.
The connecting map ∂ is a snake. Take a class [c]∈Hn(C), lift the cycle c to b∈Bn, take its boundary ∂b∈Bn−1; it maps to ∂c=0 in Cn−1, so it comes from a unique a∈An−1, which turns out to
be a cycle. Then ∂[c]=[a]. Up, across, down, across: the same zig-zag as in Figure 5.2.2. (In fact the theorem follows by
applying the snake lemma to the diagram whose rows are An/im∂→Bn/im∂→Cn/im∂→0 and 0→ker∂n−1A→ker∂n−1B→ker∂n−1C, with the vertical maps induced by ∂: their kernels
are Hn and their cokernels are Hn−1.) Hatcher proves the theorem by exactly this zig-zag (Hatcher 2002, Thm 2.16).
Hom and tensor: two ways to combine groups
Coefficients have appeared in this book in two different ways. Chains with coefficients in G were formal sums of
simplices with coefficients from G (§3.4 Computing Homology). Cochains with values in G were functions from
chains to G (§4.2 Cohomology Groups). Each is a way of combining two abelian groups into a third, and each has
a name.
Hom
For abelian groups A and G, the set Hom(A,G) of all homomorphisms A→G is itself an abelian group: add
homomorphisms pointwise, (f+g)(a)=f(a)+g(a). Computing it is a matter of asking where the generators can go.
Hom(Z,G)≅G. A homomorphism out of Z is decided by where it sends 1, and 1 may go anywhere: f↦f(1) is the isomorphism. (This is the universal property of the free group on one generator.)
Hom(Z/n,Z)=0. If f(1)=x then nx=f(n⋅1)=f(0)=0 in Z, so x=0. An element of finite order
has nowhere to go in a group without torsion.
Hom(Z/n,Z/m)≅Z/gcd(m,n). Now f(1)=x only needs nx≡0(modm), and there are exactly gcd(m,n) such x in Z/m. For instance Hom(Z/6,Z/4)≅Z/2:1 can go to 0 or to 2.
Hom(A⊕A′,G)≅Hom(A,G)⊕Hom(A′,G): a map out of a direct sum is a pair of maps — the coproduct property from §5.1 Categories and Functors.
As a functor of its first argument, Hom(−,G) is contravariant (§5.1 Categories and Functors): a
homomorphism f:A→B gives f∗:Hom(B,G)→Hom(A,G),φ↦φ∘f. Applied to chains, it
produces cochains: Cn(X;G)=Hom(Cn(X),G), and the coboundary is δ=∂∗.
Tensor product
The other combination is less familiar by name, but it is the first of the two ways coefficients appeared above: a chain mod 2 is
a sum of simplices, each “times” an element of Z/2. In general we want a group whose elements are such “formal products” a⊗g of an element of A with an element of G, obeying the distributive laws and nothing else.
From the relations: 0⊗g=0 (apply the first with a=a′=0), and (na)⊗g=n(a⊗g)=a⊗(ng) for
every integer n — integers can be moved freely across the ⊗ sign. The key property is universal (§5.1 Categories and Functors again): a homomorphism A⊗G→H is the same thing as a function A×G→H that is additive in each variable
separately (bilinear). Now the examples, which have some surprises.
Z⊗G≅G, via n⊗g↦ng. Tensoring with Z changes nothing.
Z/m⊗Z/n≅Z/gcd(m,n). Every a⊗b equals ab(1⊗1), so the group is generated by 1⊗1. Its order divides m, since m(1⊗1)=m⊗1=0⊗1=0, and likewise divides n, so it divides gcd(m,n). The bilinear map (a,b)↦abmodgcd(m,n) shows the order is exactly gcd(m,n).
Z/2⊗Z/3=0. Watch it happen: 1⊗1=3(1⊗1)−2(1⊗1)=(1⊗3)−(2⊗1)=(1⊗0)−(0⊗1)=0. Two nonzero groups whose tensor product is zero.
Q⊗Z/n=0:q⊗x=nqn⊗x=nq⊗nx=nq⊗0=0. Fractions let you divide
by n, and n kills everything in Z/n.
Exactness, and how it fails
Here is the problem that the rest of the chapter solves. Take a short exact sequence of abelian groups 0→AfBgC→0 and apply one of our two operations. Is the result still exact? Only partly.
One example shows both failures. Start from the short exact sequence
0→Z×2Z→Z/2→0.
Apply Hom(−,Z). Since Hom(Z,Z)≅Z and Hom(Z/2,Z)=0, we get 0→0→Z×2Z. The last map is multiplication by 2, which is not onto: its cokernel is Z/2. In words: a
homomorphism defined on the subgroup 2Z — say the one sending 2 to 1 — cannot be extended to all of Z, because 1 has no half in Z. The cokernel Z/2 measures exactly these non-extendable maps.
Apply −⊗Z/2. Since Z⊗Z/2≅Z/2, we get Z/2×2Z/2→Z/2→0. But
multiplication by 2 is the zero map on Z/2, so the first map is not one-to-one: its kernel is Z/2. In words: the
element 1 of the first Z was perfectly nonzero, but after reducing mod 2 it maps to 2⊗1=1⊗2=0. Reducing
mod 2 forgot that 2 was not zero.
In both cases the failure is itself an abelian group, here Z/2. The next section gives these failures their names, Ext and Tor, and a way to compute them.
Resolutions, Tor and Ext
Free resolutions
Free abelian groups are the easy case: if F is free, then Hom(F,−) and −⊗F preserve all exactness, because F is
a sum of copies of Z, and both operations do nothing to Z. So here is the plan: describe any group by free groups — its
generators and its relations — and do the measuring there. The failure of exactness then shows up as the homology of a small
complex built from those free groups, which we know how to compute.
For abelian groups the story is short. Choose generators of A: that gives a free group F0 mapping onto A. The kernel F1 of that map — the relations among the generators — is a subgroup of a free abelian group, and a standard theorem
(a close cousin of the classification in §1.4 Abelian Groups and Formal Sums) says that such a subgroup is itself free. So every
abelian group has a resolution of length one, 0→F1MF0→A→0, and for finitely generated groups M is the relation matrix whose Smith normal form you met in §1.5 Linear Algebra.
The basic example:
0→Z×nZ→Z/n→0.
Two things deserve to be said at once. First, the answer does not depend on which resolution you choose: any two free resolutions of A are chain homotopy equivalent (once more, a chain homotopy saves the day), so they give isomorphic Tor and Ext. We
shall take this on trust; Hatcher proves it in a page (Hatcher 2002, Lemma 3.1). Second, the definitions are not a trick: they are exactly “the homology of the complex you get by applying
the functor to a resolution”, which is how all derived functors are defined.
Now compute, using the resolution 0→Z×nZ→Z/n→0.
Tor(Z/n,G) is the kernel of G×nG: the elements of G killed by n. So Tor(Z/n,Z)=0, and Tor(Z/m,Z/n)≅Z/gcd(m,n) (the elements x∈Z/n with mx≡0). For example, Tor(Z/4,Z/6)≅Z/2.
Ext(Z/n,G) is the cokernel of G×nG, that is G/nG. So Ext(Z/n,Z)≅Z/n,Ext(Z/n,Z/m)≅Z/gcd(m,n), and Ext(Z/n,Q)=0 (every rational number is divisible by n).
Free groups contribute nothing:Tor(Z,G)=Ext(Z,G)=0, since Z is its own resolution 0→0→Z→Z→0.
Sums split:Tor(A⊕A′,G)≅Tor(A,G)⊕Tor(A′,G), and the same for Ext. With the
classification A≅Zr⊕Z/d1⊕⋯⊕Z/dk of §1.4 Abelian Groups and Formal Sums, these rules compute
everything.
A calculator for ⊗, Tor, Hom and ExtBuild A and G from ℤ and ℤ/n pieces · or try a preset
A=Z/4
copies of ℤ in A0
tap a summand to remove it; +n adds ℤ/n
G=Z/6
copies of ℤ in G0
tap a summand to remove it; +n adds ℤ/n
A⊗G
=Z/2
Z/4⊗Z/6=Z/2
Tor(A,G)
=Z/2
Tor(Z/4,Z/6)=Z/2
Hom(A,G)
=Z/2
Hom(Z/4,Z/6)=Z/2
Ext(A,G)
=Z/2
Ext(Z/4,Z/6)=Z/2
Where the numbers come from: a free resolution of A
0→ZMZ→A→0,M=(4)
Tensor with G=Z/6 (right exact)
GM⊗GG→A⊗G→0
The left map should be injective for exactness, and it is not: it multiplies by 4 on copies of G. Its kernel is Tor(A,G)=Z/2.
Apply Hom(−,G) (left exact)
0→Hom(A,G)→GMTG
The right map should be surjective, and it is not: its cokernel, made of the pieces G/dG for each Z/d in A, is Ext(A,G)=Z/2.
try:
Figure 5.2.3 Each operation splits over the cyclic pieces of A and G, and the cards show every piece. Below, the free resolution of A: after tensoring with G the first map stops being injective, and its kernel is Tor(A,G); after applying Hom(−,G) the
last map stops being surjective, and its cokernel is Ext(A,G). Notice that Tor and Ext vanish unless A has
torsion — free groups resolve themselves.
Where the names come from
Tor is short for torsion. One way to see it: Tor(A,Q/Z) is isomorphic to the torsion subgroup of A — for
instance Tor(Z/n,Q/Z) consists of the elements of Q/Z killed by n, which form a copy of Z/n. Tor detects the
torsion in A, as seen through G.
Ext is short for extension. An extension of C by A is a short exact sequence 0→A→B→C→0: a bigger group B built from a subgroup A and a quotient C. It turns out that the extensions (up to the obvious
equivalence) correspond exactly to the elements of Ext(C,A), with the split extension B=A⊕C corresponding to 0. Take A=C=Z/2: there are two ways to build a group of order 4 from two copies of Z/2, namely Z/2⊕Z/2 and Z/4 (in which the subgroup {0,2}≅Z/2 has quotient Z/2). Correspondingly, Ext(Z/2,Z/2)≅Z/2 has two
elements. (The count is of extensions, not of groups. Ext(Z/3,Z/3) has three elements, but only two middle groups occur, Z/3⊕Z/3 and Z/9: the two non-split extensions both use Z/9, glued to the quotient by different maps.)
The universal coefficient theorems
Now the payoff. If you know the integral homology Hn(X)=Hn(X;Z) of a space, do you know its homology and cohomology with
every other coefficient group? Yes — and Tor and Ext are exactly the correction terms.
The second formula is the one stated in §4.2 Cohomology Groups; now you can see where its Ext comes from. In
both formulas the correction term is built from the degree below. The proof is a well-chosen short exact sequence of chain
complexes and the long exact sequence it produces — homological algebra feeding on itself. We will not write it out; Hatcher does so
in a few pages for each version (Hatcher 2002, Thm 3.2, Thm 3A.3). The cohomology version is the coincidence that
Eilenberg and Mac Lane set out to explain in 1942, inventing functors along the way (§5.1 Categories and Functors).
Universal coefficientsChoose a space and a coefficient group
cells of RP2: word aa: ∂(face) = 2a
chains0→Z×2Z0Z→0
cochains in Z/20→Z/20Z/2×2Z/2→0
n=0
n=1
n=2
Hn(X;Z)integral homology
Z
Z/2
0
Hn(X;Z/2)homology with coefficients
Z/2
Z/2⊕0
Z/2
Z/2⊕0
Z/2
0⊕Z/2
from Tor of H1
Hn(X;Z/2)cohomology
Z/2
Z/2⊕0
Z/2
Z/2⊕0
Z/2
0⊕Z/2
from Ext of H1
Each entry is Hn⊗G⊕Tor(Hn−1,G) (homology) or Hom(Hn,G)⊕Ext(Hn−1,G) (cohomology); the rose part comes from torsion one degree down. Every entry agrees with a direct computation from the chain complex above.
Figure 5.2.4 Pick a space and coefficients. The table computes Hn(X;G) and Hn(X;G) from integral homology by the universal coefficient
theorems; the rose part of each entry is the Tor or Ext term coming from torsion one degree down. Every entry is checked
against a direct computation from the cell chain complex shown at the top (the book’s test suite also checks it on the simplicial
models of Part III). Compare RP2 with Z/2,Z/3 and Q.
Two consequences get used constantly. With coefficients in Q (or R) all torsion disappears: when the homology is finitely
generated, Hn(X;Q)≅Qbn, and cohomology has the same dimensions as homology. With coefficients in Z/p for a prime p, torsion of order prime to p disappears, while each summand Z/pk of Hn is seen twice, as a Z/p in degree n and another in degree n+1. That is why the mod-2 Betti numbers of RP2 are 1,1,1 although its rational Betti numbers are 1,0,0.
The Künneth theorem: homology of products
The torus is a product of two circles, T2=S1×S1. Its homology Z,Z2,Z looks like it ought to be “the product” of
the circle’s Z,Z with itself — and the Künneth theorem, glimpsed in §4.5 The Cup Product as the Künneth formula, says exactly how.
Start with cells. If X and Y are cell complexes, then X×Y is one too: its cells are products ei×ej of an i-cell of X and a j-cell of Y, of dimension i+j. The circle has a 0-cell and a 1-cell, so the torus gets cells of
dimension 0+0,0+1,1+0 and 1+1: one vertex, two edges, one face, the familiar square with opposite sides glued. The
cellular chain complex of the product is the tensor product of the two chain complexes, with boundary given by a Leibniz rule, ∂(a⊗b)=∂a⊗b+(−1)ia⊗∂b(a an i-cell). So computing Hn(X×Y) is a purely algebraic question about the homology of a tensor product of complexes, and the answer is:
Hatcher proves it, for any principal ideal domain of coefficients, in his §3.B (Hatcher 2002, Thm 3B.6).
For the torus: H0=Z⊗Z=Z;H1=(H0⊗H1)⊕(H1⊗H0)=Z2;H2=H1⊗H1=Z. No
torsion, no Tor terms. A pleasant way to remember torsion-free cases: multiply the Poincaré polynomials∑nbntn. The circle has 1+t, so the torus has (1+t)2=1+2t+t2, and the k-dimensional torus has (1+t)k, with binomial
coefficients as Betti numbers. With coefficients in a field, the Tor term disappears and this multiplication rule is exact.
The Tor term is a genuine correction, and it is the same phenomenon as in the UCT: torsion in two factors combines to produce
something one degree higher. For RP2×RP2, the classes of order 2 in the two copies of H1 give Tor(Z/2,Z/2)=Z/2 in H3. The figure lets you try products.
Homology of a productChoose the two factors
Hi(RP2)→Hj(RP2)↑
H0=Z
H1=Z/2
H2=0
H2=0
n = 20
n = 30
n = 40
H1=Z/2
n = 1Z/2
n = 2Z/2Tor=Z/2→ n = 3
n = 30
H0=Z
n = 0Z
n = 1Z/2
n = 20
H0(RP2×RP2)
=Z
Z⊕0
H1(RP2×RP2)
=(Z/2)2
(Z/2)2⊕0
H2(RP2×RP2)
=Z/2
Z/2⊕0
H3(RP2×RP2)
=Z/2
0⊕Z/2
H4(RP2×RP2)
=0
0⊕0
Each anti-diagonal i+j=n (same colour) adds up to Hn; the rose Tor terms jump one diagonal up. Agrees with the homology of the product cell complex.
X=Y=
Figure 5.2.5 Cell (i,j) holds Hi(X)⊗Hj(Y); the cells along an anti-diagonal i+j=n (one colour) add up to Hn(X×Y), together with any Tor terms (rose) that arrive from the diagonal below. For RP2×RP2,H3 consists of a
single Tor. Every total is checked against the homology of the product cell complex, computed directly. Keep this grid in mind:
a spectral sequence is a grid like this one that has not yet settled down.
Spectral sequences: computing in stages
Many spaces are built in stages. A cell complex is built skeleton by skeleton; a fibre bundle is built from copies of a fibre spread
over the cells of a base; a double complex (a grid of groups with two commuting boundary maps) can be cut into columns. In each case
there is an obvious plan: compute the homology of each stage separately, then glue. The difficulty is that the stages interact. A
cycle that looks new at stage p may have a boundary that lies in an earlier stage — or several stages earlier — and then it is not
really a cycle of the whole. A spectral sequence is the bookkeeping device that makes the plan work, correcting the first
approximation in a sequence of steps.
Here is the setting. A filtered complex is a chain complex C with a nested sequence of subcomplexes F0C⊆F1C⊆⋯⊆FkC=C: the space after stage 0, after stage 1, and so on. Draw a grid with columns p=0,1,2,… for the stages and rows q, and put each generator of degree n that is added at stage p at the position (p,q) with q=n−p. Total degree is constant along the anti-diagonals p+q=n, just as in the Künneth grid.
Page E1 records the homology of each stage relative to the stages before it: Ep,q1=Hp+q(FpC/Fp−1C). It is the first approximation: the new cycles at each stage, ignoring how stages attach.
The differential d1:Ep,q1→Ep−1,q1 records how stage p attaches to stage p−1: the
boundary of a new cycle, seen in the previous stage. Taking homology gives the next page, E2=H(E1,d1).
The differential d2:Ep,q2→Ep−2,q+12 records attachments that skip a stage; and in general dr:Ep,qr→Ep−r,q+r−1r moves r columns left and r−1 rows up, with Er+1=H(Er,dr).
Convergence. With finitely many stages the differentials eventually have nowhere to go, the pages stop changing,
and the final page E∞ spells out the homology: over a field, dimHn(C)=∑p+q=ndimEp,q∞.
Turning the pagesChoose a page · switch examples and coefficients
Two disks on a segment
stage 0: two points v, w and a loop c at v
stage 1: a segment t from v to w, and a loop b at w
stage 2: a disk e filling c, a disk f filling b
vdim 0, stage 0∂v=0
wdim 0, stage 0∂w=0
cdim 1, stage 0∂c=0
tdim 1, stage 1∂t=w−v
bdim 1, stage 1∂b=0
edim 2, stage 2∂e=c
fdim 2, stage 2∂f=b
On page E1, the differential d1 has slope (−1,0). The 2 gold arrows pair off generators that cancel; turn the page to see them vanish.
Figure 5.2.6 Each dot is a generator, placed at (stage, degree − stage). Two disks on a segment: on E1 two d1 arrows cancel t against w and f against b; on E2 a d2, of slope (−2,1), cancels the disk e against the loop c it fills, two stages earlier; E3=E∞ leaves one dot, so the space has the homology of a point. Torus by
cells: nothing ever cancels. RP2 by cells: over Q a d1 (multiplication by 2) cancels s against a; over Z/2 it is zero and every dot survives — the universal coefficient story again.
The most famous example has a fibration as input. When a space E is fibred over a base B with fibre F — like the Hopf
fibration of §5.3 Horizons, where S3 is fibred over S2 by circles — the Serre spectral sequence has Ep,q2=Hp(B;Hq(F)) (when B is simply connected) and converges to Hp+q(E). Its E2 page is a Künneth
grid, and the differentials measure how far E is from being the product B×F. Jean-Pierre Serre built it in his 1951
thesis and used it to prove that the homotopy groups of spheres are finitely generated (Serre 1951); two years later he
showed that almost all of them are finite (Serre 1953a).
Spectral sequences are still the main tool for computing homotopy groups of spheres, and one of the oldest problems about them was
settled only recently, by a spectral sequence computed partly by machine.
The Eilenberg–Steenrod axioms
This book has met several homology theories: simplicial homology of simplicial complexes, singular homology of all spaces, cellular
homology of cell complexes, and (in §4.7 Sheaves and Čech Cohomology) Čech cohomology. Why do they agree whenever they can be compared?
In 1945 Samuel Eilenberg and Norman Steenrod answered: because they all satisfy the same short list of properties, and those
properties alone determine homology (Eilenberg & Steenrod 1945). Notice that the list is phrased entirely in the language of §5.1 Categories and Functors:
functors, natural transformations, exactness.
Each axiom is a theorem you have seen for singular homology: homotopy invariance (§3.5 Maps, Invariance, and First Triumphs), the long exact
sequence of a pair and excision (§3.6 Exact Sequences and Mayer–Vietoris), the homology of a point (§3.3 Homology Groups),
and additivity, which for finitely many pieces follows from the others and was added for infinite unions by John Milnor in 1962 (Milnor 1962). What is new is
the claim that nothing else is needed. The figure computes the homology of every sphere using only the five axioms.
Spheres from the axiomsStep through · the axioms used in each step light up
1
Homotopy
f≃g⇒f∗=g∗
Homotopic maps induce the same homomorphism.
2
Exactness
⋯→Hn(A)→Hn(X)→Hn(X,A)∂⋯
Every pair gives a long exact sequence, with natural ∂.
3
Excision
Hn(X∖U,A∖U)≅Hn(X,A)
Cutting out a set deep inside A changes nothing.
4
Dimension
Hn(pt)=0 for n=0
A point has homology only in degree 0, where it is G.
5
Additivity
Hn(⨆Xα)≅⨁Hn(Xα)
A disjoint union has the direct sum of homologies.
H~k(Sn)=?
We want the homology of every sphere, using only the five axioms — no chains, no simplices, no matrices.
The question
Figure 5.2.7 The computation that drives the uniqueness theorem. A disk has the homology of a point; the long exact sequence of the pair (Dn,Sn−1) shifts degree by one; collapsing the rim of the disk gives a sphere one dimension up. Iterating down to the
0-sphere — two points — leaves H~k(Sn)≅G for k=n and 0 otherwise. Here H~ is reduced homology
(§3.3 Homology Groups), which removes one copy of G from H0.
The idea of the proof is the figure, run inside an induction on cells. Attaching an n-cell changes homology only through the pair (Dn,Sn−1), whose homology the axioms pin down; the long exact sequence and the five lemma (a cousin of the snake lemma) carry
the isomorphism from one stage of the construction to the next. In fact the argument shows more: any theory satisfying the axioms can
be computed by the cellular chain complex. So simplicial, singular and cellular homology agree on complexes — they all satisfy the
axioms with coefficient group Z. Hatcher states the uniqueness theorem in his §2.3 and proves it, for all CW pairs, in
Chapter 4 (Hatcher 2002, §2.3, Thm 4.59).
Dropping an axiom
The dimension axiom looks the most innocent: of course a point has no interesting homology in degree 5. But it is the one axiom that
refers to a specific space, and if you drop it you get a wider class of generalized (co)homology theories that still satisfy
homotopy, exactness, excision and additivity — and so still have long exact sequences, Mayer–Vietoris sequences and spectral sequences — but in which a point can have nonzero groups in many degrees. Complex K-theory, built from vector bundles, assigns to a point the
group Z in every even degree; cobordism, built from manifolds, assigns to a point the groups of all closed manifolds up to
cobordism. These are among the destinations of §5.3 Horizons.
The standard graduate text (Cambridge University Press, 1994). Chapters 1–3 cover chain complexes, the snake lemma (Lemma 1.3.2), resolutions, Tor and Ext; Chapter 5 is a thorough treatment of spectral sequences. Read it after this chapter, with Hatcher open beside it for the topology.
The axioms for homology (§2.3), the universal coefficient theorem for cohomology (§3.1), and the versions for homology and for products (§3.A, §3.B), with full proofs. The natural next step from this chapter.
Five pages in the Notices of the AMS (2006) that derive the spectral sequence of a filtered complex from scratch, the way you might have found it yourself. The best first reading after Figure 5.2.6.
Twelve short, funny, practical pages: the spectral sequence of a double complex, used to re-prove facts you already know (the snake lemma among them). The source of this chapter’s joke about spectres.
The Serre spectral sequence and its applications, including homotopy groups of spheres, in Hatcher’s unhurried style. Unfinished, free, and best read after his main book.
The encyclopedic reference (2nd edition, Cambridge University Press, 2001), with history and many worked applications. For looking things up rather than reading straight through.
Where Tor, Ext, the axioms, abelian categories and spectral sequences came from, with exact dates and the people involved (in I. M. James, ed., History of Topology, 1999).
How a prisoner-of-war camp produced two of the tools in this chapter: a historian’s account with the mathematics explained (Gazette des Mathématiciens, 2000).
Princeton University Press, 1952: the book that axiomatised homology, following the authors’ 1945 announcement. Historically important; Hatcher is easier to learn from.
References
Charles A. Weibel(1994). An Introduction to Homological Algebra. Cambridge University Press.doi
Claudia Weill(1980). It’s My Turn (film, directed by Claudia Weill). transcript of the opening lecture at Burkard Polster and Marty Ross, Mathematics Goes to the Movies.free online
Allen Hatcher(2002). Algebraic Topology. Cambridge University Press.free online
Colin McLarty(2007). The rising sea: Grothendieck on simplicity and generality. in J. J. Gray and K. H. Parshall (eds), Episodes in the History of Modern Algebra (1800–1950), AMS/LMS History of Mathematics 32 (preprint, 2003).free online
Ravi Vakil(2008). Spectral sequences: friend or foe?. lecture notes, Stanford University (Math 216).free online
Timothy Y. Chow(2006). You could have invented spectral sequences. Notices of the American Mathematical Society 53(1), 15–19.free online
Jean-Pierre Serre(1951). Homologie singulière des espaces fibrés. Applications. Annals of Mathematics 54(3), 425–505.doi
Jean-Pierre Serre(1953a). Groupes d’homotopie et classes de groupes abéliens. Annals of Mathematics 58(2), 258–294.doi
Michael A. Hill, Michael J. Hopkins and Douglas C. Ravenel(2016). On the nonexistence of elements of Kervaire invariant one. Annals of Mathematics 184 (2016), 1–262.doi
Weinan Lin, Guozhen Wang and Zhouli Xu(2024). On the last Kervaire invariant problem. preprint.free online
Haynes Miller(2000). Leray in Oflag XVIIA: the origins of sheaf theory, sheaf cohomology, and spectral sequences. Gazette des Mathématiciens 84 (supplement), 17–34.free online
Charles A. Weibel(1999). History of homological algebra. in I. M. James (ed.), History of Topology, Elsevier, 797–836.
Samuel Eilenberg and Norman Steenrod(1945). Axiomatic approach to homology theory. Proceedings of the National Academy of Sciences 31(4), 117–120.free online
John Milnor(1962). On axiomatic homology theory. Pacific Journal of Mathematics 12(1), 337–341.free online
John J. O’Connor and Edmund F. Robertson(2000). Norman Earl Steenrod. MacTutor History of Mathematics Archive, University of St Andrews.free online
Samuel Eilenberg and Norman Steenrod(1952). Foundations of Algebraic Topology. Princeton University Press.doi