Alperin Weight Conjecture
Canonical statement
View source LaTeX
Let \(G\) be a finite group, \(p\) a prime, and \(k\) an algebraically closed field of characteristic \(p\). A \(p\)-weight is a pair \((Q,\phi)\), where \(Q\le G\) is a \(p\)-subgroup and \(\phi\) is an irreducible complex character of \(N_G(Q)/Q\) of \(p\)-defect zero. Here defect zero means that the \(p\)-part of \(\phi(1)\) equals the \(p\)-part of \(|N_G(Q)/Q|\). The number of isomorphism classes of simple \(kG\)-modules equals the number of \(G\)-conjugacy classes of \(p\)-weights.Notes
Alperin's weight conjecture is a counting statement in modular representation theory. For a finite group and a prime , a -weight is a pair with a -subgroup of and an irreducible character of of -defect zero. The conjecture, put forward by Alperin in the mid-1980s, asserts that the number of simple -modules in characteristic equals the number of -conjugacy classes of weights [Alperin1987Weights]. A global invariant of the group algebra would thus be determined entirely by -local data.
The modern approach runs through reduction theorems: the conjecture has been reduced to inductive conditions to be verified for the finite simple groups [Navarro2018Characters], placing it in the same local–global programme as the McKay conjecture [Spath2013AWCReduction]. These conditions have been checked in many families of simple groups, and recent work refines the reduction via character triples and the Glauberman correspondence [Rossi2026AWC].
The verification across all simple groups is incomplete, and the conjecture — along with its blockwise and Galois-equivariant refinements — remains open.
References (4)
- [Alperin1987Weights]
Weights for finite groups
Open ↗J. L. Alperin · 1987 · misc
- [Spath2013AWCReduction]
Character Theory and the McKay Conjecture
Open ↗Gabriel Navarro · 2018 · misc
- [Rossi2026AWC]
The Alperin weight conjecture and the Glauberman correspondence via character triples
Open ↗Damiano Rossi · 2026 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.