Monogenic pure cubics
Abstract.
Let be a square-free integer. We prove that the number of square-free integers such that and is monogenic is and for any . Assuming ABC, the upper bound can be improved to . Let be the finite field of order with and let be non-constant square-free. We prove unconditionally the analogous result that the number of square-free such that , and is monogenic is and .
Key words and phrases:
Monogenicity, pure cubic fields, function fields, ABC2010 Mathematics Subject Classification:
Primary: 11R16, 11R58. Secondary: 11D251. introduction
A number field is called monogenic if its ring of integers is for some . Number fields that are fundamental to the development of algebraic number theory such as quadratic and cyclotomic fields are all monogenic. Certain questions about monogenic number fields (as well as monogenic orders) are closely related to the so called discriminant form equations which have been studied extensively by Evertse, Győry, and other authors. The readers are referred to [EG15, EG16, Ngu17, BN18, Gaá19] and the references there for many interesting results including those over positive characteristic fields.
A pure cubic field is a number field of the form where is cube-free. In a certain sense, pure cubic fields are the “next” family of number fields to investigate after quadratic fields especially from the computational point of view (for example, see [WCS80, WDS83, SS99] of which the third paper treats the function field analogue of pure cubic fields). While every quadratic field is monogenic, many pure cubics are not and the goal of this paper is to study the density of monogenic pure cubic fields and its function field analogue. For instance, the first naive question is whether the set
has zero density. It turns out that the answer is negative thanks to the below theorem of Dedekind. Satisfactory results have been obtained by Bhargava, Shankar, and Wang [BSW] in which they establish the density of monic integer polynomials of degree having squarefree discriminants and, in a certain sense, the density of monogenic number fields of degree for any . The questions considered in this paper are quite different in nature since we restrict to the 1-parameter family as well as the family of polynomials none of which have square-free discriminant.
To see why the above question has a negative answer, we start with the following [Mar18, p. 35–36]:
Theorem 1.1 (Dedekind).
Let be a cube-free integer, let , and write where and are square-free positive integers. We have the following:
-
•
If mod then is an integral basis of .
-
•
If mod then is an integral basis of .
An immediate consequence is that is monogenic when is square-free and mod . In fact this is the only case when we have a positive density result. For the remaining cases (i.e. or mod ), the conclusion is in stark contrast with the above. As a side note, a recent paper of Gassert, Smith, and Stange [GSS19] considers the 1-parameter family of quartic fields given by and shows that a positive density of them are monogenic.
Throughout this paper, for each square-free positive integer , let:
and if let
From now on, whenever is mentioned, we tacitly assume the condition that . Our main results for pure cubic number fields are the following:
Theorem 1.2.
For every and square-free integer , we have as . For every square-free , we have as . Consequently, the sets for and the sets for have zero density.
A table of monogenic pure cubic fields with discriminant up to has been computed by Gaál-Szabó [GS10, Gaá19] and it is noted in [Gaá19, p. 111] that “the frequency of monogenic fields is decreasing”. Our zero density result illustrates this observation. Further investigations and computations involving integral bases and monogenicity of higher degree pure number fields have been done by Gaál-Remete [GR17].
Assuming ABC, we can arrive at the much stronger upper bound:
Theorem 1.3.
Assume that the ABC Conjecture holds. Let and let be a square-free positive integer. We have . And if , we have .
Remark 1.4.
Remark 1.5.
In principle, we can break into and . When choosing the signs appropriately, all results and arguments for remain valid for each individual and .
We now consider the function field setting. For the rest of this section, let be a finite field of order and characteristic . A polynomial is called square-free (respectively cube-free) if it is not divisible by the square (respectively cube) of a non-constant element of . Every cube-free can be written uniquely as in which are square-free and is monic. We have the analogue of Dedekind’s theorem for :
Theorem 1.6 (function field Dedekind).
Let be cube-free, let , , and let be the integral closure of in . Express as above. Then is a basis of over .
Proof.
As before, is called monogenic if for some . For each monic square-free , let
For each positive integer , let denote the set of polynomials of degree at most . It is easy to show that there are square-free polynomials in . Therefore, if we define the density of a subset of to be
(assuming the limit exists), then the set has density . As before, this is in stark contrast to the case :
Theorem 1.7.
Let be a non-constant monic square-free polynomial in . We have
as where the implied constants depend only on and .
Remark 1.8.
In Theorem 1.7, an analogous upper bound to the number field setting would be . The bound obtained here is much stronger; this is a typical phenomenon thanks to the uniformity of various results over function fields.
We end this section with a brief discussion on the methods of the proofs. As mentioned above, it is well-known that monogenicity is equivalent to the fact that a certain discriminant form equation has a solution in (or if we are in the function field case). For the questions involving pure cubic fields considered here, we end up with an equation of the form where and are fixed and varies so that the equation has a solution . There are several methods to study those Thue equations [EG15, EG16, Gaá19] and we can effectively bound the number of solutions or the size of a possible solution. However, the question considered here is somewhat different: we are estimating how many for which we have at least one solution. The unconditional upper bound in the number field case follows from a sieving argument together with a simple instance of the Chebotarev density theorem. The much stronger bound in the number field case as well as the bound in the function field case follow from the use of ABC together with several combinatorial arguments that might be of independent interest.
Acknowledgments. We wish to thank Professors Shabnam Akhtari and István Gaál for helpful comments. Z. S. A is partially supported by a PIMS Postdoctoral Fellowship. K. N. is partially supported by an NSERC Discovery Grant and a CRC tier-2 research stipend.
2. The number field case
We start with the following:
Proposition 2.1.
Let and be square-free positive integers. We have:
-
(a)
if and only if mod and the equation has a solution .
-
(b)
if and only if mod and the equation has a solution .
Proof.
For (a), suppose mod , let , , and consider the integral basis . To find such that , it suffices to consider of the form with . Then we have:
We represent in terms of the given integral basis and the corresponding matrix has determinant . Therefore if and only if the equation has a solution .
The proof of part (b) is similar with some tedious algebraic expressions as follows. Suppose mod , let , , and consider the integral basis . As before, consider with . Then depending on whether mod , we have:
where , , and the precise value of is not needed for our purpose. We represent in terms of the given integral basis and the corresponding matrix has determinant:
Therefore if then the equation has a solution . Conversely, if is a solution, we can choose and and we need to explain why . From mod , we have mod . Using this and the equation , we have mod . Hence mod . ∎
The following establish the upper bounds in Theorem 1.2:
Proposition 2.2.
Let and be positive integers such that is not the cube of a rational number. As , the number of integers such that the equation has an integer solution is .
Proof.
Let and let be its Galois closure. Let be the set of primes such that is not a cube mod . This means remains a prime in and splits completely in ; in other words the Frobenius of with respect to is the conjugacy class of the 2 elements of order 3. The Chebotarev density theorem gives that has Dirichlet as well as natural density . Put so that ; put . Then partial summation gives:
thanks to the Prime Number Theorem and the fact that . This implies
(1) |
Proof of Theorem 1.2.
The upper bound in Theorem 1.2 follows from Propositions 2.1 and 2.2. For the lower bound, first we consider and the equation . We can always take for so that the above equation has a solution . We need that mod and is square-free for a positive proportion of such . A direct calculation shows that regardless of the possibility of mod , we can always find such that mod . We now choose of the form for where is a positive constant depending only on . By classical results of Hooley [Hoo67, Hoo68] (also see [Gra98] for a more general result assuming ABC), the irreducible cubic polynomial admits square-free values for at least many where depends only on and . The proof of is completely similar. ∎
We will obtain the stronger upper bound assuming the ABC Conjecture:
Conjecture 2.3.
Let , then there exists a positive constant depending only on such that the following holds. For all relatively prime integers with , we have:
Proposition 2.4.
Assume Conjecture 2.3. Let and be positive integers such that is not the cube of a rational number and let . The number of integers such that and the equation has an integer solution is .
Proof.
Let be a small positive number depending on that will be specified later. The implicit constants in this proof depends only on , , and . Except for the finitely many for which is the cube of an integer, any such that , , and satisfies . An immediate consequence of ABC gives:
From , we get . Combining with the above, we get: . Put so that we have:
Therefore, in order to estimate the number of , we estimate the number of pairs with and such that is an integer in .
Fix such a , we have the obvious bound and we now study the congurence mod . Let be a prime divisor of and let such that . If , the equation mod has at most 3 solutions in thanks to the structure of . If and , for the above congruence equation to have a solution, we must have that is a positive integer divisible by and any solution must have the form where satisfies mod and is given by . Again, there are at most 3 solutions in this case. In conclusion, there are many solutions in of the equation mod ; here denotes the number of distinct prime factors of .
Overall, the number of pairs is at most:
This is since is dominated by . Now choosing sufficiently small so that and we get the desired conclusion. ∎
3. The function field case
Throughout this section, let be a finite field of order and characteristic . A polynomial is called square-free (respectively cube-free) if it is not divisible by the square (respectively cube) of a non-constant polynomial in . Every cube-free can be written uniquely as in which are square-free and is monic. We have the function field analogue of Proposition 2.1 whose proof is completely similar:
Proposition 3.1.
Let be as above. Then is monogenic if and only if there exists such that .
In function fields, the Mason-Stothers theorem plays a similar role to ABC:
Theorem 3.2 (Mason-Stothers).
Let be a field and let be relatively prime polynomials with . Suppose that at least one of the derivatives is non-zero then
where denotes the number of distinct roots of in .
In order to guarantee the condition on derivatives in the above theorem, we need:
Lemma 3.3.
Let be non-constant square-free polynomials. Suppose there exist such that . Then there exist such that and at least one of the derivatives and is non-zero.
Proof.
Write and where the ’s and ’s are irreducible over . Let be the largest non-negative integer such that both and are -th power of some element of . Write and , we have that and at least one of the derivatives and is non-zero.
Since , from and we can express and as:
where the ’s and ’s are positive integer, , and mod for and .
Hence the ’s and ’s have the same non-zero congruence mod . Depending on whether they are mod or respectively mod , we can write
or respectively
We need to rule out the second possibility above. Indeed, suppose it happens then the Mason-Stothers theorem implies:
contradiction since the RHS is strictly smaller than the average of the 2 terms in the LHS. This finishes the proof. ∎
For , let denote the number of distinct monic irreducible factors of . As before, we also need an upper bound for :
Lemma 3.4.
For every of degree , we have .
Proof.
All the implicit constants in this proof depend only on . For every positive interger , let be the degree of the product of all monic irreducible polynomials of degree at most . Since there are monic irreducible polynomials of degree , we have
Now we choose the smallest such that . This implies that is at most the number of monic irreducible polynomials of degree at most :
From the above formula for and the choice of , we have that and ; this finishes the proof. ∎
It turns out that we will need an estimate for where . Using the above bound for each individual would yield for the above sum which would not be good enough for our purpose. Instead, we have:
Lemma 3.5.
.
Proof.
Let be where ranges over all monic polynomials of degree equal to . It suffices to show . The generating series has the Euler product:
where ranges over all the monic irreducible polynomials over . The denominator is simply the zeta-function while the coefficients of the numerator are bounded above by the coefficients of . Therefore the ’s are bounded above by the coefficients of and this finishes the proof. ∎
Proof of Theorem 1.7.
For the lower bound, we simply study the equation . Either by adapting the arguments in [Hoo67, Hoo68, Gra98] or using a general result of Poonen [Poo03, Theorem 3.4] which is valid for a multivariable polynomial, we have that for a positive proportion of the polynomials with , we have that is squarefree; we now simply take and for those ’s. This proves the lower bound.
For the upper bound, we prove that for an arbitrary , there are many of degree at most such that the equation has a solution ; since we must have that . By Lemma 3.3, we may assume that at least one of the derivatives and is non-zero. The Mason-Stothers theorem yields:
The first inequality gives then we use this and the second inequality to obtain . Then it follows that .
We now count the number of pairs with such that and is a polynomial in of degree at most . Hence . Arguing as before, for each prime power factor of , the congruence equation mod has at most 3 solutions mod . Therefore by the Chinese Remainder Theorem, the congruence equation mod has at most solutions mod . Therefore once is fixed, there are at most
possibilities for . Hence the number of pairs is at most:
The first term is since while the second term is thanks to the previous lemma and this finishes the proof. ∎
4. Further Questions
Thanks to the lower bounds in our results, we know that the “main terms” and in the upper bounds are optimal. However, it seems possible that the “extra factors” in the number field case and in the function field case can be improved. This motivates:
References
- [BN18] J. P. Bell and K. D. Nguyen, Some finiteness results on monogenic orders in positive characteristic, Int. Math. Res. Not. 2018 (2018), 1601–1637.
- [BSW] M. Bhargava, A. Shankar, and X. Wang, Squarefree values of polynomial discriminants I, arXiv:1611.09806.
- [EG15] J.-H. Evertse and K. Győry, Unit Equations in Diophantine Number Theory, Cambridge Studies in Advanced Mathematics, vol. 146, Cambridge University Press, Cambridge, 2015.
- [EG16] by same author, Discriminant Equations in Diophantine Number Theory, New Mathematical Monographs, vol. 32, Cambridge University Press, Cambridge, 2016.
- [Gaá19] I. Gaál, Diophantine Equations and Power Integral Bases: Theory and Algorithms, second ed., Birkhäuser, Cham, Switzerland, 2019.
- [GR17] I. Gaál and L. Remete, Integral bases and monogenicity of pure fields, J. Number Theory 173 (2017), 129–146.
- [Gra98] A. Granville, allows us to count squarefrees, Int. Math. Res. Not. IMRN (1998), no. 19, 991–1009.
- [GS10] I. Gaál and T. Szabó, A note on the minimal indices of pure cubic fields, JP J. Algebra Number Theory Appl. 19 (2010), 129–139.
- [GSS19] T. A. Gassert, H. Smith, and K. Stange, A family of monogenic quartic fields arising from elliptic curves, J. Number Theory 197 (2019), 361–382.
- [Hoo67] C. Hooley, On the power free values of polynomials, Mathematika 14 (1967), 21–26.
- [Hoo68] by same author, On the square-free values of cubic polynomials, J. reine angew. Math. 229 (1968), 147–154.
- [Mar18] D. Marcus, Number fields, second ed., Universitext, Springer Nature, Cham, Switzerland, 2018.
- [MV06] H. Montgomery and R. Vaughan, Multiplicative Number Theory I: Classical Theory, Cambridge Studies in Advanced Mathematics, vol. 97, Cambridge University Press, Cambridge, 2006.
- [Ngu17] K. D. Nguyen, On modules of integral elements over finitely generated domains, Trans. Amer. Math. Soc. 369 (2017), 3047–3066.
- [Poo03] B. Poonen, Squarefree values of multivariable polynomials, Duke Math. J. 118 (2003), 353–373.
- [SS99] R. Scheidler and A. Stein, Voronoi’s algorithm in purely cubic congruence function fields of unit rank 1, Math. Comp. 69 (1999), 1245–1266.
- [WCS80] H. C. Williams, G. Cormack, and E. Seah, Calculation of the regulator of a pure cubic field, Math. Comp. 34 (1980), 567–611.
- [WDS83] H. C. Williams, G. W. Dueck, and B. K. Schmidt, A rapid method of evaluating the regulator and class number of a pure cubic field, Math. Comp. 41 (1983), 235–286.