Homology
Part V · The Bigger Picture
Chapter 5.2

Homological Algebra

Ext, Tor, spectral sequences and axioms

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.

— Alexander Grothendieck, Récoltes et Semailles, pp. 552–3, translated by Colin McLarty

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 that it does not have over the integers (§3.4 Computing Homology). In cohomology, the torsion of turned up one degree higher, in (§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.

You have already met many of the parts. and came in §3.2 Chains and the Boundary Operator and §3.5 Maps, Invariance, and First Triumphs; and the in §3.6 Exact Sequences and Mayer–Vietoris; the universal coefficient theorem for cohomology, with its mysterious in §4.2 Cohomology Groups. Now, with the language of §5.1 Categories and Functors in hand, we can see how the pieces fit, and meet the two functors, and that measure what is lost when you change coefficients — plus spectral sequences, the great computing engine, and the five axioms that say what “a homology theory” is.

Chain complexes, as a category

Let us restate the definitions from Part III in the abstract, without any space in sight.

Chain complexes and chain maps form a category, (composition is done degree by degree; the identity is the identity in each degree). And homology is a functor on it, a chain map sends cycles to cycles ( and boundaries to boundaries ( so it induces and 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 if  — exactly the condition met in §1.4 Abelian Groups and Formal Sums. In a chain complex we always have and the homology is the quotient of the second by the first. So:

Chain homotopy

In §3.5 Maps, Invariance, and First Triumphs we proved that . The algebraic heart of that proof is worth isolating, because it will reappear below.

A chain homotopy
Figure 5.2.1 Two chain maps (vertical) between the rows and and the diagonal maps that raise degree by one. For spaces, 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 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 or and you can check every step with arithmetic.

Chasing the snake Step through with ‹ › · change m, n and the starting element

Both rows are exact, and every square commutes (multiplying by 6 commutes with everything). Kernels on top, cokernels below.

The diagram
m 4
n 6
start at :
Figure 5.2.2 The rows are the short exact sequence twice, and every vertical map multiplies by Start at an element of  — an with  — then lift it to push it down with pull it back to and read off its class in 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 is a pair of chain maps that is short exact in every degree: exact for each 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 of chains of of and and of

The connecting map is a snake. Take a class lift the cycle to take its boundary it maps to in so it comes from a unique which turns out to be a cycle. Then 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 and with the vertical maps induced by their kernels are and their cokernels are 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 were formal sums of simplices with coefficients from (§3.4 Computing Homology). Cochains with values in were functions from chains to (§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 and the set of all homomorphisms is itself an abelian group: add homomorphisms pointwise, Computing it is a matter of asking where the generators can go.

  • A homomorphism out of is decided by where it sends and may go anywhere: is the isomorphism. (This is the universal property of the free group on one generator.)
  • If then in so An element of finite order has nowhere to go in a group without torsion.
  • Now only needs and there are exactly such in For instance can go to or to
  • 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, is contravariant (§5.1 Categories and Functors): a homomorphism gives Applied to chains, it produces cochains: 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 In general we want a group whose elements are such “formal products” of an element of with an element of obeying the distributive laws and nothing else.

From the relations: (apply the first with and for every integer  — integers can be moved freely across the sign. The key property is universal (§5.1 Categories and Functors again): a homomorphism is the same thing as a function that is additive in each variable separately (bilinear). Now the examples, which have some surprises.

  • via Tensoring with changes nothing.
  • Every equals so the group is generated by Its order divides since and likewise divides so it divides The bilinear map shows the order is exactly
  • Watch it happen: Two nonzero groups whose tensor product is zero.
  • Fractions let you divide by and kills everything in

Exactness, and how it fails

Here is the problem that the rest of the chapter solves. Take a short exact sequence of abelian groups 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

Apply Since and we get The last map is multiplication by 2, which is not onto: its cokernel is In words: a homomorphism defined on the subgroup  — say the one sending to  — cannot be extended to all of because has no half in The cokernel measures exactly these non-extendable maps.

Apply Since we get But multiplication by 2 is the zero map on so the first map is not one-to-one: its kernel is In words: the element of the first was perfectly nonzero, but after reducing mod 2 it maps to Reducing mod 2 forgot that 2 was not zero.

In both cases the failure is itself an abelian group, here The next section gives these failures their names, and and a way to compute them.

Resolutions, Tor and Ext

Free resolutions

Free abelian groups are the easy case: if is free, then and preserve all exactness, because is a sum of copies of and both operations do nothing to 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 that gives a free group mapping onto The kernel 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, and for finitely generated groups is the relation matrix whose you met in §1.5 Linear Algebra. The basic example:

Two things deserve to be said at once. First, the answer does not depend on which resolution you choose: any two free resolutions of are chain homotopy equivalent (once more, a chain homotopy saves the day), so they give isomorphic and 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

  • is the kernel of the elements of killed by So and (the elements with For example,
  • is the cokernel of that is So and (every rational number is divisible by
  • Free groups contribute nothing: since is its own resolution
  • Sums split: and the same for With the classification of §1.4 Abelian Groups and Formal Sums, these rules compute everything.
A calculator for ⊗, Tor, Hom and Ext Build A and G from ℤ and ℤ/n pieces · or try a preset
copies of ℤ in A 0
tap a summand to remove it; +n adds ℤ/n
copies of ℤ in G 0
tap a summand to remove it; +n adds ℤ/n
Where the numbers come from: a free resolution of
Tensor with (right exact)

The left map should be injective for exactness, and it is not: it multiplies by on copies of . Its kernel is .

Apply (left exact)

The right map should be surjective, and it is not: its cokernel, made of the pieces for each in , is .

try:
Figure 5.2.3 Each operation splits over the cyclic pieces of and and the cards show every piece. Below, the free resolution of after tensoring with the first map stops being injective, and its kernel is after applying the last map stops being surjective, and its cokernel is Notice that and vanish unless has torsion — free groups resolve themselves.

Where the names come from

Tor is short for torsion. One way to see it: is isomorphic to the of  — for instance consists of the elements of killed by which form a copy of Tor detects the torsion in as seen through

Ext is short for extension. An extension of by is a short exact sequence a bigger group built from a subgroup and a quotient It turns out that the extensions (up to the obvious equivalence) correspond exactly to the elements of with the split extension corresponding to Take there are two ways to build a group of order 4 from two copies of namely and (in which the subgroup has quotient Correspondingly, has two elements. (The count is of extensions, not of groups. has three elements, but only two middle groups occur, and the two non-split extensions both use glued to the quotient by different maps.)

The universal coefficient theorems

Now the payoff. If you know the integral homology of a space, do you know its homology and cohomology with every other coefficient group? Yes — and and are exactly the correction terms.

The second formula is the one stated in §4.2 Cohomology Groups; now you can see where its 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 coefficients Choose a space and a coefficient group
cells of : word aa: ∂(face) = 2a
chains
cochains in
integral homology
homology with coefficients
⊕
⊕
⊕
from Tor of
cohomology
⊕
⊕
⊕
from Ext of
Each entry is (homology) or (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 and from integral homology by the universal coefficient theorems; the rose part of each entry is the or 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 with and

Two consequences get used constantly. With coefficients in (or all torsion disappears: when the homology is finitely generated, and cohomology has the same dimensions as homology. With coefficients in for a prime torsion of order prime to disappears, while each summand of is seen twice, as a in degree and another in degree That is why the mod-2 Betti numbers of are although its rational Betti numbers are

The Künneth theorem: homology of products

The torus is a product of two circles, Its homology looks like it ought to be “the product” of the circle’s with itself — and the Künneth theorem, glimpsed in §4.5 The Cup Product as the , says exactly how.

Start with cells. If and are cell complexes, then is one too: its cells are products of an -cell of and a -cell of of dimension The circle has a 0-cell and a 1-cell, so the torus gets cells of dimension and 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, So computing 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: No torsion, no terms. A pleasant way to remember torsion-free cases: multiply the Poincaré polynomials The circle has so the torus has and the -dimensional torus has with binomial coefficients as Betti numbers. With coefficients in a field, the term disappears and this multiplication rule is exact.

The 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 the classes of order 2 in the two copies of give in The figure lets you try products.

Homology of a product Choose the two factors
n = 2
n = 3
n = 4
n = 1
n = 2 → n = 3
n = 3
n = 0
n = 1
n = 2
⊕
⊕
⊕
⊕
⊕

Each anti-diagonal (same colour) adds up to ; the rose Tor terms jump one diagonal up. Agrees with the homology of the product cell complex.

Figure 5.2.5 Cell holds the cells along an anti-diagonal (one colour) add up to together with any terms (rose) that arrive from the diagonal below. For consists of a single 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 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 with a nested sequence of subcomplexes the space after stage 0, after stage 1, and so on. Draw a grid with columns for the stages and rows and put each generator of degree that is added at stage at the position with Total degree is constant along the anti-diagonals just as in the Künneth grid.

  • Page records the homology of each stage relative to the stages before it: It is the first approximation: the new cycles at each stage, ignoring how stages attach.
  • The differential records how stage attaches to stage the boundary of a new cycle, seen in the previous stage. Taking homology gives the next page,
  • The differential records attachments that skip a stage; and in general moves columns left and rows up, with
  • Convergence. With finitely many stages the differentials eventually have nowhere to go, the pages stop changing, and the final page spells out the homology: over a field,
Turning the pages Choose a page · switch examples and coefficients
n = 0n = 1n = 2
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
dim 0, stage 0
dim 0, stage 0
dim 1, stage 0
dim 1, stage 1
dim 1, stage 1
dim 2, stage 2
dim 2, stage 2
On page , the differential has slope . 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 two arrows cancel against and against on a of slope cancels the disk against the loop it fills, two stages earlier; leaves one dot, so the space has the homology of a point. Torus by cells: nothing ever cancels. by cells: over a (multiplication by 2) cancels against over it is zero and every dot survives — the universal coefficient story again.

The most famous example has a fibration as input. When a space is fibred over a base with fibre  — like the Hopf fibration of §5.3 Horizons, where is fibred over by circles — the Serre spectral sequence has (when is simply connected) and converges to Its page is a Künneth grid, and the differentials measure how far is from being the product 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 axioms Step through · the axioms used in each step light up
1
Homotopy
Homotopic maps induce the same homomorphism.
2
Exactness
Every pair gives a long exact sequence, with natural ∂.
3
Excision
Cutting out a set deep inside A changes nothing.
4
Dimension
A point has homology only in degree 0, where it is G.
5
Additivity
A disjoint union has the direct sum of homologies.

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 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 for and otherwise. Here is reduced homology (§3.3 Homology Groups), which removes one copy of from

The idea of the proof is the figure, run inside an induction on cells. Attaching an -cell changes homology only through the pair 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 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 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.

Exercises

Summary

Further reading

  • 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.
  • Differential Forms in Algebraic Topology — Raoul Bott and Loring W. Tu
    Springer GTM 82 (1982). Builds spectral sequences from the Čech–de Rham double complex, with pictures; the natural bridge from this book’s Part IV.
  • History of Homological Algebra — Charles A. Weibel free
    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).
  • Foundations of Algebraic Topology — Samuel Eilenberg and Norman Steenrod
    Princeton University Press, 1952: the book that axiomatised homology, following the authors’ 1945 announcement. Historically important; Hatcher is easier to learn from.

References

  1. Charles A. Weibel (1994). An Introduction to Homological Algebra. Cambridge University Press. doi
  2. 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
  3. Allen Hatcher (2002). Algebraic Topology. Cambridge University Press. free online
  4. 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
  5. Ravi Vakil (2008). Spectral sequences: friend or foe?. lecture notes, Stanford University (Math 216). free online
  6. Timothy Y. Chow (2006). You could have invented spectral sequences. Notices of the American Mathematical Society 53(1), 15–19. free online
  7. Jean-Pierre Serre (1951). Homologie singulière des espaces fibrés. Applications. Annals of Mathematics 54(3), 425–505. doi
  8. Jean-Pierre Serre (1953a). Groupes d’homotopie et classes de groupes abéliens. Annals of Mathematics 58(2), 258–294. doi
  9. 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
  10. Weinan Lin, Guozhen Wang and Zhouli Xu (2024). On the last Kervaire invariant problem. preprint. free online
  11. 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
  12. Charles A. Weibel (1999). History of homological algebra. in I. M. James (ed.), History of Topology, Elsevier, 797–836.
  13. Samuel Eilenberg and Norman Steenrod (1945). Axiomatic approach to homology theory. Proceedings of the National Academy of Sciences 31(4), 117–120. free online
  14. John Milnor (1962). On axiomatic homology theory. Pacific Journal of Mathematics 12(1), 337–341. free online
  15. John J. O’Connor and Edmund F. Robertson (2000). Norman Earl Steenrod. MacTutor History of Mathematics Archive, University of St Andrews. free online
  16. Samuel Eilenberg and Norman Steenrod (1952). Foundations of Algebraic Topology. Princeton University Press. doi