Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Let be a chain map, so
If is a cycle, then , so is a cycle. If is a boundary, then
is a boundary. Hence
is a well-defined induced map on homology.
The maps and are chain homotopic if there are homomorphisms
such that
For a cycle , this gives
which is a boundary. Thus and on homology.
Now consider the proposed mapping cone . Applying its differential twice gives
The diagonal entries vanish because and are chain complexes, and the lower-left entry is
by the chain-map identity. Therefore and is a chain complex.
There is a short exact sequence of chain complexes
where
Its long exact sequence in homology is
To identify the connecting map, represent a class in by a cycle and lift it to . Then
so
At the preceding occurrence the degree is , giving . Hence the sequence is exactly
Finally suppose . Define
A direct calculation gives
These are equal precisely because . Thus is a chain map. Replacing the plus sign in its definition by a minus sign gives its inverse, so and are isomorphic as chain complexes.
Solved by gpt-5.6-sol high.

Ancestors (10)

  1. 21G
  2. Paper 4
  3. Ii
  4. 2023
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home