← LibraryNilpotent Groups and HomologyEngineering · MathematicsLesson 2/5← PrevNext →
GuidePublished 6 Aug 20263 min readBy Kevin JoginComputational Number TheoryApplicationsNilpotent GroupLower Central Series
Skip to the main content

MathematicsApplications

Nilpotent Groups and Homology

How low-degree homology controls nilpotent quotients, via the theorems of Stallings and Stammbach.

Executive summary

H1 and H2 determine the nilpotent quotients

A homomorphism inducing an isomorphism on H1 and a surjection on H2 induces isomorphisms on every quotient by the lower central series. That is Stallings' theorem, with Stammbach's variant supplying the nilpotent-group case. It converts an infinite family of group-theoretic questions into two homological ones, and it is the reason the Schur multiplier controls so much of nilpotent group theory.

Learning objectives

  • Define the lower central series and nilpotency.
  • State Stallings' theorem and Stammbach's variant.
  • Explain the role of the Schur multiplier.
  • Apply the results to a presentation question.

Section 01The lower central series

γ1G = G,    γn+1G = [γnG, G]

G is nilpotent of class c when γc+1G = 1. The quotients GnG are the nilpotent quotients, and γ2G is the commutator subgroup, so G2G = H1(G, ℤ).

Why homology enters

Each step of the lower central series is a central extension, and central extensions are classified by H². Building up the nilpotent quotients one step at a time is therefore a sequence of problems that H1 and H2 control.

Section 02The theorems

AlgorithmStallings' theoremin: a map with prescribed low-degree homology behaviour  →  out: isomorphic nilpotent quotients
  1. Let f: G → K be a homomorphism.
  2. Suppose f induces an isomorphism H1(G) → H1(K).
  3. Suppose f induces a surjection H2(G) ↠ H2(K).
  4. Then f induces isomorphisms G/γnG → K/γnK for every finite n. The proof is an induction on n using the five-term exact sequence.
  5. It does NOT follow that f is an isomorphism, nor that the inverse limits agree.
Stammbach's variant handles nilpotent groups and gives the corresponding statement for the homology of nilpotent groups directly.
Nilpotent quotients are not the group

Two groups can have all nilpotent quotients isomorphic and still differ. Parafree groups — non-free groups with the same nilpotent quotients as a free group — are the standard examples. The theorem is genuinely about the tower, not about the group.

Section 03Applications

Application

Deficiency of presentations

The rank of the Schur multiplier bounds how far a presentation can be from balanced, constraining the number of relations required.

Application

Detecting non-isomorphism

Two groups with different H2 cannot have isomorphic nilpotent completions in a way compatible with H1 — a computable obstruction.

Application

Link theory

Milnor invariants of links are read from the nilpotent quotients of the link group, and Stallings' theorem is what makes them well defined.

Application

Homology spheres

A group with the homology of the trivial group has trivial nilpotent quotients but need not be trivial — the source of exotic homology spheres.

Application

Nilpotent completion

The inverse limit of the nilpotent quotients is determined by the hypotheses, though the groups themselves need not be.

Application

Lower central series of free groups

The quotients are free abelian of ranks given by the necklace numbers, computed from the vanishing of H2 for free groups.

ReferenceFrequently asked questions

Why is H<sub>2</sub> only required to be surjective?

Because the induction uses the five-term exact sequence, where H2 appears at the end and only needs to hit enough to force the next quotient to match. Requiring an isomorphism would be a stronger hypothesis than the conclusion needs.

Does the theorem extend to the whole group?

Only under additional hypotheses, such as both groups being residually nilpotent and finitely generated with an appropriate completeness condition. Without them, parafree groups show the conclusion fails.

What is the connection with the Schur multiplier?

H2(G, ℤ) is the Schur multiplier, and Hopf's formula computes it from a presentation. So the hypotheses of Stallings' theorem are checkable directly from presentations of the two groups.

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.

Page ID
KV-MATH-0168
Taxonomy
ENG-MATH — Engineering / Mathematics
Collection
COL-HOMALG-001
Topic stream
HA-APPLICATIONS
Version
1.1.0 / content 2026.08
Last reviewed
2026-08-06

Continue learning

Homological Algebra and Algebraic TopologyGuide · MathematicsNEXT LESSON →Finiteness Conditions on GroupsGuide · MathematicsModular Representation TheoryGuide · MathematicsDerived and Stable CategoriesGuide · Mathematics