Hiraga--Ichino--Ikeda formal degree conjecture
Assume the local Langlands correspondence for a split connected reductive group over a non-Archimedean local field of characteristic zero. Let be the irreducible smooth representations of , let be an -parameter for , and let be its associated finite component group. Let be the variant used in the conjecture, and let denote the irreducible character of attached to in the -packet. For a non-trivial additive character , let be the gamma factor of the adjoint representation, where is the action of the Langlands dual group on .
Hiraga--Ichino--Ikeda's formal degree conjecture. Suppose that is a discrete series representation whose -parameter is . Then
The conjecture predicts a precise relation between formal degrees, -packets, component groups, and adjoint gamma factors. It is known in a number of important cases but is not established uniformly for all split connected reductive groups in the stated generality.
Equivalent formulations
Let be a reductive group over a nonarchimedean local field , let be a discrete Langlands parameter, and let correspond to an irreducible representation of the component group associated with . Write for the gamma factor attached to , and let be the chosen Haar measure on . Hiraga–Ichino–Ikeda formal degree conjecture. For every such and ,
d(\pi, \mu_{Z\backslash G})=\frac{\dim \rho_{\pi}}{\\#\mathcal{S}_{\varphi}^\sharp}\lvert\gamma(\varphi)\rvert.This predicts that formal degrees are governed by adjoint gamma factors and the dimensions of the representations parametrizing local Langlands packets. It is known in a number of cases, but the general statement depends on the local Langlands correspondence and remains unresolved in full generality.
source: Anantha Krishna B, “The formal degree conjecture for groups over local function fields”, arXiv:2605.26031 (2026).
References
- Guy Henniart and Masao Oi, “On Swan exponents of symmetric and exterior square Galois representations”, arXiv:2307.15248 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.