Artin's theorem on induced characters

From testwiki
Jump to navigation Jump to search

In representation theory, a branch of mathematics, Artin's theorem, introduced by E. Artin, states that a character on a finite group is a rational linear combination of characters induced from all cyclic subgroups of the group.

There is a similar but somehow more precise theorem due to Brauer, which says that the theorem remains true if "rational" and "cyclic subgroup" are replaced with "integer" and "elementary subgroup".

Statement

In Linear Representation of Finite Groups Serre states in Chapter 9.2, 17 [1] the theorem in the following, more general way:

Let G finite group, X family of subgroups.

Then the following are equivalent:

  1. G=gG,HXg1Hg
  2. χ character of GHX,χHH,d:dχ=HXIndHG(χH)

This in turn implies the general statement, by choosing X as all cyclic subgroups of G.

Proof

Let G be a finite groupe and (χi) its irreducible characters. Let us denote, like Serre did in his book, (G) the -module iχi. Since all of G's characters are a linear combination of (χi) with positive integer coefficient, the elements of (G) are the difference of 2 characters of G. Moreover, because the product of 2 characters is also a character, (G) is even a ring, a sub-ring of the -algebra of the class function over G ( of which (χi) forms a basis ), which, by tensor product, is isomorphic to (G). Both the restriction Res of the representation of G to one of its subgroup and its dual operator Ind of induction of a representation can be extended to an homomorphisme : Res:(G)(H),kiχikiResHGχi Ind:(H)(G),kiχikiIndHGχi

With those notations, the theorem can be equivalently re-write as follow : If X is a family of subgroup of G, the following properties are equivalents :

  1. G is the reunions of the conjugate of the subgroups of X
  2. The cokernel of Ind:HX(H)(G) is finite.

This result from the fact that (G) is of finite type. Before getting to the proof of it, understand that the morphisme Ind:HX(H)(G), naturally defined by (kiHχiH)HXHX,ikiHResHGχi is well defined because X is finite ( because G is ) and its cokernel is (G)/Im(Ind).

Let’s begin the proof with the implication 2. 1. Starting with the following lemma :

Let H be an element of X. Then for every fH(H), IndHG(fH) is null on xG if x isn’t conjugate to any h of H. It is enough to prove this assertion for the character ϕH of a representation θ:H𝐆𝐋(W) of H ( as fH is a difference of some ). Let ρ:G𝐆𝐋(V) be the induced representation of G by (W,θ). Let now (ri) be a system of representative of G/H,by definition, V is the direct sum of the transformed ρriW of which ρx is a permutation. Indeed ρxρriW=ρxriW=ρrixW where xri=rixt for some tH. To evaluate χ(x):=Ind(ϕ)(x)=TrV(ρx), we can now choose a basis of V reunion of basis of the ρriW. In such a basis, the diagonal of the matrix of ρx is null at every ririx, and because ri=rix would imply rixri1=tH ( which is ruled out by hypothesis ), it is fully null, we thus have χ(x)=TrV(ρx)=0 which conclude the proof of the lemma.

This particularly insure that, for every element s not in S:=gG,HXg1Hg, the elements in the image of Ind:HX(H)(G), which are the HXIndHG(fH) evaluate to zero on s. The prolonged morphisme Ind:HX(H)(G) has to be surjective. Indeed if not, its cokernel would contain a Vect(f) for some f in (G), which in turn means the multiples of f are distinct elements of the cokernel of Ind contradicting its finitude. Particularly, every element of (G) are thus null on the complementary of S, insuring S=G, thereby concluding the implication.

Let’s now prove 1. 2. To do so, it is enough to prove that the -linear application Ind:HX(H)(G) is surjective ( indeed, in that case, (G) would admit a basis (ei) composed of element of the image A of the Ind. It would thus have the same cardinality n, than (χi), insuring that the quotient (G)/A is isomorphic to some n/inHiin/Hi which is finite - where the Hi are non-trivial ideals of ), which, through duality, is equivalent to prove the injectivity of Res:(G)HX(H) Which is obvious : indeed this is equivalent to say that if a class function is null on ( at least ) one element of each class of conjugation of G, it is null ( but class function are constant on conjugation class ).

This conclude the proof of the theorem.

References

Further reading