# Determination of character table of alternating group:A5

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 alternating group:A5.

View all pages that describe how to determine character table of particular groups | View all specific information about alternating group:A5

This page describes various ways to determine the character table of alternating group:S5. 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 alternating group:A5.

## Contents

## Finding the degrees of irreducible representations using number-theoretic constraints

Final answer: The degrees of irreducible representations are 1, 3, 3, 4, 5.

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 60, 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 60, the order of the group.
- Number of one-dimensional representations equals order of abelianization: In this case, the group is a perfect group (in fact, it is a simple non-abelian group -- see A5 is simple) so there is only one one-dimensional representation.
- Order of inner automorphism group bounds square of degree of irreducible representation

(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 because . Moreover, (3) tells us that all the degrees must divide 60, this eliminates the case . There exists a trivial representation, so and . We thus have:

with . Note that we can use (4) to show that , but we will be able to narrow down to a unique choice of degrees of irreducible representations even without this information.

### Case

In this case, we obtain:

However, 23 cannot be expressed as a sum of three squares. So this case is eliminated.

### Case

In this case, we obtain:

Consider the subcases:

- : This gives , but 9 is not the sum of two squares of positive integers. So this case is ruled out.
- : This gives , giving the solution . We thus get .
- : This is not possible, because , so .

### Case

In this case, we obtain:

with . By size considerations, is forced, and is also forced. But this leaves , which does not give an integer value of .