Inflation-restriction exact sequence¶
The low-degree exact sequence in group cohomology that relates a group's cohomology to that of a normal subgroup and quotient through inflation, restriction, and transgression maps.
Core Idea¶
The inflation–restriction exact sequence is the five-term low-degree bridge for a group extension and coefficient module. Inflation, restriction, and transgression relate quotient, total-group, and invariant subgroup cohomology, with exactness turning each adjacent kernel and image into a calculational constraint. In its standard five-term form it runs from H1(G/N,A^N) by inflation to H1(G,A), by restriction to H1(N,A)^(G/N), by transgression to H2(G/N,A^N), and by inflation to H2(G,A).
Scope of Application¶
The construction applies to low-degree group cohomology problems organized by a normal subgroup and quotient action. Use it only after normal subgroup, quotient action, invariant coefficients, cohomological degree, and map conventions are explicit.
- Group extensions. Relates quotient, subgroup, and total-group classes.
- Cohomology computations. Reduces low-degree questions to simpler pieces.
- Extension classification. Interprets H2 obstructions and lifting behavior.
- Galois cohomology. Uses normal subgroups and quotient symmetries.
- Spectral-sequence analysis. Extracts edge maps and the first differential.
Clarity¶
The sequence prevents ‘restriction to a subgroup’ from being treated as an unconstrained operation. It identifies the required invariant target, distinguishes lifting from extension obstruction, and makes the kernel-image conditions that connect those questions explicit. The closest near miss sets the boundary: The general five-term exact sequence is the nearest near miss: inflation–restriction is its group-cohomology specialization arising from the extension's Lyndon–Hochschild–Serre spectral sequence.
Manages Complexity¶
A total group's low-degree cohomology mixes normal-subgroup data, quotient symmetry, and extension effects. The five-term sequence compresses that interaction into typed terms and four maps, allowing partial knowledge to bound or determine adjacent groups without computing the full spectral sequence. The central computational compression–hidden hypotheses tradeoff is this: The five-term display is concise, but every term depends on normality, module actions, invariants, and indexing conventions. A second exactness–splitting tension matters because Kernel-image equality yields strong constraints without supplying canonical decompositions.
Abstract Reasoning¶
Use three linked moves: state the exact group extension, coefficient module, and actions before writing cohomology groups; compute N-invariants in A and the induced G/N action on coefficients and subgroup cohomology; write inflation and restriction with their correct domains and codomains. As a collapse test, the case exits when N is not normal, the quotient action or invariant coefficients are wrong, map directions change, or exactness is not established. A fourth check is to identify transgression as the obstruction map supplied by the spectral sequence.
Knowledge Transfer¶
The exact-sequence technique transfers literally to other group extensions and coefficient modules after every action is retyped. Outside group cohomology, ‘inflate, restrict, transgress’ is not a portable metaphor; the broader parent structures are exactness and filtration-derived edge sequences. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. The kernel of each map equals the image of its predecessor.
Neighborhood in Abstraction Space¶
Inflation-restriction exact sequence sits in a moderately populated region (57th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Group-Theoretic Subgroup & Cohomology Structures (7 abstractions)
Nearest neighbors
- Crossed Product Algebra — 0.85
- Burnside category — 0.85
- Complexification (Lie group) — 0.85
- Elementary Amenable Group — 0.85
- Complex representation — 0.85
Computed from structural-signature embeddings · 2026-10-08