Abstract
For a given form \(F\in \mathbb {Z}[x_1,\dots ,x_s]\) we apply the circle method in order to give an asymptotic estimate of the number of m-tuples \({\mathbf {x}}_1, \dots , {\mathbf {x}}_m\) spanning a linear space on the hypersurface \(F(X) = 0\) with the property that \(\det ( ({\mathbf {x}}_1, \dots , {\mathbf {x}}_m)^t \, ({\mathbf {x}}_1, \dots , {\mathbf {x}}_m)) = b\). This allows us in some measure to count rational linear spaces on hypersurfaces whose underlying integer lattice is primitive.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(F \in \mathbb {Z}[x_1,\dots ,x_s]\) be a form of degree d. In previous work [2, 4] we investigated the number of rational linear spaces of dimension m contained in the hypersurface given by \(F({\mathbf {x}})=0\). Let \(N_m(P)\) denote the number of \({\mathbf {x}}_1, \dots , {\mathbf {x}}_m \in \mathbb {Z}^s\), \(|x_{ij}| \leqslant P \; (1 \leqslant i \leqslant m, 1 \leqslant j \leqslant s)\), satisfying
and set \(r = \left( {\begin{array}{c}m+d-1\\ d\end{array}}\right) \). Theorem 1.1 of [2] and Theorem 1.3 of [4] show that there exists a positive parameter \(\delta \) such that
for some non-negative constants \(\chi _{\infty }\) and \(\chi _p\) characterising the density of solutions over the local fields \(\mathbb {R}\) and \(\mathbb {Q}_p\), respectively, provided that
It is, however, apparent that the strategy of counting linear spaces by analysing Eq. (1.1) is susceptible to double-counting in several ways. Rational linear spaces can be viewed as integer lattices, but in order to count lattices via counting sets of generators, we need tools both to identify primitive lattices and to account for the multiplicity factor by which each individual lattice is counted. The objective of this memoir is to make a step in this direction by counting integer lattices contained in hypersurfaces that have a fixed lattice discriminant. If \(L' \subseteq L\) is a sublattice, then the discriminant of L will divide the discriminant of \(L'\). It follows that the m-dimensional sublattices of \(\mathbb {Z}^s\) counted by \(N_m(P)\) with prime discriminant will be primitive unless they are oriented along coordinate axes, in which case they are primitive if and only if they are unimodular.
Suppose that \(({\mathbf {x}}_1, \dots , {\mathbf {x}}_m)\) is a solution to (1.1), then we may consider the lattice X spanned by \({\mathbf {x}}_1, \dots , {\mathbf {x}}_m\). This is a sublattice of \(\mathbb {Z}^s\) of dimension at most m and with lattice discriminant \({\mathcal {D}}(X) = \sqrt{\det (({\mathbf {x}}_1, \dots , {\mathbf {x}}_m) ^t \,({\mathbf {x}}_1, \dots , {\mathbf {x}}_m))}\). Write \(D({\mathbf {x}}_1, \dots , {\mathbf {x}}_m) = {\mathcal {D}}(X)^2\), so that D is a homogeneous polynomial of degree 2m in the ms variables \(({\mathbf {x}}_1, \dots , {\mathbf {x}}_m) \in \mathbb {Z}^{ms}\), and denote by \(N_m(P;b)\) the number of \(({\mathbf {x}}_1, \dots , {\mathbf {x}}_m) \in \mathbb {Z}^{ms}\) counted by \(N_m(P)\) that additionally satisfy the equation
The main result of this paper is an asymptotic estimate for \(N_m(P;b)\).
Theorem 1.1
Let \(F \in \mathbb {Z}[x_1, \dots , x_s]\) be a smooth form of degree \(d \geqslant 2\), and let \(m \geqslant 2\) be a positive integer. Furthermore, suppose that
if \(d>2m\), and
if \(d<2m\). Then there exists a \(\delta >0\) such that
with non-negative factors \(\chi _{\infty }(b,P)\) and \(\chi _p(b)\) that characterise the density of solutions of the system over the local fields \(\mathbb {R}\) and \(\mathbb {Q}_p\), respectively.
More general versions of each of the cases of Theorem 1.1 are available below (see Theorems 4.1, 7.1) that somewhat relax the requirement that F should be smooth. The glaring omission here is of course the case \(d=2m\); while the analytical aspects of the treatment of this case are in fact more conventional than in the situation when \(d \ne 2m\) and largely follow the arguments of [1, 2], the geometry creates additional difficulties when the singularities of F interfere with the discriminant equation. We plan to resolve this issue in future work.
We will prove Theorem 1.1 by the circle method via a combination of the ideas presented in our own work [2] and recent work by Browning and Heath-Brown [5]. Observe that the latter can be applied directly to the simultaneous Eqs. (1.1) and (1.3), yielding conditions of the shape \(s>s_0(d,m)\), where \(s_0(d,m) \ll 2^d r^2 d\) for \(d >m\) and \(s_0(d,m) \ll 2^{2m}r^2m\) when \(2m>d\). In particular, these bounds grow quadratically in the parameter r, which is itself of size \(m^d\). In contrast, Theorem 1.1 exhibits linear growth in r.
It is an obvious question whether or not, and in what circumstances, the local factors in Theorem 1.1 are positive, so that the formula in (1.4) provides an honest asymptotic estimate. Ideally, one might be tempted to speculate that there might be a way of relating each factor \(\chi _p(b)\) in (1.4) with the corresponding factor \(\chi _p\) in (1.2), but unfortunately it seems highly unlikely for such a relation to hold in general. Nonetheless, we are able to say something about the factors. An argument by Schmidt [12, Sect. 2] shows that \(\chi _{\infty }(b,P)>0\), provided that the variety described by (1.1) and (1.3) has a positive \((ms-r-1)\)-dimensional volume inside \([-1,1]^{ms}\). Similarly, one can show by arguments due to Schmidt (see [11, Lemma 2 and Sect. 11] and [12, Sect. 2]) in combination with a bound of Wooley on p-adic solubility [13, Corollary 1.1] that \(\chi _p(b)\) is positive whenever
though we note that for generic forms F this bound may be improved somewhat by earlier work of the author (see [3, Corollary 1]).
In the context of Theorem 1.1, the choice of \(b=0\) is somewhat distinguished, as it corresponds to the number of choices for \({\mathbf {x}}_1, \dots , {\mathbf {x}}_m\) satisfying (1.1) that have a linear dependence relation between them. Such solutions span linear spaces of dimension at most \(m-1\), and thus represent the ‘degenerate’ solutions to (1.1). As might be expected, results controlling the number of such degenerate solutions can be obtained by much simpler means. Lewis and Schulze-Pillot [9, p. 283] addressed the issue perfunctorily by showing that the set of linear spaces of dimension at most m / 2 has itself dimension smaller than \(ms-rd\) whenever \(s>m/2 +2rd/m\), which is sufficient for applications requiring only an asymptotic dependence on m (see e.g. Lewis and Schulze-Pillot [9, Theorems 1, 3], Dietmann [7, Theorem 2], and Brandes [2, Theorem 1.3]). However, even a precise statement can easily be established by observing that the main term of \(N_m(P)\) exceeds that of \(N_{m-1}(P)\) as soon as \(s>\left( {\begin{array}{c}d+m-2\\ d-1\end{array}}\right) d\), a much weaker condition than what is required in Theorem 1.1. Nonetheless, one could ask even in this setting how Theorem 1.1 compares with other analytic methods in showing that \(N_m(P;0) = o(N_m(P))\). The conclusion of Theorem 1.1 is stronger than necessary in that it saves an additional amount of \(P^{2m}\) over what is needed for a non-trivial result. Marmon [10] recently showed that non-trivial upper bounds can be established even when the number of variables is smaller than what is required for an asymptotic formula. However, in order to save the required amount, his methods still yield bounds on the number of variables that grow quadratically in r, though one can potentially improve on this by optimising his treatment for situations involving linear spaces.
This question can be interpreted in somewhat different terms in the context of counting matrices with a fixed determinant. Whilst the determinant is in many ways the most natural measure of the size of a matrix, its hyperbolic nature renders it unsuitable as a height function. Hence in settings that require a finite-volume height function one typically resorts to height functions that increase with the size of the coefficients, and this raises the question of whether the two can be related. Duke et al. [8, Example 1.6] provide a count of matrices of bounded euclidean height with a given non-zero determinant. Our Theorem 1.1 can be viewed as a generalisation of their result in the sense that we count matrices whose constituting columns lie not in the affine space but on a hypersurface. Obviously, such a question can sensibly be asked only if the dimension of the linear space is smaller than the dimension of the embedding variety, and in practice we require the much more stringent condition that the variety contain a sufficiently high-dimensional linear space on which to perform such a count.
As a result of the methods applied, the proof of Theorem 1.1 naturally consists of two essentially self-contained parts, as the cases \(d>2m\) and \(d<2m\) need separate treatment. We will consider the situation when \(d<2m\) in Sects. 2, 3 and 4, and turn to the structurally similar but technically slightly more demanding case \(d>2m\) in Sects. 5, 6 and 7.
Throughout the paper, the following conventions will be observed. Every statement involving the letter \(\varepsilon \) is true for all \(\varepsilon >0\), and consequently no effort will be made to trace the ‘value’ of \(\varepsilon \). Statements involving vectors should be read entry-wise, so \(|{\mathbf {x}}| \leqslant P\) means \(|x_i| \leqslant P\) for all components \(x_i\) of \({\mathbf {x}}\). Similarly, we write \(({\mathbf {a}}, b)\) for the greatest common divisor of all entries \(a_i\) and b. Expressions like \(\sum _{n=1}^x f(n)\), where x may or may not be an integer, are always to be interpreted as \(\sum _{1 \leqslant n \leqslant x} f(n)\). We will commonly write \(\mathbb {T}= \mathbb {R}/\mathbb {Z}\). Finally, we write \(e(x) = e^{2 \pi i x}\) and use the Landau and Vinogradov notation extensively. All implied constants are allowed to depend on s, d, m and the coefficients of F, but are independent of P, which is always taken to be a large integer.
2 The case \(2m>d\): Weyl’s inequality
Let \(\Phi \) be the symmetric d-linear form associated to F, and write J for the set of d-tuples \({\mathbf {j}} \in \{1,\dots ,m\}^d\) neglecting order, so that \({{\mathrm{Card}}}J = r\). Then we have
with suitable combinatorial factors \(A({\mathbf {j}}) \in \mathbb {Z}/d!\). Writing \(\overline{\mathbf {x}} = ({\mathbf {x}}_1, \dots , {\mathbf {x}}_m)\) and \(\Phi _{{\mathbf {j}}}(\overline{\mathbf {x}}) = A({\mathbf {j}})\Phi ({\mathbf {x}}_{j_1}, \dots , {\mathbf {x}}_{j_d})\), we see that (1.1) holds for precisely those \(\overline{\mathbf {x}}\) that satisfy
Let \( \varvec{\alpha }=(\alpha _{{\mathbf {j}}})_{{\mathbf {j}} \in J}\) and \(\underline{\varvec{\alpha }}= (\varvec{\alpha }, \alpha _0) \in \mathbb {T}^r \times \mathbb {T}\), and write
then we may define the exponential sum as
Recalling the standard orthogonality relations from Fourier analysis, the counting function \(N_m(P;b)\) is now given by
Our first task is to bound \(T_P(\underline{\varvec{\alpha }})\) from above. Define the discrete differencing operator via its action on a test polynomial \(G \in \mathbb {Z}[{\mathbf {x}}_1, \dots , {\mathbf {x}}_m]\) as
The following is an easy modification of Lemma 3.1 of [2].
Lemma 2.1
Let \(1 \leqslant k \leqslant 2m\) and \(j_l\), \(1 \leqslant l \leqslant k\), be integers with \(1 \leqslant j_l \leqslant m\). Then
where all sums range over suitable boxes of sidelength at most 2P.
This auxiliary lemma allows us to establish a tripartite Weyl inequality in terms of \(\alpha _0\), but first we need to acquire a better understanding of the action of \(\Delta \) on D. Observe that every vector \({\mathbf {x}}_i\) occurs quadratically within \(D(\overline{\mathbf {x}})\). It follows that the expression \(\Delta _{j_1, {\mathbf {h}}_1} \cdots \Delta _{j_{2m-1}, {\mathbf {h}}_{2m-1}} D(\overline{\mathbf {x}}; \underline{\varvec{\alpha }})\) vanishes whenever an entry of \((j_1, \dots , j_{2m-1})\) occurs at least thrice, and otherwise depends only on \({\mathbf {x}}_{j_{2m}}\), where \(j_{2m}\) is the unique parameter occurring only once in \((j_1, \dots , j_{2m-1})\). Let \(\sigma \) be a permutation of \((1,2,\dots ,m)\) and suppose that \({\mathbf {j}} = (\sigma (1), \dots , \sigma (m), \sigma (1), \dots , \sigma (m))\). Let further \({\mathcal {T}} \subseteq S_{2m}\) denote the group generated by the transpositions \((k, m+k)\), and write
then for fixed \({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1}\) we have
Define the \((2m-1)\)-linear forms \(d_{n}\) for \(1 \leqslant n \leqslant s\) via
where \({\mathbf {e}}_n\) denotes the nth unit vector in \(\mathbb {Z}^s\). In this notation, the Weyl-type lemma is as follows.
Lemma 2.2
Suppose that \(l>0\) and \(0 <\eta \leqslant 1\) are parameters and \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\), then one of the following holds.
-
(A)
We have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-l\eta }\), or
-
(B)
there are integers \(0 \leqslant a_0 < q_0 \ll P^{(2m-1)\eta }\) satisfying \(|\alpha _0 q_0 - a_0| \ll P^{-2m+(2m-1)\eta }\), or
-
(C)
the number of integer vectors \({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1} \in [-P^{\eta }, P^{\eta }]^s\) satisfying
$$\begin{aligned} d_n({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1}) = 0 \qquad (1 \leqslant n \leqslant s) \end{aligned}$$(2.3)is asymptotically larger than \((P^{\eta })^{(2m-1)s - 2^{2m-1}l - \varepsilon }\).
Proof
This is only a slight modification of Lemma 2.5 of Birch [1]. Applying Lemma 2.1 with \(k=2m-1\) yields
Since every application of the difference operator reduces the degree by one, the argument of the exponential is linear in \(\overline{\mathbf {x}}\), and since we had \(d<2m\), the dependence on the form F has disappeared up to at most a constant twist. Write for brevity \({\mathcal {H}} = ({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1})\). In this notation we obtain
and therefore
The remainder of the proof follows precisely by the argument of Birch [1, Sect. 2]. \(\square \)
Birch proceeds by interpreting the third case in Lemma 2.2 geometrically. In our setting, however, we encounter a delicacy when embedding the discriminant function into the complex numbers. In fact, the complex embedding of the discriminant is \(\det (X^*\, X)\), where \(X^*\) denotes the adjoint of the matrix X, but since this operation is not polynomial, the complex discriminant function is not amenable to the methods of classical algebraic geometry. It turns out, however, that in our specific case the same ideas underlying the usual arguments from algebraic geometry may still be made to work over the real numbers.
Lemma 2.3
Case (C) of Lemma 2.2 does not occur when
Proof
The set of all \({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1} \in \mathbb {R}^s\) satisfying (2.3) forms a real manifold \({\mathscr {M}}\) inside \(\mathbb {R}^{(2m-1)s}\). Furthermore, Lemma 3.1 of Birch [1] shows that whenever case (C) of Lemma 2.2 applies, then one has
Observe that for any fixed choice of \({\mathbf {x}}_1, \dots , {\mathbf {x}}_{m-1}\) and \({\mathbf {y}}_1, \dots , {\mathbf {y}}_{m-1}\) the polynomial \(\det \left( ({\mathbf {x}}_1, \dots , {\mathbf {x}}_m)^t \,({\mathbf {y}}_1, \dots , {\mathbf {y}}_{m}) \right) \) is homogeneous in \({\mathbf {x}}_m\) and \({\mathbf {y}}_m\), and by Euler’s theorem on homogeneous functions one has
for all \({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1}\) satisfying (2.3). Observe further that the value of \(\det (\overline{\mathbf {x}}^t \, \overline{\mathbf {y}})\) is invariant under the action of the symmetric group \(S_m\) on the indices. Let
and for \(1 \leqslant k \leqslant m\) define recursively \({\mathscr {M}}_k = {\mathscr {M}}_{k-1} \cap {\mathscr {D}}_k\), where \({\mathscr {D}}_k \subseteq \mathbb {R}^{2ms}\) denotes the diagonal given by \({\mathbf {x}}_k = {\mathbf {y}}_k\). It is now clear that \({\mathscr {M}} \subseteq {\mathscr {M}}_1\).
For a given integer k satisfying \(1 \leqslant k \leqslant m-1\), suppose that some tuples \({\mathbf {x}}_1, \dots , {\mathbf {x}}_{m-1}\) and \({\mathbf {y}}_{1}, \dots , {\mathbf {y}}_{m-1}\) with \({\mathbf {x}}_i = {\mathbf {y}}_i\) for all \(1 \leqslant i \leqslant k\) satisfy
then the function \(\det (\overline{\mathbf {x}}^t \, \overline{\mathbf {y}})\) vanishes precisely if either \({\mathbf {x}}_m \in \langle {\mathbf {x}}_1, \dots , {\mathbf {x}}_{m-1} \rangle \) and \({\mathbf {y}}_m\) is arbitrary, or if \({\mathbf {y}}_m \in \langle {\mathbf {y}}_{1}, \dots , {\mathbf {y}}_{m-1}\rangle \) and \({\mathbf {x}}_m\) is arbitrary, so the equation \(\det (\overline{\mathbf {x}}^t \, \overline{\mathbf {y}})=0\), interpreted as an equation in \({\mathbf {x}}_m\) and \({\mathbf {y}}_m\), defines an \((m-1+s)\)-dimensional manifold inside \(\mathbb {R}^{2s}\). Accordingly, the restriction of \(\det (\overline{\mathbf {x}}^t \, \overline{\mathbf {y}})\) to \({\mathscr {D}}_{m}\) vanishes precisely for those vectors \({\mathbf {x}}_{m}\) lying in the \((m-1)\)-dimensional manifold \( \langle {\mathbf {x}}_1, \dots , {\mathbf {x}}_{m-1} \rangle \cup \langle {\mathbf {y}}_{1}, \dots , {\mathbf {y}}_{m-1}\rangle \). Recalling the invariance under \(S_m\), we thus obtain the recursive relationship
and it is clear that after applying (2.6) iteratively \(m-1\) times we obtain
Under the hypotheses of the lemma this leads to a contradiction with (2.5). \(\square \)
If \(\alpha _0\) has an approximation as in case (B) of Lemma 2.2, we may in a second step establish a result similar to that of Lemma 2.2 in order to find a rational approximation for \(\varvec{\alpha }\). An application of Lemma 2.1 with \(k=d-2\) yields
and thus with Cauchy’s inequality
We perform a van der Corput step similar to Sect. 4 in [5]. Let \(q_0\) be as in Lemma 2.2 (B), write \(\nu = (2m-1)\eta \), and observe that
The square expression can be expanded and is then
where we made a change of variables \({\mathbf {x}}_{j_{d-1}} \mapsto {\mathbf {x}}_{j_{d-1}}+q_0 {\mathbf {v}}\) and \({\mathbf {w}} = {\mathbf {u}} - {\mathbf {v}}\). It follows that
Observe that
where \(M({\mathbf {j}})\) is a combinatorial factor. On the other hand, it follows from the assumption on \(\alpha _0\) that
for all \(1 \leqslant i \leqslant m, 1 \leqslant j \leqslant s\), so a multi-dimensional summation by parts shows that the contribution to (2.8) stemming from D is negligible.
For the sake of notational conciseness write \({\mathcal {H}}\) for the tuple \(({\mathbf {h}}_1, \dots , {\mathbf {h}}_{d-2})\). Define the \((d-1)\)-linear forms \(B_n\), \(1 \leqslant n \leqslant s\), via
then a combination of (2.7), (2.8) and (2.9) together with a familiar bound on linear exponential sums yields
for every \({\mathbf {j}} \in J\), where \(\Upsilon _{{\mathbf {j}}}\) is given by
Define
then standard arguments from the geometry of numbers (cf. Sect. 4 in [5] or Lemma 3.4 in [4]) show that for any \(0 < \theta \leqslant 1-\nu \) one has the estimate
It follows that, if \(|T_P(\underline{\varvec{\alpha }})| \gg P^{ms-k\theta }\) for some \(k>0\) and \(0 < \theta \leqslant 1-\nu \), then
and we may conclude as follows.
Lemma 2.4
Suppose that \(\alpha _0\) has an approximation as in case (B) of Lemma 2.3 with denominator \(q_0\), and let \(k>0\) and \(0 < \theta \leqslant 1-(2m-1)\eta \) be parameters. Then one of the following is true.
-
(A)
Either \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-k\theta }\), or
-
(B)
for any \({\mathbf {j}} \in J\) one finds \(q_{{\mathbf {j}}} \ll P^{(d-1)\theta }\) and \(0 \leqslant a_{{\mathbf {j}}} < q_0 q_{{\mathbf {j}}}\) satisfying
$$\begin{aligned} |q_0 q_{{\mathbf {j}}} \alpha _{{\mathbf {j}}} - a_{{\mathbf {j}}}| \ll P^{-d+(d-1)\theta + (2m-1)\eta }, \end{aligned}$$or
-
(C)
the number of \((d-1)\)-tuples \(({\mathbf {h}}_1, \dots , {\mathbf {h}}_{d-1})\) with \(|{\mathbf {h}}_i|\ll P^{\theta } \, (1 \leqslant i \leqslant d-1)\) satisfying
$$\begin{aligned} B_n({\mathbf {h}}_1, \dots , {\mathbf {h}}_{d-1})=0 \qquad (1 \leqslant n \leqslant s) \end{aligned}$$is asymptotically greater than \((P^{\theta })^{(d-1)s - 2^{d-1}k - \varepsilon }\).
This follows as in the proof of Lemma 3.4 in [2], and as in Lemma 3.5 of the same work the third case may be excluded by demanding that
The next step is to combine Lemmas 2.2 and 2.4 in order to bound \(T_P(\underline{\varvec{\alpha }})\) on the minor arcs.
3 The minor arcs in the case \(2m>d\)
The goal of this section is to define our sets of major and minor arcs, and to show that under certain conditions the former set can be taken arbitrarily small. Throughout this section we will always assume the inequalities (2.4) and (2.10) to hold.
For non-negative coprime integers \(a <q\) denote by \({\mathfrak {M}}_0(q,a)\) the set of \(\alpha \in \mathbb {T}\) satisfying \(|q\alpha -a| \leqslant P^{-2m+(2m-1)\eta }\), and define further
and \({\mathfrak {m}}_0(P; \eta ) = \mathbb {T}{\setminus } {\mathfrak {M}}_0(P; \eta )\), where the parameter P will be suppressed whenever there is no danger of confusion. Lemma 2.2 then implies that whenever \(\alpha _0 \not \in {\mathfrak {M}}_0(\eta )\), then we have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-l\eta +\varepsilon }\). This allows us to establish our first pruning lemma.
Lemma 3.1
Suppose that the parameters \(l >0\) and \(\eta _* \in (0,1]\) satisfy
and
Then there exists some \(\delta >0\) for which one has
uniformly for all \(\varvec{\alpha }\in \mathbb {T}^r\).
Proof
Let l and \(\eta _*\) be given according to (3.1) and (3.2). We can find a sequence \((\eta _i)\) with the property
and subject to the condition
This is always possible with \(T_1=O(1)\). It follows from Lemma 2.2 and (3.1) that for some \(\delta >0\) we have
Furthermore, a straightforward calculation shows that
We may therefore decompose the remaining set \({\mathfrak {m}}_0(\eta _*) {\setminus } {\mathfrak {m}}_0(\eta _0)\) according to (3.3). With (3.5) and Lemma 2.2 (A), this yields
and the exponent on the right hand side is
by (3.4), provided \(\varepsilon \) has been taken sufficiently small. This proves the lemma. \(\square \)
The second pruning step involves the major arcs associated to the vector \(\varvec{\alpha }\). Write \({\mathfrak {M}}(P; \theta , \eta )\) for the set of \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\) with \(\alpha _0 =a_0/q_0 + \beta _0 \in {\mathfrak {M}}_0(\eta )\) for which there exist entrywise coprime integer vectors \({\mathbf {a}}, {\mathbf {q}}\) satisfying
and let \({\mathfrak {m}}(P; \theta , \eta ) = \mathbb {T}^{r+1} {\setminus } {\mathfrak {M}}(P; \theta , \eta )\), where the parameter P will typically be suppressed. Again, Lemma 2.4 implies that we have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-k\theta +\varepsilon }\) for all \(\underline{\varvec{\alpha }}\in {\mathfrak {m}}(\theta , \eta )\) having \(\alpha _0 \in {\mathfrak {M}}_0(\eta )\).
It is desirable to have a unique parameter for measuring the size of \(T_P(\underline{\varvec{\alpha }})\) on the minor arcs, and in fact it will transpire in the course of the argument that no generality is lost by setting
Thus the width of \({\mathfrak {M}}(\theta , \eta )\) can be measured in terms of \(\theta \) alone, and we will suppress the redundant parameter \(\eta \) in the future. With this convention we have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-k\theta +\varepsilon }\) for all \(\underline{\varvec{\alpha }}\in {\mathfrak {m}}(\theta )\), so it respects both the respective case distinctions of Lemmas 2.2 and 2.4 simultaneously.
Lemma 3.2
Let \(\eta _*\) be the parameter obtained in Lemma 3.1, and suppose that the conditions
and
are satisfied. Then for any \(\theta \in (0, 1-(2m-1)\eta _*]\) there exists a \(\delta >0\) such that
Proof
A standard computation shows that
where we used (3.6). We now fix a sequence \((\theta _i)\) satisfying
and having the property that
for each i. This is possible by (3.8), and (3.7) ensures via (3.6) that Lemma 2.4 is applicable. In fact, from the definition of \({\mathfrak {m}}(\theta )\) above we have
where the first term is \(O(P^{ms-rd-2m-\delta })\) by Lemma 3.1 and the second term can be bounded above by \(P^{-2m+2(2m-1)\eta _*}P^{ms-k\theta _*+\varepsilon }\). On recalling (3.6) and (3.2) we see that for sufficiently small \(\varepsilon \) the exponent is smaller than \(ms-rd-2m\).
We now argue as before and find that
and the exponent is
which is smaller than \(ms-rd-2m\) by (3.9) whenever \(\varepsilon \) is sufficiently small. \(\square \)
Observe that Lemmas 3.1 and 3.2 are compatible only if one can find a value for \(\eta _*\) satisfying both (3.2) and (3.7). This is possible if and only if
This condition fully encompasses (3.1). It follows that, if the conditions (3.8) and (3.10) are satisfied, we may choose \(\theta \) (and thereby also \(\eta \)) arbitrarily small.
4 The major arcs bound for \(2m>d\)
For the analysis of the contribution from our narrow set of major arcs it is desirable to have approximations of the components of \(\underline{\varvec{\alpha }}\) that use the same denominator. We therefore set
Write \((r(d-1) + (2m-1)(k/l))\theta = \omega \), and for fixed \(q, \underline{\mathbf {a}}\) let \({\mathfrak {N}}(q,\underline{\mathbf {a}})\) denote the set of all \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\) satisfying
Define further
Then \({\mathfrak {M}}(\theta ) \subseteq {\mathfrak {N}}(\theta )\). One computes
Define
and
then a standard argument reveals that
Write further
and
for the truncated singular series and integral. It then follows from (4.4) and (4.1) that
where the error is acceptable if \(\theta \) has been chosen small enough. By a change of variables one has
and thus
It remains to show that \({\mathfrak {S}}_b(P)\) and the integral in the expression for \({\mathfrak {J}}_b(P)\) converge as \(P \rightarrow \infty \) and reproduce the expected main term.
Lemma 4.1
The terms of the singular series are bounded by
Proof
We imitate the argument of Browning and Heath-Brown [5, Lemma 8.2]. Observe that the statement of the lemma is satisfied when \(q=1\), so we can, without loss of generality, suppose that \(q >1\). Equally, if \(a_0=0\), the first term in the minimum returns the trivial bound, allowing us to assume that \(a_0>0\) and therefore \((q,a_0)<q\). Fix \(Q = q^A\) for some large A to be determined later. Applying (4.4) and (4.8) with \(\underline{\varvec{\beta }}= \underline{\varvec{0}}\) and observing that \(v_1(\underline{\varvec{0}}) \asymp 1\), it follows that
Fix \(\eta \) such that
so that \(a_0/q \in {\mathfrak {M}}_0(Q; \eta )\). Note that by taking A sufficiently large we may ensure that \(\eta <m/(2m-1)\), so that these major arcs are disjoint. It follows that \(a_0/q\) is best approximated by itself. Furthermore, in the q-aspect it lies just on the edge of the major arcs. Since by continuity the minor arcs bound applies on the closure of the minor arcs, we have additionally that \(|T_Q(q^{-1} \underline{\mathbf {a}})|\ll Q^{ms-l \eta +\varepsilon }\). Solving this for \(Q^\eta \) and inserting into (4.11) yields after rearranging \(|T_Q (q^{-1} \underline{\mathbf {a}})| \ll Q^{ms+\varepsilon } \left( q/(q,a_0)\right) ^{-\frac{l}{2m-1}}\), and on substituting this into (4.10), one sees that
Recalling that \(Q=q^A\), it is clear that for A sufficiently large the first term dominates. This establishes the first bound in the lemma.
Fix now \(\theta \) via
so that \(q^{-1} \underline{\mathbf {a}} \in {\mathfrak {M}}(Q; \theta )\). As before, we are free to take A large enough that the major arcs \({\mathfrak {M}}(q, \underline{\mathbf {a}})\) are disjoint, and we deduce that in the q-aspect, \(q^{-1} \underline{\mathbf {a}}\) lies on the boundary of \({\mathfrak {M}}(Q;\theta )\), so the minor arcs estimate of Lemma 2.4 (A) still applies and yields \(Q^\theta \ll (Q^{-ms+\varepsilon }|T_Q(q^{-1} \underline{\mathbf {a}})|)^{-1/k}\). Together with (4.12) this produces a non-trivial bound on \(T_Q(q^{-1} \underline{\mathbf {a}})\) which in turn may be inserted into (4.10), yielding
As before, we see that for A large enough the first term dominates. This establishes the second statement of the lemma. \(\square \)
Lemma 4.1 implies that the singular series may be extended to infinity. In fact, we have
for each \(\lambda \in [0,1]\). This series converges if, for some \(\lambda \), one has
and these inequalities can be simultaneously satisfied if and only if
It remains to complete the singular integral
This follows the argument of [5, Lemma 8.3].
Lemma 4.2
We have
Proof
We start by observing that the bound \(|v_1(\underline{\varvec{\beta }})| \ll 1\) is trivial, so in what follows we do not lose any generality by assuming that \(|\beta _0| >1\) and \(|\varvec{\beta }| >1\). Choose \(Q=|\underline{\varvec{\beta }}|^A\) for some large parameter A to be fixed later, and write \(\underline{\varvec{\gamma }}= (Q^{-d} \varvec{\beta }, Q^{-2m}\beta _0)\). Taking \(\underline{\mathbf {a}}=\underline{\varvec{0}}\) and \(q=1\), we have from (4.4) and (4.8) that
Determine \(\eta \) such that \(|\beta _0| = Q^{(2m-1)\eta }\). Observe that when A is suffficiently large one has \(\eta \) \(< m/(2m-1)\), so we can assume that the major arcs are disjoint. Hence \(\gamma _0\) is best approximated by \(q_0=1\) and \(a_0=0\), and thus lies just on the edge of the major arcs \({\mathfrak {M}}_0(Q;\eta )\). By continuity, the minor arcs estimate extends to the closure of the minor arcs, so we have \(Q^{\eta } \ll (Q^{-ms-\varepsilon }|T_Q(\underline{\varvec{\gamma }})|)^{-1/l}\). On the other hand, exploiting the major arcs information about \(\gamma _0\), we obtain
Solving this for \( |T_Q(\underline{\varvec{\gamma }})|\) and inserting into (4.15) yields
Recalling that \(Q=|\underline{\varvec{\beta }}|^{A}\), this yields the first estimate whenever A is large enough.
For the second estimate, we fix \(\theta \) such that, recalling (3.6), we have
As in the previous lemma, by choosing A large enough, we may assume that the major arcs are disjoint. The unique best approximation to \(\underline{\varvec{\gamma }}\) is therefore given by \(\underline{\mathbf {a}} = \underline{\varvec{0}}\) and \(\underline{\mathbf {q}} = \underline{\varvec{1}}\). In particular, \(\underline{\varvec{\gamma }}\) lies on the boundary of \({\mathfrak {M}}(Q; \theta )\). Again, by extending the minor arcs estimate from Lemma 2.4 (A) to the boundary, we deduce that \(Q^{\theta } \ll \left( Q^{-ms-\varepsilon }|T_Q(\underline{\varvec{\gamma }})|\right) ^{-1/k}\). On the other hand, our choice of \(\theta \) implies that
for every \({\mathbf {j}} \in J\). This inequality is easily rearranged to yield a bound on \(|T_Q(\underline{\varvec{\gamma }})|\), and as before, it follows that
which returns the desired bound if A is large enough. \(\square \)
Now write \(\rho _0 = |\beta _0|\) and \(\rho = |\varvec{\beta }|\), and note that the set of \(\varvec{\beta }\) satisfying \(|\varvec{\beta }| = \rho \) has measure \(O(\rho ^{r-1})\). Thus, the expression from (4.14) is bounded above by
for any \(\lambda \in [0,1]\). As in the situation regarding the singular series, the limit \(\chi _{\infty }(b,P) = \lim _{R \rightarrow \infty } \chi _{\infty }(b,P,R)\) exists if the inequalities
can simultaneously be satisfied, which is possible if and only if
Both (4.13) and (4.16) are a consequence of (3.8), so on combining our estimates we obtain
provided that the conditions (2.4), (2.10), (3.8) and (3.10) are all satisfied. In fact, we may restate the case \(2m>d\) of Theorem 1.1 in a more general fashion.
Theorem 4.1
Let F, m and d be as in Theorem 1.1 with \(2m>d\), and suppose that the conditions
are both satisfied. Then for some \(\delta >0\) one has
where the factors are given by
and
The only thing that still remains to be shown is that one has indeed an Euler product representation of the singular series as advertised. This is, however, standard and follows from arguments analogous to those given in Chapter 5 of Davenport’s book [6]. We also remark that the second statement of Theorem 1.1 follows upon assuming \(\dim {{\mathrm{Sing}}}F = 0\) and observing that under this assumption the hypotheses of Theorem 4.1 reduce to
A modicum of computation confirms that for \(2m>d\) the second term dominates.
5 Weyl differencing in the case \(d>2m\)
In our second case, the procedure is structurally very similar to the treatment of the case \(d<2m\). The following is a straightforward modification of Lemma 5.3 of [2].
Lemma 5.1
Suppose that k satisfies (2.10) and we have
Then for \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\) one of the following holds.
-
(A)
We have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-k\theta }\), or
-
(B)
there are integers \(1 \leqslant \tilde{q}\ll P^{2(d-1)\theta }\) and \(0 \leqslant a_{{\mathbf {j}}} < \tilde{q}\) \(({\mathbf {j}} \in J)\) such that
$$\begin{aligned} |\tilde{q}\alpha _{{\mathbf {j}}} - a_{{\mathbf {j}}}| \ll P^{-d+3(d-1)\theta }. \end{aligned}$$
Proof
This follows by the same proof as in [2, Lemma 5.3]. Observe that, since the degree of D is strictly smaller than that of F, all the terms involving D disappear in the course of the proof. \(\square \)
Let now \(\theta \) and \(\tilde{q}\) be fixed, suppose that \(\varvec{\alpha }\) satisfies the condition of Lemma 5.1 (B), and write \(\nu = 3(d-1)\theta \). Recall the definition of the discrete differencing operator from (2.1), then Lemma 2.1 implies that
where the variables \(\overline{\mathbf {x}}\) and \({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-2}\) run over boxes contained in \([-P,P]^s\). By Cauchy’s inequality we have therefore
We abbreviate \({\mathcal {H}} = ({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-2})\). By an argument mirroring the treatment of the case \(2m>d\) leading to (2.8), we observe that
whence we conclude that
Similar to before, we observe that for all \({\mathbf {j}} \in J\) and all \(1 \leqslant i \leqslant m\), \(1 \leqslant n \leqslant s\) one has
from our assumption on \(\varvec{\alpha }\), so it follows from partial summation that the dominating contribution in (5.2) stems from \(D(\overline{\mathbf {x}})\). Recall our notation (2.2), then we find
Let
and define
then arguments from the geometry of numbers (see [5, Sect. 4] or [4, Lemma 3.4]) show that for every \(\eta \in (0, 1-\nu ]\) one has
Suppose now that \(| T_P(\underline{\varvec{\alpha }})| \gg P^{ms- l \eta }\), then substituting (5.4) into (5.3) yields
and as before, the argument of the proof of Lemma 3.4 of [2] leads us to the following Weyl type dissection.
Lemma 5.2
Suppose that \(\tilde{q}\) and \(\theta \) are as in Lemma 5.1, and let l and \(\eta \) be fixed positive parameters satisfying \(0 < \eta \leqslant 1-3(d-1)\theta \). Then for every \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\) one of the following holds.
-
(A)
We have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-l\eta }\), or
-
(B)
there are integers \(1 \leqslant q_0 \ll P^{(2m-1) \eta }\) and \(1 \leqslant a_0 < q_0 \tilde{q}\) satisfying
$$\begin{aligned} |\alpha _0 \tilde{q}q_0 - a_0| \ll P^{-2m + (2m-1)\eta + 3(d-1)\theta }, \end{aligned}$$or
-
(C)
the number of integral \({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1} \in [-P^{\eta }, P^{\eta }]^s\) satisfying
$$\begin{aligned} d_n({\mathbf {h}}_1, \dots , {\mathbf {h}}_{2m-1}) = 0 \qquad (1 \leqslant n \leqslant s ) \end{aligned}$$is asymptotically larger than \((P^{\eta })^{(2m-1)s - 2^{2m-1}l - \varepsilon }\).
Lemma 2.3 above allows us to exclude the third case by demanding that (2.4) holds. As before, under certain conditions we may combine Lemmas 5.1 and 5.2 to show that on a large set of minor arcs the contribution is smaller than the expected main term.
6 The minor arcs in the case \(d>2m\)
Throughout this section we make the assumptions (2.4) and (2.10). The treatment of the minor arcs is similar to that of Sect. 3. However, without further measures the constraint imposed upon \(\theta \) in Lemma 5.1 would lead to unnecessarily large bounds. Fortunately, this can be avoided by pruning instead a different set of major arcs that can be defined for any positive \(\theta \leqslant 1\). We record here Lemma 3.5 of [2], which serves as starting point for our first pruning step.
Lemma 6.1
Let \(\theta \in (0,1]\) and \(k>0\) be parameters, where k satisfies (2.10). Then one of the following is true.
-
(A)
We have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-k\theta }\), or
-
(B)
for each \({\mathbf {j}} \in J\) there are integers \(0 \leqslant a_{{\mathbf {j}}} < q_{{\mathbf {j}}} \ll P^{(d-1)\theta }\) satisfying \(|\alpha _{{\mathbf {j}}} q_{{\mathbf {j}}}-a_{{\mathbf {j}}}| \ll P^{-d + (d-1)\theta }\).
As in the case of Lemma 5.1, the contribution of D disappears in the course of the proof as D is of strictly smaller degree than F.
Denote by \({\mathfrak {M}}_d(P;\theta )\) the set of \(\varvec{\alpha }\in \mathbb {T}^r\) with the property that one can find entrywise coprime vectors \(0 \leqslant {\mathbf {a}} < {\mathbf {q}} \leqslant P^{(d-1)\theta }\) satisfying \(|\alpha _{{\mathbf {j}}} q_{{\mathbf {j}}}-a_{{\mathbf {j}}}| \leqslant P^{-d+(d-1)\theta }\) for each \({\mathbf {j}} \in J\). Write further \({\mathfrak {m}}_d(P; \theta ) = \mathbb {T}^{r} {\setminus } {\mathfrak {M}}_d(P; \theta )\), then Lemma 6.1 shows that we have \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-k\theta +\varepsilon }\) for all \(\varvec{\alpha }\in {\mathfrak {m}}_d(P;\theta )\). As usual, we will suppress the parameter P in most cases.
Lemma 6.2
Suppose that \(k>0\) and \(\theta _* \in (0,1]\) satisfy
and
Then there exists a parameter \(\delta >0\) such that uniformly for all \(\alpha _0 \in \mathbb {T}\) one has
Proof
Fix a sequence \((\theta _i)\) with \(T_3=O(1)\) terms satisfying
and having the property
From (6.1) we infer that there exists a \(\delta >0\) such that
Furthermore, one computes
(see e.g. Eq. (4.2) in [2]), so on the difference set one has
by (6.4) and Lemmas 6.1 (A), and (6.3) ensures that the exponent is smaller than \(ms-rd-2m\) whenever \(\varepsilon \) is small enough. \(\square \)
This set \({\mathfrak {M}}_d(\theta )\) of major arcs has inhomogeneous denominators, so in order to be able to define major arcs for \(\alpha _0\) as well we first need to define a second set of homogenised major arcs. Suppose that \(\theta ^{\dagger }\) is small enough so that (5.1) holds, then we define \({\mathfrak {M}}_d^{\dagger }(\tilde{q}, {\mathbf {a}})\) to be the set of all \(\varvec{\alpha }\in \mathbb {T}^r\) satisfying \(|\alpha _{{\mathbf {j}}} \tilde{q} - a_{{\mathbf {j}}}| \leqslant P^{-d+3(d-1)\theta }\), and
Again, we let \({\mathfrak {m}}_d^{\dagger }(\theta ) = \mathbb {T}^r {\setminus } {\mathfrak {M}}_d^{\dagger }(\theta )\) and note that this dissection into major and minor arcs respects the case distinction of Lemma 5.1. Lemma 5.3 of [2] shows that \({\mathfrak {M}}_d(\theta ) \subseteq {\mathfrak {M}}_d^\dagger (\theta )\) for all \(\theta \) satisfying (5.1).
Define now \({\mathfrak {M}}(P; \theta , \eta )\) as the set of those \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\) having \(\varvec{\alpha }= \tilde{q}^{-1} {\mathbf {a}} + \varvec{\beta }\in {\mathfrak {M}}_d^\dagger (P; \theta )\) and for which there are coprime integers \(q_0 \leqslant P^{(2m-1)\eta }\) and \(0 \leqslant a_0 < \tilde{q}q_0\) satisfying
where, as customary, the parameter P will usually be suppressed. Then
Write further \({\mathfrak {m}}(P; \theta , \eta ) = \mathbb {T}^{r+1} {\setminus } {\mathfrak {M}}(P; \theta , \eta )\), and observe that, again, one has \(|T_P(\underline{\varvec{\alpha }})| \ll P^{ms-l \eta +\varepsilon }\) whenever \(\underline{\varvec{\alpha }}\in {\mathfrak {m}}(P; \theta , \eta )\) with \(\varvec{\alpha }\in {\mathfrak {M}}_d^\dagger (P;\theta )\). As in the treatment of Sect. 3, it is convenient to make the assumption (3.6), so we will suppress the parameter \(\theta \) in what follows.
Lemma 6.3
Suppose that k and l are positive numbers satisfying
Let further \(\theta _*\) be the value of \(\theta \) obtained in Lemma 6.2, and suppose that \(\theta _*\) satisfies (5.1) as well as the inequalities
and
Then for any \(\eta \in (0,(k/l) \theta _*]\) there exists a \(\delta >0\) such that
Proof
The contribution from \({\mathfrak {m}}(\eta _*)\) can be computed as
where we used the fact that \({\mathfrak {m}}_d^\dagger (\theta ) \subseteq {\mathfrak {m}}_d(\theta )\), and the exponent is smaller than \(ms-rd-2m\) by (3.6) and (6.7).
Now in order to bound the contribution from \({\mathfrak {m}}(\eta ) {\setminus } {\mathfrak {m}}(\eta _*)\) we fix a sequence \((\eta _i)\) with \(T_4 = O(1)\) terms satisfying
and
This is possible by (6.6), and (6.8) ensures via (3.6) that \(\eta _* \leqslant 1-3(d-1)\theta _*\). Then, arguing as before, we arrive at the bound
where we used (6.5) and Lemma 5.2 (A). Again, by (6.9), the exponent is smaller than \(ms-rd-2m\) whenever \(\varepsilon \) is sufficiently small. \(\square \)
A straightforward computation shows that the conditions (6.7) and (6.8) can be simultaneously satisfied only if
Similarly, the conditions (5.1) and (6.7) are compatible if
and these constraints imply (6.1) and (6.2). Hence it follows from combining Lemmata 6.2 and 6.3 that for every \(\eta >0\) there is a \(\delta >0\) such that
provided the conditions (6.6), (6.10) and (6.11) are satisfied.
7 Major arcs analysis in the case \(d>2m\)
This is very similar to the treatment in Sect. 4. Write \(\omega = ((2m-1)+ 3(d-1)(l/k)) \eta \), then after setting \(q = {{\mathrm{lcm}}}(\tilde{q}, q_0)\), we denote by \({\mathfrak {N}}(q, \underline{\mathbf {a}})\) the set of all \(\underline{\varvec{\alpha }}\in \mathbb {T}^{r+1}\) satisfying
and
As in Sect. 4, this definition implies that \({\mathfrak {M}}(\eta ) \subseteq {\mathfrak {N}}(\eta )\), and the volume of these extended major arcs is still estimated by (4.1) with \(\omega \) given as above. Recall the definitions (4.2), (4.3), (4.5) and (4.6), then (4.4) and (4.7) continue to hold with adapted parameters and the error is acceptable if \(\eta \) has been chosen small enough.
As in Sect. 4, we show that the singular integral and the singular series can be extended to infinity. This analysis is in fact very similar to that of the case \(d<2m\).
Lemma 7.1
We have the bound
Proof
We imitate the proof of Lemma 4.1. Since the lemma is trivially true for \(q=1\), we may suppose without loss of generality that \(q>1\), and by a similar argument the claim is trivially true if \({\mathbf {a}} = \varvec{0}\), allowing us to assume that \((q, {\mathbf {a}})<q\). Let \(Q = q^A\) for some large A to be determined later, and fix \(\theta \) such that
so that \({\mathbf {a}}/q \in {\mathfrak {M}}_d(Q; \theta )\). Furthermore, note that by taking A sufficiently large we may ensure that \(\theta <d/(2(d-1))\). Under this assumption, the major arcs are disjoint, so \({\mathbf {a}}/q\) is best approximated by itself. Furthermore, in the q-aspect it lies just on the edge of the major arcs. As in Sect. 4, the minor arcs bound continues to apply on the closure of the minor arcs, so together with (7.1) we find
and on substituting this into (4.10), we see that
Recalling that \(Q=q^A\), it is clear that for A sufficiently large the first term dominates. This establishes the first bound in the lemma.
Fix now \(\eta \) via
so that \(q^{-1} \underline{\mathbf {a}} \in {\mathfrak {M}}(Q; \eta )\). By choosing A large enough, we may assume that the major arcs are disjoint. Hence \(q^{-1} \underline{\mathbf {a}}\) is best approximated by itself, and in the q-aspect it lies on the boundary of the major arcs. Using the corresponding minor arcs bound
together with (7.2) within (4.10) yields
and we see that for A large enough the first term dominates. This establishes the second statement of the lemma. \(\square \)
We may now extend \({\mathfrak {S}}_b(P)\) to infinity. In fact, we have
for each \(\lambda \in [0,1]\). This series converges if, for some \(\lambda \), one has
and these inequalities can be simultaneously satisfied if and only if
For the treatment of the singular integral we remark that Eqs. (4.8) and (4.9) remain valid with adapted parameters, so it remains to establish an analogous version of Lemma 4.2.
Lemma 7.2
We have
Proof
We imitate again our treatment of the case \(2m>d\). The bound \(|v_1(\underline{\varvec{\beta }})|\ll 1\) is trivial, so we may assume that \(|\beta _0|>1\), and also that \(|\varvec{\beta }| >1\). Choose \(Q=|\underline{\varvec{\beta }}|^A\) for some large parameter A to be fixed later, and write \(\underline{\varvec{\gamma }}= (Q^{-d} \varvec{\beta }, Q^{-2m} \beta _0)\), then Eqs. (4.4) and (4.8) with \(\underline{\mathbf {a}} = \underline{\varvec{0}}\) and \(q = 1\) imply that relation (4.15) holds true. Determine \(\theta \) such that \(|\varvec{\beta }| = Q^{(d-1)\theta }\). Since for \(\theta < d / (2(d-1))\) the major arcs \({\mathfrak {M}}_d(Q; \theta )\) are disjoint, by choosing A sufficiently large we may ensure that this approximation is the only one, so \(\varvec{\beta }\) lies just on the edge of the major arcs. As before, the minor arcs estimate extends to the closure, so by Lemma 6.1 (A) we have \(Q^{\theta } \ll (Q^{-ms-\varepsilon } |T_Q(\underline{\varvec{\gamma }})|)^{-1/k}\). On the other hand, our choice of \(\theta \) implies
which gives \(|T_Q(\underline{\varvec{\gamma }})| \ll Q^{ms+\varepsilon } |\varvec{\beta }|^{- \frac{k}{d-1}}\). Inserting this into (4.15) and recalling \(Q = |\underline{\varvec{\beta }}|^A\) yields
which is acceptable if A is large enough.
On the other hand, if we fix \(\eta \) such that, with (3.6), we have
then by choosing A sufficiently large, we can force \(\eta \) to be small enough that the major arcs \({\mathfrak {M}}(q, \underline{\mathbf {a}})\) are disjoint, so \(\underline{\varvec{\gamma }}\) lies on the edge of \({\mathfrak {M}}(Q; \eta )\), and it follows from extending the minor arcs estimate to the boundary that \(Q^{\eta } \ll (Q^{-ms-\varepsilon } |T_Q(\underline{\varvec{\gamma }})|)^{-1/l}\). As before, we also have the major arcs information
This produces an upper bound for \(|T_Q(\underline{\varvec{\gamma }})|\) which can be substituted into (4.15) and then yields the desired result, provided that A has been chosen large enough. \(\square \)
The analysis of the major arcs is now swiftly completed. Again, we define \(\chi _{\infty }(b, P, R)\) as in (4.14) and see that
for any \(\lambda \in [0,1]\). The limit \(\chi _{\infty }(b, P) = \lim _{R \rightarrow \infty }\chi _{\infty }(b,P,R)\) exists if \(\lambda \) can be chosen to satisfy
which is possible precisely if
Observe that both (7.3) and (7.4) are implied in (6.6). Combining all estimates, we may thus conclude that the asymptotic formula given in (4.17) holds for \(d>2m\), provided the conditions (2.4), (2.10), (6.6), (6.10) and (6.11) are all satisfied. Again, we may formulate a theorem that is more general than what has been stated in the introduction.
Theorem 7.1
Suppose that the conditions
and
are all satisfied. Then for some \(\delta >0\) one has
where the factors \(\chi _p(b)\) and \(\chi _{\infty }(b,P)\) are as in Theorem 4.1.
Again, the only thing that remains to show is the Euler product representation of the singular series, which follows in a straightforward manner from standard references such as [6, Chapter 5]. Remark that for smooth forms F the conditions of Theorem 7.1 simplify to
and a modicum of computation confirms that for \(d>2m\) the first term dominates the second one.
References
Birch, B.J.: Forms in many variables, Proc. Roy. Soc. Ser. A 265, 245–263 (1961/1962)
Brandes, J.: Forms representing forms and linear spaces on hypersurfaces. Proc. Lond. Math. Soc. 108, 809–835 (2014)
Brandes, J.: A note on \(p\)-adic solubility for forms in many variables. Bull. Lond. Math. Soc. 47, 501–508 (2015)
Brandes, J.: Forms representing forms: the definite case. J. Lond. Math. Soc. 92, 393–410 (2015)
Browning, T.D., Heath-Brown, D.R.: Forms in many variables and differing degrees. J. Eur. Math. Soc. 9, 357–394 (2017)
Davenport, H.: Analytic Methods for Diophantine Equations and Diophantine Inequalities. Cambridge University, Cambridge (2005)
Dietmann, R.: Systems of cubic forms. J. Lond. Math. Soc. 77, 666–686 (2008)
Duke, W., Rudnick, Z., Sarnak, P.: Density of integer points on affine homogeneous varieties. Duke Math. J. 71, 143–179 (1993)
Lewis, D.J., Schulze-Pillot, R.: Linear spaces on the intersection of cubic hypersurfaces. Monatsh. Math. 97, 277–285 (1984)
Marmon, O.: Diophantine equations in moderately many variables. Michigan Math. J. 65, 547–566 (2016)
Schmidt, W.M.: Simultaneous rational zeros of quadratic forms, Seminar on Number Theory, Paris 1980–81 (Paris, 1980/1981). In: Progress in Mathematics 22, Birkhäuser, Boston, MA, 1982, pp. 281–307
Schmidt, W.M.: On Cubic Polynomials. IV. Systems of rational equations. Monatsh. Math. 93, 329–348 (1982)
Wooley, T.D.: On the local solubility of diophantine systems. Compos. Math. 111, 149–165 (1998)
Acknowledgements
The author is very grateful to Oscar Marmon for reading an earlier draft version of this article and for making available a preprint version of [10], and to Tim Browning for valuable comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Brandes, J. On the number of linear spaces on hypersurfaces with a prescribed discriminant. Math. Z. 289, 803–827 (2018). https://doi.org/10.1007/s00209-017-1975-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00209-017-1975-z