Mackey Irreducibility Criterion
Mackey's irreducibility criterion provides a practical test for determining when an induced representation is irreducible, essential for classification problems.
Let be a subgroup and an irreducible representation of . Then is irreducible if and only if:
- Intertwining condition: For all , the representations and are disjoint (non-isomorphic) as representations of where denotes conjugation:
- is -irreducible: The representation is irreducible as an -representation
Equivalently, contains with multiplicity 1, and all other irreducible summands are non-isomorphic to .
Proof idea: Use Frobenius Reciprocity and Mackey's decomposition formula. The condition ensures that , so by Schur's Lemma, the representation is irreducible.
Let (subgroup of order 2) and (sign representation of , so acts as ).
Check conjugates: For :
- on is just the trivial representation
- restricted to is also trivial
Since , all representations of it are isomorphic (trivial), so the intertwining condition fails. Thus is not irreducible.
Indeed, computing: where is the 2-dimensional standard representation.
Dihedral group: For , let with a non-trivial character .
For many , we have and the conjugated representations are non-isomorphic on the intersection. Mackey's criterion often confirms that is an irreducible 2-dimensional representation.
If acts simply transitively on the cosets (i.e., is maximal and has no non-trivial intersection with its conjugates), then is irreducible for any irreducible of .
This is because the intertwining condition is automatically satisfied when conjugate subgroups intersect trivially.
Mackey's criterion is fundamental for:
- Constructing irreducibles: Many irreducible representations arise as inductions from maximal subgroups
- Representation theory of wreath products: Irreducibles are often induced from subgroups
- Automorphic representations: Generalization to p-adic and adelic groups
- Geometric representation theory: Irreducibility of perverse sheaves
The criterion transforms the abstract problem of checking irreducibility into a concrete computation involving conjugacy and restriction.