Binary quartic forms with bounded invariants and small Galois groups
Cindy Tsang, Stanley Yao Xiao

TL;DR
This paper classifies integral irreducible binary quartic forms with Galois groups as subgroups of the dihedral group of order eight, organizing them into families linked to quadratic forms and counting their equivalence classes.
Contribution
It introduces a classification of such quartic forms based on quadratic form families and provides enumeration of their equivalence classes.
Findings
Forms are organized into families indexed by quadratic forms.
Enumeration of GL_2(Z)-equivalence classes for fixed quadratic forms.
Connection between quartic forms and quadratic form discriminants.
Abstract
In this paper, we consider integral and irreducible binary quartic forms whose Galois group is isomorphic to a subgroup of the dihedral group of order eight. We first show that the set of all such forms is a union of families indexed by integral binary quadratic forms of non-zero discriminant. Then, we shall enumerate the -equivalence classes of all such forms associated to a fixed .
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.
Binary quartic forms with bounded invariants
and small Galois groups
Cindy (Sin Yi) Tsang
Yau Mathematical Sciences Center
Tsinghua University
Beijing, P. R. China
and
Stanley Yao Xiao
Mathematical Institute
University of Oxford
Andrew Wiles Building
Radcliffe Observatory Quarter
Woodstock Road
Oxford
OX2 6GG
Abstract.
In this paper, we consider integral and irreducible binary quartic forms whose Galois group is isomorphic to a subgroup of the dihedral group of order eight. We first show that the set of all such forms is a union of families indexed by integral binary quadratic forms of non-zero discriminant. Then, we shall enumerate the -equivalence classes of all such forms associated to a fixed .
Contents
- 1 Introduction
- 2 Characterization of forms with small Galois groups
- 3 Basic properties of forms in of non-zero discriminant
- 4 Parametrizing forms in of non-zero discriminant
- 5 Definition of a bounded semi-algebraic set
- 6 Error estimates and the main theorem
- 7 Acknowledgments
1. Introduction
The problem of enumerating -equivalence classes of integral and irreducible binary forms of a fixed degree has a long history. The quadratic and cubic cases were solved in [16, 22] and [12, 13], respectively, where the forms are ordered by the natural height, namely the discriminant . The quartic case turns out to be much more challenging because while the ring of polynomial invariants for both binary quadratic and cubic forms is generated by as an algebra, that for binary quartic forms is generated by two independent invariants, usually denoted by and . For
[TABLE]
they are given by the explicit formulae
[TABLE]
which are of degrees two and three, respectively. In [4], instead of using the discriminant, Bhargava and Shankar introduced the height function
[TABLE]
For , let us define
[TABLE]
where denotes -equivalence class. In [4], they proved that
[TABLE]
This is the first result ever obtained, and as far as we know, the only known result in the literature, for the quartic case.
1.1. Set-up and notation
In this paper, we shall also be interested in the quartic case, but only the integral and irreducible binary quartic forms with small Galois group , which is defined to be the Galois group of the splitting field of over . We know that is isomorphic to one of the following:
[TABLE]
We shall say that is small if it is isomorphic to , or . Recall that the cubic resolvent of is defined by
[TABLE]
Then, equivalently, we have the classical characterization that for irreducible
[TABLE]
It turns out that whether is small or not may also be characterized in terms of binary quadratic forms and the following so-called twisted action of .
Given a complex binary form , let act on it via
[TABLE]
Observe that this is only an action up to sign when is odd, in the sense that for , we only have in general. Now, given a real binary quadratic form with , write
[TABLE]
for its associated matrix in . Its action on binary quartic forms clearly remain unchanged if we scale by a constant in . In [27], the second-named author proved that for any real binary quartic form with , elements of
[TABLE]
all arise from binary quadratic forms in this way; see Proposition 2.1. Recall that an integral binary quadratic form is called primitive if its coefficients are coprime. Using this result from [27], in Section 2, we shall first show that:
Theorem 1.1**.**
Let be an integral binary quartic form with . Then, the following are equivalent.
- (1)
* is reducible.* 2. (2)
* for some which is not a scalar multiple of .* 3. (3)
* for an integral and primitive binary quadratic form with .*
Moreover, in the case that is reducible:
- (a)
If , then there is a unique such up to sign. 2. (b)
If , then there are exactly three such up to sign, among which one is definite and two are indefinite.
Given a real binary quadratic form with , let us further make the following definitions. First put
[TABLE]
Clearly is a vector space over and a lattice over . A straightforward calculation shows that is three; see (3.1) and (3.2) below. Also, put
[TABLE]
For , we shall define two new invariants as follows. As we shall see in (2.3), there is a unique root of corresponding to . Let denote the other two roots of and define
[TABLE]
By Proposition 3.2 below, they have degrees one and two, respectively, in the coefficients of . Following (1.2), let us define the height of associated to by
[TABLE]
This is comparable to the height (1.2) because by comparing coefficients in
[TABLE]
we easily deduce the relations
[TABLE]
which in turn imply that
[TABLE]
Let us note that
[TABLE]
where the first equality is well-known, and the second equality holds by (1.5). Also, our height is an invariant in the sense that for any , we have
[TABLE]
as shown in Proposition 3.1 below. This implies that the map
[TABLE]
which is a well-defined bijection because , is height-preserving when restricted to the forms of non-zero discriminant.
Now, let us return to the integral and irreducible binary quartic forms with small Galois group. Write for the set of all such forms and set
[TABLE]
By Theorem 1.1, we know that
[TABLE]
where denotes the set of all integral and primitive binary quadratic forms of non-zero discriminant, up to sign. In particular, given , there is a unique such that , and we may define the height of by setting
[TABLE]
For , let us define
[TABLE]
Then, by (1.8) and (1.9), we have
[TABLE]
where denotes a set of representatives of the -equivalence classes on . In Theorem 1.2, which is our main result, for , we shall determine the asymptotic formula for . In fact, we shall consider the finer counts
[TABLE]
and show that the latter two are negligible compared to . This means that most of the forms in have Galois group isomorphic to . However, all of our error estimates depend upon . Currently, we do not know how to control them in a uniform way, and so we are unable to obtain an asymptotic formula for by summing over .
Finally, let us explain, for each , how counting forms in may be reduced to counting lattice points. Write with . By (3.1) and (3.2), the set is a vector space isomorphic to via
[TABLE]
Recall that the subset has the structure of a rank-three -lattice, which may be identified with the lattices
[TABLE]
in . Let us mention here that we shall use the isomorphism
[TABLE]
Thus, the problem is reduced to counting points in or , and then sieving out those which come from reducible forms. In turn, counting lattice points amounts to computing certain volumes by a result of Davenport [11]; see Proposition 5.1.
1.2. Statement of the main theorem
It is clear that we may choose the set of representatives to be such that for all , the -coefficient is positive, and
[TABLE]
when is reducible. Let denote -equivalence. Then, our main result is:
Theorem 1.2**.**
Let be an integral and primitive binary quadratic form of non-zero discriminant and with positive -coefficient. Write , and put
[TABLE]
- (a)
Suppose that is positive definite. Then, we have
[TABLE]
where
[TABLE] 2. (b)
Suppose that is reducible and that has the shape (1.11). Then, we have
[TABLE]
where
[TABLE] 3. (c)
Suppose that is indefinite and irreducible. Define to be such that is the fundamental unit of the quadratic order , or equivalently
[TABLE]
where is the least solution to . Then, we have
[TABLE]
where
[TABLE] 4. (d)
In all three cases, for any , we have
[TABLE]
and also
[TABLE]
Notice that the error terms in Theorem 1.2 depend upon . Hence, we are unable to obtain an asymptotic formula for by summing over . However, there are only three that need to be considered if we restrict to the forms in
[TABLE]
This is because by Proposition 2.1 below, such a matrix must be of the shape or up to sign, where . From (1.9), we then deduce that
[TABLE]
For , let us put
[TABLE]
Then, by (1.8) and the above discussion, we have
[TABLE]
where we may take
[TABLE]
whose discriminants are , and , respectively. It follows that:
Corollary 1.3**.**
We have
[TABLE]
Proof.
Theorem 1.2 implies that
[TABLE]
Summing these terms up then yields the claim. ∎
Finally, as a consequence of the proof of Theorem 1.2, we also have:
Theorem 1.4**.**
Let , where are coprime and is not a square. Then, the negative Pell’s equation has integer solutions if and only if the integral binary quadratic form is -equivalent to a form of the shape with dividing .
We now discuss some potential applications of our Theorem 1.2 and Corollary 1.3.
First, it is natural to ask whether the asymptotic formula (1.3), which was proven using Proposition 5.1, admits a secondary main term. From the arguments in [4], we see that the error term arising from volumes of the lower dimensional projections in Proposition 5.1 is only of order . Thus, possibly is the order of a second main term, but it is dominated by another error term coming from
[TABLE]
In particular, it was shown in [4, Lemma 2.4] that
[TABLE]
Our Corollary 1.3 removes this obstacle, because
[TABLE]
by (1.6) and Theorem 1.2 (d), whence we have
[TABLE]
This improvement potentially allows one to prove a secondary main term for (1.3) by using similar methods from [5], where it was shown that the counting theorem in [14] for cubic fields has a secondary main term of order ; this latter fact was proven independently in [23] as well.
Next, integral binary quartic forms are closely related to quartic orders, and maximal irreducible quartic orders may be regarded as quartic fields. More generally, by the construction of Birch-Merriman [7] or Nakagawa [20], any integral binary form gives rise to a -order whose rank is the degree of , where -equivalence class of corresponds to isomorphism class of . By [15], it is well-known that all cubic orders come from integral binary cubic forms, which enabled the enumeration of cubic orders having a non-trivial automorphism as well as cubic fields by their discriminant; see [6] and [14], respectively. But this is not true for orders of higher rank. Parametrizations of quartic and quintic orders were given by Bhargava in his seminal work [2] and [3]. In [25], Wood further showed that the quartic orders arising from integral binary quartic forms are exactly those having a monogenic cubic resolvent; see [2] for the definition. This implies that the forms in
[TABLE]
correspond to quartic -, -, and -fields whose ring of integers has a monogenic cubic resolvent. In our upcoming paper [24], we shall enumerate -equivalence classes of forms in with respect to a height corresponding to the conductor of fields, as motivated by [1]. In fact, we shall that show that
[TABLE]
Thus, our counting theorem in [24] may be regarded as a refinement and an extension of Corollary 1.3 above.
Last but not least, binary quartic forms are connected to elliptic curves as well. In particular, any integral binary quartic form gives rise to an elliptic curve
[TABLE]
defined over . In [4], Bhargava and Shankar applied (1.3) as well as a parametrization of 2-Selmer groups due to Birch and Swinnerton-Dyer to show that the average rank of elliptic curves over , when ordered by a naive height analogous to (1.2), is at most . This result is remarkable in that it is the first to show, unconditional on the BSD-conjecture and the Grand Riemann Hypothesis, boundedness of the average rank of large families of elliptic curves over . Conditional bounds were obtained by Brumer [8], Heath-Brown [17], and Young [26] previously. Now, the relations in (1.5) imply that for with , we have
[TABLE]
which has a rational -torsion point. Hence, our Theorem 1.2 potentially allows one to study arithmetic properties of elliptic curves with -torsion over . Let us remark that unlike a large family of elliptic curves over , in the sense of [4, Section 3], the family consisting of those curves with a rational -torsion exhibits a rather peculiar behaviour. Indeed, Klagsbrun and Lemke-Oliver [19] proved that the average size of the 2-Selmer groups in this family is unbounded, and they conjectured an asymptotic growth rate. One might be able to obtain such an asymptotic growth rate using our Theorem 1.2 and a sieve that detects local solubility; this line of inquiry is pursued in an upcoming paper due to D. Kane and Z. Klagsbrun.
2. Characterization of forms with small Galois groups
2.1. Cremona covariants
Let be a real binary quartic form with . As Cremona defined in [10], we have three quadratic covariants , each of which is associated to a root of ; see [27, Subsection 4.2] for the explicit definition. They satisfy the syzygy
[TABLE]
where is the Hessian covariant of and is given by
[TABLE]
We shall label the roots of such that
[TABLE]
where is defined as in [27, (4.6)]. Then, from (2.1) and the explicit expressions for given in [27], we have the following observations:
- (1)
For , the binary quadratic form has real coefficients. 2. (2)
For , we have:
If , then has real coefficients for some .
If , then does not have real coefficients for all .
Also, it is easy to check that
[TABLE]
We shall require the following result by the second-named author in [27].
Proposition 2.1**.**
Let be a real binary quartic form with . Then, a set of representatives for the quotient group
[TABLE]
is given by
[TABLE]
Furthermore, the quadratic forms , and , are pairwise non-proportional over .
Proof.
For the first statement, see [27, Proposition 4.6]. As for the second statement, since are covariants, replacing by a -translate if necessary, we may assume that . In this special case, it is not hard to verify the claim using the explicit expressions for in [27, (4.6)]. ∎
Let be a real binary quartic form with . Proposition 2.1 implies that for any real binary quadratic form with , we have if and only if
[TABLE]
Moreover, this root is unique, and we shall denote it by . This was required in order to define the - and -invariants in (1.4).
2.2. Proof of Theorem 1.1
The key is the following lemma.
Lemma 2.2**.**
Let be an integral binary quartic form with and let be a root of . Then, the quadratic form is proportional over to a form with integer coefficients if and only if .
Proof.
If , then we easily see from (2.1) that has integer coefficients for some . Conversely, if has integer coefficients for some , then consider the action of an element , where is an algebraic closure of . It is clear from the definition of that . From (2.1), we have
[TABLE]
and this last binary quartic form has zero discriminant. This shows that for all . Thus, we have , and so since is monic. ∎
The first claim in Theorem 1.1 now follows from Proposition 2.1, Lemma 2.2, and (2.3). Note that , which means that has three integer roots if and only if is reducible and . The second claim then follows from this fact and (2.2).
3. Basic properties of forms in of non-zero discriminant
Throughout this section, let be a real binary quadratic form with . It is not hard to check, by a direct calculation, that
[TABLE]
if , and similarly that
[TABLE]
if . Below, we shall give some basic properties of and .
3.1. The two new invariants
Recall the definitions of the - and -invariants given in (1.4). First, we shall show that they are indeed invariants under the twisted action of in the following sense.
Proposition 3.1**.**
For all and , we have
[TABLE]
Proof.
Notice that . For any root of , because is a covariant up to sign by (2.1), if is proportional to , then is proportional to . It then follows from the definition that . Since , we also have by the first equality in (1.5). ∎
We shall give explicit formulae for and in two special cases.
Proposition 3.2**.**
The following holds.
- (a)
Assume that . Then, for all as in (3.1), we have
[TABLE]
Moreover, we have
[TABLE]
where
[TABLE] 2. (b)
Assume that . Then, for all as in (3.2), we have
[TABLE]
Moreover, we have
[TABLE]
Proof.
This may be verified by explicit computation. ∎
We shall also need the following observation.
Proposition 3.3**.**
Assume that is integral. Then, for all , we have
[TABLE]
Moreover, when is primitive in addition, we have
[TABLE]
Proof.
We have by Lemma 2.2. Since , we deduce from the first equality in (1.5) that holds as well. Observe that
[TABLE]
both of which are integers. Since , we deduce from (1.7) that at least one of the above expressions is divisible by . But again by (1.5), we have
[TABLE]
so in fact both expressions are divisible by . This proves the first claim.
Next, assume that is primitive in addition. In view of Proposition 3.1, by applying a -action on if necessary, we may assume that and that is coprime to . Using Proposition 3.2 (a), we then compute that
[TABLE]
This expression is an integer by the first claim, and hence must be divisible by , because is taken to be coprime to . This proves the second claim. ∎
3.2. Determinants of the two lattices
In this subsection, assume that is integral and primitive. Let and denote the lattices defined in (1.10). Below, we shall compute their determinants in terms of the number as in Theorem 1.2.
Proposition 3.4**.**
We have and .
Proof.
Observe that the linear transformation defined by the matrix
[TABLE]
has determinant , and it sends to . Thus, it suffices to prove the first claim. Recall from (3.1) that is the set of tuples satisfying
[TABLE]
If , then it is easy to check that . If , then we shall use the fact that
[TABLE]
and so indeed holds by Lemma 3.5 below. ∎
Lemma 3.5**.**
Let be a prime dividing and let . Then, we have
[TABLE]
Proof.
For brevity, write
[TABLE]
Then, the claim may be restated as
[TABLE]
By definition, the lattice is the set of tuples satisfying
[TABLE]
where
[TABLE]
Observe that we have the relation
[TABLE]
For , we deduce from (3.3) that is defined solely by
[TABLE]
For and , it is easy to see that is in fact defined by
[TABLE]
For and , we shall first show that is also defined by
[TABLE]
If (3.4) is satisfied, then from (3.3), it is easy to see that . Conversely, if , then the assumption implies that
[TABLE]
while reducing (3.3) mod also yields
[TABLE]
From these three congruence equations, it follows that (3.4) is indeed satisfied. In all cases, we then see that is as claimed. ∎
3.3. Forms with abelian Galois groups
In this subsection, assume that is integral. Consider an irreducible form . By Theorem 1.1, we have , , or . To distinguish among these three possibilities, note that the cubic resolvent polynomial of , defined by
[TABLE]
when has the shape (1.1), is reducible since is small. Also, it has a unique root precisely when , in which case we define
[TABLE]
Then, we have the well-known criterion
[TABLE]
See [9] for example. We then deduce that:
Proposition 3.6**.**
Let be an irreducible form. Then, we have
[TABLE]
as well as
[TABLE]
Proof.
Observe that by (1.7), we have
[TABLE]
The first claim is then clear. Next, suppose that . By Proposition 3.1, we may assume that . For in the shape as in (3.1), a direct computation yields
[TABLE]
Using Proposition 3.2 (a), we further compute that
[TABLE]
By (1.7) and the criterion above, it follows that are squares if and only if is a square, as desired. ∎
3.4. Reducible forms
In this subsection, assume that is integral. We shall study the reducible forms in . Let us first make a definition and an observation.
Definition 3.7**.**
Let be a reducible form.
- (1)
We say that is of type if for some and integral binary quadratic form . 2. (2)
We say that is of type if for some integral binary quadratic forms and satisfying and .
Lemma 3.8**.**
For all reducible forms of type , we have
[TABLE]
Proof.
This may be verified by a direct computation. ∎
Below, we shall show that the two reducibility types in Definition 3.7 are in fact the only possibilities. We shall require two further lemmas.
Lemma 3.9**.**
Let be a non-zero complex binary linear form, and suppose that for some . Then, we have , with
[TABLE]
in the case that .
Proof.
The hypothesis implies that
[TABLE]
Then, by computing the eigenvalues and eigenspaces of the matrix above, we see that the claim holds. ∎
Lemma 3.10**.**
Let be a non-zero complex binary quadratic form, and suppose that for some . Then, we have , with
[TABLE]
in the case that .
Proof.
The hypothesis implies that
[TABLE]
Then, by computing the eigenvalues and eigenspaces of the matrix above, it is not hard to check that the claim holds.∎
Proposition 3.11**.**
Any reducible form is either of type or of type .
Proof.
Write , where the are complex binary linear forms, and are pairwise non-proportional because . Since is reducible, by renumbering if necessary, we may assume that
[TABLE]
have integer coefficients and are irreducible. We have and by definition. Hence, up to scaling, the matrix acts on the via a permutation on four letters of order dividing two. This has two consequences.
By (1.8), without loss of generality, we may assume that . First, the form cannot have exactly one rational linear factor, for otherwise
[TABLE]
From Lemma 3.9, it would follow that is a square and that is proportional to a form with integer coefficients, which is a contradiction. Second, when has four rational linear factors, by further renumbering if necessary, we may assume that
[TABLE]
Now, in all three of the possible cases for the factorization of , define
[TABLE]
which are integral binary quadratic forms by definition. We then deduce that
[TABLE]
for some . In the former case, it is clear that is of type . In the latter case, we have by Lemma 3.10 and the fact that , so is of type . ∎
4. Parametrizing forms in of non-zero discriminant
Throughout this section, let be a real binary quadratic form with and . We shall give an alternative parametrization of , different from (3.1) and (3.2), in terms of the regions
[TABLE]
corresponding to the - and -invariants, as well as a parameter arising from the orthogonal group of , defined by
[TABLE]
Note that by (1.7), for any , we have
[TABLE]
First, we shall show that it suffices to consider and . It shall be helpful to recall (1.8) as well as the isomorphisms and defined in Subsection 1.1.
Lemma 4.1**.**
Define a matrix
[TABLE]
Then, we have a well-defined bijective linear map
[TABLE]
and we have .
Proof.
The first claim holds by (1.8) and the fact
[TABLE]
Identifying and with via , we see from (3.1) that
[TABLE]
from which the second claim follows. ∎
In the subsequent subsections, we shall prove the following propositions.
Proposition 4.2**.**
There exists an explicit bijection
[TABLE]
defined as in (4.4), such that
- (a)
we have and , 2. (b)
the Jacobian matrix of has determinant .
Proposition 4.3**.**
There exist explicit injections
[TABLE]
defined as in (4.6), with
[TABLE]
such that
- (a)
we have and , 2. (b)
the Jacobian matrix of has determinant ,
for all .
In view of (1.11), we shall give another parametrization of when , which does not require reducing to the form via Lemma 4.1.
Proposition 4.4**.**
Suppose that . Then, there exist explicit injections
[TABLE]
defined as in (4.9), with
[TABLE]
such that
- (a)
we have and , 2. (b)
the Jacobian matrix of has determinant ,
for both .
For , we shall use the notation
[TABLE]
which is an element of and , respectively.
4.1. Positive definite case
Define
[TABLE]
where
[TABLE]
The image of lies in by (3.1) and (1.8). Using Propositions 3.1 and 3.2 (a), it is easy to check that Proposition 4.2 (a) holds.
Now, by (3.1), an arbitrary has the shape
[TABLE]
Write and . Note that because by (1.7). For , a direct computation yields
[TABLE]
where
[TABLE]
It is not hard to show that there exists a unique such that and . Put . Then, we have
[TABLE]
by Propositions 3.1 and 3.2 (a). We solve that , or equivalently
[TABLE]
Since is uniquely determined by , this shows that is a bijection.
Finally, the above calculation also yields
[TABLE]
where
[TABLE]
By a direct computation, we then see that Proposition 4.2 (b) holds.
4.2. Indefinite case
Define
[TABLE]
where
[TABLE]
for , and
[TABLE]
for . The images of lie in by (3.1) and (1.8). Using Propositions 3.1 and 3.2 (a), it is easy to check that Proposition 4.3 (a) holds.
Now, by (3.1), an arbitrary has the shape
[TABLE]
Write and . For , a direct computation yields
[TABLE]
where
[TABLE]
Note that . It is not hard to check that:
- •
If , then there is a unique such that .
- •
If , then for all , and there is a unique such that .
Put . Then, we have
[TABLE]
by Propositions 3.1 and 3.2 (a). We solve that , or equivalently
[TABLE]
Since is uniquely determined by , this shows that are all injections, and that the stated disjoint union holds.
Finally, the above calculation also yields
[TABLE]
where
[TABLE]
for , and
[TABLE]
for . By a direct computation, we then see that Proposition 4.3 (b) holds.
4.3. Reducible case
Suppose . For , put
[TABLE]
which is an element of . Define
[TABLE]
where
[TABLE]
The images of lie in by (3.2) and (1.8). Using Propositions 3.1 and 3.2 (b), it is easy to check that Proposition 4.4 (a) holds.
Now, by (3.2), an arbitrary has the shape
[TABLE]
Write and . For , a direct computation yields
[TABLE]
where
[TABLE]
Since , we have for a unique , and there is a unique such that . Put . Then, we have
[TABLE]
by Propositions 3.1 and 3.2 (b). We solve that , or equivalently
[TABLE]
Since and are uniquely determined by , this shows that and are both injections, and that the stated disjoint union holds.
Finally, the above calculation also yields
[TABLE]
where
[TABLE]
By a direct computation, we then see that Proposition 4.4 (b) holds.
5. Definition of a bounded semi-algebraic set
Throughout this section, let be an integral and primitive binary quadratic form with and , in the shape (1.11) whenever is reducible. As we have already explained in Subsection 1.1, the proof of Theorem 1.2 is reduced to counting points in the lattices in (1.10), which in turn amounts to certain volume computations, by the result below.
Proposition 5.1** (Davenport’s lemma).**
Let be a bounded semi-algebraic multi-set in having maximum multiplicity and which is defined by at most polynomial inequalities, each having degree at most . Then, the number of integral lattice points (counted with multiplicity) contained in the region is
[TABLE]
where denotes the greatest -dimensional volume of any projection of onto a coordinate subspace by equating coordinates to zero, with . The implied constant in the second summand depends only on .
Proof.
This is a result of Davenport [11], and the above formulation is due to Bhargava and Shankar in [4, Proposition 2.6]. ∎
For , define
[TABLE]
However, to prove Theorem 1.2, we cannot apply Proposition 5.1 directly to
[TABLE]
as in Subsection 1.1, to count the lattice points in because
- (1)
the set is unbounded when is indefinite, 2. (2)
distinct forms in might be -equivalent.
Recall (4.1) and define
[TABLE]
In the notation of Lemma 4.1 as well as Propositions 4.2, 4.3, and 4.4, we have
[TABLE]
respectively, if is positive definite, indefinite, and reducible. We shall overcome the two issues above by restricting the values for .
For brevity, in this section, write
[TABLE]
as in Theorem 1.2 and Lemma 4.1, respectively.
Definition 5.2**.**
If is positive definite, define
[TABLE]
If is reducible, define
[TABLE]
If is indefinite and irreducible, define
[TABLE]
where is defined as in Theorem 1.2 (c).
The goal of this section to prove the following preliminary results and estimates:
Proposition 5.3**.**
The set is bounded, semi-algebraic, and definable by an absolutely bounded number of polynomial inequalities whose degrees are absolutely bounded.
Proposition 5.4**.**
The following statements hold.
- (a)
A form in is -equivalent to at least one form in . 2. (b)
A form in for which is -equivalent to exactly forms in , where is defined as in Theorem 1.2.
5.1. Alternative description
First, we shall give an alternative description of the set in terms of the coefficients of the forms in .
Lemma 5.5**.**
If is positive definite, then .
Proof.
This is clear from (5.1). ∎
Lemma 5.6**.**
If is reducible, then
[TABLE]
where denotes the -coefficient of .
Proof.
For and for any , we have by (4.11), and the claim is then clear from (5.1). ∎
Lemma 5.7**.**
If is an indefinite and irreducible, then
[TABLE]
where in the notation of Proposition 3.2 (a), we define
[TABLE]
and for in the image of , we define
[TABLE]
Proof.
For , consider . For , we have
[TABLE]
by a direct computation using (4.2), (4.7), and (4.8). We then see that
[TABLE]
from which the claim follows. ∎
5.2. Proof of Proposition 5.3
From (4.5), (4.7), (4.8), and (4.11), it is clear that the set is bounded. Thus, it remains to show that is a semi-algebraic set definable by an absolutely bounded number of polynomial inequalities whose degrees are absolutely bounded.
5.2.1. The case when is positive definite or reducible
The claim follows immediately from Lemmas 5.5 and 5.6 as well as Proposition 3.2.
5.2.2. The case when is indefinite and irreducible
The only problem is that is not a polynomial in the , , and -coefficients of . We shall resolve this issue in Lemma 5.8 below. The claim then follows from Lemma 5.7 and Proposition 3.2.
Lemma 5.8**.**
For , let . Then, the condition
[TABLE]
is equivalent to an absolutely bounded number of polynomial inequalities in the variables whose degrees are absolutely bounded.
Proof.
For brevity, define
[TABLE]
as well as write
[TABLE]
Note that by (1.7) because . This implies that and so the stated condition may be rewritten as
[TABLE]
By rearranging, we may further rewrite the above as
[TABLE]
From here, we shall consider the different possibilities for the signs of , , . For example, when and , the above is equivalent to and
[TABLE]
The other cases are analogous. We then see that the claim holds. ∎
5.3. Integral orthogonal groups
We shall require an explicit description of
[TABLE]
In the notation of Lemma 4.1, observe that
[TABLE]
Moreover, it is well-known that
[TABLE]
where and are defined as in (4.3), and
[TABLE]
We shall need the following lemma.
Lemma 5.9**.**
Suppose that has finite order. Then, the form is -equivalent to a form of the shape
[TABLE]
for some integers , and .
Proof.
By [21, Chapter IX], for example, a finite cyclic subgroup of not contained in is conjugate to the subgroup generated by one of the following:
[TABLE]
We then deduce that there exists such that is equal to one of the following matrices up to sign:
[TABLE]
Since is primitive with by assumption and , we then check that must have one of the stated shapes. ∎
Proposition 5.10**.**
Suppose that is positive definite. Then, we have
[TABLE]
if is not -equivalent to the forms below, and the group is equal to
[TABLE]
Proof.
Elements in have finite order by (5.2) and so the first claim follows from Lemma 5.9. Using (5.2), we compute that elements in are of the forms
[TABLE]
where and . With the help of the proof of Lemma 5.9, it is not hard to check that is as claimed. ∎
Proposition 5.11**.**
Suppose that is reducible. Then, the group is equal to
[TABLE]
Proof.
Using (5.2), we compute that elements in are of the forms
[TABLE]
where and . For the matrix on the left to have integer entries, necessarily
[TABLE]
Similarly, for the matrix on the right to have integer entries, necessarily
[TABLE]
We then deduce that
[TABLE]
Since has the shape (1.11) by assumption, we have
[TABLE]
and we see that the claim indeed holds. ∎
Proposition 5.12**.**
Suppose that is indefinite and irreducible. Define
[TABLE]
and is the least solution to . Then, we have
[TABLE]
if is not -equivalence to the forms below, and the group is equal to
[TABLE]
Proof.
By (5.2), elements in of infinite order are of the shape
[TABLE]
where and . We then see that
[TABLE]
Hence, the first claim follows from Lemma 5.9 and the fact that is -equivalent to the form
[TABLE]
Now, again by (5.2), elements in of finite order have the shape
[TABLE]
where and . Notice that the matrix on the left cannot lie in because is not square when is irreducible. Using the description of , it is then not hard to check that , from which the second claim follows. ∎
5.4. Proof of Theorem 1.4
Suppose that and that is not a square. In the notation of Proposition 5.12, we have
[TABLE]
by definition. But Proposition 5.12 also implies that is equivalent to
[TABLE]
The theorem now follows from Lemma 5.9 and (5.4).
5.5. Proof of Proposition 5.4
We shall need the following lemma.
Lemma 5.13**.**
For all with and , we have
- (a)
* if and only if ,* 2. (b)
* if and only if .*
Proof.
Note that by (1.8). By Theorem 1.1 (a), we then have if and only if , whence part (a) holds. By Theorem 1.1 (a) and Proposition 2.1, we have if and only if is proportional to , from which part (b) follows since . ∎
5.5.1. The case when is positive definite or reducible
Let us first observe that:
Lemma 5.14**.**
We have .
Proof.
Let be given. If is positive definite, then clearly by Lemma 5.5. If is reducible, then recall Lemma 5.6, and we have since
[TABLE]
by (4.10) and Proposition 3.2 (b), respectively. ∎
Lemma 5.14 implies that part (a) holds. Together with Lemma 5.13 (a, it further implies that for with , the number of forms in which are -equivalent to is equal to
[TABLE]
By Lemma 5.13 (b), we in turn have
[TABLE]
which may be verified to be equal to using Propositions 5.10 and 5.11.
5.5.2. The case when is indefinite and irreducible
We shall use the notation from Lemma 4.1, Proposition 5.12, (4.3), and (5.3). Then, by definition, we have
[TABLE]
Now, by (5.1) and (4.6), a form in is of the shape
[TABLE]
Observe that and commute with as well as fix the forms in . For any , we then deduce that
[TABLE]
Let be the unique integer such that . The existence of then implies part (a).
Next, suppose that , in which case
[TABLE]
by Lemma 5.13 (a). If , then part (b) holds by the uniqueness of . If , then recall from Proposition 5.12 that
[TABLE]
From (5.2), we see that
[TABLE]
Then, for any , it is straightforward to verify that
[TABLE]
There is a unique such that . Observe that
[TABLE]
But has finite order, and so it cannot proportional to by (5.5), which is a contradiction by Lemma 5.13 (b). Then, we conclude from Proposition 5.12 that part (b) indeed holds.
6. Error estimates and the main theorem
Throughout this section, let be an integral and primitive binary quadratic form with and , in the shape (1.11) whenever is reducible. Let and be as in Theorem 1.2.
In Subsections 6.1 and 6.2, respectively, we shall first prove:
Proposition 6.1**.**
For any , we have
[TABLE]
and
[TABLE]
Further, the number
[TABLE]
is equal to zero if . and is bounded by otherwise.
Propositions 6.1, 3.6, and 5.4 then imply part d) of Theorem 1.2.
The reader should compare the last claim above with [28, Theorem 1.4].
Proposition 6.2**.**
We have
[TABLE]
Now, from Propositions 5.4, 6.1, and 6.2, we also easily see that
[TABLE]
Let be a linear transformation on which takes to , and define
[TABLE]
as before. Observe that then
[TABLE]
By Proposition 5.3, we may apply Proposition 5.1 to obtain
[TABLE]
where by Proposition 3.4, we know that
[TABLE]
Hence, it remains to compute the above volumes, which we shall do in Subsection 6.3.
6.1. Proof of Proposition 6.1
Recall the notation from Proposition 3.2. By definition and Proposition 3.3, we then have a well-defined map
[TABLE]
Using Proposition 3.2, it is easy to verify that is in fact injective. We shall also need the following result due to Heath-Brown [18].
Lemma 6.3**.**
Let be a ternary quadratic form such that its corresponding matrix has non-zero determinant. For , let denote the number of tuples such that
[TABLE]
Then, we have
[TABLE]
where denotes the greatest common divisor of the minors of , and is the number of ways to write as a product of three positive integers.
Proof.
See [18, Corollary 2].∎
In what follows, consider , and for brevity, write
[TABLE]
Since is injective, it is enough to estimate the number of choices for . To that end, let us put . Recall from Propositions 3.2 and 3.3 that
[TABLE]
which is non-zero by (1.7). By the definition of our height, we also have
[TABLE]
The latter estimate holds by
[TABLE]
as well as the fact that and are linear in the coefficients of . Finally, we shall write for the divisor function.
Proof of Proposition 6.1: first claim.
Suppose that . Then, we have
[TABLE]
If is reducible, then and so clearly there are
[TABLE]
choices for the pair . If is irreducible, then note that
[TABLE]
and applying Lemma 6.3 to the ternary quadratic form with matrix
[TABLE]
we deduce from (6.3) that there are
[TABLE]
choices for the pair . In both cases, we see that there are
[TABLE]
choices for in total, whence the claim. ∎
Proof of Proposition 6.1: second claim.
Suppose that . By Proposition 3.3, we may write
[TABLE]
From the hypothesis, we then easily see that
[TABLE]
as well as that divides . In particular, a simple calculation yields
[TABLE]
Now, suppose also that , in which case by (6.3). Note also that
[TABLE]
Applying Lemma 6.3 to the ternary quadratic form with matrix
[TABLE]
we then see from (6.3) that there are
[TABLE]
choices for when is fixed. It follows that we have
[TABLE]
choices for and hence for .
Next, regard as being fixed, and recall that
[TABLE]
We claim that there are choices for . If is positive definite or if is reducible, then this is clear. If is indefinite and irreducible, then by Definition 5.2 as well as Propositions 3.1 and 4.3, we have
[TABLE]
Since , we must have by the hypothesis, and so in fact . From the proof of Lemma 5.7, we know that
[TABLE]
which implies that
[TABLE]
Since , we then deduce that indeed there are choices for . Using the bound , we conclude that there are
[TABLE]
choices for in total, whence the claim. ∎
Proof of Proposition 6.1: third claim.
Suppose that and that is in the shape as in (3.1). Using Proposition 3.2, we then deduce that
[TABLE]
Hence
[TABLE]
from which it follows that the above expression is a square if and only if is a square. This also follows immediately from the observation that the above product is equal to in this case.
We now suppose that , so in particular is positive definite. is then determined by , and that implies
[TABLE]
Hence there are choices for . It follows that the claim holds. ∎
6.2. Proof of Proposition 6.2
By Lemma 3.8 and Proposition 6.1, we have
[TABLE]
whence it is enough to consider the reducible forms in of type 2; recall Definition 3.7. By definition, such a form has the shape
[TABLE]
where , and we have
[TABLE]
by Lemma 3.10. We have the condition
[TABLE]
since the above numbers are all integers. Using Proposition 3.2 (a), we compute that
[TABLE]
Now, by the definition of our height, we clearly have
[TABLE]
Observe also that
[TABLE]
by (4.7), (4.8), (4.2), and the bound . We then deduce that
[TABLE]
where we define
[TABLE]
It is clear that this set is bounded and semi-algebraic. Hence, we may apply Proposition 5.1 to estimate the number of integral points it contains.
6.2.1. The case when is irreducible
Let us define
[TABLE]
Applying Proposition 5.1, we then obtain
[TABLE]
For any , from (6.5) and (6.6), we deduce that
[TABLE]
as well as that
[TABLE]
This, together with (6.7), implies that in fact
[TABLE]
We then compute that
[TABLE]
The claim now follows from (6.4) and (6.8).
6.2.2. The case when is reducible
Let us define
[TABLE]
Since in this case, we see that
[TABLE]
Now, applying Proposition 5.1, we have
[TABLE]
For any , the conditions (6.5) and (6.6) imply that
[TABLE]
which is analogous to (6.9). We then compute that
[TABLE]
The claim now follows from (6.4) and (6.8).
6.3. Proof of Theorem 1.2
We have already proven part (d). To prove parts (a) through (c), it remains to compute the volumes in (6.2).
6.3.1. The case when is positive definite
We have
[TABLE]
by Lemma 4.1 and Proposition 4.2 (b), as well as
[TABLE]
Observe also that
[TABLE]
because lies in the cube centered at the origin of side length by (4.5) and (4.2). We then deduce part (a) from (6.1) and (6.2).
6.3.2. The case when is reducible
We have
[TABLE]
by Proposition 4.4, as well as
[TABLE]
We then deduce part (b) from Lemma 6.4 below as well as (6.1) and (6.2).
Lemma 6.4**.**
We have .
Proof.
By Definition 5.2, an element in takes the form
[TABLE]
Let us recall that
[TABLE]
Then, from (4.11), we see that -dimensional projections of have lengths of order . As for the -dimensional projections, note that (5.1) and (6.10) yield
[TABLE]
as well as the estimates
[TABLE]
Hence, the projections of onto the -plane and -plane, respectively, have areas bounded by
[TABLE]
Similarly, from (5.1) and (6.10), we deduce that
[TABLE]
as well as the estimate
[TABLE]
Note that also implies that
[TABLE]
Hence, the projection of onto the -plane has area bounded by
[TABLE]
It follows that all of the -dimensional projections of have areas of order , and this proves the lemma.∎
6.3.3. The case when is indefinite and irreducible
We have
[TABLE]
by Lemma 4.1 and Proposition 4.3, as well as
[TABLE]
Observe also that
[TABLE]
because lies in the cube centered at the origin of side length by (4.7), (4.8), (4.2), and the bound on . We then deduce part (c) from (6.1) and (6.2).
7. Acknowledgments
The first-named author was partially supported by the China Postdoctoral Science Foundation Special Financial Grant (grant number: 2017T100060). We would like to thank the referee for many useful suggestions which helped improve the exposition of the paper significantly.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Altug, A. Shankar, I. Varma, and K. Wilson, The number of quartic D 4 subscript 𝐷 4 D_{4} -fields ordered by conductor , ar Xiv:1704.01729 v 1 [math.NT].
- 2[2] M. Bhargava, Higher composition laws III. The parametrization of quartic rings , Ann. of Math. 159 (2004), no. 3, 1329-1360.
- 3[3] M. Bhargava, Higher composition laws IV: The parametrization of quintic rings , Ann. of Math. 167 (2008), no.1, 53-94.
- 4[4] M. Bhargava and A. Shankar, Binary quartic forms having bounded invariants, and the boundedness of the average rank of elliptic curves , Ann. of Math. 181 (2015), no. 1, 191-242.
- 5[5] M. Bhargava, A. Shankar, and J. Tsimerman, On the Davenport-Heilbronn theorems and second order terms , Invent. Math. 193 (2013), no. 2, 193-439 .
- 6[6] M . Bhargava and A. Shnidman, On the number of cubic orders of bounded discriminant having automorphism group C 3 subscript 𝐶 3 C_{3} , and related problems , Algebra and Number Theory 8 (2014), no. 1, 53-88.
- 7[7] B. J. Birch and J. R. Merriman, Finiteness theorems for binary forms with given discriminant , Proc. London Math. Soc. 24 (1972), no. 3, 385-394.
- 8[8] A. Brumer, The average rank of elliptic curves. I , Invent. Math. 109 (1992), no. 1, 445-472.
