
TL;DR
This paper develops new upper bounds for counting Galois extensions of number fields with fixed degree and bounded discriminant, using geometry of numbers and invariant theory, advancing understanding of number field distribution.
Contribution
It introduces a novel approach combining geometry of numbers and invariant theory to bound the number of Galois extensions with fixed degree and discriminant.
Findings
Provides explicit upper bounds for Galois extensions with given parameters.
Extends previous methods to include specified Galois closure.
Enhances understanding of the distribution of number field extensions.
Abstract
The problem of analyzing the number of number field extensions with bounded (relative) discriminant has been the subject of renewed interest in recent years, with significant advances made by Schmidt, Ellenberg-Venkatesh, Bhargava, Bhargava-Shankar-Wang, and others. In this paper, we use the geometry of numbers and invariant theory of finite groups, in a manner similar to Ellenberg and Venkatesh, to give an upper bound on the number of extensions with fixed degree, bounded relative discriminant, and specified Galois closure.
| Proper transitive subgroups of | |||||||
|---|---|---|---|---|---|---|---|
| # | Order | Isom. to | Subfield? | Invariant Degrees | Result | Malle | Bhargava |
| 5T1 | 5* | none | 1,2,2,3,5 | ||||
| 5T2 | 10 | none | 1,2,2,3,5 | ||||
| 5T3 | 20 | none | 1,2,3,4,5 | ||||
| 5T4 | 60 | none | 1,2,3,4,5 | ||||
| Proper transitive subgroups of | |||||||
|---|---|---|---|---|---|---|---|
| # | Ord | Isom. to | Subfield? | Invariant Degrees | Result | Malle | Schmidt |
| 6T1 | 6* | Deg. 3 | 1,2,2,2,3,6 | ||||
| 6T2 | 6* | Deg. 3 | 1,2,2,2,3,3 | ||||
| 6T3 | 12 | Deg. 3 | 1,2,2,2,3,6 | ||||
| 6T4 | 12 | Deg. 3 | 1,2,2,3,3,4 | ||||
| 6T5 | 18 | Deg. 2 | 1,2,2,3,3,6 | ||||
| 6T6 | 24 | Deg. 3 | 1,2,2,3,4,6 | ||||
| 6T7 | 24 | Deg. 3 | 1,2,2,3,3,4 | ||||
| 6T8 | 24 | Deg. 3 | 1,2,2,3,4,6 | ||||
| 6T9 | 36 | Deg. 2 | 1,2,2,3,4,6 | ||||
| 6T10 | 36 | Deg. 2 | 1,2,3,3,4,6 | ||||
| 6T11 | 48 | Deg. 3 | 1,2,2,3,4,6 | ||||
| 6T12 | 60 | none | 1,2,3,3,4,5 | ||||
| 6T13 | 72 | Deg. 2 | 1,2,2,3,4,6 | ||||
| 6T14 | 120 | none | 1,2,3,4,5,6 | ||||
| 6T15 | 360 | none | 1,2,3,4,5,6 | ||||
| Proper transitive subgroups of | |||||||
|---|---|---|---|---|---|---|---|
| # | Order | Isom. to | Subfield? | Invariant Degrees | Result | Malle | Schmidt |
| 7T1 | 7* | none | 1,2,2,2,3,4,7 | ||||
| 7T2 | 14 | none | 1,2,2,2,3,4,7 | ||||
| 7T3 | 21 | none | 1,2,3,3,3,4,7 | ||||
| 7T4 | 42 | none | 1,2,3,3,4,6,7 | ||||
| 7T5 | 168 | none | 1,2,3,3,4,4,7 | ||||
| 7T6 | 2520 | none | 1,2,3,4,5,6,7 | ||||
| Proper transitive subgroups of | |||||||
|---|---|---|---|---|---|---|---|
| # | Order | Isom. to | Subfield? | Invariant Degrees | Result | Malle | Schmidt |
| 8T1 | 8* | Deg. 4 | 1,2,2,2,2,3,4,8 | ||||
| 8T2 | 8* | Deg. 4 | 1,2,2,2,2,2,4,4 | ||||
| 8T3 | 8* | Deg. 4 | 1,2,2,2,2,2,2,2 | ||||
| 8T4 | 8* | Deg. 4 | 1,2,2,2,2,2,4,4 | ||||
| 8T5 | 8* | Deg. 4 | 1,2,2,2,2,4,4,4 | ||||
| 8T6 | 16* | Deg. 4 | 1,2,2,2,2,3,4,8 | ||||
| 8T7 | 16* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T8 | 16* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T9 | 16* | Deg. 4 | 1,2,2,2,2,2,4,4 | ||||
| 8T10 | 16* | Deg. 4 | 1,2,2,2,2,3,4,4 | ||||
| 8T11 | 16* | Deg. 4 | 1,2,2,2,2,4,4,4 | ||||
| 8T12 | 24 | Deg. 4 | 1,2,2,3,3,4,4,6 | ||||
| 8T13 | 24 | Deg. 4 | 1,2,2,2,3,3,4,6 | ||||
| 8T14 | 24 | Deg. 4 | 1,2,2,2,3,4,4,6 | ||||
| 8T15 | 32* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T16 | 32* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T17 | 32* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T18 | 32* | Deg. 4 | 1,2,2,2,2,3,4,4 | ||||
| 8T19 | 32* | Deg. 4 | 1,2,2,2,3,4,4,4 | ||||
| 8T20 | 32* | Deg. 4 | 1,2,2,2,3,4,4,4 | ||||
| 8T21 | 32* | Deg. 4 | 1,2,2,2,2,4,4,4 | ||||
| 8T22 | 32* | Deg. 4 | 1,2,2,2,2,4,4,4 | ||||
| 8T23 | 48 | Deg. 4 | 1,2,2,3,3,4,6,8 | ||||
| 8T24 | 48 | Deg. 4 | 1,2,2,2,3,4,4,6 | ||||
| 8T25 | 56 | none | 1,2,3,4,4,4,4,7 | ||||
| 8T26 | 64* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T27 | 64* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T28 | 64* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T29 | 64* | Deg. 4 | 1,2,2,2,3,4,4,4 | ||||
| 8T30 | 64* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T31 | 64* | Deg. 4 | 1,2,2,2,2,4,4,4 | ||||
| 8T32 | 96 | Deg. 4 | 1,2,2,3,3,4,4,6 | ||||
| 8T33 | 96 | Deg. 2 | 1,2,2,3,4,4,4,6 | ||||
| 8T34 | 96 | Deg. 2 | 1,2,2,3,4,4,4,6 | ||||
| 8T35 | 128* | Deg. 4 | 1,2,2,2,3,4,4,8 | ||||
| 8T36 | 168 | none | 1,2,3,4,4,5,6,7 | ||||
| 8T37 | 168 | none | 1,2,3,4,4,4,6,7 | ||||
| 8T38 | 192 | Deg. 4 | 1,2,2,3,3,4,6,8 | ||||
| 8T39 | 192 | Deg. 4 | 1,2,2,3,3,4,4,6 | ||||
| 8T40 | 192 | Deg. 4 | 1,2,2,3,3,4,6,8 | ||||
| 8T41 | 192 | Deg. 2 | 1,2,2,3,4,4,4,6 | ||||
| 8T42 | 288 | Deg. 2 | 1,2,2,3,4,4,6,6 | ||||
| 8T43 | 336 | none | 1,2,3,4,4,6,7,8 | ||||
| 8T44 | 384 | Deg. 4 | 1,2,2,3,3,4,6,8 | ||||
| 8T45 | Deg. 2 | 1,2,2,3,4,4,6,8 | |||||
| 8T46 | Deg. 2 | 1,2,2,3,4,4,6,8 | |||||
| 8T47 | Deg. 2 | 1,2,2,3,4,4,6,8 | |||||
| 8T48 | none | 1,2,3,4,4,5,6,7 | |||||
| 8T49 | none | 1,2,3,4,5,6,7,8 | |||||
| Some transitive subgroups of | |||||||
|---|---|---|---|---|---|---|---|
| # | Order | Isom. to | Subfield? | Invariant Degrees | Result | Malle | Schmidt |
| 9T3 | 18 | Deg. 3 | 1,2,2,2,2,3,3,5,8 | ||||
| 9T4 | 18 | Deg. 3 | 1,2,2,2,3,3,3,3,6 | ||||
| 9T5 | 18* | Deg. 3 | 1,2,2,2,2,3,3,3,3 | ||||
| 9T8 | 36 | Deg. 3 | 1,2,2,2,3,3,3,4,6 | ||||
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.
Counting -Extensions by Discriminant
Evan P. Dummit
Dept. of Mathematics, University of Rochester, 915 Hylan Building, RC Box 270138, Rochester, NY 14627
Abstract.
The problem of analyzing the number of number field extensions with bounded (relative) discriminant has been the subject of renewed interest in recent years, with significant advances made by Schmidt, Ellenberg-Venkatesh, Bhargava, Bhargava-Shankar-Wang, and others. In this paper, we use the geometry of numbers and invariant theory of finite groups, in a manner similar to Ellenberg and Venkatesh, to give an upper bound on the number of extensions with fixed degree, bounded relative discriminant, and specified Galois closure.
00footnotetext: 2010 Mathematics Subject Classification. Primary 11R21 ; Secondary 11R29, 13A50, 11H06.00footnotetext: Keywords: Discriminants, number field counting, -extensions, discriminant counting, polynomial invariant theory, geometry of numbers.
1. Overview
Over a century ago, Hermite showed that the number of number fields of a given degree whose (absolute) discriminant is less than is finite. Thus, ordering number fields of a fixed degree (or fixed Galois closure) by discriminant provides us with a variety of well-posed counting problems.
For a fixed number field , our primary interest is in analyzing the asymptotics, as , of the number of extensions , of fixed degree and Galois closure, whose discriminant (norm) is less than . Providing exact asymptotics is quite difficult and has been carried out in only a few cases.
In Section 2, we briefly review a number of results on counting number fields by discriminant, and then in Section 3 we review some necessary background on polynomial invariants attached to representations of finite groups.
In Section 4, we then prove a general theorem bounding from above the number of extensions of a given degree, bounded discriminant, and specified Galois closure. We give a prototypical example in Section 5, and then finish with some concluding remarks.
2. Notation and Background
To introduce some notation, let be a number field and be an extension of degree . Also let and be the rings of integers, and and be the absolute discriminants, of and respectively. We also take to be the absolute norm on ideals and to be the relative discriminant ideal.
We will understand to mean that , and to mean that for some constant and sufficiently large (where may depend on other parameters such as and that will be clear from the context). The group will also always refer to a finite group equipped with an embedding into , and is to be interpreted as the Galois group of the Galois closure of .
2.1. Counting Extensions of Fixed Degree
Our central problem is to count extensions where .
Definition 1**.**
For a fixed and , we define to be the number of number fields (up to -isomorphism) with extension degree and absolute discriminant norm .
A folk conjecture, sometimes attributed to Linnik, says that
[TABLE]
for fixed and as , for some positive constant depending on and . Even for the base field , the best known results for large are far away from this conjectured result. Only in some low-degree cases ) is this conjecture proven: for general , the case is an exercise in Kummer theory, and the case for is due to Davenport and Heilbronn [13], while for general it is due to Datskovsky and Wright [12]. For , the results for and are also known and due to Cohen-Diaz y Diaz-Olivier and Bhargava [3, 4, 8], (a slightly weaker exponent was first established by Kable-Yukie [32, 19]), and for general they are due to Bhargava-Shankar-Wang [6]. However, these techniques are not expected to extend to higher-degree extensions.
Our starting point for counting extensions of higher degree is the following theorem of Schmidt [26]:
Theorem** (Schmidt).**
For all and all base fields ,
[TABLE]
The approach of Schmidt can be broadly interpreted as follows: if is an extension of degree , first use Minkowski’s Lattice Theorems to obtain an element whose archimedean norms are small (in terms of ). This gives bounds on the coefficients of the minimal polynomial of ; counting the number of possibilities for yields the upper bound on the number of possible extensions . We will note that some care is necessary in the above argument: in fact, Schmidt actually counts chains of primitive extensions to avoid possible issues arising from the existence of large-degree subfields. (The overall exponent in , ultimately, is independent of any assumption of primitivity.)
The best upper bound for general was established by Ellenberg and Venkatesh [17]:
Theorem** (Ellenberg-Venkatesh).**
For all and all base fields ,
[TABLE]
where is a constant depending only on and is an absolute constant.
Although the constants are not explicitly computed in the paper, after some effort one can show that for sufficiently large (roughly on the order of ), the result becomes stronger than Schmidt’s bound.
By taking logarithms, one may recast Theorem Theorem as showing that
[TABLE]
for any . For comparison, Schmidt’s result is that this limit is at most , while Linnik’s conjecture is that this limit is 1.
Ellenberg-Venkatesh use a modification of Schmidt’s technique: rather than counting the number of possibilities for a single element of , they instead count linearly-independent -tuples of elements of , where is chosen at the end so as to optimize the resulting bound. Then by using properties of the invariant theory of products of symmetric groups, they rephrase the problem into one about counting integral points on a scheme which is a generically-finite cover of affine space.
2.2. Counting Extensions with Specified Galois Closure
We may refine the basic counting problem by restricting our attention to extensions whose Galois closure has Galois group isomorphic to a particular finite permutation group .
Definition 2**.**
For fixed and , and a transitive permutation group with a given embedding into , we define to be the number of number fields (up to -isomorphism) such that
- (1)
The degree , 2. (2)
The absolute norm of the relative discriminant is less than , and 3. (3)
The action of the Galois group of the Galois closure of on the complex embeddings of is permutation-isomorphic to .
Extensions satisfying these conditions are referred to as -extensions. It is also common to abuse terminology and refer to as the “Galois group” of the extension , despite the fact that this extension is not typically Galois.
A series of conjectures of Malle [24, 25] give expected growth rates for depending on the group . Explicitly, for a transitive subgroup acting on , and for in , define the index of an element
[TABLE]
which is also equal to the sum, over all cycles in the cycle decomposition of in , of the length of the cycle minus 1. Next define the index of to be
[TABLE]
We also set
[TABLE]
Note that the index of a transposition is equal to 1, and (since an element with index 1 has orbits) the transpositions are the only elements of index 1.
The absolute Galois group of acts on the conjugacy classes of via the action on -characters of . We define the orbits (of that action) to be the “-conjugacy classes” of . Since all elements in a -conjugacy class have the same index, we define the index of a conjugacy class to be the index of any element in that class.
The strong form of Malle’s conjecture is as follows:
Conjecture 3**.**
(Malle, strong form) There exists a constant such that
[TABLE]
where and .
Remark*.*
We would expect by Linnik’s conjecture that for any group , the asymptotics should not exceed , and indeed it is not hard to see (cf. Lemma 2.2 of [25]) that if then is also 1.
The strong form of Malle’s conjecture holds for all abelian groups; this is a result of Wright [31]. However, Klüners [20] has constructed a counterexample to the part of the conjecture for the nonabelian group of order 18 embedded in . (Klüners also notes that this is not a unique example, and that all groups of the form yield counterexamples to Malle’s conjecture as formulated above.) The ultimate difficulty is the potential existence of an intermediate cyclotomic subfield inside the extension: in this case, (or in the general family).
There is a recent refinement of the exponent of the log-term in Malle’s conjecture over function fields, due to Türkelli [30], which appears to avoid all of the known counterexamples. Türkelli’s refinement is motivated by counting points on components of non-connected Hurwitz schemes. The question of counting points on connected Hurwitz schemes was related to counting extensions of function fields in a paper of Ellenberg-Venkatesh [16], and their heuristics (subject to some assumptions) aligned with Malle’s. Türkelli extended their arguments to cover non-connected Hurwitz schemes, and the difference in the results compared to those of Ellenberg-Venkatesh suggested a modification to Malle’s conjecture.
It is generally believed that the power of in Malle’s conjecture is essentially correct. Explicitly:
Conjecture 4**.**
(Malle, weak form) For any and any number field , , where .
If true, Malle’s conjecture, even when we restrict to the “weak form” that only considers the power of , and only for extensions of , would for example imply that every finite group is a Galois group over . As such, even this weak version (let alone the full version) is naturally considered to be entirely out of reach of current methods.
An upper bound at least as strong as that in Conjecture 4 is known to hold in the following cases over general number fields :
- (1)
For any abelian group [23, 31], with the asymptotic constants (in principle). 2. (2)
For any nilpotent group [22]. For a nilpotent group in its regular representation, the lower bound is also known. 3. (3)
For [12, 13], with the asymptotic constants. In fact, in this case there is a second main term, and its asymptotic constant is also known [5, 29]. 4. (4)
For and [1, 3, 8, 6]. The asymptotic constants are also known. A power savings in the error term is also known [2] when . 5. (5)
For [19, 4, 6], as well as the asymptotic constant. A power savings in the error term is also known [27] when . 6. (6)
For degree-6 extensions [7], as well as the asymptotic constant. 7. (7)
Under mild restrictions, for wreath products of the form where is nilpotent [21].
Note that the results in degree 4 provide a stark contrast for the situation with counting polynomials by the maximum height of their coefficients: if we let for be indeterminates, then the polynomial has Galois group over . Hilbert’s Irreducibility Theorem then implies that almost all specializations (when ordered by the coefficient height) of this polynomial still have Galois group .
However, the results of Cohen et al. [9] collectively show that, when ordered by discriminant, a positive proportion (roughly 17%) of extensions of degree 4 have an associated Galois group isomorphic to the dihedral group : the difference is entirely caused by ordering the fields by discriminant. Malle’s conjectures, moreover, indicate that the non- extensions should have a positive density for any composite , but should have zero density for prime , though this is not known to be true for any .
2.3. Outline of Results
The overarching goal of this paper is to generalize the results of Schmidt and Ellenberg-Venkatesh to arbitrary -extensions. In Section 4, we prove the following theorem:
- Theorem7.
Let , let be any number field, and let be a proper transitive subgroup of . Also, let be such that if is the intersection of any point stabilizer in with , then any subgroup of properly containing has index at most . Then for any ,
[TABLE]
where the for are a set of primary invariants for , whose degrees (in particular) satisfy .
We note here that for every primitive group covered by the Theorem, the result is always strictly better than the result offered by Schmidt’s bound , and the savings (see Appendix A) are often significant.
Our proof follows the same general approach as that of Schmidt and generalizes Example 2.7 from Ellenberg-Venkatesh [17], which gives a rough outline of the technique for a single group. The technique is as follows:
- (1)
Apply Minkowski’s Theorems to obtain an algebraic integer generating whose archimedean valuations are small. 2. (2)
Use a counting argument to establish an upper bound on the number of such algebraic integers.
The goal of Proposition 5 is to accomplish (1). We modify the basic argument in (2) by rephrasing the counting argument in scheme-theoretic language, and then invoke invariant theory and the large sieve (see Lemma 6) to save in the counting part.
3. Polynomial Invariants of Finite Groups
In this section we briefly discuss some standard results in the theory of polynomial invariants; we freely refer to results from this section in the main text. The following discussion is condensed from Derksen-Kemper [14].
Let be a finite group and be a (faithful) complex representation, and let act on via . If are algebraically independent, homogeneous elements of with the property that , the ring of -invariant polynomials, is a finitely-generated module over , we say these polynomials are a set of “primary invariants” for . The Noether normalization lemma implies that such polynomials exist; that there are of them follows from comparing transcendence degrees.
The primary invariants are not unique: one can (for example) take linear combinations or powers of the and still retain the finite-generation property. When we speak of primary invariants, we generally mean a set of primary invariants which are homogeneous and of minimal degree, arranged in nondecreasing order by degree. However, all results discussed will hold for any set of primary invariants.
Denote , and . The theorem of Hochster-Roberts (Theorem 2.5.5 of [14]) implies that is a Cohen-Macaulay ring and, moreover, that there exist homogeneous -invariant polynomials with such that . These polynomials are called “secondary invariants” of and will depend intrinsically on the choice of primary invariants, and are not uniquely determined even for a fixed set of primary invariants.
Example**.**
Let and be the regular representation of (which acts by index permutation on ). It is easy to see that the elementary symmetric polynomials are invariants under the action of on , and that they are algebraically independent: thus, they form a set of primary invariants for . In fact, for any subgroup of , the elementary symmetric polynomials form a set of (possibly non-minimal-degree) primary invariants: hence, for any permutation representation of degree , there exists a set of primary invariants of such that for each .
Associated to any (usually -invariant) graded submodule of is the generating function , where , the vector space dimension of the degree- polynomials in . This generating function is called (variously) the Hilbert series or the Molien series of .
Example**.**
For , one has by the algebraic independence of the .
For , there is a formula, due to Molien, which says
[TABLE]
(In fact the formula applies to any linear representation , over any field of characteristic relatively prime to .) By looking at the free resolution of arising from the secondary invariants in tandem with 3.1, we can write
[TABLE]
By examining the Hilbert series identity 3.2 with sufficient care, one can deduce a number of facts about the primary invariants: for example, the product of the degrees of any set of primary invariants is divisible by , and the quotient is equal to the number of associated secondary invariants (cf. Proposition 3.3.5 of [14]). Also, the least common multiple of the degrees of the primary invariants is divisible by the exponent of .
For any particular representation , one can compute the Hilbert series as a rational function using Molien’s formula, and then factor the denominator to generate possibilities for the degrees for the primary invariants. One might hope that this will immediately give the degrees of the primary invariants, but this is not the case: for general linear representations (or even permutation representations), the minimal degrees possible from the Hilbert series will not always give the degrees of an actual set of primary invariants.
The computer algebra system MAGMA computes minimal primary invariants by using Molien’s formula to generate possible degree vectors for the primary invariants, then generates independent -invariant polynomials of those degrees, and finally applies a Hilbert-driven Buchberger algorithm to verify that the resulting ideal is zero-dimensional. For a number of reasons, most algorithms for primary invariant computation in general settings generally seek to minimize the product of the invariant degrees rather than their sum. In general, we would also not expect there to be a way to compute the degrees of a set of primary invariants without essentially having to compute the invariants themselves; see the discussion following Algorithm 3.3.4 of [14] for further details.
4. Proof of Main Counting Theorem
Given an extension , we start by constructing a generator of small size.
Proposition 5**.**
Let be a number field of degree over , and an extension of degree such that , and such that any proper subfield of containing has . Then there exists an with , all of whose archimedean valuations have absolute value , and such that .
Proof.
If has real embeddings and complex embeddings (where ), for we define the “Minkowski map” sending
[TABLE]
Recall that the image is the so-called Minkowski lattice of rank in .
Let be the successive minima of the gauge function on , and denote for shorthand. (Note that is essentially just the maximum archimedean valuation of up to a factor of 2.) Minkowski’s Second Theorem [28] says
[TABLE]
where the implied constant depends only on .
Now since the are nondecreasing, for any we may use the bound given by 4.1 to write
[TABLE]
whence
[TABLE]
For all with , 4.2 implies
[TABLE]
Now, by our assumption about intermediate subfields, we know that will generate , since spans a vector subspace of of dimension greater than any proper subfield. By a pigeonhole argument, we see that if denotes the number of subfields of (which by Galois theory can be bounded above in terms of only), there exists a linear combination , with integral coefficients bounded in absolute value by , that generates .
Since is fixed, we may choose a basis of and observe that still has the property that for every . If is the projection of onto the sublattice of the Minkowski lattice generated by , then lies in , has trace zero, generates , and its archimedean norms satisfy
[TABLE]
∎
We also require a sieving lemma:
Lemma 6**.**
Suppose is a finite map of schemes of degree and is irreducible. Then, for any , the number of integral points of whose images lie in the box centered at 0 whose sides have lengths is , where are positive rational numbers.
Proof.
First, by changing variables for , we may assume that the are integers. Our starting point is a multivariable version of Hilbert’s Irreducibility Theorem due to S.D. Cohen [10]: if is a morphism of degree , then the number of integral points of of height which lift to is .
The side length of the box in that theorem is , and the result gives a savings of on the box. The result is also stated for a box centered at 0, but the bound (with a uniform constant) still holds even if we translate to center the box at an arbitrary point.
Now we tile our large box of side lengths with square boxes each of which has size : each square box yields points of having an image in that square box, and we require a total of such square boxes to cover the large box. The result follows.∎
Remark*.*
There are sieving methods that work directly with non-square boxes, and these would presumably give an additional small savings, although we do not expect the gain to be particularly significant.
We can now prove the main theorem:
Theorem 7**.**
Let , let be any number field, and let be a proper transitive subgroup of . Also, let be such that if is the intersection of a point stabilizer in with , then any subgroup of properly containing has index at most . Then for any ,
[TABLE]
where the for are a set of primary invariants for , whose degrees (in particular) satisfy .
Remark*.*
The condition about the point stabilizer is (by the Galois correspondence) equivalent to the following: if is a -extension, then any proper subfield of containing has . (The criterion in the theorem statement is stated the way it is in order to avoid any reference to .) We note in particular that if is a primitive subgroup of , then .
Proof.
Let act on the polynomial ring by index permutation, and let be primary invariants of with associated secondary invariants , each set arranged in order of nondecreasing degree. Observe that because is transitive, the only primary invariant of degree 1 is , and that because is proper, there is at least one secondary invariant besides .
Denote and , and observe that is an integral domain. Let be the subring of generated by and , and let . Observe that is an integral domain (since is) so is irreducible.
The natural map induces a projection (namely, evaluation of the polynomials at the given point), and the map is finite because is a finitely-generated -module (whence is finite over ). Also notice that, by construction, we have , and so has degree at least 2.
Now suppose is an extension of number fields with , , such that the Galois group of the Galois closure is permutation-isomorphic to , and such that . As noted in Remark Remark, the condition on the group implies that any field intermediate between and has . By Proposition 5, there exists a nonzero element of trace zero such that all archimedean valuations of are and with . This element gives rise to an integral point , where the are the archimedean embeddings of . (Note that we are using the fact that has trace zero to say that , so that is actually well-defined on .)
We may then obtain an upper bound on the total possible number of fields by bounding the number of possible . But since is finite (and its degree is independent of ), we may equivalently bound the number of possibilities for .
Since is simply evaluation of the primary invariant polynomials on the point , the coordinates of obey the bounds
[TABLE]
for , which forms a “box” in . By choosing an integral basis of , this box becomes a box in with the same dimensions (up to fixed constants), each occurring times, and the image of is integral. We now apply Lemma 6 to see that the number of possible integral points is . Finally, since and each gives rise to at most one distinct extension , we obtain
[TABLE]
which is precisely the desired result.∎
Remark*.*
Note that we require the existence of a secondary invariant in order to apply Lemma 6. Without a secondary invariant, we lose the power savings and instead obtain the upper bound . This will only occur when , whose primary invariants are the usual symmetric polynomials (with degrees ): it is then easy to see that our upper bound is
[TABLE]
which is precisely Schmidt’s bound. Since the symmetric polynomials are a set of primary invariants for any permutation group, we therefore see that for any primitive proper transitive subgroup of , our theorem always beats the bound of Schmidt (due to the power-savings from the sieving and the fact that ). However, in practice for most primitive groups , the majority of the actual savings comes from the primary invariants, whose degrees tend to be much smaller than the degrees of the symmetric polynomials.
5. A Prototypical Example: in
In this section we give an explicit example of a primary invariant computation, for the group , which is the simple group of order 168, and appears as 7T5 in the tables in Appendix A.
Corollary 8**.**
For any ,
For comparison, Schmidt’s bound (for general degree-7 extensions) gives an upper bound of , and the Ellenberg-Venkatesh bound is weaker.
Proof.
Let ; it is a primitive permutation group on whose action is conjugate to the action of on . A computation with MAGMA shows that primary invariants can be chosen as
[TABLE]
of degrees respectively. Invoking Theorem 7 yields the stated bound. (Note here that .) ∎
We will note that the group also appears as a transitive subgroup of (it is 8T37 in the tables in Appendix A), but the upper bounds obtained are different: as a subgroup of we obtain the bound , while as a subgroup of we obtain . This should not be surprising, as the fields being counted are different (though related): in the case we are counting fields of degree 7 whose Galois action on the 7 complex embeddings is that of , whereas in the case we are counting fields of degree 8 whose Galois action on the 8 complex embeddings is that of . Indeed, the predictions from Malle’s heuristics also differ for these fields: the number of degree-7 -extensions is expected to be approximately while the number of degree-8 -extensions is expected to be approximately .
6. Closing Remarks
Per Malle’s heuristics, we would expect the actual number of integral points to be (much) lower than the bound given by Theorem 7. There are three ways in which we lose accuracy:
- (1)
The map associating an element to an extension is not injective: any extension has many different generators. Worse still, there is no uniform way to account for this non-injectivity: an extension of small discriminant will have many generators of small archimedean norm, and thus it will show up in the count much more frequently than an extension of larger discriminant. 2. (2)
The simple techniques employed above for counting integral points on the scheme give weaker bounds than could be hoped for. Most points in affine space are not actually the image of an integral point on , so we would not expect that the sieving lemma 6 is sharp: it is likely only extracting a small amount of the potential savings that should be realizable. 3. (3)
If has any intermediate extensions, the bound given in Lemma 5 on the archimedean norm of a generator is weaker than for a primitive extension. The worst losses occur when has a subfield of small index (e.g., index 2), in which case the exponent obtained in Theorem 7 is nearly doubled.
One technique by which we could address the issues in (1) is that of Ellenberg-Venkatesh [17]: rather than counting the number of possibilities for the single element of trace zero and whose archimedean valuations are small, we could instead count the number of possibilities for an -tuple of elements , each of whose archimedean valuations is small. This would provide a stronger way of separating extensions of differing discriminants and reduce the amount of duplication in the counting (though it cannot entirely erase duplicate counting).
In order to address the deficiencies of (2), we would require the use of stronger point-counting techniques. To do this, however, would require understanding the geometry of the scheme in a much deeper way. For particular groups with low-degree permutation representations, this is (at least, theoretically) feasible, since the primary invariants are explicitly computable. However, for large this seems very unlikely to succeed, since the invariant theory becomes extremely computationally demanding for .
To deal with the deficiencies of (3), it seems likely that a more direct analysis of the possible extension towers for extensions of small degree over general base fields could yield significant savings, but we will not pursue this avenue here.
As a concluding remark, one way of reinterpreting Theorem 7 is to view it as a result about permutation representations of groups. The invariant theory involved in the proof carries over to general representations , and so one could ask: is there a way to construct an analogue of these results attached to an arbitrary faithful representation ? As we show in a forthcoming paper [15], the answer to this question is also “yes”.
Appendix A Tabulation of Results
In the following tables, we give the results of the invariant computations, performed using the algebra system MAGMA, for all proper transitive subgroups of for , along with a small number of subgroups of for which it was possible to finish the invariant computations within 2 days on a 4Ghz desktop computer with 1GB of memory. We observe that for primitive transitive subgroups, the result of Theorem 7 is significantly better than the overall bound of Schmidt, although the results generally do not get close to nor (a fortiori) to the bounds in Malle’s Conjecture 4. For imprimitive extensions, and especially in even degree (where many extensions have an index-2 subfield), the results are frequently worse than Schmidt’s bound.
The labeling of the transitive subgroups is the standard one originally given by Conway-Hulpke-McKay [11]. Subfield information was obtained from John Jones’ page on transitive group data [18], which also contains additional detailed information about the transitive subgroups.
For brevity in the tables below, we quote the results of Theorem 7 only for the base field , and we write the results as rather than (including the bounds conjectured by Malle). The upper bound over a general base field of degree over is (for an entry of ) equal to . Rows marked with an asterisk are groups for which Malle’s weak conjecture is known to hold. For subgroups of , we compare the results to the bound of Bhargava; for other symmetric groups, we compare our results to that of Schmidt.
We also remark that for certain classes of groups such as the dihedral groups, there are bounds available (e.g., from class field theory) that are far better than Schmidt’s bound.
Acknowledgements
The author would like to thank Jordan Ellenberg and Akshay Venkatesh for their work which inspired this paper, John Voight for computing assistance with MAGMA, David Dummit and Dinesh Thakur for their helpful editorial comments, and Jordan Ellenberg in particular for his comments and persistent encouragement.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. M. Baily, On the density of discriminants of quartic fields , J. reine angew. Math 315 (1980) 190–210.
- 2[2] K. Belabas, M. Bhargava, and C. Pomerance, Error estimates for the Davenport-Heilbronn theorems , Duke Mathematical Journal 153 (2010), no. 1, 173–210.
- 3[3] M. Bhargava, The density of discriminants of quartic rings and fields , Annals of Mathematics (2005) 1031–1063.
- 4[4] ———, The density of discriminants of quintic rings and fields , Annals of Mathematics (2010) 1559–1591.
- 5[5] M. Bhargava, A. Shankar, and J. Tsimerman, On the Davenport–Heilbronn theorems and second order terms , Inventiones Mathematicae 193 (2013), no. 2, 439–499.
- 6[6] M. Bhargava, A. Shankar, and X. Wang, Geometry-of-numbers methods over global fields I: Prehomogeneous vector spaces , ar Xiv preprint ar Xiv:1512.03035 (2015).
- 7[7] M. Bhargava and M. Wood, The density of discriminants of S 3 subscript 𝑆 3 S_{3} -sextic number fields , Proceedings of the American Mathematical Society 136 (2008), no. 5, 1581–1587.
- 8[8] H. Cohen, Constructing and Counting Number Fields , Proceedings of the ICM 2 (2002) 129–138.
