1. Let be a field and be a -set. Recall that denotes the permutation -module. Prove:

  • (i) Suppose acts on transitively. If we pick any element and let then is also the stabilizer of the space , and , where denotes the trivial -module.

    This shows that permutation modules on transitive -sets are exactly the modules that are induced from the trivial module on some subgroup.

  • (ii) Let . For the permutation module , the value of its character on equals the number of fixed points of on :

\begin{proof} i) Assume that , where . Note that if , otherwise leads to a contradiction. Since is transitive on , one can check . Now we can set . By ^hp5t8s, there is

where is the trivial -module. Define

Then one can check is an isomorphism between -modules and so .

ii) Define . Let be the matrix of of the permutation representation. Then is a - matrix, and iff . Thus . \end{proof}

2. Let and be subgroups of with and . Show that for any -module , the module is a direct sum of copies of the regular module .

\begin{proof} Define . Note that , then and so . It deduces that

For any and , there is . Suppose , then as -vector space

Define , which is a -vector space and for any there is . Therefore, as -module and so

is a direct sum of copies of the regular module . \end{proof}

3. We say that a -set is -transitive (or, more properly, the action of on is -transitive) if has at least elements and for every pair of -tuples and in which the are distinct elements of and the are distinct elements of , there exists with for every . Prove the following statements.

  • (i) acts -transitively on .
  • (ii) Let be a -set with at least elements (where ) and let . Then acts -transitively on if and only if acts transitively on and acts -transitively on .

\begin{proof} i) For any distinct -tuples and with , define . Then is a permutation and so . By the arbitrary of and , acts -transitively on .

ii) We first assume that acts -transitively on , then is transitive on . Then for -tuples and with , there exists such that and so . By the arbitrary of -tuples, acts -transitively on .

Conversely, assume that is transitive on and acts -transitively on . For any given -tuples and , we aim to find such that . Since is transitive on , there exists such that . Then there exists such that . Thus

and so is what we desire. Now we finish the proof. \end{proof}

4.

  • (i) Let be a -set. Prove: the permutation module may be written as a direct sum of -modules

    for some module .

  • (ii) Under the hypothesis of (i), suppose further that acts transitively on and . Let for some . Prove the following statements.

    • (a) .
    • (b) is simple if and only if .
    • (c) is simple if and only if acts 2-transitively on . In that case, is not the trivial representation.

\begin{proof} i) Define , then is a -submodule of . Let , then is also a -submodule of . Since and , we have .

ii) a) By Frobenius reciprocity and Mackey decomposition formula, we have

b) By exercise 1, we have . It deduces that

Since is transitive on , one can check . Then is simple if and only if .

c) Assume that is -transitive, then is transitive on . For any distinct , there exists such that and so . It deduces that . By the arbitrary of , we know and so . By a) and b), is simple.

Conversely, assume that is simple, then by a) and b), there is . Since is the number of orbits of on by ^vdlh0x and , we know is transitive on and so is -transitive on by Exercise 3. Furthermore, since is simple and , is not trivial. \end{proof}