How Good are Permutation Represesentations?
Posted by John Baez
Any action of a finite group on a finite set gives a linear representation of on the vector space with basis . This is called a ‘permutation represention’. And this raises a natural question: how many representations of finite groups are permutation representations?
Most representation are not permutation representations, since every permutation representation has a vector fixed by all elements of , namely the vector that’s the sum of all elements of . In other words, every permutation representation has a 1-dimensional trivial rep sitting inside it.
But what if we could ‘subtract off’ this trivial representation?
There are different levels of subtlety with which we can do this. For example, we can decategorify, and let:
the Burnside ring of be the ring of formal differences of isomorphism classes of actions of on finite sets;
the representation ring of be the ring of formal differences of isomorphism classes of finite-dimensional representations of .
In either of these rings, we can subtract.
There’s an obvious map , since any action of on a finite set gives a permutation representation of on the vector space with basis .
So I asked on MathOverflow: is typically surjective, or typically not surjective?
In fact everything depends on what field we’re using for our vector spaces! For starters let’s take .
Here’s a list of finite groups where the map from the Burnside ring to the representation ring is known to be surjective, taken from the nLab article Permutation representations:
cyclic groups,
symmetric groups,
-groups (that is, groups whose order is a power of the prime ),
binary dihedral groups for (at least) ,
the binary tetrahedral group, binary octahedral group, and binary icosahedral group,
the general linear group .
Now, these may seem like rather special classes of groups, but devoted readers of this blog know that most finite groups have order that’s a power of 2 I don’t think this has been proved yet, but it’s obviously true empirically, and we also have a good idea as to why:
- Tom Leinster, Almost all of the first 50 billion groups have order 1024.
So, map from the Burnside ring to the representation ring is surjective for most finite groups!
There are groups of order where is not surjective, but David Benson listed how many of them there are for various orders, and there are rather few:
“Most” finite groups are -groups, for which the map is an isomorphism. But quite a lot of groups of order are examples where it isn’t. There are 45 such groups of order 96, for example.
Here is a list of the first few orders for which there are such groups, and how many there are:
24: 2,
40: 2,
48: 7,
56: 1,
60: 2,
72: 8,
80: 8,
84: 1,
88: 2,
96: 45,
104: 2,
112: 5,
120: 13,
132: 1,
136: 3,
140: 2,
144: 39,
152: 2,
156: 1,
160: 12,
168: 12,
171: 1,
176: 7,
180: 6,
184: 1,
192: 423,
200: 8,
204: 2,
208: 8,
216: 35,
220: 1,
224: 28,
228: 1,
232: 2,
240: 90,
248: 1,
252: 4,
260: 2,
264: 10,
272: 12,
276: 1,
280: 12,
288: 256,
296: 2,
300: 8,
304: 7,
308: 1,
312: 16,
320: 532,
328: 3,
333: 1,
336: 76,
340: 2,
342: 2,
344: 2,
348: 2,
352: 41,
360: 51,
364: 2,
368: 5,
372: 1,
376: 1,
380: 2.
This seems to represent quite a small proportion of all finite groups, counted by order, even ignoring the -groups.
All this is if we work over . If we work over the situation flip-flops, and I believe is usually not surjective. It already fails to be surjective for cyclic groups bigger than !
Why? Because has a 1-dimensional representation where the generator acts as multiplication by a primitive th root of unity, and since this is not a rational number when , this representation is not definable over . Thus, one can show, there’s no way to get this representation as a formal difference of permutation representations, since those are always definable over .
And this phenomenon of needing roots of unity to define representations is not special to cyclic groups: it happens for most finite groups as hinted at by Artin’s theorem on induced characters.
An example
Now, you’ll notice that I didn’t yet give an example of a finite group where the map from the Burnside ring to the representation ring fails to be surjective when we work over . I recently had a lot of fun doing an exercise in Serre’s book Linear Representations of Finite Groups, where he asks us in Exercise 13.4 to prove that is such a group. Here is the quaternion group, an 8-element subgroup of the invertible quaternions:
I couldn’t resist trying to understand why this is the counterexample Serre gave. First of all, looks like a pretty weird group — why does it work, and why did Serre choose this one? Secondly, it has 24 elements, and I love the number 24. Thirdly, I love the quaternions.
Right now I believe is the smallest group for which is non-surjective. I’ve asked on MathOverflow, but so far nobody has answered that question. I got a lot of useful information about my other question, though: is surjective for most finite groups, or not?
To solve Serre’s problem 13.4, he asked you to use exercise 13.3. Here is my reformulation and solution of that problem. I believe any field characteristic zero would work for this theorem:
Theorem. Suppose is a finite group with a linear representation such that:
is irreducible and faithful
every subgroup of is normal
appears with multiplicity in the regular representation of .
Then the map from the Burnside ring of to the representation ring of is not surjective.
Proof. It suffices to prove that the multiplicity of in any permutation representation of is a multiple of , so that the class cannot be in the image of .
Since every finite -set is a coproduct of transitive actions of , which are isomorphic to actions on for subgroups of , every permutation representation of is a direct sum of those on spaces of the form . (This is my notation for the vector space with basis .) Thus, it suffices to show that the multiplicity of in the representation on is if is the trivial group, and otherwise.
The former holds by assumption 3. For the latter, suppose is a nontrivial subgroup of . Because is normal by assumption 2, every element acts trivially on : we can see this by letting act on an arbitrary basis element :
Since is nontrivial, it contains elements that act trivially on . But no can act trivially on because is faithful, by assumption 1. Thus cannot be a subrepresentation of . That is, appears with multiplicity in . ▮
Serre’s exercise 13.4 is to show the group obeys the conditions of this theorem. As a hint, Serre suggests to embed and in the multiplicative group of the algebra (the quaternions defined over ). By letting act by left multiplication and act by right multiplication, one obtains a 4-dimensional irreducible representation of which appears with multiplicity in the regular representation. Furthermore is faithful and irreducible. Finally, every subgroup of is normal, because that’s true of and — and since the orders of these groups are relatively prime, every subgroup of is a product of a subgroup of and a subgroup of .