A natural adjunction between induction and restriction functors in representation theory: for a subgroup H of a group G (or more generally for a pair of algebras and a module restriction/extension situation) there is a canonical isomorphism Hom_G(Ind_H^G V, W) ≅ Hom_H(V, Res^G_H W) identifying G-maps from an induced representation with H-maps into the restricted representation.

Principle

Induction is left adjoint to restriction (and dually coinduction is right adjoint to restriction) so maps out of an induced object correspond naturally to maps before induction; the organizing idea is adjunction between functors controlling how structures extend and restrict across an inclusion.

Demonstration

Let G be a finite group, H a subgroup, V a finite-dimensional representation of H over a field k, and W a representation of G. The vector space of G-linear maps from the induced module Ind_H^G V to W is naturally isomorphic to the vector space of H-linear maps from V to the restricted module Res^G_H W; concretely, a map f:Ind_H^G V → W is determined by its composition with the canonical inclusion V → Ind_H^G V, and conversely any H-map gives a unique G-map by averaging over coset representatives when needed.

Misapplication

Treating Frobenius reciprocity as an equality of characters or multiplicities without checking hypotheses: for infinite groups, topological groups, or categories without well-behaved induction the naive finite-dimensional averaging construction fails. Another misuse is to swap induction and coinduction without checking whether restriction admits both adjoints in the given category.

Consequence

When applicable, Frobenius reciprocity gives a powerful method to compute multiplicities of irreducible constituents, to transfer Hom computations between different group levels, and to relate branching rules; it underlies reciprocity formulas in character theory and simplifies many computations in modular and ordinary representation theory.

Reversal

Viewed oppositely, the statement says that restriction is right adjoint to induction if one reverses arrow directions formally; dually, coinduction is right adjoint to restriction, yielding Hom_G(W, Coind_H^G V) ≅ Hom_H(Res^G_H W, V). This highlights the symmetric pair of adjunctions rather than a single equality.

Boundary

Applies in abelian categories where induction and restriction functors are defined and exactness or finiteness hypotheses required for the specific constructions hold (e.g., finite index subgroups, finite-dimensional modules, or algebra extensions of finite rank). For topological, measured, or infinite-dimensional contexts one must add continuity, integrability, or completion hypotheses; without them the canonical maps may fail to be isomorphisms.

Semantic Tension

Competes with Mackey theory and Frobenius–Schur-type statements: Frobenius reciprocity describes an adjunction level correspondence, whereas Mackey decomposition addresses how induction followed by restriction breaks into pieces; confusion arises when one expects the adjunction to give decomposition data that actually requires more refined double-coset analysis.

Synthesis

Frobenius reciprocity is the adjointness principle linking how representations extend from a subgroup and how maps between them correspond: it reduces G-level Hom problems to H-level Hom problems whenever induction and restriction are well-defined and the appropriate finiteness or continuity conditions hold, while admitting a dual formulation via coinduction and defining the conceptual backbone for branching and multiplicity calculations.