1 Introduction
1.1 Background
For a prime q, we use
$\mathbb {F}_q$
to denote the finite field of q elements. Given a set
${\mathcal N} \subseteq \mathbb {F}_q$
and an integer
$k~{\geqslant }~ 1$
, let
$T_{\nu ,k}({\mathcal N};q)$
be the number of solutions to the equation (in
$\mathbb {F}_q)$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu1.png?pub-status=live)
For
$\nu =2$
, we also denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu2.png?pub-status=live)
When
$k=1$
, in additive combinatorics, this is the well–known quantity called the additive energy of
${\mathcal N}$
. More generally,
$ E_{k}({\mathcal N};q)$
is the additive energy of the set of k-th roots of elements of
${\mathcal N}$
(of those which are k-th power residues).
In the special case
${\mathcal N} = \{1, \ldots , N\}$
for an integer
$1~ \leqslant ~N < q$
, we also write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu3.png?pub-status=live)
where the set
$j{\mathcal N} = \{j, \ldots , jN\}$
is embedded in
$\mathbb {F}_q$
in a natural way.
The quantity
$\mathsf {E}_{2}(N;j,q)$
has been introduced and estimated in [Reference Dunn, Kerr, Shparlinski and Zaharescu13]. In particular, for any
$j \in \mathbb {F}_q^*$
, by [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Lemmas 6.4 and 6.6] we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn1.png?pub-status=live)
which has been used in [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Theorem 1.7] to estimate certain bilinear sums and thus improve some results of [Reference Dunn and Zaharescu14] on correlations between Salié sums, which is important for applications to moments of L-functions attached to some modular forms. Furthermore, bounds of such bilinear sums have applications to the distribution of modular square roots of primes; see [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Reference Shkredov, Shparlinski and Zaharescu27] for details.
This line of research has been continued in [Reference Shkredov, Shparlinski and Zaharescu26] where it is shown that, for almost all primes q, for all
$N < q$
and
$j \in \mathbb {F}_q^*$
one has an essentially optimal bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn2.png?pub-status=live)
We expect the bound (1.2) to hold for all primes q; however, this seems difficult to establish with current techniques.
As an application of the bound (1.2), it has been shown in [Reference Shkredov, Shparlinski and Zaharescu26] that on average over q one can significantly improve the error term in the asymptotic formula for twisted second moments of L-functions of half integral weight modular forms.
Furthermore, it is shown in [Reference Shkredov, Shparlinski and Zaharescu26] that methods of additive combinatorics can be used to estimate
$ E_{2}({\mathcal N};q)$
for sets
${\mathcal N}$
with small doubling. Namely, for an arbitrary set
${\mathcal N}$
(of any algebraic domain equipped with addition), as usual, we denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu4.png?pub-status=live)
Then it is shown in [Reference Shkredov, Shparlinski and Zaharescu26], in particular, that if
${\mathcal N} \subseteq \mathbb {Z}_q$
is a set of cardinality N such that
$\#\left ({\mathcal N} + {\mathcal N}\right ) \,{\leqslant }\, LN$
for some real L, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn3.png?pub-status=live)
Here, we extend and improve these results in several directions and obtain upper bounds on
$T_{\nu ,k}({\mathcal N};q)$
and
$\mathsf {T}_{\nu ,k}(N;j,q)$
for other choices of
$(\nu ,k)$
besides
$(\nu ,k) = (2,2)$
along with improving the bound of [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Lemma 6.6] for
$T_{2,2}(N;j,q)$
. Our estimate for
$T_{2,2}(N;j,q)$
gives some improvement on exponential sums bounds from [Reference Dunn, Kerr, Shparlinski and Zaharescu13].
We believe the new ideas of this work include
-
• the use of higher-dimensional lattices and more advanced techniques from the geometry of numbers such as transference principles and should be considered a development of the arguments from [Reference Dunn, Kerr, Shparlinski and Zaharescu13] where only a two-dimensional lattice is used,
-
• applying so-called decimations of multivariate polynomials,
-
• the use of Gowers norms.
Such estimates have the potential for several new applications. One such application is to bilinear sums with some multidimensional Salié sums which by a result of Duke [Reference Duke10] can be reduced to one-dimensional sums over k-th roots (generalising the case of
$k=2$
, see [Reference Iwaniec and Kowalski19, Lemma 12.4] or [Reference Sarnak23, Lemma 4.4]). This result of Duke [Reference Duke10] combined with our present results and also the approach of [Reference Dunn and Zaharescu14, Reference Dunn, Kerr, Shparlinski and Zaharescu13, Reference Shkredov, Shparlinski and Zaharescu26] may have a potential to lead to new asymptotic formulas for moments of L-functions with Fourier coefficients of automorphic forms over
${\mathrm {GL}}(k, \mathbb {Z})$
with
$k\,{\geqslant }\,3$
. We refer to [Reference Duke10] for further references. For these applications, one has to extend our bound from
$k=2$
to arbitrary
$k\,{\geqslant }\,3$
, which is of independent interest, and maybe achievable with our techniques.
Improved bounds on
$\mathsf {T}_{\nu ,k}(N;j,q)$
with
$\nu> 2$
have a potential to obtain further improvements and extend the region in which there are nontrivial bounds of bilinear sums from [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Reference Shkredov, Shparlinski and Zaharescu26]. In turn, this can lead to further advances in their applications.
Furthermore, the new result on the distribution of modular roots of primes, (see Theorem 2.3) can be viewed as dual to celebrated result of Duke, Friedlander and Iwaniec [Reference Duke, Friedlander and Iwaniec11, Reference Duke, Friedlander and Iwaniec12] on square roots of a fixed integer modulo distinct primes. In turn, this may have a similar range of ‘dual’ applications.
1.2 Notation
Throughout the paper, the notation
$U = O(V)$
,
$U \ll V$
and
$ V\gg U$
are equivalent to
$|U|\leqslant c V$
for some positive constant c, which throughout the paper may depend on the integer k.
For any quantity
$V> 1$
, we write
$U = V^{o(1)}$
(as
$V \to \infty $
) to indicate a function of V which satisfies
$|U| \,{\leqslant }\, V^{\varepsilon }$
for any
$\varepsilon> 0$
, provided V is large enough.
For complex weights , supported on a finite set
${\mathcal N}$
, we define the norms
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu5.png?pub-status=live)
where
$\sigma>1$
, and similarly for other weights.
For a real
$A> 0$
, we write
$a \sim A$
to indicate that a is in the dyadic interval
$A/2\,{\leqslant }\,a < A$
.
We use
$\# {\mathcal A}$
for the cardinality of a finite set
${\mathcal A}$
.
Given two functions
$f,g$
on some algebraic domain
${\mathcal D}$
equipped with addition, we define the convolution
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu6.png?pub-status=live)
We can then recursively define longer convolutions
$(f_1\circ \ldots \circ f_s)(d)$
.
If f is the indicator function of a set
${\mathcal A}$
, then we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu7.png?pub-status=live)
In fact, we often use
${\mathcal A}(a)$
for the indicator function of a set
${\mathcal A}$
, that is,
${\mathcal A}(a) = 1$
if
$a \in {\mathcal A}$
and
${\mathcal A}(a) = 0$
otherwise.
Note that
$\left ({\mathcal A} \circ {\mathcal A}\right ) (d)$
counts the number of the solutions to the equation
$d=a_1-a_2$
, where
$a_1$
,
$a_2$
run over
${\mathcal A}$
, that is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn4.png?pub-status=live)
As usual, we also write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu8.png?pub-status=live)
and more generally
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu9.png?pub-status=live)
Finally, we follow the convention that in summation symbols
$\sum _{a{\leqslant }A}$
the sum is over positive integers
$a \,{\leqslant }\, A$
.
1.3 New results
We start with a new bound on
$\mathsf {T}_{2,2}(N;j,q)=\mathsf {E}_2(N;j,q)$
which improves Equation (1.1).
Theorem 1.1. Let q be prime. For any
$j\in \mathbb {F}_q^{*}$
and integer
$N\,{\leqslant }\,q$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu10.png?pub-status=live)
Note it is easy to show the following trivial inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu11.png?pub-status=live)
which combined with Theorem 1.1 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn5.png?pub-status=live)
We now obtain a stronger bound for short intervals.
Theorem 1.2. Let q be prime. For any
$j\in \mathbb {F}_q^{*}$
and integer
$N\,{\leqslant }\,q$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu12.png?pub-status=live)
We see that Theorem 1.2 is sharper than Equation (1.5) provided
$N \,{\leqslant }\, q^{1/12}$
. Energies of the type considered in Theorem 1.2 have the potential for applications to new bilinear sum estimates considered in Section 2 below. However, the range of parameters
$N \,{\leqslant }\, q^{1/12}$
does not seem strong enough for meaningful applications, except maybe to very skewed bilinear sums.
The proofs of Theorems 1.1 and 1.2 are based on the geometry of numbers and in particular on some properties of lattices. Although such ideas have been used before to estimate the number of solutions of various congruences (see [Reference Bourgain, Garaev, Konyagin and Shparlinski7, Reference Kerr and Mohammadi20]), they have never been applied to estimate the additive energy of modular roots.
Next, we generalise Equation (1.2) to higher-order roots. In fact, as in [Reference Shkredov, Shparlinski and Zaharescu26] the methods allow us to also treat the natural extension of
$\mathsf {E}_{k} (N;j,q)$
to composite moduli q, for which we consider equations in the residue ring
$\mathbb {Z}_q$
modulo q, and estimate
$\mathsf {E}_{k} (N;j,q)$
for almost all positive integers q. We, however, restrict ourselves to the case of prime moduli q.
Theorem 1.3. For a fixed
$k \,{\geqslant }\, 3$
and any positive integers
$Q \,{\geqslant }\, N \,{\geqslant }\, 1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu13.png?pub-status=live)
To establish Theorem 1.3, we use some arguments related to norms of algebraic integers. It is interesting to note that our construction of auxiliary polynomials resemble the so-called decimation procedure which appears in multiple contexts; we refer to [Reference Arzhakova, Lind, Schmidt and Verbitskiy1] for further references.
We now extend the bound (1.3) to other values of k as follows.
Theorem 1.4. Let
${\mathcal N} \subseteq \mathbb {F}_q$
be a set of cardinality
$\# {\mathcal N} = N \,{\leqslant }\, q^{2/3}$
such that
$\#\left ({\mathcal N} + {\mathcal N}\right ) \,{\leqslant }\, LN$
for some real L. Then for
$k \,{\geqslant }\, 3$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu14.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu15.png?pub-status=live)
We remark that the exponent of L in Theorem 1.4 is
$\vartheta _3 = 32/19$
,
$\vartheta _4 = 64/47$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu16.png?pub-status=live)
for
$k \,{\geqslant }\, 5$
. For
$k=3, 4$
, the exponent of L is better than generic because of some additional saving in our application of the Plünnecke inequality; see [Reference Tao and Vu30, Corollary 6.29].
The proof is based on some ideas of Gowers [Reference Gowers16, Reference Gowers17], in particular on the notion of the Gowers norm. Finally, we remark that it is easy to see that, actually, our method works for any polynomial not only for monomials. Also, it is possible, in principle, to insert the general weight , but the induction procedure requires complex calculations to estimate this more general quantity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu17.png?pub-status=live)
Nevertheless, we record a simple consequence of Theorem 1.4 with weights , which follows from the pigeonhole principle.
Corollary 1.5. Let
${\mathcal N} \subseteq \mathbb {F}_q$
be a set of cardinality
$\# {\mathcal N} = N$
such that
$\#\left ({\mathcal N} + {\mathcal N}\right ) \,{\leqslant }\, LN$
for some real L. Then for any weights
supported on
${\mathcal N}$
, and with
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu18.png?pub-status=live)
where
$\vartheta _k$
and
$\rho _k$
are as in Theorem 1.4.
We also remark that Theorem 1.4 can be reformulated as a statement that for any set
${\mathcal A} \subseteq \mathbb {F}_q$
either the additive energy
$\#\{a_1+a_2 = a_3+a_4:~a_1, a_2 ,a_3, a_4\in {\mathcal A}\}$
of
${\mathcal A}$
is small or
${\mathcal A}^k$
has large doubling set
${\mathcal A}^k + {\mathcal A}^k =\{a_1^k+a_2^k:~a_1, a_2 \in {\mathcal A}\}$
.
2 Applications
Given weights and
$a,h\in \mathbb {F}_q^{*}$
, we define bilinear forms over modular square roots as in [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Equation (1.6)]
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn6.png?pub-status=live)
Using Theorem 1.1, we obtain a new estimate for which improves on [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Theorem 1.7]. Assuming
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu19.png?pub-status=live)
it follows from the proof of [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Theorem 1.7] that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu20.png?pub-status=live)
for some b with
$\gcd (b,q)=1$
.
Applying Theorem 1.1, we obtain the following bound.
Corollary 2.1. For any positive integers
$M,N \,{\leqslant }\, q/2$
and any weights
and
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu21.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu22.png?pub-status=live)
If the sequence corresponds to values of a smooth function
$\varphi $
whose derivatives and support
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn7.png?pub-status=live)
for any integer j (with implied constant allowed to depend on j), then we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn8.png?pub-status=live)
We now give a new bound for . This does not rely on energy estimates although may be of independent interest. It is also used in a combination with Corollary 2.1 to derive Theorem 2.3 below.
Theorem 2.2. For any positive integers
$M,N$
satisfying
$MN \ll q$
and
$M<N$
, any weight
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu23.png?pub-status=live)
and a function
$\varphi $
satisfying Equation (2.2), for any fixed integer
$r\,{\geqslant }\, 2$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu24.png?pub-status=live)
Corollary 2.1 may be used to improve various results from [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Sections 1.3–1.4]. We present once such improvement to the distribution of modular roots of primes. Recall that the discrepancy
$D(N) $
of a sequence in
$\xi _1, \ldots , \xi _N \in [0,1)$
is defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu25.png?pub-status=live)
For a positive integer P, we denote the discrepancy of the sequence (multiset) of points
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu26.png?pub-status=live)
by
$\Gamma _q(P)$
. Combining the Erdös-Turán inequality with the Heath–Brown identity reduces estimating
$\Gamma _q(P)$
to sums of the form (2.1) and (2.3). Combining, Corollary 2.1 with Theorem 2.2, we obtain an improvement on [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Theorem 1.10].
Theorem 2.3. For any
$P \,{\leqslant }\, q^{3/4}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu27.png?pub-status=live)
Note that Theorem 2.3 is nontrivial provided
$P\,{\geqslant }\,q^{13/22}$
and improves on the range
$P\,{\geqslant }\,q^{13/20}$
from [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Theorem 1.10].
3 Proof of Theorem 1.1
3.1 Lattices
We use
$\mathrm {Vol}(B)$
to denote the volume of a body
$B \subseteq \mathbb {R}^d$
. For a lattice
$\Gamma \subseteq \mathbb {R}^{d}$
, we recall that the quotient space
$\mathbb {R}^d/\Gamma $
(called the fundamental domain) is compact and so
$\mathrm {Vol}(\mathbb {R}^d/\Gamma )$
is correctly defined; see also [Reference Tao and Vu30, Sections 3.1 and 3.5] for basic definitions and properties of lattices. In particular, we define the successive minima
$\lambda _i$
,
$i=1, \ldots , d$
, of B with respect to
$\Gamma $
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu28.png?pub-status=live)
where
$\lambda B$
is the homothetic image of B with the coefficient
$\lambda $
.
The following is Minkowski’s second theorem. For a proof see [Reference Tao and Vu30, Theorem 3.30].
Lemma 3.1. Suppose
$\Gamma \subseteq \mathbb {R}^{d}$
is a lattice of rank d,
$B\subseteq \mathbb {R}^{d}$
a symmetric convex body, and let
$\lambda _1,\ldots ,\lambda _d$
denote the successive minima of
$\Gamma $
with respect to B. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu29.png?pub-status=live)
For a proof of the following, see [Reference Betke, Henk and Wills4, Proposition 2.1].
Lemma 3.2. Suppose
$\Gamma \subseteq \mathbb {R}^{d}$
is a lattice,
$B\subseteq \mathbb {R}^{d}$
a symmetric convex body, and let
$\lambda _1,\ldots ,\lambda _d$
denote the successive minima of
$\Gamma $
with respect to B. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu30.png?pub-status=live)
3.2 Reduction to counting points in lattices
It more convenient to estimate
$\mathsf {T}_{2,2}(N;\overline {j},q)$
rather than
$\mathsf {T}_{2,2}(N;j,q)$
for the multiplicative inverse
$\overline {j}$
of j modulo q, which or course is an equivalent question.
Let
${\mathcal A}$
denote the set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu31.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn9.png?pub-status=live)
where
$({\mathcal A}\circ {\mathcal A})(d)$
is defined by Equation (1.4).
If
$a_1,a_2\in {\mathcal A}$
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu32.png?pub-status=live)
then elementary algebraic manipulations imply
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu33.png?pub-status=live)
We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu34.png?pub-status=live)
Since for any
$\lambda , \mu \in \mathbb {F}_q$
the number of solutions to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu35.png?pub-status=live)
is
$O(1)$
, we derive from Equation (3.1)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu36.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu37.png?pub-status=live)
If
$n,m$
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu38.png?pub-status=live)
then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu39.png?pub-status=live)
This implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn10.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn11.png?pub-status=live)
Let
${\mathcal L}(d)$
denote the lattice
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu40.png?pub-status=live)
B the convex body
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu41.png?pub-status=live)
and let
$\lambda _1(d),\, \lambda _2(d)$
denote the first and second successive minima of
${\mathcal L}(d)$
with respect to B.
We now partition summation in Equation (3.2) according to the size of
$\lambda _1(d)$
and
$\lambda _2(d)$
to get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn12.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu42.png?pub-status=live)
3.3 Concluding the proof
Consider first
$S_0$
. If
$\lambda _1(d)>1$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu43.png?pub-status=live)
which follows from the fact that for any distinct points
$(n_0,m_0)$
,
$(n_1.m_1)$
satisfying the conditions in Equation (3.3) we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu44.png?pub-status=live)
This implies that
$J(d)^2 = J(d)$
, and we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn13.png?pub-status=live)
Consider next
$S_1$
. Suppose d satisfies
$\lambda _1(d) \,{\leqslant }\, 1$
and
$\lambda _2(d)> 1$
. There exists
$n_d,m_d$
satisfying the conditions given in Equation (3.3) such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu45.png?pub-status=live)
Since
$\lambda _2(d)>1$
, there exists a unique point
$(a_d,b_d) \in {\mathcal L}(d)\cap B$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu46.png?pub-status=live)
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu47.png?pub-status=live)
This implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn14.png?pub-status=live)
where
${\mathcal W}$
is the following set of all pairs
$(a,b)$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn15.png?pub-status=live)
and
$K(a,b)$
is defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu48.png?pub-status=live)
for some choice of integers
$m_{a,b},n_{a,b}$
satisfying
$|m_{a,b}|,|n_{a,b}| \,{\leqslant }\, 6 N$
and
$J(a,b)$
is defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu49.png?pub-status=live)
Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu50.png?pub-status=live)
since after fixing
$m,n$
with
$O(N^2)$
choices there exists
$O(1)$
solutions to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu51.png?pub-status=live)
in the remaining variable
$\lambda $
. We also have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn16.png?pub-status=live)
Fix some
$a,b$
as in the sum in Equation (3.6), and consider
$K(a,b)$
. If
$n,m$
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu52.png?pub-status=live)
then, since
$\gcd (a,b)=1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn17.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn18.png?pub-status=live)
Furthermore, if one out of m or n is fixed, then the other number is defined in no more than two ways.
Write Equation (3.9) as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu53.png?pub-status=live)
Then we see that there are two integers
$a_1,a_2$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu54.png?pub-status=live)
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu55.png?pub-status=live)
Hence, for each fixed pair
$(a_1, a_2)$
there are at most
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu56.png?pub-status=live)
possibilities for n. Hence, by a well-known bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn19.png?pub-status=live)
on the divisor function
$\tau (a)$
for
$a \ne 0$
, see [Reference Iwaniec and Kowalski19, Equation (1.81)], we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu57.png?pub-status=live)
By the Cauchy–Schwarz inequality and Equation (3.11), we now derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn20.png?pub-status=live)
Similarly, using Equation (3.10) we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn21.png?pub-status=live)
Combining Equations (3.12), (3.13), (3.8) and substituting into Equations (3.6), we see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu58.png?pub-status=live)
Hence, recalling Equation (3.7), we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu59.png?pub-status=live)
Using the bound on the divisor function (3.11) again, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn22.png?pub-status=live)
Finally, consider
$S_2$
. If d satisfies
$\lambda _2(d) \,{\leqslant }\, 1$
, then by Lemmas 3.1 and 3.2
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn23.png?pub-status=live)
In particular, we see that for
$N = o(q^{1/3})$
the bound (3.15) implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu60.png?pub-status=live)
which means that this case (that is,
$\lambda _2(d) \,{\leqslant }\, 1$
) never occurs for ‘small’ N.
For each
$|n| \,{\leqslant }\, 6N$
there exists at most one value of m satisfying Equation (3.3) and for any two pairs
$(n_1,m_1), (n_2,m_2)$
satisfying Equation (3.3) we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu61.png?pub-status=live)
This implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu62.png?pub-status=live)
Since for any integer
$r\neq 0$
the bound (3.11) on the divisor function implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu63.png?pub-status=live)
we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu64.png?pub-status=live)
By Equation (3.15)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu65.png?pub-status=live)
which implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn24.png?pub-status=live)
Combining Equations (3.5), (3.14) and (3.16) with Equation (3.4), we derive the desired bound on
$\mathsf {T}_{2,2}(N;\overline {j},q))$
.
4 Proof of Theorem 1.2
4.1 Lattices
For a lattice
$\Gamma $
and a convex body B, we define the dual lattice
$\Gamma ^*$
and dual body
$B^*$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu66.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu67.png?pub-status=live)
respectively.
The following is known as a transference theorem and is due to Mahler [Reference Mahler21] which we present in a form given by Cassels [Reference Cassels8, Chapter VIII, Theorem VI].
Lemma 4.1. Let
$\Gamma \subseteq \mathbb {R}^{d}$
be a lattice,
$B\subseteq \mathbb {R}^{d}$
a symmetric convex body, and let
$\Gamma ^{*}$
and
$B^{*}$
denote the dual lattice and dual body. Let
$\lambda _1,\ldots ,\lambda _d$
denote the successive minima of
$\Gamma $
with respect to B and
$\lambda _1^{*},\ldots ,\lambda _d^{*}$
the successive minima of
$\Gamma ^{*}$
with respect to
$B^{*}$
. For each
$1 \,{\leqslant }\, j \,{\leqslant }\, d$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu68.png?pub-status=live)
We apply Lemma 4.1 to lattices of a specific type whose dual may be easily calculated. For a proof of the following, see [Reference Bordignon and Kerr6, Lemma 15].
Lemma 4.2. Let
$a_1,\ldots ,a_d$
and
$q\,{\geqslant }\, 1$
be integers satisfying
$\gcd (a_i,q)=1$
, and let
${\mathcal L}$
denote the lattice
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu69.png?pub-status=live)
Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu70.png?pub-status=live)
Our next result should be compared with the case
$\nu =3$
of [Reference Bourgain, Garaev, Konyagin and Shparlinski7, Lemma 17]. It is possible to give a more direct variant of [Reference Bourgain, Garaev, Konyagin and Shparlinski7, Lemma 17] to estimate higher-order energies of modular square roots (see the proof of Corollary 4.4 below) although this seems to put tighter restrictions on the size of the parameter N.
Lemma 4.3. Let q be prime, and
$L,\, M,\, N$
integers. Let
${\mathcal L}$
denote the lattice
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu71.png?pub-status=live)
and let B be the convex body
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu72.png?pub-status=live)
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu73.png?pub-status=live)
and
$\lambda _1,\lambda _2$
denote the first and second successive minima of
${\mathcal L}$
with respect to B. Then at least one of the following holds:
-
(i)
$$ \begin{align*}K <\max\left\{\frac{640LMN}{q},\,1\right\}. \end{align*} $$
-
(ii)
$\lambda _1 \,{\leqslant }\, 1$ and
$\lambda _2>1$ .
-
(iii) There exists some
and
$\ell,\, m,\, n\in \mathbb {Z}$ satisfying
$$ \begin{align*}|\ell| \,{\leqslant}\, \frac{4320MN}{K}, \quad |m| \,{\leqslant}\, \frac{4320LN}{K}, \quad |n| \,{\leqslant}\, \frac{4320LM}{K} \end{align*} $$
Proof. Assume that (i) fails. Thus, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn25.png?pub-status=live)
Then
$K \,{\geqslant }\, 1$
. Hence, if
$\lambda _1 \,{\leqslant }\, \lambda _2 \,{\leqslant }\, \lambda _3$
denote the successive minima of
${\mathcal L}$
with respect to B, then
$\lambda _1 \,{\leqslant }\, 1$
. We first show Equation (4.1) implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu77.png?pub-status=live)
Indeed, otherwise by Lemma 3.2
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn26.png?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu78.png?pub-status=live)
we see from Lemma 3.1 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn27.png?pub-status=live)
which together with Equation (4.2) contradicts Equation (4.1).
Hence, we have either
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn28.png?pub-status=live)
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn29.png?pub-status=live)
Clearly, Equation (4.4) is the same as (ii).
Next, suppose that we have Equation (4.5). By Lemma 3.2, a similar calculation as before, together with Equation (4.3) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn30.png?pub-status=live)
Applying Lemma 3.1 and using
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu79.png?pub-status=live)
we derive from Equation (4.6) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu80.png?pub-status=live)
Let
$\lambda _1^{*}$
denote the first successive minima of the dual lattice
${\mathcal L}^{*}$
with respect to the dual body
$B^{*}$
. By Lemma 4.1,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu81.png?pub-status=live)
The above estimates combined with Equation (4.6) implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu82.png?pub-status=live)
Hence, by the definition of
$\lambda _1^{*}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn31.png?pub-status=live)
Its remains to recall that by Lemma 4.2
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu83.png?pub-status=live)
and also it is obvious that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu84.png?pub-status=live)
By Equation (4.7), this implies there exists some and
$\ell,\, m,\, n$
satisfying (iii), which completes the proof.
Corollary 4.4. Let
$\varepsilon>0$
be a fixed real number. For
$j\in \mathbb {F}_q^{*}$
, integer
$N\ll q$
and
$\Delta \,{\geqslant }\, 1$
, let
${\mathcal A},\, {\mathcal D}\subseteq \mathbb {F}_q$
denote the sets
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu85.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu86.png?pub-status=live)
Let K be sufficiently large, and suppose K and
$\Delta $
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn32.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn33.png?pub-status=live)
Let
${\mathcal F}\subseteq \mathbb {F}_q^{*}$
denote the set of f satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn34.png?pub-status=live)
Then either
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn35.png?pub-status=live)
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu87.png?pub-status=live)
Proof. From Equation (4.10)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn36.png?pub-status=live)
If
$d_1,\, d_2\in {\mathcal D}$
satisfy
$d_1-d_2=f$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu88.png?pub-status=live)
and some algebraic manipulations show
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu89.png?pub-status=live)
Since
$0\not \in {\mathcal D}$
, for each
$d\in {\mathcal D}$
, by Equation (4.9) and [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Lemma 6.4] there exists
$m_d,\, n_d$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn37.png?pub-status=live)
Let
$I(f)$
count the number of solutions to the congruence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn38.png?pub-status=live)
with
$d_1,\, d_2\in {\mathcal D}$
. The above and Equation (4.12) imply
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn39.png?pub-status=live)
Rearranging Equation (4.14), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu90.png?pub-status=live)
This implies that
$I(f)$
is bounded by the number of solutions to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn40.png?pub-status=live)
with
$d_1,\, d_2\in {\mathcal D}$
. Let
${\mathcal L}$
denote the lattice
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu91.png?pub-status=live)
and B the convex body
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu92.png?pub-status=live)
for a suitable absolute constant C. By Equations (4.13) and (4.16)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn41.png?pub-status=live)
Let
$\lambda _1,\, \lambda _2$
denote the first and second successive minima of
${\mathcal L}$
with respect to B. Assuming that
$K\,{\geqslant }\, 1$
, we have
$\lambda _1 \,{\leqslant }\, 1$
.
Suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu93.png?pub-status=live)
Then there exists some
$(a_0,\, b_0,\, c_0)\in {\mathcal L}\cap B$
such that for any
$d_1,\, d_2\in {\mathcal D}$
satisfying Equation (4.17) we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu94.png?pub-status=live)
for some
$m\in \mathbb {Z}$
. Note from Equation (4.13) for each
$d_1,\, d_2\in {\mathcal D}$
we have
$m_{d_1}m_{d_2}\neq 0$
and hence
$c_0\neq 0$
. This implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu95.png?pub-status=live)
Hence,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu96.png?pub-status=live)
since once
$n_{d_1}/m_{d_1}$
is fixed, due to the coprimality condition in Equation (4.13),
$d^2_1$
is uniquely defined and similarly for
$d^2_2$
. This implies Equation (4.11).
Suppose next that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn42.png?pub-status=live)
Let
$J(\ell,\, m,\, n)$
count the number of solutions to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu97.png?pub-status=live)
with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn43.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn44.png?pub-status=live)
for some absolute constant C. We next show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn45.png?pub-status=live)
Estimates for the divisor function (3.11) imply the number of solutions to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu98.png?pub-status=live)
is at most
$N^{o(1)}$
. For each such
$m_1,\, m_2$
, there exists at most one solution to the system
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu99.png?pub-status=live)
which establishes Equation (4.21). By Equations (4.15) and (4.20)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu100.png?pub-status=live)
and hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn46.png?pub-status=live)
By Equation (4.9), for each
$\ell,\, n \in \mathbb {Z}$
, there exists at most one value of
$|m|\ll N^5/\Delta ^8$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu101.png?pub-status=live)
For any
$(\ell _1,\, m_1,\, n_1)$
and
$(\ell _2,\, m_2,\, n_2)$
satisfying the conditions of Equation (4.22), there exists some
$|m|\ll N^5/\Delta ^8$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn47.png?pub-status=live)
Define the lattice
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu102.png?pub-status=live)
and the convex body
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu103.png?pub-status=live)
for a suitable constant
$C_0$
. Since for any integer r
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu104.png?pub-status=live)
we see that Equation (4.23) implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu105.png?pub-status=live)
By Equation (4.8), Equation (4.18) and Lemma 4.3, there exists
$(\ell,\, m,\, n)\neq (0,\, 0,\, 0)$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn48.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn49.png?pub-status=live)
Note we may assume
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn50.png?pub-status=live)
Recall Equation (4.16)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn51.png?pub-status=live)
If
$d_1,\, d_2$
satisfy the conditions in Equation (4.27), then by Equation (4.25)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu106.png?pub-status=live)
and hence from Equation (4.8), assuming that N is large enough, we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn52.png?pub-status=live)
Similarly by Equations (4.24) and (4.25) we have and again Equation (4.8) ensures that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu107.png?pub-status=live)
Therefore, Equation (4.28) implies the following equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu108.png?pub-status=live)
We see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn53.png?pub-status=live)
Hence, from Equations (4.13) and (4.27), there exists some constant C such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu109.png?pub-status=live)
Summing the above over
$f\in {\mathcal F}$
, using Equation (4.15) and noting that for each
$\ell,\, m,\, n$
satisfying Equation (4.26) there exists
$O(1)$
values of f satisfying Equation (4.25), we see that
$K\# {\mathcal F}$
is bounded by the number of solutions to the Equation (4.29) with integer variables satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu110.png?pub-status=live)
We see from Equation (4.29) that
$n_{d_1}m_{d_1}n_{d_2}m_{d_2}=r^2$
for some
$r\in \mathbb {Z}$
and hence a bound (3.11) on the divisor function implies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu111.png?pub-status=live)
which completes the proof.
4.2 Concluding the proof
As in Section 3.2, here we work again with
$\mathsf {T}_{4,2}(N;\overline {j},q)$
for the multiplicative inverse
$\overline {j}$
of j modulo q rather than with
$\mathsf {T}_{4,2}(N;j,q)$
. Let notation be as in Corollary 4.4 so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu112.png?pub-status=live)
where we recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu113.png?pub-status=live)
By Equation (1.5), we may assume that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn54.png?pub-status=live)
Applying the dyadic pigeonhole principle, there exist
$\Delta _1,\Delta _2 \,{\geqslant }\, 1$
and
${\mathcal D}_1,{\mathcal D}_2\subseteq \mathbb {F}_q$
given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu114.png?pub-status=live)
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu115.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu116.png?pub-status=live)
By the Cauchy–Schwarz inequality,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu117.png?pub-status=live)
and hence there exists some
$\Delta $
and
${\mathcal D}$
given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu118.png?pub-status=live)
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn55.png?pub-status=live)
It is also obvious from Equationi (3.1) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn56.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn57.png?pub-status=live)
Isolating the diagonal contribution in
$E({\mathcal D})$
, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu119.png?pub-status=live)
We may assume
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn58.png?pub-status=live)
since otherwise we have
$E({\mathcal D}) \,{\leqslant }\, 2 (\#{\mathcal D})^2$
and it follows from the bounds (4.31) and (4.32) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu120.png?pub-status=live)
Now, recalling the condition (4.30) and using Theorem 1.1, we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu121.png?pub-status=live)
By Equation (4.34) and the dyadic pigeonhole principle, there exists some K and a set
${\mathcal F}\subseteq \mathbb {F}_q^{*}$
given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu122.png?pub-status=live)
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn59.png?pub-status=live)
Combining with Equations (4.31) and (4.35) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn60.png?pub-status=live)
We apply Corollary 4.4 to estimate the right-hand side of Equation (4.36).
We now fix some
$\varepsilon> 0$
and suppose first that one of Equation (4.8) or Equation (4.9) does not hold. In particular, assume
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn61.png?pub-status=live)
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn62.png?pub-status=live)
where we have use the assumption (4.30) to ignore the term
$N^{3/2}/q^{1/2}$
in Equation (4.9). If Equation (4.37) holds, then using the trivial bounds
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu123.png?pub-status=live)
we derive from Equation (4.36)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn63.png?pub-status=live)
If Equation (4.38) holds, then from Equation (4.36)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn64.png?pub-status=live)
Hence, if one of the conditions (4.8) or (4.9) does not hold then combining Equations (4.39) and (4.40) we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn65.png?pub-status=live)
Suppose next that Equations (4.37) and (4.38) both fail and thus both Equation (4.8) and Equation (4.9) hold. By Corollary 4.4, we have either
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn66.png?pub-status=live)
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn67.png?pub-status=live)
If Equation (4.42) holds, then from Equation (4.36) and the trivial bound
$K \#{\mathcal F} \,{\leqslant }\, (\#{\mathcal D})^2$
, we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu124.png?pub-status=live)
Now, the bound (4.32) and Theorem 1.1 (under the condition (4.30)) yield
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu125.png?pub-status=live)
If Equation (4.43) holds, then using Equation (4.33)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn68.png?pub-status=live)
Combining Equations (4.41) and (4.44), since
$\varepsilon>0$
is arbitrary, we complete the proof.
5 Proof of Theorem 1.3
5.1 Product polynomials
In the proof of [Reference Shkredov, Shparlinski and Zaharescu26, Lemma 5.1], a certain polynomial in four variables with integer coefficients played a key role. More precisely, it has been found in [Reference Shkredov, Shparlinski and Zaharescu26] that the polynomial
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu126.png?pub-status=live)
has the following property. Letting
$U = u^2$
,
$V = v^2$
,
$X = x^2$
and
$Y = y^2$
, one has that
$F(u^2, v^2, x^2, y^2) = 0$
for any
$u, v, x, y$
for which
$u+v = x+y$
(over any commutative ring). We now proceed to discuss this property in a more general context.
Denote
${\mathcal U}_k = \{ \omega \in \mathbb {C} :~\omega ^k = 1\}$
, and consider the polynomial
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu127.png?pub-status=live)
defined over the cyclotomic field
$K_k = \mathbb {Q}\left (\exp (2 \pi i /k)\right )$
. Since the Galois group
${\mathrm {Gal}}(K_k/\mathbb {Q})$
of K is cyclic and any automorphism
$\sigma $
of
$K_k$
over
$\mathbb {Q}$
is a multiplication by some
$\omega \in {\mathcal U}_k$
, we see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu128.png?pub-status=live)
Hence,
$G_k$
has rational coefficients. Since obviously these coefficients are algebraic integers, we see that
$G_k\left (X_1,X_2, X_3, X_4\right ) \in \mathbb {Z}[X_1,X_2, X_3, X_4]$
.
We also see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu129.png?pub-status=live)
Therefore,
$G_k(X_1,X_2, X_3, X_4)$
is a polynomial in
$X_4^k$
. Similarly,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu130.png?pub-status=live)
Thus, it is also a polynomial in
$X_1^k$
and of course also in
$X_2^k$
and
$X_3^k$
. Hence, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu131.png?pub-status=live)
for some polynomial
$F_k\left (X_1,X_2, X_3, X_4\right ) \in \mathbb {Z}[X_1,X_2, X_3, X_4]$
.
Remark 5.1. It is clear that this construction can be extended in several directions, in particular to polynomials
$F_{\nu ,k} \in \mathbb {Z}[X_1, \ldots , X_{2\nu }]$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu132.png?pub-status=live)
whenever
$x_1+ \ldots +x_\nu = x_{\nu +1} + \ldots + x_{2\nu }$
.
5.2 The zero set of
$F_k(X_1,\ X_2,\ X_3,\ X_4)$
We now need the following bound on the number of integer zeros of
$F_k$
in a box. Define by
$T_k(N)$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu133.png?pub-status=live)
Our next result gives a bound for
$T_k(N)$
.
Lemma 5.2. Fix an integer
$k \,{\geqslant }\, 3$
. For any positive integer N, we have
$T_k(N) \ll N^{2}$
.
Proof. Take a solution
$(n_1, n_2, n_3, n_4)$
to
$F_k( n_1, n_2, n_3, n_4) = 0$
satisfying
$1 \,{\leqslant }\, n_1, n_2, n_3, n_4 \,{\leqslant }\, N$
. Denote by
$t_1, t_2, t_3, t_4$
the positive real numbers that are roots of order k of
$n_1, n_2, n_3, n_4$
, respectively.
Therefore, there exist roots of unity
$\omega _1,\omega _2,\omega _3 \in \mathcal {U}_k$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn69.png?pub-status=live)
We now distinguish two cases.
Case 1. At least one of the roots of unity
$\omega _1$
,
$\omega _2$
,
$\omega _3$
is not real. Complex conjugation then provides a second linear equation,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn70.png?pub-status=live)
which is different from Equation (5.1). Then using Equations (5.1) and (5.2) to eliminate
$t_4$
, one obtains a nontrivial linear equation in
$t_1, t_2$
and
$t_3$
which obviously has at most
$O(N^2)$
solutions, after which
$t_4$
is uniquely defined.
Thus, the total number of solutions in Case 1 is
$O(N^2)$
.
Case 2. All three of
$\omega _1, \omega _2, \omega _3$
are real, that is,
$\omega _1, \omega _2, \omega _3 \in \{ -1, 1\}$
, and Equation (5.1) reduces to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn71.png?pub-status=live)
We observe that Case 2 also covers the
$2N^2 + O(N)$
diagonal solutions.
To treat the nondiagonal solutions, one can now apply results of Besicovitch [Reference Besicovitch3], Mordell [Reference Mordell22], Siegel [Reference Siegel28] or the more recent results of Carr and O’Sullivan [Reference Carr and O’Sullivan9]. For instance, [Reference Carr and O’Sullivan9, Theorem 1.1] shows that a set of real k-th roots of integers that are pairwise linearly independent over the rationals must also be linearly independent. Applying this to the set
$t_1, t_2, t_3, t_4$
, which by Equation (5.3) is not linearly independent over
$\mathbb {Q}$
, it follows that two of them, for example,
$t_1$
and
$t_2$
, are linearly dependent over
$\mathbb {Q}$
. We derive that there are positive integers
$a_1, a_2, b$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu134.png?pub-status=live)
where b is not divisible by a k-th power of a prime. That is,
$a_1^k$
is the largest k-th power that divides
$n_1$
, and
$a_2^k$
is the largest k-th power that divides
$n_2$
.
Then letting
$t_5$
denote the positive k-th root of b, Equation (5.3) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn72.png?pub-status=live)
Without loss of generality, we can assume that
$a_1 \,{\geqslant }\, a_2$
. Hence, for any fixed
$1 \,{\leqslant }\, a_2 \,{\leqslant }\, a_1 \,{\leqslant }\, N^{1/k}$
there are at most
$N/a_1^k$
possible values for b and thus for
$t_5$
. After
$a_1$
,
$a_2$
and
$t_5$
are fixed, there are obviously at most N pairs
$(t_3,t_4)$
satisfying Equation (5.4). Hence, the total contribution from such solutions is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu135.png?pub-status=live)
which concludes the proof.
We remark that the case of
$k=2$
can also be included in Lemma 5.2; however, this case is already fully covered by the results of [Reference Shkredov, Shparlinski and Zaharescu26].
5.3 Concluding the proof
Clearly, the congruence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu136.png?pub-status=live)
implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu137.png?pub-status=live)
for the above polynomial
$F_k$
. Since
$F_k$
is homogeneous, this implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu138.png?pub-status=live)
Since for a prime
$q\sim Q$
,
$a \in \mathbb {F}_q$
and
$j \in \mathbb {F}_q^*$
, there are at most k solutions to the congruence
in variable
$z\in \mathbb {F}_q$
, and thus at most
$2k$
solution in variable
$z \in [1,N]$
(since
$N \,{\leqslant }\, Q \,{\leqslant }\, 2q$
) we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu139.png?pub-status=live)
where, as before,
$\overline {j}$
denotes the multiplicative inverse of j modulo q. Changing the order of summation and separating the sum over the variables
$U,V,X,Y$
into two parts depending on whether
$F_k(U,V,X,Y) = 0$
or not, we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu140.png?pub-status=live)
Recall that
$F_k$
is a polynomial with constant coefficients of degree
$k^3$
. Hence,
$F_k(U,V,X,Y) \ll N^{k^3}$
, and thus trivially has at most
$O\left (\log N\right )$
prime divisors. Hence, we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu141.png?pub-status=live)
and applying Lemma 5.2 we conclude the proof.
Remark 5.3. Furthermore, it is easy to see that there is a constant
$C>0$
such that if
$N \,{\leqslant }\, C q^{1/k^3}$
, then
with
$1 \,{\leqslant }\, n_1,n_2,n_3, n_4 \,{\leqslant }\, N$
implies
$ F_k(n_1,n_2,n_3,n_4) = 0$
. Hence, in this range of N, using Lemma 5.2, we obtain
$\mathsf {E}_{k} (N;j,q) \ll N^2$
for every q.
6 Proof of Theorem 1.4
6.1 Preliminary discussion
We need some facts about the Gowers norms, introduced in the celebrated work of Gowers [Reference Gowers16, Reference Gowers17] on the first quantitative bound for the famous Szemerédi Theorem [Reference Szemerédi29] about sets avoiding arithmetic progressions of length four and longer. As an important step in the proof, Gowers [Reference Gowers16, Reference Gowers17] observes that there are very random sets having an unexpected number of arithmetic progressions of length
$l\,{\geqslant }\, 4$
. An example is, basically, the set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn73.png?pub-status=live)
where
$c_k>0$
is an appropriate constant, depending on
$k\,{\geqslant }\, 2$
only (see the beginning of [Reference Gowers17, Section 4] and also [Reference Gowers18]). Then the set
${\mathcal A}^{(k)}$
has an enormous number of arithmetic progressions of length
$k+2$
but the expected number of shorter progressions. In Theorem 1.4, we consider the sets
${\mathcal N}^{1/k}$
, where
${\mathcal N}$
is a set with small doubling. Clearly, such sets generalise the construction (6.1). Below, we show that these sets are random in the sense that they all have small additive energy. Actually, we obtain a stronger property that Gowers norms of its characteristic functions are small and thus this has even more parallels to the Gowers construction (6.1). On the other hand, sets
${\mathcal N}^{1/k}$
preserve all essential combinatorial properties of the sets
${\mathcal A}^{(k)}$
. For example, for
$k=2$
and any
$s\neq 0$
we have for an arbitrary
$x\in {\mathcal N}^{1/2} \cap ({\mathcal N}^{1/2} + s)$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu142.png?pub-status=live)
Thus,
$2sx - s^2 \in {\mathcal N}-{\mathcal N} $
or
$x\in ({\mathcal N}-{\mathcal N} + s^2)/2s$
. Hence, all intersections
${\mathcal N}^{1/2} \cap ({\mathcal N}^{1/2} + s)$
are additively rich sets exactly as in construction (6.1) (we literally use such facts in the proof of Theorem 1.4 below).
6.2 Gowers norms
Now, we are ready to give general definitions. Suppose that G is an abelian group with the group operation
$+$
and
${\mathcal A}\subseteq G$
is a finite set. Having a sequence of elements
$s_1,\ldots ,s_l \in G$
, we define the set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu143.png?pub-status=live)
Let
$ \| {\mathcal A} \|_{\mathcal {U}^{k}} $
be the Gowers nonnormalised kth-norm [Reference Gowers17] of the characteristic function of
${\mathcal A}$
(in additive form). We have (see, for example, [Reference Shkredov25]):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu144.png?pub-status=live)
where
$\varepsilon = (\varepsilon _1,\ldots ,\varepsilon _k)$
(we also recall that we use
${\mathcal A}(a)$
for the indicator function of
${\mathcal A}$
). In particular,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu145.png?pub-status=live)
is the additive energy of
${\mathcal A}$
, that is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu146.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu147.png?pub-status=live)
Moreover, the induction property for Gowers norms holds; see [Reference Gowers17]
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu148.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn74.png?pub-status=live)
where
$\pi (s_1,\ldots ,s_k)$
is a vector with
$2^k$
components, namely,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu149.png?pub-status=live)
Notice also
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn75.png?pub-status=live)
It is proved in [Reference Gowers17] that kth-norms of the characteristic function of any set are connected to each other. It is shown in [Reference Shkredov25] that the connection for the nonnormalised norms does not depend on size of the group G. Here, we formulate a particular case of [Reference Shkredov25, Proposition 35], which relates
$\| {\mathcal A} \|_{\mathcal {U}^{k}}$
and
$\| {\mathcal A} \|_{\mathcal {U}^{2}}$
.
Lemma 6.1. Let
${\mathcal A}$
be a finite subset of an abelian group G with the group operation
$+$
. Then for any integer
$k\,{\geqslant }\, 1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu150.png?pub-status=live)
Next, we have to relate
$\| {\mathcal A} \|_{\mathcal {U}^{k}}$
and
$E({\mathcal A})$
; see [Reference Shkredov25, Remark 36].
Lemma 6.2. Let
${\mathcal A}$
be a finite subset of an abelian group G with the group operation
$+$
. Then for any integer
$k\,{\geqslant }\, 1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu151.png?pub-status=live)
6.3 Concluding the proof
Let
${\mathcal A} = {\mathcal N}^{1/k}$
.
6.3.1 Case
$k=3$
Let us start with the case
$k=3$
. Below, we can assume that the quantity L is sufficiently small because otherwise the result is trivial.
For any
$s\neq 0$
, consider the set
${\mathcal A}_s = {\mathcal A} \cap ({\mathcal A}-s)$
and let
$x\in {\mathcal A}_s$
. Then
$x^3, (x+s)^3 \in {\mathcal N}$
and hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu152.png?pub-status=live)
Put
${\mathcal B}_s ={\mathcal A}_s + s/2$
, so
$\# {\mathcal B}_s = \# {\mathcal A}_s$
. Furthermore, let
${\mathcal C}_s = \{x^2:~ x \in {\mathcal B}_s\}$
. Clearly, by the Plünnecke inequality (see [Reference Tao and Vu30, Corollary 6.29]),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu153.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu154.png?pub-status=live)
Then, after applying estimate (1.3) with our restriction
$N \,{\leqslant }\, q^{2/3}$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn76.png?pub-status=live)
We now assume that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn77.png?pub-status=live)
We also observe that we can always assume that
$L \,{\leqslant }\, N^{1/32}$
as otherwise the result is trivial. Further, to show that the second term in Equation (6.4) dominates the first one, we need to check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn78.png?pub-status=live)
or
$L^2_s \left ( \#{\mathcal A}_s\right )^{5/4} \,{\leqslant }\, q$
, which in turn is equivalent to
$\left ( \#{\mathcal A}_s\right )^{3} \,{\geqslant }\, L^{32} N^8 q^{-4} $
. Since for
$L \,{\leqslant }\, N^{1/32}$
and
$N \,{\leqslant }\, q^{2/3}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu155.png?pub-status=live)
we see that under the assumption (6.5) we have Equation (6.6) and hence the bound (6.4) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn79.png?pub-status=live)
By the definition of the sets
${\mathcal A}_s$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn80.png?pub-status=live)
Furthermore, using the definition of
$\mathcal {U}_3$
–norm we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn81.png?pub-status=live)
First, we observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu156.png?pub-status=live)
Thus, for each of
$E({\mathcal A})$
choices of quadruples
$(a_1, a_2,a_3, a_4) \in {\mathcal A}^4$
with
$a_1+a_2= a_3+a_4$
, there are at most T possibilities for s with
$ \# {\mathcal A}_s\,{\leqslant }\,T$
and we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn82.png?pub-status=live)
We now choose
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn83.png?pub-status=live)
and note that the trivial upper bound
$E({\mathcal A}) \,{\leqslant }\, (\# {\mathcal A})^3 \,{\leqslant }\, 27N^3$
implies that
$T \,{\geqslant }\, N^{4/5} L^{32/5}$
. Hence, for any s with
$\# {\mathcal A}_s> T$
the condition (6.5) is satisfied and so the bound (6.7) holds.
Hence, by identity (6.8), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn84.png?pub-status=live)
The value of T in Equation (6.11) is chosen to balance the bounds (6.10) and (6.12) and thus from Equation (6.9) we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu157.png?pub-status=live)
Finally, applying Lemma 6.2, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu158.png?pub-status=live)
and whence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu159.png?pub-status=live)
which gives the desired result for
$k=3$
.
6.3.2 Case
$k=4$
Next, we consider the case
$k=4$
. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu160.png?pub-status=live)
and let
$x\in {\mathcal A}_{\pi (s,t)}$
. Then
$x^4, (x+s)^4, (x+t)^4, (x+t+s)^4 \in {\mathcal N}$
and hence
${\mathcal N} - {\mathcal N}$
contains
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu161.png?pub-status=live)
Subtracting the expressions with s and t from the expression with
$s+t$
, we see that
$3{\mathcal N}-3{\mathcal N}$
contains
$12 st x^2 + 12 (t^2 s + ts^2) x + (t+s)^4-s^4-t^4$
and we can apply a version of previous arguments. Actually, in our particular case
$k=4$
one can write exact identity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu162.png?pub-status=live)
and thus even it is enough to consider the set
$2{\mathcal N}-2{\mathcal N}$
. In particular, since by the Plünnecke inequality (see [Reference Tao and Vu30, Corollary 6.29])
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu163.png?pub-status=live)
the role of
$L_s$
is now played by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu164.png?pub-status=live)
We also set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu165.png?pub-status=live)
and note that we have the trivial bound
$\| {\mathcal A} \|_{\mathcal {U}^3} \,{\leqslant }\, N E({\mathcal A})$
. We also have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu166.png?pub-status=live)
We now verify that
$T^3 \,{\geqslant }\, L^{64} N^8 q^{-4}$
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu167.png?pub-status=live)
which is equivalent to
$N^{28} L^{128} \,{\leqslant }\, q^{20} $
. Since we can clearly assume that
$L \,{\leqslant }\, N^{1/64}$
as otherwise the result is trivial, the last inequality hold under our assumption
$N \,{\leqslant }\, q^{2/3}$
.
Hence, similar to the case
$k=3$
after simple calculations, one verifies that for
$\#{\mathcal A}_{s,t}> T$
, we have
$ L_{s,t}^2 \left (\#{\mathcal A}_{\pi (s,t)}\right )^{5/4} \,{\leqslant }\, q$
which in turn is equivalent to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu168.png?pub-status=live)
Therefore, by Equation (1.3), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu169.png?pub-status=live)
Using Equations (6.2) and (6.3) and the arguments as above, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn85.png?pub-status=live)
since again we have chosen T to optimise the above bound.
On the other hand, applying Lemma 6.1 and then Lemma 6.2, we derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn86.png?pub-status=live)
Comparing Equations (6.13) and (6.14)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu170.png?pub-status=live)
which gives the desired result for
$k=4$
.
6.3.3 Case
$k\,{\geqslant }\, 5$
Finally, consider the general case, which we treat with a version of Weyl differencing. Now,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu171.png?pub-status=live)
and let
$x\in {\mathcal A}_{\pi (s_1,\ldots ,s_{k-2})}$
. Indeed, we start with
${\mathcal A}_{s_1}$
and reduce the main term in
$x^k, (x+s_1)^k \in {\mathcal N}$
deriving that
$p_{k-1} (x) \in {\mathcal N}-{\mathcal N}$
, where
$\deg p_{k-1}= k-1$
. After that consider
$({\mathcal A}_{s_1})_{s_2} = {\mathcal A}_{\pi (s_1,s_2)}$
and reduce degree of the polynomial by one, and so on. We also note that by the Plünnecke inequality (see [Reference Tao and Vu30, Corollary 6.29])
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu172.png?pub-status=live)
the role of
$L_s$
or
$L_{s,t}$
is now played by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu173.png?pub-status=live)
We now set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu174.png?pub-status=live)
Using the same arguments as above, after somewhat tedious calculations to verify all necessary conditions such as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn87.png?pub-status=live)
to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu175.png?pub-status=live)
In particular, to check Equation (6.15) we note that for the above choice of T we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu176.png?pub-status=live)
and then derive
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu177.png?pub-status=live)
which is true because
$N \,{\leqslant }\, q^{2/3}$
and
$L \,{\leqslant }\, N^{1/ 2^{k+3}}$
(which we can assume as otherwise the bound is trivial).
Using the formula (6.2) and Equation (6.3), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu178.png?pub-status=live)
and hence by induction and Lemma 6.2
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu179.png?pub-status=live)
In other words,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu180.png?pub-status=live)
which completes the proof.
7 Proof of Theorem 2.2
Given a function
$f:\mathbb {F}_q\rightarrow \mathbb {C}$
, we define the Fourier transform of f by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu181.png?pub-status=live)
Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn88.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu182.png?pub-status=live)
Recall that
$\varphi $
satisfies Equation (2.2).
Applying Poisson summation to the sum over n gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn89.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu183.png?pub-status=live)
Using Equation (7.1) and interchanging summation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu184.png?pub-status=live)
where
$\overline {am}$
denotes multiplicative inverse modulo q. Summation over x is a quadratic Gauss sum which has evaluation (see [Reference Berndt, Evans and Williams5, Theorem 1.52])
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu185.png?pub-status=live)
for some
$|\varepsilon _q|=1$
, where
$\chi $
is the quadratic character mod q. Therefore, there exists some integer c with
$\gcd (c,q)=1$
depending on a and h such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu186.png?pub-status=live)
Substituting this into Equation (7.2) and applying the triangle inequality, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu187.png?pub-status=live)
Our next step is to apply linear shifts in a similar fashion to Friedlander and Iwaniec’s generalisation of the Burgess bound for character sums [Reference Friedlander and Iwaniec15]. Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn90.png?pub-status=live)
so by assumption on
$M,N$
we have
$U\gg 1$
. For fixed
$m\sim M$
apply shifts
$n\rightarrow n+um$
to the inner summation over n. Averaging this over
$1 \,{\leqslant }\, u \,{\leqslant }\, U$
gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu188.png?pub-status=live)
Let
$\varepsilon>0$
be small. Note by Equation (2.2) and partial integration, for any
$m\sim M$
,
$1 \,{\leqslant }\, u \,{\leqslant }\, U$
and constant
$C>0$
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu189.png?pub-status=live)
Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu190.png?pub-status=live)
Applying partial summation to u and using
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu191.png?pub-status=live)
we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu192.png?pub-status=live)
for some
$U_0 \,{\leqslant }\, U$
. Let
$I(\lambda )$
count the number of solutions to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu193.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn91.png?pub-status=live)
Note
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn92.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu194.png?pub-status=live)
It is known (see, for example, [Reference Ayyad, Cochrane and Zheng2]) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu195.png?pub-status=live)
and by assumptions on
$M,N$
the above simplifies to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn93.png?pub-status=live)
Applying the Hölder inequality to summation in Equation (7.4) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu196.png?pub-status=live)
Using Equations (7.5) and (7.6)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu197.png?pub-status=live)
Expanding the
$2r$
-th power, interchanging summation, isolating the diagonal contribution and using the Weil bound (see [Reference Schmidt24, pg. 45, Theorem 2G]) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu198.png?pub-status=live)
Using the above and recalling Equation (7.3), we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu199.png?pub-status=live)
from which the result follows after taking
$\varepsilon $
sufficiently small.
8 Proof of Theorem 2.3
8.1 Preliminaries
Our argument follows the proof of [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Theorem 1.10], the only difference being our use of Corollary 2.1 and Theorem 2.2. We refer the reader to [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Section 7] for more complete details.
Let
$\widetilde {S}_q(h,P)$
denote the sum
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu200.png?pub-status=live)
By partial summation, it is sufficient to show
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu201.png?pub-status=live)
Let
$J\,{\geqslant }\, 1$
be an integer. Using the Heath–Brown identity and a smooth partition of unity as in [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Section 1.7], there exist some
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu202.png?pub-status=live)
$2J$
-tuple of parameters satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu203.png?pub-status=live)
(implied constants are allowed to depend on J),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn94.png?pub-status=live)
and
-
• the arithmetic functions
$m_i \mapsto \gamma _i(m_i)$ are bounded and supported in
$[M_i/2,2M_i]$ ;
-
• the smooth functions
$x_i \mapsto V_i(x)$ have support in
$[1/2,2]$ and satisfy
$$ \begin{align*}V_i^{(j)}(x) \ll q^{j \varepsilon} \end{align*} $$
$j \,{\geqslant }\, 0$ , where the implied constant may depend on j and
$\varepsilon $
such that defining
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu205.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu206.png?pub-status=live)
We proceed on a case-by-case basis depending on the size of
$N_1$
. We first note a general estimate for the multilinear sums. Let
${\mathcal I},{\mathcal J}\subseteq \{1,\ldots ,J\}$
, and write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu207.png?pub-status=live)
Grouping variables in
$\Sigma (\mathbf {V})$
according to
${\mathcal I},{\mathcal J}$
, there exists
$\alpha ,\beta $
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu208.png?pub-status=live)
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu209.png?pub-status=live)
By Corollary 2.1,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn95.png?pub-status=live)
We proceed on a case by case basis depending on the size of
$N_1$
. Let
$P^{1/2}\,{\geqslant }\, H\,{\geqslant }\, P^{\varepsilon }$
be some parameters and take
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu210.png?pub-status=live)
8.2 Small
$N_1$
Suppose first
$N_1 \,{\leqslant }\, H$
, then arguing as in [Reference Dunn, Kerr, Shparlinski and Zaharescu13, Equation (7.13)] we can choose two arbitrary sets
${\mathcal I}, {\mathcal J} \subseteq \{1, \ldots , J\}$
such that for
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu211.png?pub-status=live)
where Q is given by Equation (8.1) and we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu212.png?pub-status=live)
Hence, by Equation (8.2)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn96.png?pub-status=live)
8.3 Medium
$N_1$
Let L be a parameter satisfying
$H \,{\leqslant }\, L$
, and suppose next that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu213.png?pub-status=live)
We may also suppose
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu214.png?pub-status=live)
as otherwise we may argue as before to obtain the bound (8.3). In this case, we define
$M,N$
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu215.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu216.png?pub-status=live)
By Equation (8.2)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn97.png?pub-status=live)
8.4 Large
$N_1$
Let R be a parameter to be chosen later and satisfying
$R\,{\geqslant }\, c P^{1/2}$
for some sufficiently large constant
$c> 0$
. Suppose next that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu217.png?pub-status=live)
Taking
$M=N_1$
as above, we derive from Equation (8.2)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn98.png?pub-status=live)
8.5 Very large
$N_1$
Finally, consider when
$N_1\,{\geqslant }\, R$
. We now intend to apply Theorem 2.2 with
$P/N_1\ll M\ll P/N_1$
and
$N = N_1$
, where we notice that the condition
$R\,{\geqslant }\, c P^{1/2}$
ensures that
$M< N$
, provided that c is large enough. Choosing
$r=2$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu218.png?pub-status=live)
Using the assumption
$P \,{\leqslant }\, q^{3/4}$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqn99.png?pub-status=live)
8.6 Optimisation
Combining all previous bounds (8.3), (8.4), (8.5) and (8.6) results in
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu219.png?pub-status=live)
Taking parameters
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu220.png?pub-status=live)
gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240301125826208-0250:S1474748023000397:S1474748023000397_eqnu221.png?pub-status=live)
which completes the proof.
Acknowledgement
We would like to thank Christian Bagshaw for pointing out a gap in the initial proof of Equation (3.14) and his help with fixing it and Alexander Dunn for some useful discussions and in particular for pointing out the paper of Duke [Reference Duke10] regarding multidimensional Salié sums. We are also very grateful to the referee for the very careful reading of the manuscript and very helpful comments.
During the preparation of this work, B.K. was supported by the Academy of Finland Grant 319180 and by the Max Planck Institute for Mathematics, I.D.S. by the Ministry of Science and Higher Education of the Russian Federation (agreement no. 075-02-2023-934), and I.E.S. by the Australian Research Council Grants DP170100786 and DP200100355.
Competing interests
The authors have no competing interest to declare.