Frobenius reciprocity

From testwiki
Revision as of 14:56, 23 September 2023 by imported>Citation bot (Add: pages, chapter. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 1335/3840)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In mathematics, and in particular representation theory, Frobenius reciprocity is a theorem expressing a duality between the process of restricting and inducting. It can be used to leverage knowledge about representations of a subgroup to find and classify representations of "large" groups that contain them. It is named for Ferdinand Georg Frobenius, the inventor of the representation theory of finite groups.

Statement

Character theory

The theorem was originally stated in terms of character theory. Let Template:Var be a finite group with a subgroup Template:Var, let ResHG denote the restriction of a character, or more generally, class function of Template:Var to Template:Var, and let IndHG denote the induced class function of a given class function on Template:Var. For any finite group Template:Var, there is an inner product ,A on the vector space of class functions A (described in detail in the article Schur orthogonality relations). Now, for any class functions ψ:H and φ:G, the following equality holds:Template:SfnTemplate:Sfn

IndHGψ,φG=ψ,ResHGφH.

In other words, IndHG and ResHG are Hermitian adjoint.

Template:Collapse top Let ψ:H and φ:G be class functions.

Proof. Every class function can be written as a linear combination of irreducible characters. As , is a bilinear form, we can, without loss of generality, assume ψ and φ to be characters of irreducible representations of H in W and of G in V, respectively. We define ψ(s)=0 for all sGH. Then we have

Ind(ψ),φG=1|G|tGInd(ψ)(t)φ(t1)=1|G|tG1|H|sGs1tsHψ(s1ts)φ(t1)=1|G|1|H|tGsGψ(s1ts)φ((s1ts)1)=1|G|1|H|tGsGψ(t)φ(t1)=1|H|tGψ(t)φ(t1)=1|H|tHψ(t)φ(t1)=1|H|tHψ(t)Res(φ)(t1)=ψ,Res(φ)H

In the course of this sequence of equations we used only the definition of induction on class functions and the properties of characters.

Alternative proof. In terms of the group algebra, i.e. by the alternative description of the induced representation, the Frobenius reciprocity is a special case of a general equation for a change of rings:

Hom[H](W,U)=Hom[G]([G][H]W,U).

This equation is by definition equivalent to [how?]

W,Res(U)H=W,UH=Ind(W),UG.

As this bilinear form tallies the bilinear form on the corresponding characters, the theorem follows without calculation. Template:Collapse bottom

Module theory

Template:See also

As explained in the section Representation theory of finite groups#Representations, modules and the convolution algebra, the theory of the representations of a group Template:Var over a field Template:Var is, in a certain sense, equivalent to the theory of modules over the group algebra Template:Var[[[:Template:Var]]].[1] Therefore, there is a corresponding Frobenius reciprocity theorem for Template:Var[[[:Template:Var]]]-modules.

Let Template:Var be a group with subgroup Template:Var, let Template:Var be an Template:Var-module, and let Template:Var be a Template:Var-module. In the language of module theory, the induced module K[G]K[H]M corresponds to the induced representation IndHG, whereas the restriction of scalars K[H]N corresponds to the restriction ResHG. Accordingly, the statement is as follows: The following sets of module homomorphisms are in bijective correspondence:

HomK[G](K[G]K[H]M,N)HomK[H](M,K[H]N).[2]Template:Sfn

As noted below in the section on category theory, this result applies to modules over all rings, not just modules over group algebras.

Category theory

Let Template:Var be a group with a subgroup Template:Var, and let ResHG,IndHG be defined as above. For any group Template:Math and field Template:Math let RepAK denote the category of linear representations of Template:Var over Template:Var. There is a forgetful functor

ResHG:RepGRepH(V,ρ)ResHG(V,ρ)

This functor acts as the identity on morphisms. There is a functor going in the opposite direction:

IndHG:RepHRepG(W,τ)IndHG(W,τ)

These functors form an adjoint pair IndHGResHG.[3] In the case of finite groups, they are actually both left- and right-adjoint to one another. This adjunction gives rise to a universal property for the induced representation (for details, see Induced representation#Properties).

In the language of module theory, the corresponding adjunction is an instance of the more general relationship between restriction and extension of scalars.

See also

Template:Portal

Notes

Template:Reflist

References

Template:Refbegin

Template:Refend