Derived and Stable Categories

Executive summary

Complexes first, modules second

The derived category is obtained from the category of complexes by formally inverting the quasi-isomorphisms — the maps that induce isomorphisms on homology. In it, a module and any resolution of it become isomorphic, so resolutions stop being a computational device and become the objects themselves. Exact sequences are replaced by distinguished triangles, derived functors become ordinary functors between derived categories, and Ext becomes a Hom group.

Learning objectives

Construct the derived category by localisation.
Explain why a module and its resolution become isomorphic.
State the triangulated structure and how triangles replace exact sequences.
Identify Ext as a Hom in the derived category.

Section 01Localisation

Stage 01ComplexesStart with the abelian category of chain complexes and chain maps.
Stage 02Homotopy categoryQuotient by chain homotopy. This is already triangulated but not yet the right object.
Stage 03Invert quasi-isomorphismsFormally invert maps inducing isomorphisms on homology. The calculus of fractions makes this manageable.
Stage 04Derived category D(A)Objects are complexes; morphisms are roofs. A module and any of its resolutions become isomorphic.

Why quasi-isomorphism and not homotopy equivalence

A projective resolution is quasi-isomorphic to the module it resolves but not homotopy equivalent to it. Inverting quasi-isomorphisms is precisely what makes the resolution and the module the same object, which is the whole design goal.

Extⁿ_A(M, N) ≅ Hom_D(A)(M, N[n])

Section 02Triangles

The derived category is not abelian — it has no kernels or cokernels. Its replacement structure is a class of distinguished triangles

X → Y → Z → X[1]

satisfying axioms that make them behave like short exact sequences: each triangle induces a long exact sequence on homology, and the shift functor plays the role of the connecting map.

Abelian categoryShort exact sequences

Kernels and cokernels exist. Long exact sequences arise from the snake lemma.

Triangulated categoryDistinguished triangles

No kernels or cokernels. Long exact sequences arise from the triangle axioms and the shift functor.

Cones are not functorial

The third term of a triangle — the mapping cone — is not determined functorially by the map. This is the well-known defect of triangulated categories, and it is what motivates the enhancements: differential graded categories, stable ∞-categories and derivators.

Section 03Consequences and variants

Consequence

Derived functors become functors

RHom and the derived tensor product are ordinary functors between derived categories. Their homology recovers Ext and Tor, so the classical theory is a shadow.

Consequence

Composition is automatic

The Grothendieck spectral sequence becomes the statement that the derived functor of a composite is the composite of the derived functors, with the spectral sequence recovering the homology.

Variant

Bounded derived categories

Restricting to bounded complexes gives D^b, the usual setting for coherent sheaves and for tilting theory.

Variant

Stable module category

For a finite group in modular characteristic, the module category modulo projectives is triangulated and equivalent to a quotient of the derived category.

Variant

Derived equivalence

Two rings can have equivalent derived categories without being isomorphic — Morita theory's derived analogue, central to modern representation theory.

Variant

Derived algebraic geometry

Replacing rings by simplicial or differential graded rings; the derived category becomes the natural home for intersection theory with correct multiplicities.

Where the subject went

Classical homological algebra computes invariants of modules. The derived viewpoint treats the complexes as the objects and asks about equivalences between the resulting categories. Most current research in the area is conducted in that language.

ReferenceFrequently asked questions

Is the derived category a category in the naive sense?

Yes, but morphism classes can fail to be sets without care. Working with bounded complexes over a small category, or using a suitable universe convention, resolves this. The homotopy-category route with a calculus of fractions is the standard construction.

Why is the derived category not abelian?

Because inverting quasi-isomorphisms destroys kernels and cokernels: a map with zero kernel and cokernel in the derived sense is already an isomorphism. Triangles are the structure that survives, and they carry enough to reproduce long exact sequences.

Do I need derived categories to do homological algebra?

Not for the classical results in this collection — Ext, Tor, group and Lie algebra cohomology are all accessible without them. They become necessary when the objects of interest are complexes themselves, as in algebraic geometry and modern representation theory.

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 Derived and Stable Categories. 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 Derived and Stable Categories as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—derived, category, stable, localisation, functors—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 Derived and Stable Categories?