We’ve been talking a lot about the general theory of finite group representations. But our goal is to talk about symmetric groups in particular. Now, we’ve seen that the character table of a finite group is square, meaning there are as many irreducible representations of a group as there are conjugacy classes . But we’ve also noted that there’s no reason to believe that these have any sort of natural correspondence.
But for the symmetric group , there’s something we can say. We know that conjugacy classes in symmetric groups correspond to cycle types. Cycles correspond to integer partitions of . And from a partition we will build a representation.
For a first step, let be a partition, with . We can use this to come up with a subgroup . Given a set we will write for the group of permutations of that set. For example permutes the first positive integers, and permutes the next of them. We can put a bunch of these groups together to build
Elements of permute the same set as , and so , but only in certain discrete chunks. Numbers in each block can be shuffled arbitrarily among each other, but the different blocks are never mixed. Really, all that matters is that the chunks have sizes through , but choosing them like this is a nicely concrete way to do it.
So, now we can define the -module by inducing the trivial representation from the subgroup to all of . Now, the are not all irreducible, but we will see how to identify a particular irreducible submodule of each one, and the will all be distinct. Since they correspond to partitions , there are exactly as many of them as there are conjugacy classes in , and so they must be all the irreducible -modules, up to isomorphism.