Homological Algebra and Algebraic Topology

Executive summary

The algebra was abstracted from the topology

Chain complexes, homotopy, exact sequences and derived functors were all abstracted from constructions on spaces. The dictionary runs in both directions: a space gives a chain complex whose homology is a topological invariant, and a group gives a space — its classifying space — whose homology is the group's. Knowing which side a given theorem lives on, and how it translates, is often the fastest route to understanding why it is true.

Learning objectives

State the dictionary between topological and algebraic constructions.
Explain the role of the Eilenberg–Zilber theorem.
Describe classifying spaces and Eilenberg–MacLane spaces.
Identify which spectral sequences correspond to which geometric situations.

Section 01The dictionary

Topology and homological algebra
Topology	Algebra
Singular chain complex of a space	A chain complex of free abelian groups
Continuous map	Chain map
Homotopy of maps	Chain homotopy
Homotopy equivalence	Chain homotopy equivalence
Long exact sequence of a pair	Long exact homology sequence
Mayer–Vietoris	The sequence of a short exact sequence of complexes
Universal coefficients	Ext and Tor corrections
Product of spaces	Tensor product of complexes, via Eilenberg–Zilber
Classifying space BG	Bar resolution over ℤ[G]
Fibration	Grothendieck spectral sequence, via Serre
CW structure	A small free resolution

Chain homotopy is the abstraction of homotopy

Homotopic maps of spaces induce chain homotopic maps on singular chains, hence agree on homology. The algebraic notion was defined precisely to capture that, and the fact that additive functors preserve it — which makes derived functors well defined — is the algebraic residue of homotopy invariance.

Section 02Eilenberg–Zilber and Künneth

The singular chain complex of a product is not the tensor product of the chain complexes, but the Eilenberg–Zilber theorem provides a natural chain homotopy equivalence between them.

Stage 01Eilenberg–ZilberS(X × Y) is chain homotopy equivalent to S(X) ⊗ S(Y), naturally, via the Alexander–Whitney and shuffle maps.
Stage 02KünnethCompute the homology of the tensor product from the homologies of the factors, with a Tor correction.
Stage 03CompositeH_*(X × Y) in terms of H_*(X) and H_*(Y).
Stage 04DiagonalComposing with the diagonal map gives the cup product on cohomology.

Two theorems, often quoted as one

The topological statement about products needs both: Eilenberg–Zilber is the geometry, Künneth the algebra. Sources sometimes call the composite the Künneth theorem, which obscures that the algebraic half holds for arbitrary complexes with no topology at all.

Section 03Classifying spaces

For a discrete group G, the classifying space BG is an Eilenberg–MacLane space K(G, 1): connected, with fundamental group G and contractible universal cover. Its homology is the group homology of G, and the cellular chains of the universal cover form a free resolution of ℤ over ℤ[G].

Groups and their classifying spaces
Group	Classifying space	Consequence
ℤ	Circle	H_n = 0 for n ≥ 2
Free group of rank n	Wedge of n circles	Cohomological dimension 1
ℤⁿ	n-torus	Exterior algebra cohomology
ℤ/2	Infinite real projective space	Non-zero cohomology in every degree
Surface group of genus g	The surface itself	Poincaré duality group of dimension 2
Torsion-free group acting freely on a contractible complex	The quotient	Finite cohomological dimension

Torsion forces infinite dimension

A group with torsion has non-vanishing cohomology in infinitely many degrees, so its classifying space cannot be finite-dimensional. This is why finiteness conditions on groups and the presence of torsion are so tightly linked.

ReferenceFrequently asked questions

Does every homological theorem have a topological counterpart?

Many do, but not all. Purely ring-theoretic results — Hilbert's syzygy theorem, characterisations of regular local rings — have no direct topological reading, though analogies via commutative algebra and geometry exist.

Why is the bar resolution the same as the classifying space?

Because the nerve of the one-object category associated with G has n-simplices indexed by n-tuples of group elements, which are exactly the free generators of the bar resolution in degree n. The simplicial identities become the differential.

Which came first?

The topology. Singular homology, exact sequences and the Künneth formula were established for spaces before Cartan and Eilenberg abstracted the algebra in the 1950s. The abstraction then paid back by applying to sheaves, groups and Lie algebras.

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 Homological Algebra and Algebraic Topology. 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 Homological Algebra and Algebraic Topology as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—topology, algebra, section, homological, algebraic—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 Homological Algebra and Algebraic Topology?