Chain Homotopy and the Comparison Theorem

Executive summary

Homotopic chain maps induce the same map on homology

Two chain maps are homotopic when their difference is a boundary in the algebraic sense: f − g = ∂s + s∂ for some degree-raising family s. Homotopic maps induce the same map on homology, which is what makes derived functors well defined: any two projective resolutions of a module are homotopy equivalent, so the homology of the resolved complex does not depend on which resolution was chosen.

Learning objectives

Define chain homotopy and homotopy equivalence.
Prove that homotopic maps agree on homology.
State and apply the comparison theorem.
Distinguish homotopy equivalence from quasi-isomorphism.

Section 01Homotopy

f − g = ∂s + s∂, s_n: C_n → D_n+1

The family s need not commute with anything; it is simply a degree-raising map of graded modules. On a cycle z, (f − g)(z) = ∂s(z) is a boundary, so f and g agree on homology classes.

This is the only reason derived functors exist

Additive functors preserve the identity ∂s + s∂, so they carry homotopies to homotopies. Hence the homology of the image complex is independent of the chosen resolution. Additivity of the functor is exactly what this argument needs, which is why it is a standing hypothesis.

Section 02The comparison theorem

AlgorithmComparison theorem for projective resolutionsin: two resolutions and a map → out: a lift, unique up to homotopy

Let P_• ↠ M be a projective resolution and Q_• ↠ N any resolution, with f: M → N given.
Construct a chain map lifting f by induction: at each stage the projectivity of P_n lifts the required map through the surjection onto the cycles of Q_•. Projectivity supplies the lift; exactness of Q supplies the surjection.
Any two such lifts are chain homotopic, by the same induction applied to their difference.
Taking M = N and f = 1 gives: any two projective resolutions of M are chain homotopy equivalent.
Therefore the derived functors computed from either agree, canonically.

The horseshoe lemma

Given a short exact sequence of modules and projective resolutions of the outer two, the horseshoe lemma builds a compatible resolution of the middle term, producing a short exact sequence of complexes. That is the step converting a short exact sequence of modules into the long exact sequence of derived functors.

Section 03Homotopy equivalence versus quasi-isomorphism

Homotopy equivalenceStronger

Chain maps both ways whose composites are homotopic to identities. Preserved by every additive functor.

Quasi-isomorphismWeaker

A chain map inducing isomorphisms on all homology. NOT generally preserved by additive functors.

The distinction is not academic

A quasi-isomorphism can be destroyed by applying a functor, whereas a homotopy equivalence cannot. This is precisely why derived functors are computed with projective or injective resolutions rather than arbitrary quasi-isomorphic complexes, and why the derived category has to be constructed by formally inverting quasi-isomorphisms rather than by taking homotopy classes.

Between bounded-below complexes of projectives the two notions coincide, which is why the comparison theorem is available in exactly the setting where resolutions live.

ReferenceFrequently asked questions

Is chain homotopy the algebraic shadow of topological homotopy?

Yes, and historically that is where it came from. Homotopic maps of spaces induce chain homotopic maps on singular chains, so they agree on homology. The algebraic notion was abstracted from exactly this.

Does a contracting homotopy prove exactness?

Yes — if the identity of a complex is homotopic to zero, all homology vanishes. The converse fails in general, but holds for bounded-below complexes of projectives, which is again the resolution setting.

Why must the functor be additive?

Because the homotopy identity involves a sum of two composites. A non-additive functor need not preserve that sum, so homotopic maps could have non-homotopic images and the whole independence argument would collapse.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Chain Homotopy and the Comparison Theorem. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Chain Homotopy and the Comparison Theorem as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—homotopy, chain, comparison, theorem, equivalence—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Chain Homotopy and the Comparison Theorem?