On a conjecture for $\ell$-torsion in class groups of number fields: from the perspective of moments
Lillian B. Pierce, Caroline L. Turnage-Butterbaugh, Melanie, Matchett Wood

TL;DR
This paper explores the conjecture that the $ ext{l}$-torsion subgroup in class groups of number fields is very small, analyzing its connections with various counting problems and emphasizing the utility of the method of moments.
Contribution
It explicitly relates the $ ext{l}$-torsion conjecture to other major conjectures and counting problems, highlighting the role of moments in understanding these relationships.
Findings
Reinforces the belief that the $ ext{l}$-torsion conjecture is true.
Establishes quantitative links between $ ext{l}$-torsion bounds and counting problems.
Demonstrates the broad utility of the method of moments in number theory.
Abstract
It is conjectured that within the class group of any number field, for every integer , the -torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the full strength of this conjecture remains open, and even partial progress is limited. Significant recent progress toward average versions of the -torsion conjecture has crucially relied on counts for number fields, raising interest in how these two types of question relate. In this paper we make explicit the quantitative relationships between the -torsion conjecture and other well-known conjectures: the Cohen-Lenstra heuristics, counts for number fields of fixed discriminant, counts for number fields of bounded discriminant (or related invariants), and counts for elliptic curves with fixed conductor. All of these considerations reinforce…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On a conjecture for -torsion
in class groups of number fields:
from the perspective of moments
Lillian B. Pierce
Department of Mathematics, Duke University, 120 Science Drive, Durham, NC 27708 USA
,
Caroline L. Turnage-Butterbaugh
Department of Mathematics & Statistics, Carleton College, 1 North College Street, Northfield, MN 55057 USA
and
Melanie Matchett Wood
Department of Mathematics, Harvard University, 1 Oxford Street, Cambridge, MA 02138 USA
Abstract.
It is conjectured that within the class group of any number field, for every integer , the -torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the full strength of this conjecture remains open, and even partial progress is limited. Significant recent progress toward average versions of the -torsion conjecture has relied crucially on counts for number fields, raising interest in how these two types of question relate. In this paper we make explicit the quantitative relationships between the -torsion conjecture and other well-known conjectures: the Cohen-Lenstra heuristics, counts for number fields of fixed discriminant, counts for number fields of bounded discriminant (or related invariants), counts for elliptic curves with fixed conductor. All of these considerations reinforce that we expect the -torsion conjecture to be true, despite limited progress toward it. Our perspective focuses on the relation between pointwise bounds, averages, and higher moments, and demonstrates the broad utility of the “method of moments.”
Key words and phrases:
Class groups, counting number fields, elliptic curves
2010 Mathematics Subject Classification:
11R29, 11R45
1. Introduction
Associated to each number field is the ideal class group , a finite abelian group that encodes information about arithmetic in , and can also be seen as the Galois group of the maximal unramified abelian extension of . Correspondingly, each number field has a class number, defined to be the cardinality of the class group. Given a field , it is natural to ask about the size and structure of the class group; moreover, as varies over an infinite set, or “family,” of fields, it is natural to ask how the corresponding class groups are distributed. Interest in such questions has a long history, going back to C.F. Gauss’s class number conjecture, early attempts at proving Fermat’s Last Theorem, and Dirichlet’s development of the class number formula. In particular, although class numbers arise initially from an algebraic construction, the class number formula identifies them with values of -functions and hence to core questions in analytic number theory, including the Generalized Riemann Hypothesis.
Our focus in this paper is a well-known conjecture for -torsion in class groups, which, in the strongest form in which it has been proposed, remains stubbornly out of reach. For each integer , the -torsion subgroup of is defined by
[TABLE]
in which we write the class group in additive notation. Thus for example, if the -torsion is trivial, the class number is not divisible by .
How big is ? For any number field of degree and discriminant of absolute value , we may trivially bound the -torsion subgroup for any integer by the size of the full class group, so that111We will use Vinogradov’s notation: denotes that there exists a constant such that and denotes that may depend on .
[TABLE]
for all arbitrarily small, according to Landau’s upper bound for the class number via the Minkowski bound (see e.g. [Nar80, Theorem 4.4]). But conjecturally, a much stronger upper bound should hold.
Conjecture 1.1** (-torsion Conjecture).**
For every integer , every field extension of degree satisfies the property that for all primes and every ,
[TABLE]
This conjecture was first raised as a question of Brumer and Silverman [BS96, Question ] in the context of counting elliptic curves with fixed conductor; we will return to this original motivation, and a possible more precise rate of growth, in §6. It is known to have implications for many other problems: for example, proving this upper bound would imply strong bounds for the ranks of elliptic curves (see [EV07, §1.2]) and for counts of certain number fields (see Remarks 1.10 and 4.1). See also Zhang [Zha05, Conjecture 3.5] in the context of equidistribution of CM points on Shimura varieties, Duke [Duk98, p. 166] in consideration of counting number fields, and Belolipetsky and Lubotzky [BL17, Thm. 7.5], who show an equivalence between certain more precise forms of Conjecture 1.1 and a conjecture on counting non-uniform lattices in semisimple Lie groups. We have stated the conjecture here for prime, as for composite the result follows from the prime cases; see §7.1.
Conjecture 1.1 is known to be true in only one case: degree and the prime ; this follows from the genus theory of Gauss [Gau01], which shows that for a fundamental discriminant of absolute value , we have , where denotes the number of distinct prime divisors of . Since (see e.g. [HW08, Ch. 22 §10]), it follows that for any quadratic field , for every ,
[TABLE]
Recent progress has focused on verifying results toward Conjecture 1.1 by making small improvements on (1.1), either for all number fields of a fixed degree, or for “almost all” fields in a family of number fields of fixed degree. Results of the first type include [HV06, Pie05, Pie06, EV07, BST*+*17]. Results of the second type, which can also be thought of as results “on average” over a family of fields, include [DH71, Bha05, HBP17, EPW17, PTBW20, FW17, FW18]. (For an overview of recent work, see Section 7.)
The apparent difficulty of verifying Conjecture 1.1, for a fixed prime and all fields of a fixed degree , in any case other than that due to Gauss, leads to a question: is the strong pointwise version of Conjecture 1.1 stated above too much to expect?
In this paper we describe several explicit motivations for why we expect Conjecture 1.1 to hold. The key philosophy we employ is the “method of moments,” surveyed in §2: this is the principle that in certain settings, if one can control arbitrarily high moments of a function, then one can deduce that there is not even one violation of a pointwise upper bound by the function. In particular we show quantitatively how Conjecture 1.1 follows from three other well-known conjectures in number theory: the Cohen-Lenstra heuristics; the discriminant multiplicity conjecture for counting number fields with fixed discriminant; and a generalization of the Malle conjecture for counting number fields with bounded discriminant. Furthermore, we quantify implications of these conjectures for counting elliptic curves with fixed conductor, and we prove new unconditional counts for elliptic curves.
Many recent works on -torsion in class groups have focused on average results over families of fields, and this type of work has been significantly constrained by the difficulty of counting number fields. Our investigations in this paper confirm that counting fields is not merely a technical difficulty one encounters when proving average results, but in fact lies at the heart of understanding -torsion in class groups.
We now give an overview of this paper, organized according to four main themes.
1.1. Cohen-Lenstra and Cohen-Martinet heuristics (§3)
First, we make quantitatively precise how Conjecture 1.1 follows from the Cohen-Lenstra [CL84] and Cohen-Martinet [CM90] heuristics. In fact, we show that even a collection of weaker upper bounds for moments, implied by the Cohen-Lenstra-Martinet heuristics, would imply Conjecture 1.1. We frame our first result as a statement about a “family” of degree field extensions of ; we will at the moment leave the specifications of such a family rather vague, but this could indicate that we have fixed not only the degree and the Galois group of the Galois closure, but also the signature, certain local conditions, and possibly certain ramification restrictions (see §1.6 for precise conventions).
Let denote a family of fields of degree and let denote those with , where . Consider for any fixed real number , integer , and real number the statement that for all ,
[TABLE]
Theorem 1.2**.**
Let be fixed. Suppose that for a fixed value , (1.4) is known for all integers . Then for every we have for every field .
This principle can be applied to any family for which appropriate moment bounds are known. Here we record that Theorem 1.2 immediately implies that for fixed , uniform control of arbitrarily high -th moments is sufficient to deduce Conjecture 1.1 in its full strength:
Corollary 1.3**.**
Let be fixed and let be taken to be the family of all degree extensions of . For each fixed integer , the conclusion of Conjecture 1.1 for -torsion for all would follow from knowing (1.4) holds for that fixed and a certain fixed , for arbitrarily large .
See Remark 3.3 for an example of how to apply this moment approach to -torsion in quadratic fields; while this case may be deduced by other means (§7.1), this is nevertheless an illustration of the principle.
1.2. Discriminant multiplicity conjecture (§4)
In the second theme, we will show quantitatively how Conjecture 1.1 follows from a well-known folk conjecture about counting number fields with fixed degree and fixed discriminant. By Hermite’s finiteness theorem, for any fixed integer there are finitely many extensions of degree with (see e.g. [Ser97, §4.1]). The question remains: how many? Duke [Duk98, §3] and Ellenberg and Venkatesh [EV05, Conjecture 1.3] make the following prediction, which we call the discriminant multiplicity conjecture:
Conjecture 1.4** (Discriminant Multiplicity Conjecture).**
For each , for every and for every integer , at most fields of degree have .
Conjecture 1.4 is known to be true for quadratic fields () but is not known in full for any . See §4 for a summary of known results toward the discriminant multiplicity conjecture.
Ellenberg and Venkatesh have noted that Conjecture 1.4 implies Conjecture 1.1 (see [EV05, p. 164]). In Theorem 1.7, we make this explicit by exhibiting quantitatively how even a partial result toward Conjecture 1.4 implies progress toward Conjecture 1.1. To do so, we define two notations:
Property 1.5** (Property ).**
Let be fixed. We say that property holds if for every and for every fixed integer , at most fields of degree have .
Property 1.6** (Property ).**
Let be fixed. We say that property holds if for every and for all fields of degree , we have
Now we make the relationship between and the -torsion conjecture quantitatively precise.
Theorem 1.7**.**
Fix an integer and any prime . If Property holds for a real number , then Property holds.
Note that the exponent we gain for the -torsion bound is significantly weaker (that is, larger) than the exponent we assume for counting fields with fixed discriminant; in this formulation, as increases, we need to be increasingly good at counting the relevant fields, to preserve the same quality of bound on -torsion. Theorem 1.7 has an immediate corollary:
Corollary 1.8**.**
Let be fixed. Then for a fixed prime , the statement of Conjecture 1.1 holds for all fields of degree , if Conjecture 1.4 is known for degree .
Remark 1.9*.*
We highlight here a difficulty of this approach; if one fixes and wants to use this route to prove the -torsion conjecture for all for fields of degree , then one would need to prove the discriminant multiplicity conjecture for infinitely many degrees. The recent work of the authors in [PTBW20] to some extent eliminates this inefficiency; in that work, once the degree is fixed, (weak) results are proved for -torsion for all by proving weak results toward the discriminant multiplicity conjecture only for degree ; see §7.5 for further remarks.
1.3. Generalized Malle Conjecture (§5)
In the third theme, we examine how Conjecture 1.4, and hence Conjecture 1.1, follows from a generalized Malle conjecture for counting number fields ordered via other invariants than the discriminant. This observation is due to Ellenberg and Venkatesh [EV05, Prop. 4.8], and we state it here only loosely (see §5 for a precise statement):
Theorem A** ([EV05, Prop. 4.8]).**
If a generalized Malle conjecture (see (5.3)) holds for all groups , then Conjecture 1.4 holds, and hence Conjecture 1.1 holds.
We highlight this theorem of Ellenberg and Venkatesh because it uses not only the method of moments but also a clever strategy of reinterpreting a -th moment of an object as an average of -fold objects, so that one can (conjecturally) obtain bounds for arbitrarily high moments even if one only assumes bounds for averages (i.e. first moments). (This leads to speculation on whether it could be advantageous to reinterpret -th moments of -torsion as averages of -torsion over certain -fold objects, but any such precise formulation is so far elusive.)
Remark 1.10*.*
Note also that Alberts [Alb18] has shown that Conjecture 1.1 implies the generalized Malle conjecture that we give below in (5.3), providing a converse to Theorem A.
1.4. Counting elliptic curves with fixed conductor (§6)
In our fourth theme, we observe that for every , a -th moment estimate for counting elliptic curves with fixed conductor can be deduced from any of the conjectures mentioned above. In addition, unconditionally, we derive improved bounds for counting elliptic curves with fixed conductor.
To be precise, given a positive integer , let denote the number of isogeny classes of elliptic curves over with conductor . Brumer and Silverman have put forward the following conjecture:
Conjecture 1.11** ([BS96, Conj. 3]).**
For every , for all ,
[TABLE]
(For clarity, we note that an equivalently strong conjecture is expected to hold if we instead count the number of isomorphism classes of elliptic curves over with conductor ; the statement of our results below will hold for both and , up to a constant factor.) Brumer and Silverman proved the first result toward Conjecture 1.11, namely , by dominating this count by -torsion in certain quadratic fields; by combining aspects of [HV06, Thm. 4.5] and [EV07] this can now be improved to
[TABLE]
for an explicit constant ; see §6 for an explication of this. We observe in Theorem 6.2 that Conjecture 1.11 would follow from counting sextic fields of fixed discriminant. But our main focus is on a moment statement related to Conjecture 1.11.
Brumer and Silverman’s argument dominates pointwise by a sup-norm of over quadratic fields; this comparison has been sharpened further in [HV06], still using a supremum over a set of certain quadratic fields. Thus proving an upper bound for -torsion for almost all such fields (or for an average, or for a fixed moment) does not immediately provide an analogous result for (see Remark 6.4). The content of Duke and Kowalski [DK00, Prop. 1] is that a refined argument shows that nevertheless, average counts for are dominated by average counts for -torsion in quadratic fields. (See [FNT92] for an analogue when the curves are ordered by discriminant rather than conductor.)
An upper bound for an average yields an upper bound for the number of for which can violate a certain pointwise upper bound; a comparable upper bound for a higher moment sharpens the upper bound on the number of possible exceptions. This motivates us to consider higher moments. We build on [BS96, DK00, HV06] to prove that the -th moment of -torsion in quadratic fields dominates the -th moment of , for a certain numerical constant specified precisely below.
Theorem 1.12**.**
Let denote the family of quadratic fields with discriminant of absolute value at most . Let be the numerical constant determined by as defined in [HV06, Thm. 3.8]. Let be a fixed real number, and assume that there exists such that for every and for every ,
[TABLE]
Then for that , for every and for all ,
[TABLE]
Notice that the conclusion for is stronger than the assumption for , since the power in the moment has nearly doubled in size. In particular, (1.6) shows that
[TABLE]
while we see from (1.7) that
[TABLE]
By combining Theorem 1.12 with moment bounds of the form (1.6) for -torsion in quadratic fields due to Heath-Brown and the first author in [HBP17, Cor. 1.4] we immediately obtain new unconditional bounds for moments of :
Corollary 1.13**.**
For each , let denote the number of isogeny classes of elliptic curves over with conductor . Let be the numerical constant as above. Then for every , for all ,
[TABLE]
More generally, for all real ,
[TABLE]
and for all real ,
[TABLE]
These results improve on all results implicitly derivable in previous literature; see §6 for details.
1.5. Concluding sections §7 and §8
In §7 we briefly survey certain recent works toward Conjecture 1.1, with a focus on the relation to the Generalized Riemann Hypothesis. In contrast to the impact of the other major conjectures we have mentioned, GRH does not appear to imply Conjecture 1.1 directly, due to an interesting interaction with another set of conjectures, about number fields with generating elements of small height. Finally, in §8 we include brief appendices with further remarks about moment bounds and one special case of the discriminant multiplicity conjecture.
1.6. Notational conventions on families of fields
A “family” (set) of fields is formally defined as follows. Given an integer and a fixed transitive subgroup , for every integer we can define a family to be where all are in a fixed algebraic closure , is the Galois closure of over , the Galois group is considered as a permutation group on the embeddings of in , and the isomorphism with is one of permutation groups. We let . It is furthermore possible to impose additional restrictions on the definition of the family, such as fixing the signature, certain local conditions, or ramification restrictions. In some cases where we wish to be more vague (for example, considering all degree extensions), we will just refer to a family and the subset of those fields with . Given a family , we will say that a set is a subset of density zero if
[TABLE]
If a property holds for all fields in a family except those lying in a possible exceptional set of density zero, we say the property holds for “almost all” fields in the family.
2. The method of moments
We start with a general philosophy for why one can expect control of arbitrarily high moments of a function to yield good control on the function’s values. On a (-finite) measure space such as with Lebesgue measure or with counting measure, given a complex-valued measurable function , define for every real the distribution function . Then for any ,
[TABLE]
Suppose that it is known that for a sequence of growing arbitrarily large we have for a fixed constant , uniformly in . Assuming this, one intuitively sees that for fixed , as through such a sequence, must be vanishingly small in (2.1). This is the principle by which uniform control of arbitrarily high moments implies pointwise (-a.e.) bounds. (By a “moment” we refer to the -th power of the norm, and not the norm itself. Using the notation of the distribution function defined above, we have
[TABLE]
which are all expressions for how “moments” are defined in different contexts, motivating the terminology.)
Let us see more concretely how this philosophy applies in a model of the discrete setting that is our concern in this paper, by taking counting measure on (denoted by for a set ) and considering integer-valued functions of finite support (that is, vanishing aside from at finitely many integers). We will consider a restricted norm where is the dyadic interval with . Now we will aim to show not that is uniformly bounded but that it does not grow too quickly.
For any and any the following inequality holds:
[TABLE]
Assume that for a sequence of , for all we have
[TABLE]
for some fixed . Then we may conclude that for each such , for all , we have
[TABLE]
In particular, if the sequence of for which we know this grows arbitrarily large, we can for each take sufficiently large that so that the set on the left-hand side of (2.4) must be empty, that is, for all we have . (Somewhat more nuanced arguments are required if the bound in (2.3) is not uniform in ; see the proof of Theorem 1.2 and the comments in §8.1.)
We will adapt this method of moments first to the setting in which our “discrete space” is a set of fields, and the function measures the size of the -torsion subgroup (§3); and later, to the setting in which the discrete space is and counts the number of fields with a specified discriminant (§5). These ideas may be adapted to many other settings, such as other functions mapping fields (ordered by some invariant) to non-negative real numbers; for detailed remarks from the perspective of spaces, which may be helpful in such generalizations, see the appendix in §8.1.
Note that in practice, even if one cannot prove uniform control of arbitrarily high moments, it can sometimes be useful to prove an upper bound for one particular moment, such as the second moment. If an upper bound for an average shows that a certain pointwise bound must hold for almost all elements in a family (that is, for all but an exceptional family of density zero), then proving an appropriate upper bound on a higher moment can force a better upper bound on the cardinality of the possible exceptional family. See Remark 3.2 for an instance of this; this also motivates the interest for Theorem 1.12 and Corollary 1.13 on elliptic curves.
The method of moments has a long history and wide applicability in number theory; we mention two additional settings. First, the method of moments shows that the Lindelöf Hypothesis for the Riemann zeta function would be a consequence of upper bounds for arbitrarily large even moments of along the critical line. Precisely, arguments such as [Tit86, Thm. 13.2] show that the statement
[TABLE]
is equivalent to the statement that for all
[TABLE]
(We remark that in this context of Lebesgue measure on , rather than a discrete counting measure such as we will consider, one requires some additional consideration to ensure that a result holds for all and not just a.e. . For this result on the zeta function, this comes from an integral expression for the analytic continuation, and the resulting notion of the derivative of in the critical strip, so that any large value of would imply that also takes large values on a positive measure neighborhood.)
Second, the principle of the method of moments can be used to deduce the Weil-Deligne bound for character sums of prime moduli from another Riemann Hypothesis, that of -functions of algebraic varieties over finite fields. This area is very deep (see e.g. [Kow10] for an overview). Even given Deligne’s proof [Del74, Del80] of the Weil conjectures (which includes deductions for certain one-variable additive character sums), deducing the desired (square-root cancellation) bounds for complete character sums in higher dimensions is difficult (the subject, for example, of many celebrated works of N. Katz, which fully employ tools of algebraic geometry). In contrast, “elementary” presentations proceed by the philosophy we have encapsulated above as the method of moments. The idea at the heart of this approach is, roughly speaking, that the character sum modulo a prime may be embedded inside a family of character sums over for all . On the one hand, for each the sum may be interpreted as a sum of roots associated to a rational function (the zeta function), which are themselves -powers of the roots associated to the original sum . On the other hand, for each the sum may be interpreted in terms of counting points on a variety over with a prescribed error-term. If for all sufficiently large the error term is then one learns (by uniting the two interpretations) that the -th moment of the roots corresponding to is for all sufficiently large , and hence by the general philosophy of the method of moments, one can deduce that each root associated to is . One finally deduces that itself is . (In this application, one is of course thinking of for the -dimensional case.) There are two general presentations of this style of argument: first, Stepanov’s method, exposed in [Sch76] and [IK04, §11.7]; see in particular Lemma 11.22 of [IK04] for the role of arbitrarily high moments in closing this argument. Second, there is the “method of moments” work of Hooley [Hoo82], whose consequences are summarized in [Bro15, Lemma 3.5], and which also has a very clear, explicitly computed application in the work of [BB09, Lemma 33].
3. Relation to the Cohen-Lenstra-Martinet moment predictions
We start from the perspective of the heuristics of Cohen-Lenstra [CL84] and Cohen-Martinet [CM90]. We will show in this section that a collection of moment asymptotics predicted by these heuristics, and indeed even a collection of much weaker upper bounds, implies Conjecture 1.1. We will furthermore note that another well-known conjecture formulated under the heuristics (the density statement) does not suffice alone to imply Conjecture 1.1.
The Cohen-Lenstra and Cohen-Martinet heuristics predict, for “good” primes , the distribution of class groups and their -torsion subgroups as varies over a family of number fields of fixed degree. For example, the Cohen-Lenstra heuristics for the family of imaginary quadratic fields imply a moment asymptotic for each odd prime : namely that for every positive integer ,
[TABLE]
where is the number of subspaces of the vector space (see, e.g. [Woo15, Lemma 3.2]). For real quadratic fields, the Cohen-Lenstra heuristics imply similar moment asymptotics with different values of the constant, say .
Given a permutation group , for primes , the Cohen-Martinet heuristics imply moment asymptotics analogous to (3.1) for the family of fields with Galois group and fixed signature, again with different values of the constant playing the role of . (This follows from [WW19, Theorem 6.1], after expressing as and then noting each homomorphism corresponds to a module homorphism from to .)
It is worth mentioning the few known asymptotic results that verify cases of (3.1) or its analogues for higher degree fields. First, Davenport and Heilbronn [DH71] proved (3.1) for and , with , as well as its real analogue with . Second, Bhargava [Bha05] proved the conjectured asymptotic for cubic fields and -torsion, for the first moment (). Although not originally included in the Cohen-Lenstra heuristics, Fouvry and Klüners [FK06] proved an analogous result related to -torsion when is quadratic, for all (see Remark 3.3).
There is also an increasing body of recent work toward related asymptotics, though not exactly of the kind mentioned above. For example, recent work of Klys [Kly16] gives certain asymptotic results on -torsion in cyclic cubic fields; see also the recent work on 16-rank in quadratic fields, e.g. Milovic [Mil17], Koymans and Milovic [KM16, KM17], or work of Bhargava and Varma [BV15, BV16] elaborating on [DH71, Bha05]. See also results of Klys [Kly16] on moments of -torsion in cyclic degree fields (conditional on GRH for ) and of Smith [Smi16, Smi17] on the distribution of the -class groups in imaginary quadratic fields (recently extended by Koymans and Pagano [KP18] to -class groups of degree cyclic fields).
3.1. Relation to Theorem 1.2
We will now show that if a moment asymptotic such as (3.1) holds, as long as we assume information is known for arbitrarily high moments, we can deduce pointwise upper bounds on for each field , with no exceptions.
In fact our assumption in Theorem 1.2 is weaker than (3.1), taking the form of an upper bound: we assume the upper bound (1.4) holds for one fixed and all integers . For any the case of the inequality (1.4) is implied by (3.1) or its appropriate analogue, and for all choices of the inequality is weaker than the conjectured Cohen-Lenstra-Martinet asymptotic for . For the cases of dividing , for higher degree fields, in analogy with the quadratic case, we might also guess that for a given permutation group , (1.4) holds for dividing with , and that a proof of this in the case of dividing is probably much more accessible than for good primes (see e.g. [Kly16]).
3.2. Proof of Theorem 1.2
Recall the setting of Theorem 1.2, which we introduced in §1.1. We will use the fact that there exist constants (not necessarily sharp) such that
[TABLE]
for all . In fact this is known for each if we consider the set of all degree extensions of . By Malle’s conjectures [Mal02, Mal04], it is expected that should suffice, and this is known for by a classical computation, by [DH71], by [CDyDO02], [Bha05], and by [Bha10]. For each it is known that for the set of all degree extensions of ,
[TABLE]
for a constant depending only on and a certain absolute constant ( suffices). This is due to Lemke Oliver and Thorne [OT20], and represents the current state of a progression of works with ever-improving bounds: Couveignes [Cou20], Ellenberg and Venkatesh [EV06], Schmidt [Sch95]. Of course for certain more restrictive collections of degree fields, we would expect the sharp value for to be even smaller, but we do not require this specificity here. We will note the dependence on in the initial steps of our argument below, but later use that can be taken to depend only on the degree .
We now prove Theorem 1.2. Let be fixed, and assume that for a fixed , (1.4) is known for every integer . Let be given, and then let denote the “bad” set of fields such that Then (1.4) implies that for every ,
[TABLE]
We deduce that for each , for every ,
[TABLE]
Applying this for some sufficiently large that , we conclude that for all sufficiently large (determined by ),
[TABLE]
so that the set must be empty. Consequently, given any , there exists such that for all fields with , we have . Of course, for all fields with we can apply the trivial bound
[TABLE]
for all . Upon fixing say, this is a bounded constant (depending on ). Combining these two results, we conclude that for the given , for all ,
[TABLE]
Since may be taken arbitrarily small in this argument, this concludes the proof of Theorem 1.2.
3.3. Further remarks
Remark 3.1* (Equivalent formulations).*
This proof may clearly be adapted to functions other than , or in settings where is ordered by invariants other than the discriminant. Also, note that in the hypothesis of Theorem 1.2, we have not ruled out the possibility that is large. In fact, the statement that (1.4) holds (for all ) for a particular fixed and an infinite sequence of arbitrarily large is equivalent to the statement that (1.4) holds (for all ) for with any , and all real . We provide details on this in Remark 8.1 in the appendix in §8.1.
Remark 3.2* (Density zero exceptions).*
If one only knows (1.4) for one value of , one can still conclude that an upper bound holds for , except for certain possible exceptional fields. To be precise, let be fixed. Suppose that for a single fixed value , (1.4) is known for every . Then for each , one can deduce that holds for every field except for at most a subset of density zero. To see this, we argue as above to show that for any of our choice, for all , and for that fixed ,
[TABLE]
To remove the dyadic restriction on the discriminant, we sum over at most dyadic ranges. For the purposes of this discussion we suppose that can be expressed as a power of , and then we break the discussion into two cases: when is expressed as a power of , the exponent is (i) non-negative; (ii) negative. In case (i), after summing over the dyadic ranges we can conclude that for all . Consequently there exists sufficiently close to that has a negative exponent on the right-hand side. Then has density zero in . In case (ii), then there exists a threshold such that for , the set on the left-hand side of (3.4) is empty. Then there are only finitely many fields in with , so that certainly these fields are density zero in .
Remark 3.3* (Illustrative case).*
We note a case in which moment bounds sufficient for the hypotheses of Theorem 1.2 have been proved: Fouvry and Klüners have proved that for defined to be the family of real (respectively imaginary) quadratic fields with fundamental discriminants, for every integer ,
[TABLE]
as , for a specific constant . (We use additive notation for the finite abelian group , so that we write where Fouvry and Klüners write ; see [FK06, Conj. 2] and Theorems 6–11 therein.) By Theorem 1.2, (3.5) shows that for all . From this it follows that for all . (Indeed, . Within the first factor, , which we have just bounded. Within the second factor, by the structure theorem of finite abelian groups, , which is bounded by (1.3).) Although this is an illustration of how Theorem 1.2 can be applied, the result for -torsion holds trivially for group-theoretic reasons once (1.3) is known; see §7.1.
Remark 3.4* (Density statements).*
It is worth pointing out that aside from moment asymptotics, there is another type of asymptotic, a density statement, which also follows from the Cohen-Lenstra and Cohen-Martinet heuristics. For example, the density statement conjectured by the Cohen-Lenstra heuristics for imaginary quadratic fields is that for every odd prime and finite abelian -group ,
[TABLE]
where for any abelian group we denote by the Sylow -subgroup of . (For , Smith [Smi17] has proved that as varies over all imaginary quadratic fields, the distribution of obeys the heuristic expectation (3.6) for every finite abelian 2-group ; see also the extension [KP18].) In fact the Cohen-Lenstra and Cohen-Martinet conjectures make claims about averages over class groups of any “reasonable” real-valued function of groups, where reasonable is not precisely defined, but is meant to include both characteristic functions as in (3.6), and functions like that are averaged in our moments, e.g. (3.1).
We have shown that moments such as (3.1) that are predicted by the Cohen-Lenstra-Martinet heuristics imply Conjecture 1.1. In contrast, it is easy to see that density statements such as (3.6) do not formally imply Conjecture 1.1, unless some additional information is used as input. For suppose we had a function from number fields to finite abelian groups such that for every odd prime and finite abelian -group ,
[TABLE]
Then such averages would also hold if we replaced by any function that only differs on a set of number fields that is of density zero in . In particular, while the densities above still held for , we could impose for infinitely many .
4. Relation to the discriminant multiplicity conjecture
Our next goal is to make precise the relationship of the discriminant multiplicity conjecture (Conjecture 1.4) to the -torsion conjecture (Conjecture 1.1).
4.1. Context of the discriminant multiplicity conjecture
Recall the definition of Property (Property 1.5). The discriminant multiplicity conjecture posits that should hold for each . (In the other direction, Ellenberg and Venkatesh [EV05, p. 164] have noted that genus theory shows that the number of degree extensions with a fixed Galois group and fixed discriminant can be as large as .)
For the best-known results are as follows. For cubic fields, is known, by [EV07, Cor. 3.7]. (That corollary in fact states that for all quadratic fields ; this implies that by work of Hasse [Has30]; see also Remark 4.1.)
For quartic fields, holds. To see this, let us momentarily denote by the veracity of Property 1.5 restricted to those fields of degree and Galois group of the Galois closure isomorphic to . Then is due to [Klü06b], is due to [PTBW20, Prop. 2.5], follows from class field theory, as does (see e.g. techniques in [Wri89] also illustrated in [PTBW20, Prop. 2.1]), and finally holds; we include a brief proof of this last fact in an appendix in §8.2.
For quintic fields, is deduced in [PTBW20, Prop. 2.4] as an immediate consequence of a count for -fields with a power-saving error term (in particular the version in [EPW17, Thm. 2.4], which builds on [ST14, Thm. 1] and [Bha10, Thm. 1]).
At present, for , nothing better than the bound trivially available from (3.3) is known for . For , if one further restricts to counting only those degree fields with and with Galois group of the Galois closure for a certain fixed transitive subgroup , then in some cases better results are known; see [PTBW20, §2].
Conjecture 1.4 has been known for some time to be closely connected to questions about -torsion in class groups, for primes . For example, Duke [Duk95] showed that quartic fields of fixed discriminant ( prime) can be explicitly classified by odd octahedral Galois representations of conductor , and the number of such fields can be expressed as in [Hei71] as an appropriate average of the number of 2-torsion elements in the class groups of cubic number fields of discriminant . More generally, in [EV05, p. 164], Ellenberg and Venkatesh stated that Conjecture 1.4 implies Conjecture 1.1 in the case of prime; these two ideas are also implicitly linked in the exposition of [Duk98].
4.2. Proof of Theorem 1.7
Let be a degree extension with Hilbert class field , so that Let be a fixed prime and write additively, so that we have and a corresponding extension given by the fixed field .
H_{K}$$L$$K$$\mathbb{Q}$$M$$\mathrm{Cl}_{K}$$n$$\mathrm{Cl}_{K}[\ell]\simeq\mathrm{Cl}_{K}/\ell\mathrm{Cl}_{K}$$\ell
Suppose . Consider for each surjection the corresponding extension with of degree . There are such extensions , each of which is degree over and naturally satisfies
[TABLE]
But since lives inside the unramified extension , the first factor on the right-hand side is 1, so that . Now supposing we have assumed Property holds, we know that for every there exists a constant such that the number of degree extensions of with discriminant precisely is . Then we can conclude that
[TABLE]
Thus for this fixed pair , Property holds with , proving our claim.
Remark 4.1*.*
For an odd prime, there is a partial converse to Theorem 1.7. Let denote the veracity of Property 1.5 for those degree fields with Galois group of the Galois closure isomorphic to , the dihedral group of elements (symmetries of a regular -gon). Then for every odd prime , for every , holds if holds. For this is the conclusion of Hasse [Has30], and in particular shows that the upper bound for -torsion in quadratic fields controls the number of cubic extensions of . In general, for this deduction see Klüners [Klü06a, Lemma 2.3], which applies to degree -extensions of any fixed number field. Recently [CT16, Thm. 1.1] and [FW18, Cor. 1.6] have used this relation to capitalize on the recent improvements of [EPW17, PTBW20] on -torsion in quadratic fields in order to bound from above the number of degree -fields of bounded discriminant.
5. Relation to a generalized Malle conjecture
In this section we recall the formal statement of a generalized Malle conjecture as in Ellenberg and Venkatesh [EV05], and state how via the method of moments it implies the discriminant multiplicity conjecture (Conjecture 1.4). Counting number fields of bounded discriminant is an average version of the pointwise bound conjectured in the discriminant multiplicity conjecture. Of course, if is known then we may immediately deduce an upper bound for the average. At first glance, it is surprising that an implication in the other direction also exists; this would seem to contradict the philosophy of §2, which relied on bounding arbitrarily high moments, and not just an average, in order to deduce that a pointwise bound holds at all points in a discrete space. The strategy of [EV05] is that by converting -th moments into averages of -products, one can deduce pointwise bounds only under assumptions on averages.
5.1. Context of the Malle conjecture
Recall that it is conjectured that for every , if we define to be the set of fields of degree (within a fixed closure ), then
[TABLE]
for a particular constant (this is recorded for example as a “folk conjecture” in [EV05, Conj. 1.1]). This is easy to show for (in which case one is effectively counting square-free numbers, see e.g. the appendix in [EPW17]). It has been proved in deep work of Davenport-Heilbronn [DH71] for ; Cohen, Diaz y Diaz, and Olivier [CDyDO02] and Bhargava [Bha05] for (the and non- cases, respectively); and Bhargava [Bha10] for . For any degree , such an asymptotic, or even an upper bound better than (3.3), is not known. (Lower bounds are also difficult; [BSW16] holds the current record .)
If we further define to restrict to those fields in with , then Malle [Mal02], [Mal04] has presented heuristics for upper and lower bounds
[TABLE]
as with . (Here the index of an element is defined as where is the number of orbits of acting on a set of elements.) These ideas can also be adapted, at least heuristically according to the so-called Malle-Bhargava principle [Woo16, §10], to take into account finitely or infinitely many local conditions. Proving that this principle holds in appropriate situations is currently of central interest in number theory.
5.2. Ellenberg and Venkatesh’s moment argument
We first recall, somewhat informally, how a standard method of moments argument would approach the discriminant multiplicity conjecture. Let us consider (2.2) and (2.4), adapted to the setting where for each , denotes the number of fields such that . Then after adapting (2.2) to this setting, as long as we can prove that for a sequence of arbitrarily large we have for all that
[TABLE]
for some fixed , we will be able to conclude similarly to (2.4) that for all ,
[TABLE]
Then no matter the fixed value of , and for any arbitrarily small, by applying this with sufficiently large , we could deduce that for sufficiently large the set on the left-hand side is empty. From this we could deduce that there are at most fields with , as desired. A significant obstacle to this approach is that in general, bounding even the first moment
[TABLE]
remains completely out of reach at present (e.g. for with ), so that proving (5.2) may seem an unrealistic starting point.
This is where the ideas of Ellenberg and Venkatesh [EV05, Remark 4.7, Prop. 4.8] play a role, by cleverly translating the -th moment estimate (5.2) into merely an average estimate, but for a different set of fields than . Consequently, they show that a generalized version of the average upper bound in (5.1) would imply Conjecture 1.4.
The formulation of Ellenberg and Venkatesh is in terms of a field invariant called an -discriminant, with a rational class function (not to be confused with the function used above). Precisely, if is a fixed transitive subgroup of , then a map from the set of nontrivial conjugacy classes of to is said to be a rational class function if it is invariant under the -action and has the property that for , if and only if . One can define a corresponding -discriminant of any Galois extension with Galois group . Precisely, for any (so that certainly is at most tamely ramified in and the inertia group at is cyclic), let be the image of a generator of tame inertia at . Then the -discriminant may be defined by
[TABLE]
In particular, if , then is the prime-to- part of the standard absolute discriminant of any of the conjugate degree extensions with Galois closure , corresponding via Galois theory to the element stabilizers in .
Ellenberg and Venkatesh ask whether for such -discriminants, an appropriate analogue to (5.1) holds. Given , Ellenberg and Venkatesh define for a rational class function the invariant
[TABLE]
They then propose [EV05, Ques. 4.3, Remark 4.7] that if counts Galois extensions of with Galois group and -discriminant at most , then for every ,
[TABLE]
(In fact they propose a more refined asymptotic, but this upper bound version suffices for our considerations.)
Under these definitions, we can see that (5.3) suffices to imply Conjecture 1.4, and hence Conjecture 1.1.
Theorem B** ([EV05, Prop. 4.8]).**
Given any group , define on the rational class function that is identically 1 away from the identity, that is for any choice of conjugacy classes in that are not all trivial. If a generalized Malle conjecture (5.3) holds for all , for this choice of , then Conjecture 1.4 holds.
We merely sketch the ideas, directly following [EV05, Prop. 4.8]. Since isomorphism classes of degree -fields are in finite-to-one correspondence (that is, -to-one, where depends only on ) with isomorphism classes of degree Galois -fields, to verify Conjecture 1.4 it suffices to prove that for any fixed Galois group , the number of Galois extensions with discriminant is for every . The proof hinges on the fact that for as chosen in the theorem statement, the -discriminant of a field is of the shape
[TABLE]
in which the power of the prime is always 1. Moreover, for the particular choice of in Theorem B, we have for all ; this fact will play a key role.
For each fixed integer let denote the number of Galois fields , each with Galois group and each with ; our goal is to show that . For any fixed we can generate on the order of composite fields each with Galois group , and each with -discriminant , with as defined as above.
Now suppose that there exists some such that for a sequence of arbitrarily large , we have . Then for a sequence of arbitrarily large we would obtain at least elements in . Comparing this to the conjectured statement (5.3) in the case of the group , we see that we must have , but by construction, we have for all . Since could be taken arbitrarily large, we would conclude that must be arbitrarily small, implying Property must hold.
6. Counting elliptic curves
6.1. Context of counting elliptic curves
Given a positive integer , let denote the number of isogeny classes of elliptic curves over with conductor . Let us clarify the relation between and the number of isomorphism classes of elliptic curves over with conductor . As used in [DK00, p. 12], given any elliptic curve , at most 8 -isomorphism classes are -isogenous to ; thus (see [Sil09, Ch.IX, Example 6.4] for this fact). Thus an analogous conjecture holds for , and we may proceed by considering either or ; in particular the statement of our results will hold for both and , up to a constant factor.
As we recalled in Conjecture 1.11, Brumer and Silverman [BS96, Conj. 3] conjectured that for every , for all . Indeed, Brumer and Silverman make a more precise conjecture: that there exist absolute constants such that for any finite set of primes, the number of elliptic curves with good reduction outside of is at most , where .
Remark 6.1*.*
Correspondingly, Brumer and Silverman’s original formulation of Conjecture 1.1 is the more precise question of whether for every field of degree one has
[TABLE]
See also [BL17, Conj. 3.3.A, Conj. 3.3.B, Thm. 7.5] for other possible specific rates of growth, and their relevance for counting the number of conjugacy classes of non-uniform lattices in semisimple Lie groups.
Upper bounds for follow from bounding -torsion in quadratic fields. Define for every the quantity
[TABLE]
in which denotes the family of quadratic fields (real or imaginary) with absolute discriminant at most (in absolute value). Then Brumer and Silverman showed in [BS96, p. 99-100] that for every ,
[TABLE]
for every . This was then sharpened in the proof of [HV06, Thm. 4.5] to
[TABLE]
for every , where and hence , so that implies . Originally the only bound available to Brumer and Silverman was the trivial bound via (1.1); now that is known by [EV07], it follows that
[TABLE]
for all . This is currently the best result known toward Conjecture 1.11.
In addition, Brumer and Silverman have proved that Conjecture 1.11 is true under the assumption of the Generalized Riemann Hypothesis and a weak version of the Birch-Swinnerton–Dyer Conjecture ([BS96, Thm. 4]). This is an interesting counterpart to the situation for bounding -torsion, for which it appears that GRH implies partial results, but stops far short of proving Conjecture 1.1 in full (see §7.4).
From Theorem 1.7 and (6.2), we make a simple observation, recalling the notation of Property 1.5.
Theorem 6.2**.**
If Property holds, then
[TABLE]
holds for all . In particular, if it is known that for every there are at most sextic fields of discriminant , then Conjecture 1.11 holds.
6.2. Average results
One can also ask about an average or asymptotic conjecture related to Conjecture 1.11. Here we distinguish briefly between ordering elliptic curves by discriminant or by conductor. We first consider ordering by discriminant. Brumer and McGuinness [BM90, §5] have conjectured that the number of elliptic curves over whose minimal discriminant has absolute value less than is asymptotically of size for an explicitly predicted constant (see also Watkins [Wat08, Conj. 2.1]). Each elliptic curve over in its Weierstrass form with integers has discriminant with
[TABLE]
(Here the discriminant and are the standard invariants as in [Sil09, p. 42 Ch. III §1].) Very roughly speaking, we may think of the numerology as suggesting that for fixed, most of the solutions to the equation (6.3) must come from and . Counting elliptic curves ordered by discriminant, Fouvry, Nair and Tenenbaum [FNT92] proved the weaker upper bound for every and a lower bound of the order of magnitude . Any upper bound that is would imply that the integers that are discriminants of elliptic curves are zero-density among all integers (a difficult open problem; see [You15]).
We next consider ordering by conductor . Recall that the same primes divide the discriminant and the conductor, and the conductor is a divisor of the discriminant; the precise relationship between the two is related to Szpiro’s conjecture [Szp90] (for example predicting that ). Watkins [Wat08, Heuristic 4.1] adapted the argument of Brumer-McGuinness [BM90, §5] by analyzing heuristically how often a large power of a prime divides the discriminant, and proposed the following expectation:
Conjecture 6.3**.**
Let denote the number of isomorphism classes of elliptic curves of conductor . There exists a constant such that
[TABLE]
as .
Duke and Kowalski [DK00, Prop. 1] have proved the weaker result that for ,
[TABLE]
See also [Won01a, Won01b], which further proves a lower bound . All these works [DK00, FNT92, Won01a] argue by applying the asymptotic of Davenport and Heilbronn [DH71] for the average of .
Remark 6.4*.*
It is worth noting that an argument truly is needed to deduce (6.4) or our theorem on moments. Armed only with (6.1), the statement we can trivially deduce is that
[TABLE]
Since is a sup-norm, even one violation of a pointwise upper bound would prevent us from concluding that the expression above is bounded by Similar considerations apply if we use (6.2).
6.3. Moment results: proof of Theorem 1.12
The proof of Theorem 1.12 builds on the arguments in [BS96], [DK00] and [HV06]; we begin by recalling the set-up of [BS96]. An elliptic curve of conductor has good reduction outside of the primes dividing , and so it suffices to count the number of elliptic curves with good reduction outside of the set S_{q}=\{p|q,\text{p prime}\}\cup\{2,3\}, and for any fixed we write
[TABLE]
Let us fix and the corresponding set . Then any elliptic curve counted by has
[TABLE]
for integers with being -th power free, and such that is an -integral point on the elliptic curve defined by
[TABLE]
Let us denote by the set of values that arise in this manner as ranges over . Furthermore, given any -integral point on one such , let us denote by the set of elliptic curves counted by that give rise to the point by following the procedure above. Brumer and Silverman’s argument (see also [DK00]) shows that
[TABLE]
in which varies over the -integral points on . For each , Brumer and Silverman show that for every (see [BS96, p. 100], as usual recalling that ). Moreover, they show that for each such , the number of -integral points on is for every , where is the quadratic field . (See the line leading to [BS96, Eqn. (4)]; in their equation we note that , so that for any constant we have for all .) More recently, due to improved counts for integral points on a fixed Mordell elliptic curve (such as ), we can improve this by [HV06, Thm. 4.5] to write that the number of -integral points on is
[TABLE]
for any , where is a numerical constant defined explicitly as in [HV06, Thm. 3.8]. We note that is strictly smaller than 1, so that this is advantageous.
Thus we may conclude that for every ,
[TABLE]
Now, as in the argument in [DK00, §3], for each fixed we will pass from a sum over to a sum over the set of (distinct) corresponding square-free kernels ; we set . For any elliptic curve associated to , so that the discriminant relation (6.5) holds, we see from (6.5) and the fact that the corresponding square-free kernel is square-free that and , where
[TABLE]
In general, denoting by the square-free kernel of an integer, we have for any that
[TABLE]
for all and for all ; see e.g. [HBP17, Lemma 4.4]. Since is -th power free, we may apply this in our setting with , say. Thus there are at most such values corresponding to each .
Thus we have shown that
[TABLE]
where we have used the fact that for any . On the right-hand side, we initially only consider square-free , but we can enlarge the right-hand side by considering any such divisors . Applying Hölder’s inequality to the right-hand side, this becomes
[TABLE]
since for all integers , the divisor function satisfies for all . Note that we may trivially enlarge the right-most quantity to
[TABLE]
We apply the following elementary lemma.
Lemma 6.5**.**
For any sequence of non-negative real numbers, define . Suppose it is known that for all we have for some . Then for all ,
[TABLE]
in which if and if .
Proof.
First note that (using positivity)
[TABLE]
Then by partial summation and the assumption on we have
[TABLE]
which suffices to prove the lemma. ∎
We apply the lemma in (6.6) with and the exponent assumed to hold in (1.6) for the value . Note that for any , since and for all fields . We may conclude from (6.6) that
[TABLE]
for all . This suffices to prove the theorem, upon noting that
[TABLE]
Corollary 1.13 follows from Theorem 1.12 immediately, upon applying the results of [HBP17, Cor. 1.4]. To situate the strength of Corollary 1.13, we briefly observe that for any such that , by combining (6.4) with the pointwise bound in (1.5),
[TABLE]
For example, in the case the exponent (ignoring ) in (6.7) is which is larger than the exponent obtained by applying Theorem 1.12, and applying to one factor and using Davenport-Heilbronn to bound the remaining average.
As another example, in the case , (6.7) gives the exponent while Corollary 1.13 gives the exponent .
7. Known results toward Conjecture 1.1, and relation to GRH
We have focused thus far on heuristics to support Conjecture 1.1. To conclude, we provide an overview of recent progress toward the conjecture, focusing first on results that hold for all fields of a given degree. Then we focus on a relationship to the Generalized Riemann Hypothesis. We will use the notation defined in Property 1.6.
7.1. Composite
First we remark that while we have stated Conjecture 1.1 only for primes , we expect it to hold for all integers . Indeed, let be a number field. Since is a finite abelian group, it is isomorphic to
[TABLE]
for distinct primes , and cyclic groups . For any prime , letting be the number of cyclic groups in this decomposition corresponding to , then . (If then this remains true, with and .)
Furthermore, by the above decomposition, is multiplicative as a function of , that is, for integers , Consequently if and and are known then holds. This is of course only interesting if .
Finally, for any prime , we have for any integer . (If we can say this trivially holds, since both sides are 1.) Indeed, more generally, for any , Thus if is known for some , then holds for all . Again, this is only interesting if . As a consequence, if for a given degree , Conjecture 1.1 holds for a prime , then for all , for all .
7.2. Pointwise results, prime and prime power
We remarked that Gauss proved ; from the discussion above, follows for all . For and , initial progress occurred in [HV06, Pie05, Pie06] and the current record of is held by [EV07], which also proved and for a small (Ellenberg, personal communication, computed one can take if is non-). Bhargava et al. [BST*+*17] have established for and where , the first results to hold for all fields of arbitrarily high degree.
7.3. Pointwise results, composite
By multiplicativity, combining Gauss’s work with thus implies for all .
7.4. Results conditional on GRH
Much recent progress has relied on finding sufficiently many “small” rational primes that split completely within , based on an insight credited to K. Soundararajan and P. Michel, and codified in work of Helfgott and Venkatesh [HV06] and Ellenberg and Venkatesh [EV07], from which we quote the following:
Theorem C** ([EV07, Lemma 2.3]).**
If a field of degree simultaneously has the properties that
- (1)
the minimum multiplicative Weil height of a generating element of is large, say
[TABLE] 2. (2)
and rational primes split completely in ,
then , for every .
The idea underlying this theorem can be most easily seen in the case of an imaginary quadratic field of discriminant and an odd prime. Letting , we of course have
[TABLE]
so that to show that is small it suffices to show that has many cosets in . Suppose that are distinct rational primes with that split in as , . If then it follows that , so that is a principal ideal, say for some rational integers . Upon taking norms, this shows that
[TABLE]
for some rational integers . Now if we had specified to begin with that , such a relation could not hold (since it would impose and cannot be a square of an integer), and we must have that and represent different cosets of .
Now suppose we have distinct rational primes with , each of which splits in . By the above argument, the cosets must all be distinct for , so that by (7.2), for every ,
[TABLE]
The fully general case of considering all degree fields requires much more sophisticated machinery; see [EV07].
How can we apply Theorem C in practice? Regarding the parameter in (7.1), the lower bound is known for all degree fields (see [EV07, Lemma 2.2] or [Sil84, Thm. 1]). Although the Chebotarev density theorem shows that a positive proportion of primes split completely in , it is notoriously difficult to find small split primes (i.e. to show , which is expected to be true). In general this can only be done effectively within a certain field by assuming GRH for the Dedekind zeta function associated to the Galois closure , which implies an effective version of the Chebotarev density theorem, with a good explicit error term. Taken together, these considerations lead to Ellenberg and Venkatesh’s result in [EV07] that holds for all if GRH is assumed; we will call this GRH-quality savings. This opens several avenues for possible progress, such as: first, try to remove the dependence on GRH, and second, try to improve the benchmark of GRH-quality savings, possibly by showing that can be taken to be larger in (7.1).
7.5. Average and “almost all” results
Recent work has been able to obtain savings on as strong as the GRH-quality savings described above (or stronger), but without assuming GRH, at the cost of showing that it holds only for almost all fields within a certain family. This includes remarks of Soundararajan [Sou00] on imaginary quadratic fields, and also recent work of Heath-Brown and the first author [HBP17]. The latter work even does better than GRH-quality savings, by proving for each prime the unconditional bound for all but a possible density zero family of imaginary quadratic fields. This is achieved by nontrivial use of averaging over the discriminant.
For each degree , Ellenberg and the first and third authors [EPW17] developed a new combination of field-counting and sieving to show that GRH-quality savings on holds unconditionally for all but a possible density zero exceptional family of degree extensions of (non- in the case ). This work relied in particular on precise counts for fields with certain properties, such as a count for fields in which a fixed prime splits completely, where the count has a power-saving error term with explicit dependence on the prime. The strategy of [EPW17] has also been adapted in work of Frei and Widmer [FW17] to prove results on average over the special family of totally ramified cyclic extensions of any fixed number field. In general, for degrees , methods do not yet exist to count all number fields of degree precisely enough for the strategies of [EPW17] to be carried out.
Another approach is to tackle the effective Chebotarev density theorem directly, without assuming GRH. This has been carried out by the authors in [PTBW20], which proves a new effective Chebotarev density theorem valid for almost all members of certain families of fields, and consequently proves GRH-quality savings hold for -torsion, for all , in almost all such fields. (The families of fields are too numerous to describe here, but include for example: totally ramified cyclic extensions of , in which case the result is unconditional; degree -fields with squarefree discriminant, conditional for on the strong Artin conjecture and certain counts for number fields; degree -fields, conditional on the strong Artin conjecture.) We note that this approach has recently been adapted by An [An18] to certain families of -quartic fields. We note that an interesting contrast of [PTBW20] to [EPW17] is that while it also depends heavily on counting number fields, it only requires rough counts. That is, given a family of fields, at a key step in [PTBW20] it suffices that one can show that at most fields in the family have any fixed discriminant , and at least fields in the family have bounded discriminant , where . The fact that such rough counts suffice allows [PTBW20] to prove results for many new families of fields. See also Remark 1.9 on the surprising efficiency of this method.
As mentioned above, the bound for the exponent in the expression (7.1) in property (1) is uniformly true for all degree extensions. For fields in which can be taken to be larger, one could also increase the savings in the -torsion count by increasing in property (2). This interesting strategy for improving the very notion of “GRH-quality savings” has been proposed by Ellenberg [Ell08] and taken up in recent work of Widmer [Wid18]. One underlying question is which families can admit an improved uniform lower bound for , or an improved lower bound on for almost all fields in the family. Very recently Frei and Widmer [FW18] have strengthened this approach, and their ideas combined with the methods of [EPW17, PTBW20] improve the average upper bounds in certain results of those papers. For example, they can improve the relevant exponent in [EPW17] for to ; see [FW18, Thm. 1.2].
The above results apply to average or “almost all” results. But if we turn to pointwise results, is it even true that all fields of degree should have strictly larger than ? In some restricted families of degree fields, no such improvement is possible; see [FW17]. Such considerations of enlarging relate also to conjectured uniform upper bounds such as , suggested by Ruppert [Rup98] (and proved to hold for “almost all” fields in many families of fields, by work of the authors [PTBW20]). If true, this restriction on would imply a limit for how far the “small split prime approach” can go in bounding -torsion (e.g. the best possible would be ), without additional information or new ideas.
7.6. Higher moments
Theorem 1.2 makes a clear case for studying higher moments of -torsion over families of fields. The first paper to do so was by Heath-Brown and the first author [HBP17], which proved nontrivial upper bounds for -th moments of -torsion in imaginary quadratic fields for odd primes . Very recent work of Frei and Widmer [FW18] now makes progress on upper bounds for -th moments in certain other settings, e.g. for -torsion in (imaginary and real) quadratic fields, or cyclic cubic fields, by simultaneously incorporating ideas for improving (on average) the lower bound in (7.1) into the settings of certain methods in [EPW17, PTBW20].
7.7. Asymptotics
For recent work on asymptotics, see §3.
8. Appendices
8.1. Further remarks on moment bounds in a general setting
In the context of Theorem 1.2 we argued explicitly using the function mapping fields (ordered by discriminant) to positive real numbers. This was to make the argument clear in a setting where there could be more than one field with a fixed discriminant, and where the underlying finite set changes as grows. We include further general remarks here, which clarify whether one needs uniformity in the constants appearing in the moments, as we anticipate there will be further applications for this perspective.
Let be a (-finite) measure space as before and consider the spaces for and . If then for all ; indeed Hölder’s inequality shows that
[TABLE]
In particular, if then for all with
[TABLE]
We are interested in the converse direction. Let us make the strong assumption that there exist constants such that for an infinite sequence of arbitrarily large there exists a constant such that for all ,
[TABLE]
Then we claim and moreover .
Indeed, to show we must show there exists such that . By Chebyshev’s inequality (2.1) and our assumption (8.2), for every ,
[TABLE]
for an infinite sequence of arbitrarily large . Let us choose sufficiently large such that . Then given any , we may take sufficiently large (depending on ) that
[TABLE]
Thus we may conclude that , with . Consequently, (8.1) holds for all . In particular, this shows that if the apparently weaker estimate (8.2) holds for arbitrarily large , this implies the apparently stronger estimate (8.1); that is to say, assuming that (8.2) holds for some and an infinite sequence of arbitrarily large is equivalent to assuming it holds for and all .
These ideas apply to the case where and is counting measure, so that . They can also be adapted to the setting in which we are studying moments of a function mapping fields (ordered by discriminant, for example) to positive real numbers. Let be fixed. If it is known that there is some and some for a uniform constant such that
[TABLE]
holds for a sequence of arbitrarily large , then this holds with for all , and indeed these two statements are equivalent to each other, and equivalent to the statement that .
Above, we made the assumption in (8.2) that there exists a uniform upper bound such that for all in the sequence of arbitrarily large . (Without this assumption, the norms can blow up and the claim need not hold.) However, the reader may note that in our use of (1.4) in Theorem 1.2 we made no such assumption of an upper bound on the constant being uniform in . Indeed, we do not require such an assumption because in Theorem 1.2 we prove not a uniform upper bound but merely show the growth with respect to is slow as .
In the language of the model setting above, let , for and let be counting measure. Let be given. Assume that there is some non-decreasing function such that for all . Also assume that there exists a constant and an infinite sequence of arbitrarily large with corresponding constants such that for all ,
[TABLE]
Then for any fixed , for every ,
[TABLE]
Thus for any fixed , regardless of how big each constant is, we may take a fixed sufficiently large (determined only by ) that , and consequently for sufficiently large with respect to . The set of constants was determined by the function , so we will denote this dependence as a dependence on . This means that there exists some constant such that for , the set is empty. In other words, for any , the only such that must have and hence , which is a constant depending only on . In total, we have proved that given any there exists a constant such that for all , (it suffices to take ). This argument, adapted to families of fields, underlies Theorem 1.2.
Remark 8.1*.*
The above discussion also verifies our earlier remark that the following statements are equivalent: (i) (1.4) holds (for all ) for a particular fixed and an infinite sequence of arbitrarily large ; (ii) (1.4) holds (for all ) for all with and all integers . Certainly the statement (ii) implies statement (i). In the other direction, the proof we gave for Theorem 1.2 (with ranging over all integers ) adapts easily to the case where ranges over an infinite sequence of arbitrarily large , and by this method we can prove that statement (i) implies that for every , holds uniformly for . Averaging this pointwise upper bound then implies statement (ii), completing the equivalence.
8.2. Counting quartic -fields with fixed discriminant
We briefly prove that property holds; that is, for every and for every there are at most quartic -fields of discriminant . We follow [Bai80, §4], except we fix a discriminant instead of considering all discriminants up to . Any quartic -field is a quadratic extension of a quadratic field . We have that corresponds to a quadratic ray class character for of conductor with finite part . The form of such characters has been determined in [Bai80, Lemma 17], and each character is a product of a character on , a character on the class group of , and a character on signature (see [Bai80][Eqn. (4)]). There are at most 4 characters of signature, and characters of the class group, which is for every by genus theory (1.3). It follows from the proof of [Bai80, Lemma 18] that given any , there are at most ideals and possible characters on with . Note . Thus, given , in order to count the quartic -fields of discriminant , we sum for each , the number of quartic -fields that contain the quadratic field of discriminant , and we find there are at most
[TABLE]
quartic -fields of discriminant .
Acknowledgements
The authors thank J. Ellenberg, J. Wang, B. Alberts, and the referee for insightful comments that improved and clarified the content and exposition. Pierce has been partially supported by NSF CAREER grant DMS-1652173, a Sloan Research Fellowship, a Birman Fellowship, and as a von Neumann Fellow at the Institute for Advanced Study, by the Charles Simonyi Endowment and NSF Grant No. 1128155. Pierce thanks the Hausdorff Center for Mathematics for hospitality during visits as a Bonn Research Fellow. Turnage-Butterbaugh is partially supported by NSF DMS-1902193 and NSF DMS-1854398 FRG, and thanks the Mathematical Sciences Research Institute (NSF DMS-1440140) and the Max Planck Institute for Mathematics for support and hospitality during portions of this work. Wood was partially supported by an American Institute of Mathematics Five-Year Fellowship, a Packard Fellowship for Science and Engineering, a Sloan Research Fellowship, National Science Foundation grant DMS-1301690 and CAREER grant DMS-1652116, and a Vilas Early Career Investigator Award. Wood thanks Princeton University for its hospitality during Fall 2018.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Alb 18] B. Alberts. The weak form of malle’s conjecture and solvable groups. ar Xiv:1804.11318 , 2018.
- 2[An 18] C. An. ℓ ℓ \ell -torsion in class groups of certain families of D 4 subscript 𝐷 4 {D}_{4} -quartic fields. ar Xiv:1808.02148 , 2018.
- 3[Bai 80] A. M. Baily. On the density of discriminants of quartic fields. J. Reine Angew. Math. , 315:190–210, 1980.
- 4[BB 09] E. Bombieri and J. Bourgain. On Kahane’s ultraflat polynomials. J. Eur. Math. Soc. , 11:627–703, 2009.
- 5[Bha 05] M. Bhargava. The density of discriminants of quartic rings and fields. Annals of Mathematics , 162(2):1031–1063, September 2005.
- 6[Bha 10] M. Bhargava. The density of discriminants of quintic rings and fields. Annals of Mathematics , 172(3):1559–1591, October 2010.
- 7[BL 17] M. Belolipetsky and A. Lubotzky. Counting non-uniform lattices. ar Xiv:1706.02180 , 2017.
- 8[BM 90] A. Brumer and O. Mc Guinness. The behavior of the Mordell-Weil group of elliptic curves. Bull. Amer. Math. Soc. (N.S.) , 23(2):375–382, 1990.
