Homological Algebra: Discipline Overview

Executive summary

One machine, measuring one kind of failure

Homological algebra begins with a single observation: many natural constructions preserve part of an exact sequence but not all of it. Hom is left exact; the tensor product is right exact; neither is exact. Rather than treat this as a defect, the subject makes the defect the object of study. Resolutions replace an object by a complex of well-behaved ones, derived functors measure exactly how much exactness was lost, and the resulting invariants — Ext and Tor — turn out to encode extensions, obstructions and topological information at once.

Learning objectives

State precisely how Hom and tensor fail to be exact.
Explain what a resolution is for and why the choice does not matter.
Identify Ext and Tor as the derived functors of Hom and tensor.
Trace how the same machinery yields group and Lie algebra cohomology.
Locate any topic in this knowledge stream from the layer it belongs to.

Section 01The failure that starts everything

Let 0 → A → B → C → 0 be a short exact sequence of modules. Applying Hom(M, −) gives

0 → Hom(M, A) → Hom(M, B) → Hom(M, C)

and the last map need not be surjective: a homomorphism into C may not lift to B. Applying M ⊗ − gives right exactness instead, with injectivity on the left failing. In both cases something is missing, and the missing piece is not noise — it is an invariant.

Left exactHom(M, −) and Hom(−, N)

Preserves kernels. The cokernel of the last map is measured by Ext¹.

Right exactM ⊗ −

Preserves cokernels. The kernel of the first map is measured by Tor₁.

The governing idea

A functor that is exact loses nothing and needs no repair. A functor that is only half-exact leaves a measurable residue, and that residue is a sequence of new functors — the derived functors. Homological algebra is the systematic study of those residues.

Section 02The layer stack

Every computation in the subject decomposes downward through the same layers. Knowing the stack is the fastest route to knowing where a given technique belongs.

Stage 01Modules and exactnessProjectives, injectives, free modules, Hom and tensor. The raw material.
Stage 02Categories and functorsAbelian categories, adjoints, limits. The language that makes the constructions apply far beyond modules.
Stage 03Complexes and resolutionsChain complexes, homotopy, projective and injective resolutions.
Stage 04Derived functorsExt, Tor and their long exact sequences. The central invariants.
Stage 05SpecialisationGroup cohomology, Lie algebra cohomology, Künneth formulas, spectral sequences.

Why the categorical layer is not optional

It would be possible to develop Ext and Tor for modules alone. The categorical layer earns its place because the same arguments then apply verbatim to sheaves, to representations, to chain complexes themselves — and because adjointness is what actually explains why projectives and injectives behave as they do.

Section 03What the invariants know

The principal invariants and what they classify
Invariant	Derived from	Classifies
Ext¹(C, A)	Hom(−, A), first derived functor	Extensions of C by A, up to equivalence — with the zero element the split extension
Extⁿ(C, A)	Higher derived functors of Hom	n-fold extensions (Yoneda); obstruction groups
Tor₁(A, B)	First derived functor of tensor	Torsion interaction; the correction term in the Künneth formula
Hⁿ(G, A)	Ext over the group ring	n = 1 derivations modulo principal ones; n = 2 group extensions with given action
Hⁿ(g, A)	Derived functors over the enveloping algebra	n = 2 Lie algebra extensions; vanishing gives the Whitehead lemmas
Projective dimension	Length of a shortest projective resolution	How far a module is from being projective; global dimension bounds it over the ring

One computation, many readings

Ext¹ is simultaneously an obstruction group, a classification of extensions and a derived functor. These are not analogies — they are the same group arrived at three ways, and the ability to move between the readings is most of the working skill in this subject.

Section 04How this stream is organised

KEVOS topic streams for homological algebra
Stream	Covers	Depends on
Modules	Projectives, injectives, free and cofree modules, essential extensions	—
Categories and Functors	Categories, adjoints, limits, abelian categories	Modules
Extensions, Ext and Tor	Baer sum, Ext, tensor product, Tor	Modules, categories
Derived Functors	Complexes, homotopy, resolutions, Ext and Tor systematically	Extensions
The Künneth Formula	Double complexes, Künneth and universal coefficients	Derived functors
Cohomology of Groups	Group ring, low-dimensional interpretation, extensions, transfer	Derived functors
Cohomology of Lie Algebras	Enveloping algebra, Whitehead lemmas, syzygies	Derived functors
Spectral Sequences	Exact couples, filtrations, Grothendieck and LHS sequences	Derived functors
Satellites and Kan Extensions	Relative homological algebra, satellites, Kan extensions	Derived functors, categories
Applications	Topology, nilpotent groups, modular representations, derived categories	All of the above

ReferenceFrequently asked questions

Is homological algebra a subject or a toolkit?

Both, and the distinction matters less than it appears. It arose as a toolkit abstracted from algebraic topology, and it has a substantial internal theory of its own. In practice most people meet it as machinery for another subject and only later find that the machinery has its own questions.

Do I need category theory first?

Not first, but soon. The module-theoretic development is self-contained up to derived functors, and many people find the concrete case clarifying. The categorical language becomes unavoidable once the same theorems are wanted for sheaves or for complexes themselves.

Why are there two indices, homology and cohomology?

Because functors come in covariant and contravariant flavours, and resolutions come in projective and injective flavours. Homology decreases the index and is computed from projectives with covariant right-exact functors; cohomology increases it and is computed from injectives or from contravariant left-exact functors.

NavigateContinue in this stream

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

ProvenanceSources and further reading

The standard reference for this material is Hilton and Stammbach, A Course in Homological Algebra (Springer, Graduate Texts in Mathematics 4). Cartan and Eilenberg's Homological Algebra is the founding text; Weibel's An Introduction to Homological Algebra is the standard modern companion.

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: Discipline Overview. 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: Discipline Overview as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—section, homological, algebra, failure, overview—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: Discipline Overview?