Determination of character table of symmetric group:S4
This page describes the process used for the determination of specific information related to a particular group. The information type is character table and the group is symmetric group:S4.
View all pages that describe how to determine character table of particular groups | View all specific information about symmetric group:S4
This page describes various ways to determine the character table of symmetric group:S4. The idea is to determine as much as possible wit has little knowledge of the representation theory of these groups as we can manage, therefore making the discussion suitable for people who know only basic facts about the groups and basic facts of linear representation theory. For a detailed discussion of the character theory, see linear representation theory of symmetric group:S4.
We build on the basic information on conjugacy class structure available at element structure of symmetric group:S4.
Finding the degrees of irreducible representations using number-theoretic constraints
Final answer: The degrees of irreducible representations are 1, 1, 2, 3, 3.
The following facts are known in general:
- Sum of squares of degrees of irreducible representations equals order of group: In this case, it tells us that the sum of the degrees of irreducible representations is 24, the order of the group.
- Number of irreducible representations equals number of conjugacy classes: In this case, it tells us that there are 5 irreducible representations, because there are 5 conjugacy classes.
- Degree of irreducible representation divides order of group: In this case, it tells us that the degrees of irreducible representations all divide 24, the order of the group.
- Number of one-dimensional representations equals order of abelianization: In this case, the derived subgroup is A4 in S4 (alternating group:A4, order 12) and the abelianization (the quotient group) is isomorphic to cyclic group:Z2. So, the number 1 occurs two times as a degree of irreducible representation.
- Order of inner automorphism group bounds square of degree of irreducible representation
In fact, we do not need all these facts to determine the degrees of irreducible representations. Some combinations of subsets of these facts suffice. For instance:
Using (1) and (2) alone
(2) tells us that there are five irreducible representations. Denote their (positive integer) degrees, in non-decreasing order, as . (1) tells us that . Note that since .
In this case, we obtain that . In other words, we need to express 8 as a sum of four squares of positive integers. This forces . Consider the cases and :
- . We thus obtain . But there are no three positive integers whose sum of squares is 4. Therefore, this case does not work.
- , then , leading to sum of squares 4 instead of 8. So this case does not work.
In this case, we obtain . We have . We make cases:
- : In this case, . The only solution to that is . This gives the solution .
- : In this case, , with (because ). There are no solutions to this.
- : In this case, , which clearly does not work.
In this case, are all at most 2, so the sum of squares is at most 20, falling short of the target of 24.
The only solution is .