Irreducible Representations of

Notes — 29 September 2025 I stayed up late. -Sam


Let with where is the nontrivial element of that swaps the two factors of , and . Let and build the quotient group (which is normally just a coset but since this forms a quotient group).

The goal here is to classify , the irreps of , using Clifford Theory. To do this, we follow the following steps:

  1. Understand and how acts on it by conjugation.
  2. For each -orbit , pick a representative .
  3. Let be the inertia subgroup (this seems to be a historical term indicating the stabilizer under conjugation).
  4. Irreps of lying over are then obtained by (a) extending to (in principle is not always possible, but here it is), then (b) inducing to .

Remark 1

The statement “extending to ” should be clarified a bit. We start with an irrep of and we know, by construction, that . But here, is either or depending on whether we look at the diagonal or off-diagonal case. An extension of to really means to find a representation such that

where we will define what this thing means shortly.


First, let’s look at the irreps of and the action on these objects. We have the following theorem from representation theory:

Theorem 1 (Fulton & Harris Exercise 2.36, lol)

The irreps of a direct product group are precisely the outer tensor products , where and are irreps of and , respectively.

Remark 2

The external tensor product has an underlying vector space associated with it and equipped with the action defined as

Why is this different from the “internal” tensor product? The internal tensor product takes the representations from the same group, say , and the form of the tensor product acts on a single object as

which is again a representation of . This means that the internal tensor product acts diagonally on the tensor product space.

Now, the action on by conjugation with swaps the two factors, i.e.,

This means that the orbits come in two flavors:

  • Off-diagonal elements: if , then the orbit size is 2: .
  • Diagonal elements: if , then the orbit size is 1: .

Definitions: Restriction and Induction

Definition 1: Restriction

Let be a group and a subgroup. If is a representation of , then the restriction of to is the same linear action but only considering elements of :

So, in simpler terms, you literally just “forget” about the action on the whole group and only use the subgroup’s elements. Mathematicians are just trying to confuse us to keep their jobs!

Example 1

Let and . We have the standard 2D representation on which is a permutation action on modulo some other stuff. We can write and then we can see that restricting to yields two objects: the identity acting as the identity, and acting by swapping coordinates, which is just a reflection. This is already the usual (reflection) representation of , so is the representation of .

Let’s make this even more concrete. The element acts on with basis by

So as a matrix representation in this basis, we have

Next, we define the standard 2-dimensional representation. The permutation representation is 3-dimensional, but it contains the trivial 1-dimensional subrepresentation which is spanned by the line (i.e., this line doesn’t change under ). The standard representation is the 2-dimensional quotient .

Now, we need to select some basis vectors for this subspace. We need two of them and they need to satisfy the quotient, so we can select

The action of on this new basis just swaps the first two entries, so we find

so in this basis, we can see that

with the subscript on indicating that this is the restriction to . Now, restricting to , the subgroup acts by the identity and transposition, which is exactly the reflection representation of .


Definition 2: Induction

Let be a group and a subgroup. Suppose is a representation of . The induced representation is a representation of built on a larger vector space and is defined as

with the dimension of this representation being .

Example 2

Let’s take the same example as before. Let be the trivial representation of where every acts as 1. A quick calculation gives us

so we get a 3-dimensional representation of . This induced representation is just the permutation representation of acting on the three cosets of which are , and permutes them. This means that recovers the 3-dimensional permutation representation of .

Let’s treat this more concretely like we did with the restriction. We can write to be the trivial representation of . We have three cosets from the calculation , so we need to select three coset representatives. Let’s select the representatives to be

This gives us the left cosets we were looking for. Now, we will use the basis where indicates the coset . For any the induced action is just

so each acts by a permutation matrix. If we write out each of these cosets, we find

which is clearly everything in . Let’s now consider the action of by computing the images of the cosets under left multiplication of . This gives us

so we can see that if the action of on these cosets takes the form of

Similarly, if we calculate the action of we find

and that . This feels less satisfying than the previous example, but we can immediately see that on the vector these matrices keep this vector fixed, and that in the basis

the two generator matrices block-diagonalize into the identity and the block that acts as the standard reflection/rotation action of , being isomorphic to the representation we calculated in the restriction example.


Mackey’s Formula

