I am reading a paper on coding theory, and it uses a statement, which was claimed to be a reformulation of Maschke's Theorem. But I felt that was false...
Let's say $\mathcal(V):=\mathcal{F}_2^n$ is the big ambient space. $\sigma \in S_n$ is a permutation of odd prime order $p$. $\sigma$ acts on our ambient space by permuting the order of the coordinates.
Let $\mathcal{V}(\sigma)$ be the space in $\mathcal{V}$ that is fixed by the action of $\sigma$. (So those are the ones that have the same value on the orbit of $\sigma$.). Below is what I think what the paper meant by it's a reformulation of Maschke's theorem.
Let $\pi$ be a projection from $\mathcal{V}$ onto $\mathcal{V}(\sigma)$, and let $H$ be the group generated by $\sigma$. (So just $1, \sigma, \sigma^2, \dots$.) Define
\begin{align*} \phi: \mathcal{V} &\rightarrow \mathcal{V}(\sigma) \\ x &\mapsto \sum_{g \in H} g \pi(g^{-1}x) \end{align*}
Then it's easy to check $\phi$ is still a projection, and $\phi$ composed with the inclusion map is identity on $\mathcal{V}(\sigma)$. By splitting lemma,
This uses the fact that $p$ is odd. Since if $p$ is even, the sum will always be 0.
What confuses me is that the paper claimed that $$ \mathcal{V} = \mathcal{V}(\sigma) \oplus \mathcal{V}(\sigma)^\bot$$ where $\mathcal{V}(\sigma)^\bot$ is the dual space of $\mathcal{V}(\sigma)$ using the usual inner product defined on $\mathbb{F}_2^n$.
My feeling is that those two decompositions are not necessarily the same one. Or are they? If so, is there a way to show that?