Number of irreducible representations over rationals equals number of equivalence classes under rational conjugacy
Contents
Statement
Suppose is a finite group. Then, the following numbers are equal:
- The number of irreducible linear representations of
over the field of rational numbers.
- The number of linear representations of
over
with rational character values and for which no proper nonzero subrepresentation has rational character values.
- The number of equivalence classes in
under rational conjugacy.
- The number of conjugacy classes of cyclic subgroups in
.
Caveats
The number of irreducible representations over rationals is not the same as the number of irreducible representations over the complex numbers that can be realized over the rationals. The latter number is either smaller or equal, and it is equal when the group is a rational group, which means that any two elements generating the same cyclic subgroup are conjugate.
Also, although the counts in (1) and (2) are equal, it is possible for a rational character to arise from an irreducible representation over the complex numbers that is not realized over the rationals. However, some multiple of that representation can be realized over the rationals. This explains the equality of counts in (1) and (2). The smallest multiple used is termed the Schur index.
Related facts
Similar facts
- Number of irreducible representations equals number of conjugacy classes
- Number of irreducible representations over reals equals number of equivalence classes under real conjugacy
- Number of irreducible representations over complex numbers with real character values equals number of conjugacy classes of real elements
- Number of orbits of irreducible representations equals number of orbits under automorphism group
Opposite facts
Facts used
- Sufficiently large implies splitting
- Orbits of irreducible representations of extension field under Galois group are in bijection with irreducible representations of base field
- Orbit-counting theorem (specifically, this is used to show that the character, or number of fixed points for each element, of a permutation representation determines its number of orbits).
- Application of Brauer's permutation lemma to Galois automorphism on conjugacy classes and irreducible representations (follows in turn from Brauer's permutation lemma): Suppose
is a finite group and
is an integer relatively prime to the order of
. Suppose
is a field and
is a splitting field of
of the form
where
is a primitive
root of unity, with
also relatively prime to
(in fact, we can arrange
to divide the order of
because sufficiently large implies splitting). Suppose there is a Galois automorphism of
that sends
to
. Consider the following two permutations:
- The permutation on the set of conjugacy classes of
, denoted
, induced by the mapping
.
- The permutation on the set of irreducible representations of
over
, denoted
, induced by the Galois automorphism of
that sends
to
.
Then, these two permutations have the same cycle type. In particular, they have the same number of cycles, and the same number of fixed points, as each other.
Proof
This proof uses a tabular format for presentation. Provide feedback on tabular proof formats in a survey (opens in new window/tab) | Learn more about tabular proof formats|View all pages on facts with proofs in tabular format
Given: A finite group .
To prove: The number of irreducible representations of over the field of rational numbers
(note: these need not be absolutely irreducible representations) equals the number of equivalence classes in
under rational conjugacy (which can also be described as the number of conjugacy classes of cyclic subgroups).
Proof: As in the statement of Fact (2), we denote by the set of conjugacy classes of
and by
the set of irreducible representations of
over a splitting field of characteristic zero.
No. | Assertion/construction | Facts used | Given data used | Previous steps used | Explanation |
---|---|---|---|---|---|
1 | Let ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Fact (1) | ![]() |
Fact-direct | |
2 | Under the action of the group ![]() ![]() ![]() ![]() |
Fact (2) | Apply Fact (2) to the extension ![]() ![]() | ||
3 | We get an action of the group ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
||||
4 | Under the action described in Step (3) for the group ![]() ![]() ![]() ![]() |
||||
5 | For every element ![]() ![]() ![]() ![]() |
Fact (4) (Brauer's permutation lemma) | |||
6 | For every element ![]() ![]() ![]() ![]() |
Step (5) | direct | ||
7 | The number of orbits of ![]() ![]() ![]() ![]() |
Fact (3) (orbit-counting theorem, also called Burnside's lemma) | Step (6) | [SHOW MORE] | |
8 | The number of irreducible representations over rationals equals the number of equivalence classes under rational conjugacy | Steps (2), (4), (7) | [SHOW MORE] |