Okuyama–Wajima Argument in Finite Group Theory
- The Okuyama–Wajima argument is a finite group theory framework that reduces complex character extension problems to abelian p-quotients using Glauberman correspondences.
- It employs an equivariant refinement of Gallagher’s theorem to precisely count and match irreducible characters in the presence of automorphisms.
- This method underpins automorphism-equivariant McKay bijections for p-solvable groups, providing systematic control over the enumeration of irreducible characters.
The Okuyama–Wajima argument is a pivotal technique in finite group theory and character theory with applications in the proof of the McKay conjecture for -solvable groups, including cases involving group automorphisms. Originating from a 1980 theorem of Okuyama and Wajima, its central insight is that extension problems for irreducible characters of a normal -subgroup, tightly linked to the behavior of Glauberman correspondents and the control exerted by Gallagher counting, become tractable by a reduction to abelian -quotients. The framework enables explicit matching of characters in equivariant correspondences, particularly in producing -equivariant bijections in the presence of automorphisms. Recent elaborations leverage these combinatorial and representation-theoretic features to provide self-contained proofs of equivariant versions of the McKay conjecture for finite -solvable groups (Maltempo et al., 15 Dec 2025).
1. Technical Framework and Preliminaries
Let be a finite group, a prime, a normal subgroup, $P\in\syl pG$ a Sylow -subgroup, $\theta\in\Irr(N)$ a -invariant irreducible character, and a finite group acting on stabilizing . The set of irreducible characters of above is denoted $\Irr(G\mid\theta)$, with those of degree prime to as $\Irr_{p'}(G\mid\theta)$. Fundamental to the argument is the Glauberman correspondence: when a -group $Q\le\Aut(K)$ acts on a finite group with , one has a canonical bijection
${}^*\;:\;\Irr_{Q}(K)\;\longrightarrow\;\Irr(\Cent_K(Q)),$
where is the Glauberman correspondent of a -fixed $\theta\in\Irr(K)$.
This landscape sets up the study of how irreducible characters lying over a given can be controlled and matched, particularly when targeted restrictions and extensions interplay with automorphism groups.
2. Gallagher’s Theorem and Equivariant Counting
Classical Gallagher’s theorem establishes that for and $\theta\in\Irr(N)$ -invariant, the number $|\Irr(A\mid\theta)|$ equals the number of -conjugacy classes with -good representatives. The Okuyama–Wajima argument deploys an equivariant refinement (Theorem A (Maltempo et al., 15 Dec 2025)): for with acting and -invariant, the cardinality of -fixed characters of over equals the number of -conjugacy classes all of whose elements are -good in . Navarro’s function space isomorphism (Theorem B) recasts this as a linear-algebraic statement: the restriction map from class functions on vanishing off and affording on gives a vector space with natural bases indexed by -fixed irreducibles and by classes of -good elements.
This combination provides precise enumerative control, ensuring bijectivity in subsequent character correspondences and supporting the main reduction steps in the Okuyama–Wajima argument.
3. The Okuyama–Wajima Extension Theorem
The Okuyama–Wajima Extension Theorem asserts: let act on with , normalizing a -subgroup, , $C=\Cent_K(Q)$. For -fixed $\theta\in\Irr(K)$ with Glauberman correspondent $\theta^*\in\Irr(C)$, and with abelian,
This reduces the extension problem for characters across semidirect products containing a -group quotient to the corresponding extension for the Glauberman correspondent across the fixed point subgroup. This theorem is essential for passing from local (fixed-point subgroup) character data back to global () character data.
A further corollary transitions from extension to counting: for with ,
$|\Irr_D(KS\mid\theta)| = |\Irr_D(S\mid\theta^*)|,$
so the enumeration of irreducible characters above inflating up from is governed by the count for the Glauberman correspondent in the fixed-point subgroup.
4. Equivariant Generalization and Central -Subgroups
The strategy generalizes to equivariant settings involving a central -subgroup and an -fixed linear character $\lambda\in\Irr(Z)$. Given of order prime to with $P\in\syl pG$ normalizing , and writing , , $C=\Cent_K(P)$, Theorem OW-revisited guarantees
$|\Irr_{p',A}(G\mid\theta \times \lambda)| = |\Irr_{p',B}(H\mid\theta^* \times \lambda)|,$
where $\theta\in\Irr(K)^P$ and is its Glauberman correspondent.
The proof proceeds: (a) reducing the problem via induction and Gallagher’s lemma to counting characters of types $\Irr(G\mid \widehat\theta \otimes \mu)$, (b) using Schur–Zassenhaus to split complements and applying Clifford theory for identification of character sets, and (c) applying the extension–counting correspondence recursively on subgroups involving and .
This result underpins the construction of equivariant bijections crucial to the McKay correspondence with automorphisms.
5. Application to Equivariant McKay Bijections
Integrating the above elements, one obtains the following theorem (Rossi–Maltempo–Vallejo (Maltempo et al., 15 Dec 2025)): let with -solvable, $P\in \syl p G$ stabilized by , and $\mu\in\Irr(N)^P$ -invariant. There exists an -equivariant bijection
$\Irr_{p'}(G\mid\mu) \longleftrightarrow \Irr_{p'}(N_G(P)N \mid \mu).$
This realizes an automorphism-equivariant version of the McKay conjecture for -solvable groups.
The Okuyama–Wajima argument is used at the step where one reduces to a subgroup with a central -power order, allowing decomposition and application of Theorem OW-revisited. The counting lemmas ensure that passing to inertia subgroups or modding out -components preserves perfect bijections, preventing spurious creation or loss of irreducible characters.
6. Structural Summary and Significance
The Okuyama–Wajima argument orchestrates a reduction–extension–counting sequence across several layers of group and character theory:
| Component | Content/Result | Associated Theorem |
|---|---|---|
| Local–global character link | Extension of across iff extension of across | Okuyama–Wajima Extension |
| Equivariant enumeration | -fixed irreducibles counted by -good conjugacy classes | Equivariant Gallagher |
| Class-function isomorphism | Bases for class-functions indexed by characters or conjugacy classes | Navarro |
| Full correspondence | -equivariant McKay bijection for -solvable groups with automorphisms | Rossi–Maltempo–Vallejo |
This methodology is notable for providing a self-contained, elementary approach to the equivariant McKay conjecture for -solvable groups, systematically invoking character-theoretic correspondences, handle invariance under automorphisms, and function space isomorphisms, independent of deeper geometric or cohomological machinery. The core insight—reduction of character extension and enumeration problems via the Glauberman correspondence and the fusion with generalized Gallagher lemmas—has structural consequences for the theory of finite group representations and their symmetry properties (Maltempo et al., 15 Dec 2025).