Dice Question Streamline Icon: https://streamlinehq.com

Weak Form of Malle’s Conjecture for Pushforward Discriminants

Prove that for every number field k, every finite permutation group G with normal subgroup T ◁ G, and the quotient map q: G → G/T, the number of surjections π ∈ Sur(G_k,G/T) ordered by the pushforward discriminant q_*disc satisfies # { π ∈ Sur(G_k,G/T) : |q_*disc(π)| ≤ X } ≪_ε X^{1/a(G\setminus T) + ε}, where a(G\setminus T) = min_{g ∈ G\setminus T} ind(g).

Information Square Streamline Icon: https://streamlinehq.com

Background

To control the image q_*Sur(G_k,G;X) and bound contributions from fibers, the paper introduces the pushforward discriminant q_*disc on G/T-extensions: it is defined locally by minimizing the conductor exponent across lifts to G and assembled globally as an ideal. This creates an ordering on G/T-extensions tailored to the lifting problem.

The conjecture is a pushforward analogue of Malle’s weak upper bound, heuristically supported by the Ellenberg–Venkatesh philosophy. It is known in certain nilpotent cases (via results on discriminant multiplicity), but remains open in general. Proving it would directly feed the inductive counting framework developed in the paper.

References

We then obtain the following conjecture following from a heuristic of Ellenberg and Venkatesh Question 4.3. Conjecture [The Weak Form of Malle's Conjecture for Pushforward Discriminants] Let k be a number field, G a finite permutation group with normal subgroup T\normal G, and q\colon G\to G/T the quotient map. Then #{\pi\in \Sur(G_k,G/T) : q_*\disc(\pi) \le X} \ll_{\epsilon} X{1/a(G\setminus T) + \epsilon}, where a(G\setminus T) = \min_{g\in G\setminus T} \ind(g).

Inductive methods for counting number fields (2501.18574 - Alberts et al., 30 Jan 2025) in Section “The Pushforward Discriminant,” Conjecture [The Weak Form of Malle’s Conjecture for Pushforward Discriminants]