Homology of Small Categories

Executive summary

Group homology is the one-object case

For a small category A and a functor T from it into an abelian category, the homology of A with coefficients in T is the left derived functor of the colimit — equivalently, of the left Kan extension to the terminal category. When A has one object and all morphisms invertible it is a group, and the construction returns group homology exactly. The nerve makes the whole picture topological: this homology is the homology of a classifying space.

Learning objectives

Define the homology of a small category with functor coefficients.
Recover group homology as the one-object case.
Describe the nerve and the classifying space.
State the spectral sequences relating a functor between categories.

Section 01The definition

H_n(A, T) = L_n(colim)(T) = L_n(Lan_K)(T)

where K is the functor to the terminal category. The functor category Fun(A, C) is abelian when C is, with enough projectives when A is small, so the derived functors exist.

Specialisations
Category A	Homology obtained
A group, viewed as one object with invertible morphisms	Group homology
A monoid	Monoid homology
A poset	Homology of the order complex
A discrete category	Direct sum of the coefficients; nothing higher
The simplex category	Simplicial homology of the coefficient object
A groupoid	Direct sum over connected components of group homologies

Why the group case is recovered

A functor from a one-object groupoid is exactly a module over the group, and the colimit is exactly the coinvariants. Left deriving the coinvariants is the definition of group homology, so the two constructions coincide by definition rather than by coincidence.

Section 02The nerve and classifying space

The nerve of A is the simplicial set whose n-simplices are chains of n composable morphisms. Its geometric realisation is the classifying space BA, and

H_n(A, ℤ) ≅ H_n(BA; ℤ)

For a group this is the usual classifying space BG, an Eilenberg–MacLane space K(G, 1), which is why group homology and the homology of BG agree.

The bar resolution reappears

The simplicial structure of the nerve, applied to a group, is precisely the bar resolution. The apparently ad hoc formula of the group-cohomology stream is the simplicial structure of a classifying space, written algebraically.

Section 03Functors between categories

A functor F: A → B induces restriction on coefficients and a comparison of homologies, and the Grothendieck construction gives a spectral sequence

E²_p,q = H_p(B, H_q(F ↓ −, T)) ⇒ H_p+q(A, T)

Consequence

Quillen's Theorem A

If every comma category F ↓ b is contractible, F induces a homotopy equivalence of classifying spaces — and hence an isomorphism on homology.

Consequence

Cofinality

A cofinal functor induces an isomorphism on colimits and on their derived functors, which is how many computations are reduced to a smaller indexing category.

Consequence

The LHS sequence again

For a surjection of groups viewed as a functor of one-object categories, the spectral sequence above is the Lyndon–Hochschild–Serre sequence.

ReferenceFrequently asked questions

Why must the category be small?

Because the functor category must have enough projectives and the colimits must exist, both of which require a set of objects. For large categories the constructions may fail or require universe conventions.

Is this the same as simplicial homology?

It is computed by the simplicial object given by the nerve, so yes in that sense. The categorical formulation makes the coefficient functor available, which the purely simplicial picture does not naturally provide.

What does contractibility of a comma category mean here?

That its classifying space is contractible, so it contributes nothing above degree 0 to the spectral sequence. Quillen's Theorem A turns that vanishing into a statement that the two categories have the same homology — the standard reduction technique in algebraic K-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 Homology of Small 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 Homology of Small Categories as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—homology, category, nerve, section, small—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 Homology of Small Categories?