Frobenius reciprocity

Frobenius reciprocity Frobenius reciprocity is a fundamental theorem in the representation theory of finite groups that relates induction and restriction functors between representations of a subgroup and its parent group. It provides an adjunction between the induction functor from a subgroup and the restriction functor from the whole group, and has analogues in harmonic analysis, algebraic geometry, and category theory. The result underpins computational techniques used in the study of characters, module categories, and dualities in many mathematical contexts.

Statement

Let G be a finite group and H a subgroup of G. For a representation V of H and a representation W of G, Frobenius reciprocity asserts a natural isomorphism between Hom-spaces: Hom_G(Ind_H^G V, W) ≅ Hom_H(V, Res^G_H W). This formulation connects the induction functor Ind_H^G and the restriction functor Res^G_H in the category of representations over a field k, and is commonly stated for complex representations as well as for representations over fields of positive characteristic. The theorem is attributed to Ferdinand Georg Frobenius and is often invoked alongside results about characters such as orthogonality relations and Mackey's theorem in the study of finite groups like S_n, A_n, D_n, Q_8, and C_n.

Proofs

Standard proofs use linear algebra and module theory: one constructs an explicit adjunction map from Hom_G(Ind_H^G V, W) to Hom_H(V, Res^G_H W) by composing a G-map with the canonical inclusion of V into Ind_H^G V or, dually, by averaging over coset representatives. These proofs typically reference structures explored by Emmy Noether and Richard Dedekind in module and group algebra theory. Alternative proofs employ homological algebra and categorical adjunctions as developed in the work of Saunders Mac Lane and Samuel Eilenberg; these emphasize that induction is left adjoint to restriction in the category of k[G]-modules, using properties proven by Jacobson in the theory of rings and modules. Analytic proofs in the context of unitary representations of compact groups invoke techniques from Hermann Weyl and Harish-Chandra concerning averaging and integration on groups such as compact Lie groups and SU(n).

Applications

Frobenius reciprocity is used to decompose induced representations, compute inner products of characters, and derive branching rules linking representations of groups and subgroups like those appearing in the study of Young diagram combinatorics for S_n and the representation theory of GL_n(F_q). It plays a central role in proving Frobenius' character formulae and in the analysis of permutation representations arising from actions of groups such as Gal(E/F), Weyl group, and finite groups of Lie type including Chevalley group examples. In number theory applications, reciprocity arguments appear in the construction of automorphic inductions studied by Robert Langlands and in modular representation contexts investigated by Jean-Pierre Serre and Richard Brauer. Computational group theory platforms like projects by Évariste Galois's heirs and software inspired by John Conway utilize the theorem when implementing character table algorithms and subgroup fusion techniques.

Variants and Generalizations

Generalizations include Mackey's decomposition theorem relating Ind and Res through double coset decompositions, proven by George Mackey in the context of unitary representations of locally compact groups such as p-adic groups and real reductive groups considered by Harish-Chandra. In categorical language, Frobenius reciprocity is an instance of an adjunction between functors in abelian and triangulated categories as treated by Alexander Grothendieck and formalized by Jean-Louis Verdier; it also admits extension to monoidal categories and fusion categories studied by Vladimir Drinfeld and Pavel Etingof. Algebraic geometry analogues arise in the pushforward–pullback adjunction for sheaves on schemes, a principle central to the work of Grothendieck and Alexander Grothendieck's school, and in equivariant derived categories used by researchers such as Beilinson and Bernstein. In modular representation theory, versions adapted to block theory and relative projectivity are used by J. A. Green and B. Kulshammer.

Examples and Computations

Concrete examples include inducing the trivial representation from a subgroup H to G to obtain permutation representations studied by Frobenius and decomposing them using character inner products computed via reciprocity; classic cases involve D_n acting on cosets of C_m and representations of S_n restricted to Young subgroups. For matrix groups like GL_2(F_p) and SL_2(F_p), Ind and Res computations help classify irreducible constituents following methods by Issai Schur and Fischer. Computational frameworks in the spirit of Atlas of Finite Group Representations and projects influenced by John Conway provide explicit character table entries by applying reciprocity to subgroups such as M's local subgroups. Worked small-group calculations illustrate how Hom-space dimensions correspond under the isomorphism in cases drawn from lists cataloged by William Burnside and databases influenced by Cambridge University group-theory collections.

Category:Representation theory