We also have another very important formula which is Mackey’s formula:

Theorem 2 (Mackey's Formula)

Let be a finite group and subgroups. Let be a representation of . Then the restriction to of the induced representation from to decomposes as

where is the double coset of with and defined as

and is the representation of defined as

Now, let’s plug in and . It should be clear that , , and . Selecting to be a representation of , we see that everything boils down to


Off-diagonal case:

Select on . Since the action doesn’t stabilize , the inertia subgroup is just . Let’s now consider . Since we know that , by Mackey’s formula we have

Next, we need to use Mackey’s irreducibility criterion.

Theorem 3 (Mackey's irreducibility criterion)

Let be a group and a subgroup, and an irrep of . Then is irreducible if and only if is irreducible and for every , and have no common irreducible constituents.

Applying this criterion to our situation with and , we need to check this criterion for any . But since has index 2 in , every is in the coset , i.e., all of these ‘s give the same intersection. This means that we just need to check one representative, so we can select .

Computing the intersection subgroup, we just have . The conjugate representation is just swapping the factors like we saw, so . Since we can see that and don’t share any irreducible constituents and therefore is irreducible as a representation of , which is what we needed to identify.

Calculating the dimension of this irrep, we get

Remark 3

Moreover, for each unordered pair with , we have one irrep of produced from this. Since the partitions of and the irreps of are in one-to-one correspondence with one another, we can see that there are

total unordered pairs, where is the number of partitions of .


Diagonal case:

Let , which is fixed by so . This means that we need to extend to . To do this, let’s define an action of on as such that . This operator clearly commutes with the diagonal action of and is therefore a well-defined extension of to . This gives us two possible extensions. The first corresponds to just one action of , and the second corresponds to , which is clearly just the identity. This means that the eigenvalues of (and, ultimately, ) are when acting on the diagonal elements, so we can break our space into

with the symmetric and antisymmetric spaces corresponding to the and eigenspaces, respectively. Each of these spaces are stable under both and . Moreover, each of these yield inequivalent extensions, both with dimension (since they act on ). This means that for each , we have 2 irreps of of dimension .


Multiset of Dimensions

Let’s now define to be the degrees of the irreps of with , the partition number. This is because the partition numbers of are in one-to-one correspondence with the irreps of , or equivalently, the Young tableaux of size .

For each partition , the dimension of the corresponding irrep is given by the hook-length formula:

where is the hook-length of the box in the Young tableau of . This means that, in order to get the degrees, we need to

  1. List all the partitions of ,
  2. For each of these partitions, compute the hook-lengths, and
  3. Apply the hook-length formula above to get the dimensions.

Explicit Examples

Example 3: The case

We have two partitions of 2, which are and . So we have 2 irreps of .

Young tableaux and hook lengths:

  • : ┌─┬─┐ │2│1│ └─┴─┘ which has .

  • : ┌─┐ │2│ ├─┤ │1│ └─┘ which has .

Using the hook-length formula, we find

Diagonal terms: Each yields two irreps of dimensions , so we have 2 from and 2 from , and thus 4 irreps of dimension 1.

Off-diagonal terms: Each pair yields an irrep of dimension . The only pair here is (with the ordering ), so we have 1 irrep of dimension 2.

This perfectly matches the GAP calculations.

Example 4: The case

We have three partitions of 3: , , and .

Young tableaux and hook lengths:

  • : ┌─┬─┬─┐ │3│2│1│ └─┴─┴─┘ which has .

  • : ┌─┬─┐ │3│1│ ├─┼─┘ │1│ └─┘ which has .

  • : ┌─┐ │3│ ├─┤ │2│ ├─┤ │1│ └─┘ which has .

Calculating , we find

Therefore, .

Diagonal terms: 2 irreps of dimension 1, 2 irreps of dimension 1, and 2 irreps of dimension 4 implies that we have 4 irreps of dimension 1 and 2 irreps of dimension 4.

Off-diagonal terms: We have , , and . This gives us

and thus we have 2 irreps of dimension 4 and 1 irrep of dimension 2.

This perfectly matches the GAP calculations.


Summary

The dimensions produced by this procedure are given by

The number of irreps of is given, exactly, by

I have verified all of this up to on my MacBook, lol.