Chain complexes, chain maps, and homotopies
Separate differential identities, induced cohomology maps, and chain-level homotopy data.
On this page
The question for today
What you’ll understand
- Translate explicitly between chain and cochain indexing.
- Prove that homotopic maps induce the same cohomology map.
- Construct a contraction and distinguish acyclicity from contractibility.
A complex remembers both equations and relations between equations. Its differential identifies which elements qualify as cycles, while the preceding differential records which cycles have already been declared trivial. Throughout this module, an unspecified complex is a cochain complex of left modules over a unital ring. Chain complexes will be explicitly marked, particularly when computing Tor. This convention prevents an innocent change of indices from silently reversing a connecting map.
Cycles require the square-zero identity
A cochain differential raises degree by one, and two successive differentials compose to zero. Consequently every boundary is a cycle, so the quotient defining cohomology exists. This requirement must be checked before calculating any quotient: arbitrary consecutive matrices need not form a complex. A chain differential instead lowers degree. Setting converts a chain complex into a cochain complex without altering its individual arrows; homology in degree becomes cohomology in degree .
In a finite-dimensional complex over a field, cohomology measures the gap between the kernel of one matrix and the image of the preceding matrix. Over integers, ranks alone miss torsion in that quotient. For example, multiplication by a nonzero integer has zero kernel but usually a nontrivial cokernel. Recording the ring is therefore part of the calculation, rather than an optional label: multiplication by six behaves differently over integers, rational numbers, and a field of characteristic three.
Maps compatible with differentials
A cochain map consists of maps in every degree satisfying . This identity sends cycles to cycles and boundaries to boundaries, giving a well-defined map on cohomology. Two degreewise linear maps that happen to give the same matrix rank are not thereby maps of complexes. Compatibility is an equation involving both adjacent degrees, and an alleged induced map cannot be used before that equation is established.
A cochain homotopy from one map to another is a family lowering degree by one. On a cycle, their difference becomes a boundary, which proves that homotopic maps induce identical cohomology maps. The converse is false in general: knowing an induced map discards chain-level information. Homotopy is stronger data than agreement on cohomology, and its formula explains precisely where the discarded difference goes instead of merely asserting that the difference is invisible.
Contractions and information loss
A homotopy equivalence has a cochain-map inverse up to homotopy in both directions. It is necessarily a quasi-isomorphism, meaning an isomorphism on every cohomology module. A contraction is a homotopy between the identity and zero. It forces all cohomology to vanish, since every cycle is explicitly the differential of its contracted image. Acyclicity only says that each cycle has some preimage; it does not supply compatible module homomorphisms choosing those preimages.
The distinction matters over rings where short exact sequences need not split. Over a field, choices of complements allow an acyclic complex of vector spaces to be contracted. Over integers, an exact complex containing the nonsplit quotient onto the integers modulo two can be acyclic without being contractible. Later, derived localization will deliberately erase such acyclic complexes. First we retain them, because their failure to contract explains why homotopy and cohomology describe different levels of equivalence.
Work it through
Contract an invertible two-term differential
Let be a field and let , with multiplication by three and all other terms zero. Assume the characteristic of is not three. Construct a contraction and compute cohomology.
Multiplication by three is invertible under the stated characteristic hypothesis. Thus the degree-zero kernel is zero and the degree-one image is all of ; both cohomology groups vanish.
Define the only potentially nonzero homotopy component to be multiplication by one third. All other homotopy components are zero.
In degree zero, is the identity; in degree one, is the identity. These are exactly the two nontrivial components of , so the identity is homotopic to zero.
The complex is contractible. If the characteristic were three, the differential would instead be zero, leaving a copy of in each of the two cohomological degrees.
The living notebook
Explore the model
Interactive lab · matrix
An invertible map has no kernel or cokernel
Pause/Reset, then set both diagonal scale to 0.5 and shear to 1. Predict determinant 0.5 and trivial kernel for the selected real matrix. Compare its transformed square and readouts, then Reset and set both scale to 1 and shear to 0. The interpolation is geometry, not a changing differential.
- Area scale · det A
- 1.4
- Singular values · σmax, σmin
- 1.597, 0.876
- Condition number · κ₂(A)
- 1.823
The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. 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 forEvery supported matrix is invertible over the reals, so it can serve as a contractible two-term differential; the lab does not construct a general complex.
Pause & reason
Check your understanding
Your turn
Try it yourself
Replace the worked differential by multiplication by six on in degrees zero and one. Compute cohomology and decide whether a contraction exists. Explain why the field calculation cannot simply be reused.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Determine the image as a subgroup of , and ask whether multiplication by six has a module-homomorphic inverse.
Compare with the solution
The kernel is zero, while the image is . Therefore and . A contraction would force this nonzero cohomology module to vanish, so none exists. Multiplication by one sixth is not an endomorphism of the integer module; dividing the matrix entries has left the category in which the problem was posed.
Keep the idea
Take it with you
- Fix the degree convention before manipulating differentials.
- Homotopy provides a chain-level reason that induced maps agree.
- Contractibility implies acyclicity, with no general converse over rings.
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.