H2, Hopf's Formula and the Schur Multiplier

Executive summary

Relations that hold for no reason

Present G as F/R with F free. Hopf's formula computes the second homology as (R ∩ [F, F])/[F, R] — the relations that are consequences of commutativity but not of conjugation. It is independent of the presentation, and it is the Schur multiplier: the obstruction to lifting projective representations and the kernel of the universal central extension of a perfect group.

Learning objectives

State Hopf's formula and its independence of presentation.
Compute H₂ for a small group from a presentation.
Identify the Schur multiplier and its role.
Describe the universal central extension of a perfect group.

Section 01Hopf's formula

H₂(G, ℤ) ≅ (R ∩ [F, F]) / [F, R]

where 1 → R → F → G → 1 is any presentation with F free. The right-hand side is manifestly presentation-dependent; the theorem is that the quotient is not.

What the formula says

[F, R] consists of relations forced by the presentation itself. R ∩ [F, F] consists of relations lying in the commutator subgroup. The quotient is the relations that are ‘accidentally’ commutators — true in G for reasons not visible in the presentation. That is precisely what H₂ measures.

Examples
Group	H₂(G, ℤ)
Free group	0 — no relations at all
Cyclic group of order m	0
ℤ/m × ℤ/n	ℤ/gcd(m, n)
Free abelian of rank n	Exterior square, of rank n(n−1)/2
Alternating group A_n, n ≥ 8	ℤ/2
Surface group of genus g	ℤ

Section 02The Schur multiplier

For finite G, H₂(G, ℤ) is isomorphic to H²(G, ℂ^×) with trivial action, which classifies central extensions by the multiplicative group of the complex numbers.

Role

Projective representations

A projective representation is a homomorphism to PGL(V). It lifts to GL(V) exactly when its class in the Schur multiplier vanishes.

Role

Covering groups

A finite perfect group has a unique universal central extension, the Schur cover, with kernel the multiplier.

Role

Presentations

The multiplier bounds the number of relations needed: a group with d generators and r relations satisfies r ≥ d + rank of the multiplier − rank of G^ab.

Why perfect groups are the clean case

If G is perfect then H₁ = 0 and a universal central extension exists and is unique, with kernel exactly H₂. For non-perfect groups no universal central extension exists, and the multiplier still measures central extensions but without the clean universal property.

Section 03Relation to the lower central series

Hopf's formula sits inside a broader picture relating group homology to the lower central series γ₁ = G, γ_n+1 = [γ_n, G]. Stallings' and Stammbach's theorems say that a homomorphism inducing an isomorphism on H₁ and a surjection on H₂ induces isomorphisms on all lower central quotients.

Homology controls nilpotent quotients

This is the precise sense in which H₁ and H₂ determine the nilpotent part of a group's structure. It is the basis for the homological approach to nilpotent groups covered later in this stream.

ReferenceFrequently asked questions

Is Hopf's formula really independent of the presentation?

Yes, and that is the theorem's content. Any two presentations give canonically isomorphic quotients, which can be proved directly or deduced from the identification with the derived functor definition.

How is H<sub>2</sub> computed in practice?

For small groups, from a presentation via Hopf's formula, or by computer algebra using the Schur multiplier algorithms in group theory systems. For families, via a resolution or the Lyndon–Hochschild–Serre spectral sequence.

What does a non-zero Schur multiplier mean physically?

In quantum mechanics, that projective representations of a symmetry group do not all lift to linear ones — which is why spin representations of the rotation group require SU(2) rather than SO(3).

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 H2, Hopf's Formula and the Schur Multiplier. 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 H2, Hopf's Formula and the Schur Multiplier as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—formula, schur, multiplier, central, hopf's—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 H2, Hopf's Formula and the Schur Multiplier?