The Lyndon–Hochschild–Serre Spectral Sequence

Q: Is there a homology version?

Yes, with E²p,q = Hp(Q, Hq(N, A)) converging to Hp+q(G, A). Its five-term sequence gives Hopf's formula as a special case.

Q: What if N is central?

The action of Q on Hq(N, A) may still be non-trivial through the coefficients, but for trivial coefficients it is trivial and the E2 page simplifies considerably. Central extensions are the standard first application.

Executive summary

Break a group into a normal subgroup and a quotient

For 1 → N → G → Q → 1 there is a first-quadrant spectral sequence with E₂^p,q = H^p(Q, H^q(N, A)) converging to H^p+q(G, A). It is the Grothendieck spectral sequence for taking N-invariants and then Q-invariants, and it is how essentially every non-trivial group cohomology computation is organised.

Learning objectives

State the spectral sequence and its E₂ page.
Explain the Q-action on the cohomology of N.
Extract the five-term sequence.
Apply it to compute a cohomology group.

Section 01The statement

E₂^p,q = H^p(Q, H^q(N, A)) ⇒ H^p+q(G, A)

It is the Grothendieck spectral sequence for the composite A ↦ A^N ↦ (A^N)^Q = A^G. The acyclicity hypothesis holds because ℤ[G] is free over ℤ[N], so induced modules are acyclic.

The Q-action is essential

H^q(N, A) carries an action of Q = G/N, because N acts trivially on its own cohomology by an inner-automorphism argument. Without that action the E₂ page would not make sense — the outer cohomology is taken with respect to it.

Section 02What it gives immediately

Immediate

Five-term sequence

The inflation–restriction sequence, valid with no spectral sequence machinery and sufficient for most degree-2 questions.

Immediate

N with trivial cohomology

If H^q(N, A) = 0 for q > 0, the sequence collapses to the bottom row and H^*(G, A) = H^*(Q, A^N).

Immediate

Q with trivial cohomology

If Q has cohomological dimension 0 the sequence collapses to the left column, giving H^*(G, A) = H^*(N, A)^Q.

AlgorithmComputing with the sequencein: a normal subgroup and coefficients → out: H^*(G, A)

Choose a normal subgroup whose cohomology is known — often abelian or cyclic.
Compute H^q(N, A) as a Q-module. Determining the action is usually the hardest step.
Compute H^p(Q, −) of each of those, giving the E₂ page.
Determine which differentials vanish — by degree reasons, naturality, or comparison.
Read off E_∞ and solve the extension problems in each total degree.

Section 03Cautions

DifferentialsRarely obvious

d₂ is the transgression and can be computed in low degrees; higher differentials often require independent information about G.

ExtensionsRarely automatic

Even with full collapse, the filtration of Hⁿ(G, A) must be resolved. Ring structure and restriction maps are the usual extra input.

The action on H<sup>q</sup>(N, A) is easy to get wrong

It combines the conjugation action of G on N with the action on the coefficients. Assuming it is trivial when it is not produces an E₂ page that is simply the wrong object, and the error propagates silently through the rest of the computation.

ReferenceFrequently asked questions

Why is it a first-quadrant spectral sequence?

Because both cohomology theories vanish in negative degrees. That guarantees convergence with no additional hypothesis, which is one reason the sequence is so widely usable.

Is there a homology version?

Yes, with E²_p,q = H_p(Q, H_q(N, A)) converging to H_p+q(G, A). Its five-term sequence gives Hopf's formula as a special case.

What if N is central?

The action of Q on H^q(N, A) may still be non-trivial through the coefficients, but for trivial coefficients it is trivial and the E₂ page simplifies considerably. Central extensions are the standard first application.

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 The Lyndon–Hochschild–Serre Spectral Sequence. 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 The Lyndon–Hochschild–Serre Spectral Sequence as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—sequence, spectral, normal, subgroup, cohomology—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 The Lyndon–Hochschild–Serre Spectral Sequence?