Definition
An isomorphism in group cohomology that identifies the cohomology of an induced module with the cohomology over the inducing subgroup: for a subgroup H ≤ G and an H-module M, H^n(G, Ind_H^G M) ≅ H^n(H, M) for all n (with the appropriate hypotheses on modules and topology).
Principle
Principle
Adjointness of induction and restriction underlies the lemma: induction is left (or right, depending on conventions) adjoint to restriction, so cochain complexes for the induced module collapse to cochains on the subgroup.
Demonstration
Demonstration
Compute cohomology of an induced permutation module: if M is a module for H and Ind_H^G M is the set of functions G → M satisfying the usual equivariance, the explicit cochain-level map produces an isomorphism H^n(G, Ind_H^G M) → H^n(H, M); concretely, cochains supported on coset representatives identify with H-cochains.
Misapplication
Misapplication
Applying the lemma without verifying that the induction construction and cohomology theory match the category (for example, mixing discrete induction with continuous cohomology for profinite groups or using coinduction instead of induction when the hypotheses differ).
Consequence
Consequence
Shapiro’s lemma transfers cohomological calculations from a large group to a smaller subgroup and yields compatibility results for spectral sequences and long exact sequences; it is a central computational and conceptual tool in group cohomology and arithmetic Galois cohomology.
Reversal
Reversal
Restriction or inflation maps go in the opposite direction and do not generally produce isomorphisms; the reversed statement—cohomology over G determines cohomology over H without induction—is false without further structure.
Boundary
Boundary
Holds in the setting of group cohomology with well-defined induction (discrete modules, smooth modules, or continuous modules as appropriate); modifications are required for topological groups, derived settings, or when using coinduction instead of induction.
Semantic Tension
Semantic Tension
Closely related to Frobenius reciprocity and sometimes called Eckmann–Shapiro; the tension is between different adjunctions (induction vs coinduction) and between cohomology theories (continuous, smooth, discrete) where the lemma requires matching hypotheses.
Synthesis
Synthesis
Shapiro’s lemma is the formal statement that induction is cohomologically harmless: inducing a module up to the larger group and then taking cohomology recovers the cohomology computed at the smaller subgroup, encapsulating the adjointness that makes transfer of calculations possible.