Nilpotent Groups and Homology

Q: 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.

Executive summary

H1 and H2 determine the nilpotent quotients

A homomorphism inducing an isomorphism on H₁ and a surjection on H₂ 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

γ₁G = G, γ_n+1G = [γ_nG, G]

G is nilpotent of class c when γ_c+1G = 1. The quotients G/γ_nG are the nilpotent quotients, and γ₂G is the commutator subgroup, so G/γ₂G = H₁(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 H₁ and H₂ control.

Section 02The theorems

AlgorithmStallings' theoremin: a map with prescribed low-degree homology behaviour → out: isomorphic nilpotent quotients

Let f: G → K be a homomorphism.
Suppose f induces an isomorphism H₁(G) → H₁(K).
Suppose f induces a surjection H₂(G) ↠ H₂(K).
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.
It does NOT follow that f is an isomorphism, nor that the inverse limits agree.

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 H₂ cannot have isomorphic nilpotent completions in a way compatible with H₁ — 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 H₂ 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 H₂ 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?

H₂(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.

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 Nilpotent Groups and Homology. 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 Nilpotent Groups and Homology as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—nilpotent, lower, central, series, applications—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 Nilpotent Groups and Homology?