Definition
For each , define an inner product as . Note that this inner produce is -invariant, i.e., .
sign lemma
Let be a subgroup of .
- If , then .
- For any , .
- If , then for some .
- If and are in the same row of , then .
\begin{proof}
Easy. See here.
\end{proof}
Corollary
Let be tableau of shape and be tableau of shape , where and . If , then . Moreover, if and , then .
\begin{proof}
Suppose and are in the same row of , then they belong to different columns of . Otherwise by ^fae9c5. Then by ^3e06ba . If and , then for some (by ^fae9c5, each pair of numbers in the same column does not appear in the same row of ). It follows that by ^fae9c5.
\end{proof}
Corollary
If and is tableau of shape , then is multiple of .
\begin{proof}
Since is a linear combination of tabloid of shape , it follows from ^2fe718.
\end{proof}
submodule theorem
Let be submodule of , then either on or . In particular, is irreducible.
\begin{proof}
Take , then for some . Suppose that there exists such that . But then . As is cyclic, generates and is inside of , which yields that . Otherwise, for any tableau and , we have and so
Therefore, .
\end{proof}
Proposition
If there is a non-zero element , then . If , then is multiplication by a scalar.
\begin{proof}
Since is non-zero, there exists polytabloid such that . Moreover, as can be decomposed as , we extend to a homomorphism
Since for some -tabloids , there is by ^2fe718.
If , then . Then for any permutation ,
and so is a multiplication by .
\end{proof}
Theorem
The Specht modules for form a complete list of irreducible modules of .
\begin{proof}
Since the number of equals the number of and so the number of conjugacy classes of , it suffices to show for any .
Otherwise, suppose that with . Since is non-trivial, we have non-zero and so by ^376fda. Similarly we have and so , contradiction. Now we finish the proof.
\end{proof}
Corollary
The irreducible decomposition of the permutation module has the form
where is called Kostka numbers. Moreover, .
Here is an example.
\begin{proof}
Note that where and are characters of and , respectively. If , then by ^376fda. Furthermore, since is multiplication by scalar by ^376fda, we have .
\end{proof}