Brauer's induction theorem
This article states an induction theorem: a result relating the linear characters and linear representations of a group with the characters/representations induced from the linear characters/representations of subgroups
View a complete list of induction theorems
This fact is related to: linear representation theory
View other facts related to linear representation theoryView terms related to linear representation theory |
- 1 Name
- 2 Statement
- 3 Related facts
- 4 Facts used
- 5 Proof
- 6 References
This result is also termed the characterization of characters lemma or characterization of linear characters lemma.
Version involving elementary subgroups and arbitrary characters
Let be a finite group. Brauer's induction theorem states that every character of is a combination, with integer coefficients, of characters induced from Elementary subgroup (?)s of . In other words, the character ring of (over integers, for representations over complex numbers) is generated as a -module by characters induced from elementary subgroups.
Here, the term induced is used in the sense of Induced class function (?). For a character of a representation on , the induced class function on by the character is the same as the character of the Induced representation (?) from to .
Version involving elementary subgroups and linear characters
Let be a finite group. This strong form of Brauer's induction theorem states that every character of is a combination, with (possibly negative) integer coefficients, of characters induced from Linear character (?)s (i.e., characters of one-dimensional representations) on elementary subgroups.
Version involving linear characters
Let be a finite group. Every character of is a combination, with (possibly negative) integer coefficients, of characters induced from linear characters (i.e., characters of one-dimensional representations) on subgroups.
For a complete list of induction theorems, refer Category:Induction theorems.
- Elementary implies nilpotent, Nilpotent implies supersolvable
- Finite supersolvable implies monomial
- Elementariness is subgroup-closed
The first formulation implies the other two
By facts (1) and (2), every linear representation of an elementary subgroup is monomial. In particular, every irreducible linear representation is induced from a degree-one representation, i.e., from a linear character. Further, by fact (3), any subgroup of an elementary group is elementary. Thus, using the fact that induction of representations is transitive, we obtain that the -span of representations induced from linear characters of elementary subgroups is the same as the -span of representations induced from all characters of elementary subgroups.
This shows that the first formulation implies the second. The third formulation follows naturally from the second.
Proof of the first formulation
The idea is to show that for each dividing the order of the group, the constant function sending every element to the index of the -Sylow subgroup, is a linear combination of characters induced from -elementary subgroups. Then, we can combine these constant functions to obtain the constant function that sends everything to 1. After that, suitable tensoring gives the result that every character occurs as a linear combination of characters induced from elementary subgroups.
- Linear representations of finite groups by Jean-Pierre Serre, 10-digit ISBN 0287901906 (English), ISBN 3540901906 (French), Page 75, Theorem 18, Section 10.2, More info