TheoremComplete

Maschke's Theorem

Maschke's Theorem is one of the cornerstones of representation theory, establishing that all representations of finite groups in characteristic zero are completely reducible.

TheoremMaschke's Theorem

Let GG be a finite group and F\mathbb{F} a field such that char(F)G\text{char}(\mathbb{F}) \nmid |G| (in particular, if char(F)=0\text{char}(\mathbb{F}) = 0). Then every finite-dimensional representation of GG over F\mathbb{F} is completely reducible.

Equivalently, every subrepresentation has a complementary subrepresentation.

Proof Strategy: Given a subrepresentation WVW \subseteq V, choose any vector space projection π0:VW\pi_0: V \to W. Average it over the group: π=1GgGρ(g)π0ρ(g1)\pi = \frac{1}{|G|} \sum_{g \in G} \rho(g) \circ \pi_0 \circ \rho(g^{-1})

This produces a GG-equivariant projection onto WW, whose kernel is a complementary subrepresentation.

ExampleApplications

Classification of representations: For finite groups over C\mathbb{C}, we need only classify irreducible representations. Every representation is a direct sum of irreducibles.

Character theory: The character of any representation is a linear combination of irreducible characters with non-negative integer coefficients.

Regular representation: For GG finite, the regular representation C[G]\mathbb{C}[G] decomposes as: C[G]V irreducibleVdimV\mathbb{C}[G] \cong \bigoplus_{V \text{ irreducible}} V^{\oplus \dim V}

Remark

The hypothesis char(F)G\text{char}(\mathbb{F}) \nmid |G| is essential. When char(F)\text{char}(\mathbb{F}) divides G|G| (modular representation theory), complete reducibility fails spectacularly.

Counterexample: Let G=Z/pZG = \mathbb{Z}/p\mathbb{Z} over Fp\mathbb{F}_p. Consider Fp2\mathbb{F}_p^2 with generator gg acting as (1101)\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}. The span of (1,0)(1,0) is invariant, but has no complement—the representation is indecomposable but not irreducible.

TheoremConverse (Partial)

If every representation of GG over F\mathbb{F} is completely reducible, then either:

  1. char(F)=0\text{char}(\mathbb{F}) = 0, or
  2. char(F)=p>0\text{char}(\mathbb{F}) = p > 0 and pGp \nmid |G|

In other words, the characteristic condition is necessary for complete reducibility.

DefinitionSemisimple Group Algebra

The group algebra F[G]\mathbb{F}[G] is called semisimple if every F[G]\mathbb{F}[G]-module is completely reducible.

Maschke's theorem states that F[G]\mathbb{F}[G] is semisimple if and only if char(F)G\text{char}(\mathbb{F}) \nmid |G|.

For semisimple algebras, the Artin-Wedderburn theorem gives an isomorphism: F[G]i=1kMatni(F)\mathbb{F}[G] \cong \prod_{i=1}^k \text{Mat}_{n_i}(\mathbb{F}) where the product runs over irreducible representations.

Maschke's theorem transforms the study of finite group representations from a potentially intractable problem into a manageable one: classify irreducibles, compute their tensor products, and understand multiplicities. This foundation supports character theory, Frobenius reciprocity, and connections to number theory and physics.