14
$\begingroup$

Can one show in an elementary way, without recourse to Young tableaux etc., that the complex representations of symmetric groups are realisable over $\mathbb{R}$? It is easy to show that they are all self-dual, since the conjugacy classes of symmetric groups are self-dual, so one just has to exclude the possibility of quaternionic representations. Surely, there must be a similarly elementary argument? If there is, it is escaping me at the moment.

  • 1
    @Alon If you can think of such a reason, please let me know - I haven't been able to get this to work. The Frobenius-Schur indicator is defined as $\sum_g\chi(g^2)$. Now, the map (of sets) $g\mapsto g^2$ is onto $A_n$ (that's quite easy to see). So the above sum is $\langle \text{Res}_{S_n/A_n}\chi,1\rangle$ plus further terms. The inner product is of course$1$if $\chi$ is a linear char. and 0 otherwise. But I haven't been able to express the remaining terms in any sensible way (some elements of $A_n$ get hit many times as $g$ ranges over $G$). – 2011-05-15

1 Answers 1

4

Some thoughts. Let $r_2(g)$ denote the number of square roots of $g$. Then $\langle r_2, \chi \rangle$ is the Frobenius-Schur indicator of $\chi$, and we want to show that this is equal to $1$ for all irreducibles $\chi$. This would follow if we could directly construct a representation of $S_n$ with character $r_2$, since then we would immediately have $\langle r_2, \chi \rangle \ge 0$.

The representation associated to this character would have dimension $r_2(e)$, or the number of involutions of $S_n$. And, indeed, there is a natural permutation representation of $S_n$ on the set of involutions (by conjugation), but it has the wrong character. In fact $r_2$ cannot in general be the character of a permutation representation: since it contains the trivial representation only once, it must be transitive, but its degree does not divide $n!$ in general.

But it still might be possible to construct this representation in a reasonably elementary way without going through the full construction of the irreducible representations of $S_n$.

  • 0
    It looks like a lot of (non-regular) transitive permutation reps involve every character. The multiplicities in the rep on the cosets of Alt(3) (n≄5) might be easy to express combinatorially, but I don't see how to use this. If this was modular rep theory, it sounds to me like you are asking for an injective cogenerator or a projective progenerator. r2 is asking for a minimal one, and the resulting algebra is called the basic algebra. Looking for reps that just involve every (or most) characters using perm reps and Hecke algebras is called condensation. – 2011-05-15