Subgroups: Restriction, Corestriction and Transfer

Executive summary

Restriction then corestriction is multiplication by the index

Restriction sends cohomology of G to cohomology of a subgroup H; corestriction, or transfer, goes back the other way when the index is finite. Their composite is multiplication by [G : H]. That single identity forces cohomology of a finite group to be annihilated by its order, and it makes cohomology detectable on Sylow subgroups — which is how modular computations are actually organised.

Learning objectives

Define restriction and corestriction.
State and use the index formula.
Deduce that |G| annihilates positive-degree cohomology.
Explain Sylow detection and stable elements.

Section 01The two maps

Restrictionres: Hⁿ(G, A) → Hⁿ(H, A)

Induced by the inclusion ℤ[H] ⊆ ℤ[G]. Defined for any subgroup, of any index.

Corestrictioncor: Hⁿ(H, A) → Hⁿ(G, A)

Defined only for finite index, by summing over coset representatives. Also called the transfer.

cor ∘ res = [G : H] · id

The consequence that matters most

Take H = 1. Then Hⁿ(1, A) = 0 for n ≥ 1, so the composite is zero; but it is also multiplication by |G|. Hence |G| annihilates Hⁿ(G, A) for all n ≥ 1. Cohomology of a finite group is torsion in positive degrees, with exponent dividing |G|.

Section 02Sylow detection

AlgorithmReducing to Sylow subgroupsin: a finite group and a prime → out: cohomology from the Sylow subgroup

Fix a prime p and let G_p be a Sylow p-subgroup.
The index [G : G_p] is prime to p, so cor ∘ res is multiplication by a unit on the p-primary part.
Hence restriction is injective on the p-primary component of Hⁿ(G, A). Nothing p-primary is lost by passing to the Sylow subgroup.
The image is characterised as the stable elements — those whose restrictions to intersections of conjugates agree.
So Hⁿ(G, A)_(p) is the stable subring of Hⁿ(G_p, A).

Why p-groups dominate the literature

Because Sylow detection means the cohomology of every finite group is assembled from the cohomology of p-groups. Computing the cohomology of p-groups is therefore the central problem, and it remains hard.

Section 03Further properties

Properties of restriction and corestriction
Property	Statement
Transitivity	res and cor compose correctly through a chain of subgroups
Projection formula	cor(x · res y) = cor(x) · y — corestriction is a module map over H^*(G)
Double coset formula	res ∘ cor decomposes as a sum over double cosets — the source of fusion conditions
Normal subgroups	The image of restriction to a normal subgroup lies in the invariants under the quotient action
Homology version	Both maps exist with the arrows reversed, and the index formula holds in the same form

Restriction is not surjective onto the invariants

The image lands in the Q-invariants of the subgroup's cohomology, but need not fill them. The obstruction is the transgression in the five-term sequence, and assuming surjectivity is a common error.

ReferenceFrequently asked questions

Does corestriction exist for infinite index?

No — the construction sums over cosets, which requires finitely many. For infinite index only restriction is available, which is why the annihilation results are specific to finite groups.

What are stable elements?

Classes on a Sylow subgroup whose restrictions to intersections with conjugate subgroups agree. They are exactly the classes in the image of restriction from the whole group, and the condition encodes the fusion of the group.

Why is cohomology of a finite group torsion?

Because the index formula with the trivial subgroup shows |G| kills everything in positive degree. Consequently, with coefficients in a ℚ-vector space or any module where |G| is invertible, all higher cohomology vanishes.

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 Subgroups: Restriction, Corestriction and Transfer. 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 Subgroups: Restriction, Corestriction and Transfer as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—restriction, corestriction, transfer, index, section—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 Subgroups: Restriction, Corestriction and Transfer?