1 Introduction
It is a classical problem in analytic number theory to study the distribution of well-known sequences in arithmetic progressions. The example of interest to us here is the sequence of squarefree integers; that is, integers n such that
$p^2 \nmid n$
for all primes p. Writing the indicator function for this sequence as
$\mu ^2(n)$
for all
$n \in \mathbb {N}$
, where
$\mu $
denotes the Möbius function,Footnote
1
it is known that for a given modulus q, the asymptotic equidistribution estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn1.png?pub-status=live)
for the count of squarefree integers in a progression
$a \pmod {q}$
holds if X is sufficiently large relative to q. It is a challenging question to determine the optimal constant
$\theta \in [0,1)$
such that (1) holds as soon as
$q \leq X^{\theta }$
. It is widely believed that any
$\theta < 1$
should be admissible, but this is far from proven in general. It has been known for some time (see [Reference Prachar19]) that any
$\theta < 2/3$
is admissible. At present, the best result that is available for all moduli q is that any
$\theta < 25/36 = 0.69\overline {4}$
is admissible, which is a recent result of Nunes [Reference Nunes16].
If we impose constraints on the modulus q, one might expect that it is possible to improve this range of
$\theta $
. For instance, Hooley [Reference Hooley8] showed that
$\theta $
can be taken in the interval
$[2/3,3/4)$
provided that q has a moderately largeFootnote
2
prime factor p, the size of which depends on
$\theta $
. As a consequence, he deduced that for a positive proportion of moduli
$q \leq X^{3/4-\varepsilon }$
the asymptotic (1) holds (the proportion depends on
$\varepsilon $
and tends toward
$0$
as
$\varepsilon \rightarrow 0^+$
). Recently, Liu, Shparlinski and Zhang [Reference Liu, Shparlinski and Zhang14] improved upon this result by proving a Bombieri–Vinogradov-type theorem for squarefree integers, showing that the required asymptotic formula holds for all residue classes
$(a,q) = 1$
for almost all
$q \leq X^{3/4-\varepsilon }$
.
In this article, we shall improve upon Nunes’s result for a different, natural collection of moduli, specifically those q that are
$X^{\eta }$
-smooth (otherwise called
$X^{\eta }$
-friable); that is, such that all prime factors p of q satisfy
$p \leq X^{\eta }$
for
$\eta> 0$
small. For many such moduli, including all squarefree
$X^{\eta }$
-smooth moduli, we shall in fact be able to improve upon the range of admissibility
$\theta < 3/4$
from the works of Hooley and of Liu, Shparlinski and Zhang.
More precisely, our first main result is as follows.
Theorem 1.1. Let
$\varepsilon> 0$
be small and let
$0 < \eta < 1/522$
. Let X be large in terms of
$\eta ,\varepsilon $
and let
$q \leq X^{196/261-\varepsilon }$
be
$X^{\eta }$
-smooth and squarefree. Then there is a
$\delta> 0$
, depending only on
$\eta $
and
$\varepsilon $
, such that for any
$a \pmod {q}$
with
$(a,q) \leq X^{\varepsilon }$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu1.png?pub-status=live)
Remark 1.2. Our proof actually shows that for
$q \leq X^{3/4-\varepsilon }$
one may take as the smoothness exponent any
$\eta \leq 6/25$
, whereas for
$X^{3/4-\varepsilon } < q \leq X^{196/261-\varepsilon }$
the admissible range is
$\eta < 1/522$
; it is probable that this range in
$\eta $
may be improved somewhat, though it was not our primary objective to obtain an optimal such range.
Our result has the following trivial corollaries. The first improves upon the rangeFootnote 3 of moduli that is accessible in the density result of Hooley quoted earlier.
Corollary 1.3. For any
$\varepsilon> 0$
, a positive proportion of the moduli
$q \leq X^{196/261-\varepsilon }$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu2.png?pub-status=live)
Corollary 1.4. Let
$\varepsilon> 0$
be small,
$0 < \eta < 1/522$
and let X be sufficiently large in terms of
$\eta $
and
$\varepsilon $
. Let q be squarefree and
$X^{\eta }$
-smooth and let a be a coprime residue class modulo q. Then provided
$X \geq q^{261/196+\varepsilon }$
, there is a squarefree integer in the set
$\{n \leq X : n \equiv a \pmod {q}\}$
.
It is desirable to remove the assumption that q is squarefree, so that the above results continue to hold in some form for q merely
$X^{\eta }$
-smooth. While we are not able to derive this conclusion for all such moduli, we do show that almost all
$X^{\eta }$
-smooth moduli do have this property.
Theorem 1.5. There is a
$\lambda> 0$
such that the following is true. Let
$\eta> 0$
and set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu3.png?pub-status=live)
Then for all but
$O_{\eta }(|\mathcal {Q}_{\lambda }(X)|/\log X)$
moduli
$q \in \mathcal {Q}_{\lambda }(X)$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu4.png?pub-status=live)
Given
$y \geq 2$
we will say that a positive integer q is y-ultrasmooth if, whenever
$p^n||q$
we have
$p^n \leq y$
. What we will actually show is that the conclusion of Theorem 1.5 applies to all elements of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu5.png?pub-status=live)
It is easy to see that by the union bound,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu6.png?pub-status=live)
which implies the claimed bound on the exceptional set when
$X \geq X_0(\eta )$
.
Remark 1.6. To be precise, there are two reasons why we do not treat all smooth moduli in this article. The first is that our method does not directly treat moduli q such that q has a large power of 2 or 3 as a divisor. It is likely that it could be modified to treat this case but at the cost of adding a nontrivial amount of pages to this already long article.
A more serious issue arises from the fact that in the course of the proof we need to be able to factor our modulus q (or, more precisely, a suitably chosen divisor of it) into coprime parts with well-controlled sizes (here we allow perturbations of size
$X^{\eta }$
only). If q were merely
$X^{\eta }$
-smooth but not
$X^{\eta }$
-ultrasmooth – for example, if q were divisible by a prime power
$p^{\nu }> X^{1/100}$
, say, with
$p \leq X^{\eta }$
– then this prime power would have to arise in one of the factors, biasing its size in a manner that might be incompatible with the bounds we obtain. The
$X^{\eta }$
-ultrasmoothness condition is in place to prevent such a bias in size from occurring.
Remark 1.7. It is worth noting that our proof actually shows that we may asymptotically estimate the number of squarefree integers in a progression modulo q when
$q \leq X^{3/4-\varepsilon }$
which is
$X^{\eta }$
-smooth, without further assumptions (see Subsection 6.1 for a proof). However, this by itself is not sufficient to improve upon Hooley’s positive density result.
1.1 Proof Strategy
To prove Theorems 1.1 and 1.5, we will use a method of Heath-Brown that was used by Irving [Reference Irving9] to study the distribution of the divisor function in arithmetic progressions. To motivate our argument, it is useful to see where obstructions occur in the classical treatment of counting squarefree integers in progressions, as found in [Reference Prachar19].
Assume in what follows that
$(a,q) = 1$
, for convenience. Using the classical identity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu7.png?pub-status=live)
and decoupling the parameters k and l by localising them in short intervals (as we do in Section 2), it can be shown that the error term in (1) is controlled by averaged incomplete exponential sumsFootnote 4
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn2.png?pub-status=live)
where I is some interval of size
$< q$
. Using the completion method, one is led to bound averages of ‘quadratic Kloosterman sums’
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu8.png?pub-status=live)
where
$A \in (\mathbb {Z}/q\mathbb {Z})^{\times }$
and
$B \in \mathbb {Z}/q\mathbb {Z}$
. Using the Chinese remainder theorem, we may, of course, factor
$K_2$
as a product of complete sums modulo prime powers
$p^n||q$
. Each such factor can be estimated pointwise by
$O(p^{n/2})$
, using either:
-
(i) a trivial application of the Bombieri–Dwork–Weil bound (see Lemma 2.2) when
$n = 1$ or
-
(ii) the p-adic method of stationary phase for
$n \geq 2$ (see Lemma 2.1).
The resulting bound
$O_{\varepsilon }(X^{\varepsilon }q^{1/2})$
for the complete sum modulo q is of size
$o(X/q)$
as required, as long as
$q \leq X^{2/3-\varepsilon }$
.
One way to go beyond the
$X^{2/3}$
barrier is to try to exploit the averaging in k in (2), rather than employing a pointwise bound. Indeed, when q factors sufficiently nicely, the q-analogue of the van der Corput method of exponential sums, developed by Ringrose [Reference Ringrose21] and Heath-Brown [Reference Heath-Brown7, Theorem 2], enables one to reduce the problem above to estimating correlations of complete exponential sums (to be discussed momentarily). Using (a variant of) a result of Fouvry et al. [Reference Fouvry, Ganguly, Kowalski and Michel5] to estimate such correlations, Irving is able to treat
$X^{\varepsilon }$
-smooth and squarefree moduli of size
$q \leq X^{2/3+1/246-\varepsilon }$
. Aside from the fact that the sums
$K_2$
entering the picture differ in behaviour from genuine Kloosterman sums (so that the results of [Reference Fouvry, Ganguly, Kowalski and Michel5] do not apply), this strategy by itself is insufficient in the case of squarefree integers, even falling short of Nunes’s result (see Subsection 2.2.2 for further details).
To do better, we incorporate an additional idea. The key difficulty in understanding the distribution of squarefree integers in progressions is to estimate the count of points on the curve
$xy^2 \equiv a \pmod {q}$
, for x and y lying in certain ranges. Clearly, if
$I,J \subset \mathbb {Z}/q\mathbb {Z}$
are intervals and
$q'$
is any divisor of q, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu9.png?pub-status=live)
moreover, observe that the analogous bound for (2) with
$q'$
(of suitable size) in place of q – that is,
$O(X^{\varepsilon }(q')^{1/2})$
– can be of size
$o(X/q)$
for larger choices of q than
$X^{2/3-\varepsilon }$
. There is therefore an advantage in working with exponential sums modulo a suitably sized divisor of q, whenever such a divisor can be found; this was observed as well in [Reference Hooley8], but its implementation differs from what we do here. As we shall show below, the fact that q is
$X^{\eta }$
-smooth means we can find divisors of q of any prescribed size (up to factors of size
$X^{\eta }$
), in particular the size required to use the trick above. We therefore end up applying Irving’s method to treat Kloosterman-type sums modulo
$q'$
instead, which, when combined with the analysis of correlations described above, results in a gain not over the range
$q \leq X^{2/3-\varepsilon }$
but over a larger range of q instead.
Let us describe more precisely a key feature of our argument. A crucial step in Irving’s method (again for the divisor function) involves giving nontrivial estimates for the correlations
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu10.png?pub-status=live)
where
$p \mid q$
,
$h_1,\ldots ,h_k \in \mathbb {F}_p$
,
$a \in \mathbb {F}_p^{\times }$
,
$I \subset \mathbb {F}_p$
is an interval and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu11.png?pub-status=live)
is the classical Kloosterman sum modulo p. In our circumstances, we treat
$K_2$
sums to both prime and prime power moduli, each case of which requires a separate analysis.
In the prime case, the corresponding correlation sum that we need to treat is of the formFootnote 5
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu12.png?pub-status=live)
where
$k+l \geq 1$
. We treat (completions of) such sums, which are the subject of Theorem 3.1, in Section 3 of this article, using cohomological methods, in particular, the sheaf-theoretic Fourier transform of Deligne.
Specifically, we view
$K_2$
as the
$\ell $
-adic Fourier transform of the trace function of an Artin–Schreier sheaf (
$\ell \neq p$
being an auxiliary prime), which is itself a trace function, pointwise pure of weight 1. Treating its correlations amounts to identifying cases in which tensor products of the underlying Galois representations are, or are not, geometrically trivial, a task facilitated by the Goursat–Kolchin–Ribet criterion (see [Reference Fouvry, Kowalski and Michel6] for an array of example applications of this method).
In the prime power case, our work is simplified (in terms of the required theoretical preliminaries but not in the amount of technical details) by the fact that these
$K_2$
sums can be explicitly computed using the p-adic stationary phase method. For instance, when
$n \geq 2$
and
$p>3$
is prime, we have (see Lemma 2.1)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu13.png?pub-status=live)
for any
$A \in (\mathbb {Z}/p^n\mathbb {Z})^{\times }$
and
$B \in \mathbb {Z}/p^n\mathbb {Z}$
, where
$\varepsilon _{p,n} \in S^1$
. The correlation problem then revolves around bounding exponential sums over variables from a variety determined by the polynomials
$\{X^3-\overline {2a}(b+h_i)\}_i$
and
$\{X^3-\overline {2a}(b+h_j')\}_j$
, as b varies.
An important work treating such correlations, with
$K_2$
sums again replaced by Kloosterman sums, was undertaken by Ricotta and Royer [Reference Ricotta and Royer20]. They used their estimates to establish distribution theorems for Kloosterman sums modulo
$p^n$
, as
$p \rightarrow \infty $
. However, their method is efficient mainly when n is fixed, as it relies on treating the correlation sum (via explicit formulae for Kloosterman sums to prime powers) as an exponential sum whose phase function turns out to be a polynomial modulo
$p^n$
of degree essentially as large as n and then applying the standard van der Corput–Weyl method. We also employ this strategy but instead use Vinogradov’s method (and the recent solution to the Vinogradov main conjecture, due to Bourgain–Demeter–Guth [Reference Bourgain, Demeter and Guth2] and Wooley [Reference Wooley25]) independently in place of van der Corput’s method, which leads to a stronger result when n is of bounded size as p grows.
In our circumstances we will also require a treatment that is effective for moduli
$p^n$
with rather large values of n and p possibly fixed. Fortunately, very recent work of Milićević and Zhang [Reference Milićević and Zhang15] introduced a method that suits this situation, in which one iteratively applies the stationary phase method to recover from the correlation sum a sum over a ‘generically trivial’ variety, up to small error (at least when n is large enough), rather than using Weyl sum estimates. A combination of the argumentsFootnote
6
in each of these regimes will suit our needs.
2 Setting up the Key Estimate
2.1 First reductions
Let
$\varepsilon ,\eta> 0$
be sufficiently small, let X be large relative to
$\varepsilon $
and
$\eta $
and let
$X^{2/3-\varepsilon } \leq q \leq X^{9/10-\varepsilon }$
be
$X^{\eta }$
-smooth. Given a a residue class modulo q, an arithmetic function
$g : \mathbb {N} \rightarrow \mathbb {C}$
and a set
$E\subset \mathbb {N}$
, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu14.png?pub-status=live)
We shall also use the shorthand
$\Delta _g(X;q,a):=\Delta _g([1,X]\cap \mathbb {N};q,a)$
. For the remainder of this section we will assume that
$(a,q) = 1$
.
Take
$g = \mu ^2$
, the indicator function for the squarefree integers. Using the classical identity
$\mu ^2(n) = \sum _{md^2 = n} \mu (d)$
we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu15.png?pub-status=live)
where
$\overline {d}$
denotes the residue class modulo q with
$d\overline {d} \equiv 1 \pmod {q}$
. Let
$\delta \in (0,1/20)$
and let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu16.png?pub-status=live)
be a parameter to be chosen. For
$m\le Y$
and
$1 \leq b \leq m$
, note the trivial bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu17.png?pub-status=live)
whence it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu18.png?pub-status=live)
It will be convenient in what follows later to remove the coefficient
$\mu (d)$
. Decomposing dyadically the sum in d and applying the triangle inequality, we find that there is a
$V_0 < V \leq \sqrt {X}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu19.png?pub-status=live)
Next, we further subdivide the range of
$m \leq X/d^2$
into dyadic subintervals, leading to the existence of U satisfying
$UV^2 \leq X$
, such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu20.png?pub-status=live)
To remove the condition
$md^2 \leq X$
, we split
$(U,2U]$
and
$(V,2V]$
into subintervals of respective lengths
$UV_0^{-1}$
and
$VV_0^{-1}$
, of which there are
$\ll V_0^{2}$
in total. We thus find that there are
$U_1 \in (U,2U]$
,
$V_1 \in (V,2V]$
with
$U_1V_1^2 \leq 8X$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu21.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu22.png?pub-status=live)
and
$\mathcal {E}$
counts the number of pairs
$(m,d)$
such that
-
(i)
$md^2> X$ ,
-
(ii)
$md^2 \equiv a \pmod {q}$ and
-
(iii)
$d \in I(V_1')$ ,
$m \in I(U_1')$ with
$U_1' \in (U,2U]$ ,
$V_1' \in (V,2V]$ satisfying
$U_1'(V_1')^2 \leq X$ .
We easily see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu23.png?pub-status=live)
As
$X /V_0 \geq q^{1+\delta }$
, by Shiu’s theorem [Reference Shiu22] the contribution from these pairs is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu24.png?pub-status=live)
We thus find that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn3.png?pub-status=live)
again with
$U_1V_1^2 \leq 8X$
. Note that we may assume that
$V_1> X^{1-\delta -\varepsilon }/(qV_0)$
, since otherwise we immediately obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn4.png?pub-status=live)
Let
$\tilde {q}$
be a divisor of q to be chosen later (the smoothness assumption on q will be useful in this selection). Using the fact that when
$U_1V_1^2 \leq 8X$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu25.png?pub-status=live)
for
$q' \in \{q,\tilde {q}\}$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu26.png?pub-status=live)
Hence, from (3) and
$V_1 \ll X^{1/2}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu27.png?pub-status=live)
for
$\tilde {q}\mid q$
,
$X^{\delta + \varepsilon } \leq V_0 \leq X^{1-\delta }/q$
and
$V_1 \geq \max \{V_0, X^{1-\delta -\varepsilon }/(qV_0)\}$
.
Having decoupled the variables d and m and removed the weight
$\mu (d)$
, we now introduce additive characters into the fold. By orthogonality, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu28.png?pub-status=live)
By the sieve,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu29.png?pub-status=live)
the main term of which cancels the sum with
$k = 0$
above and so we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu30.png?pub-status=live)
Applying the geometric series estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu31.png?pub-status=live)
for
$1 \leq k \leq \tilde {q}/2$
, we thus obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu32.png?pub-status=live)
2.2 Bounding incomplete exponential sums on average
Our main objective from here on is to get a suitable estimate on average over k for
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu33.png?pub-status=live)
To simplify matters further, we separate the range of k according to
$(k,\tilde {q}) = f$
, giving
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn5.png?pub-status=live)
Fix
$f\mid \tilde {q}$
with
$f < \tilde {q}$
for the moment and put
$q' := \tilde {q}/f$
. Completing the sum, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn6.png?pub-status=live)
where for
$Q \geq 2$
we have set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu34.png?pub-status=live)
the complete exponential sum defined in the introduction, as well as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn7.png?pub-status=live)
We would like to use partial summation to remove the weight
$g_{q'}$
in (6); however, the long sum in r will make this inefficient in the sequel if we do not split the interval into shorter segments. To this end, let
$1 \leq K \leq q'-1$
be a parameter that we will choose later. We split
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu35.png?pub-status=live)
Given
$1 \leq m \leq q^{\prime }/K$
, set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu36.png?pub-status=live)
Applying partial summation to estimate the derivative
$g_{q^{\prime }}^{\prime }$
of
$g_{q'}$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu37.png?pub-status=live)
Combining this, (7) and partial summation once again, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn8.png?pub-status=live)
We may control the terms in (5) with large f directly using a square-root cancelling bound for
$K_2(A,B,Q)$
, which we derive below.
2.2.1 Point-wise bounds
Lemma 2.1 p-adic stationary phase method
For any
$n \geq 2$
,
$a \in (\mathbb {Z}/p^n\mathbb {Z})^{\times }$
and
$b \in \mathbb {Z}/p^n\mathbb {Z}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn9.png?pub-status=live)
where
$\varepsilon _{p,n} = 1$
if n is even and
$\varepsilon _{p,n} = i^{(p-1)^2/4}$
if n is odd.
Proof. Applying Lemmas 12.2 and 12.3 of [Reference Iwaniec and Kowalski10], we have that if
$A \in (\mathbb {Z}/p^n\mathbb {Z})^{\times }$
and
$B \in \mathbb {Z}/p^n\mathbb {Z}$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu38.png?pub-status=live)
where for y satisfying
$y^3 \equiv \overline {2A}B \pmod {p^{\left \lfloor n/2\right \rfloor }}$
we have set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu39.png?pub-status=live)
A key point here is that the set of critical points – that is, solutions to
$y^3 \equiv \overline {2A}B \pmod {p^{\left \lfloor n/2\right \rfloor }}$
– is invariant under translations by
$p^{n-\left \lfloor n/2\right \rfloor } \mathbb {Z}/p^n\mathbb {Z}$
(see, e.g., [Reference Milićević and Zhang15, Lemma 1]); in particular, by choosing a lift of such critical points to solutions to
$y^3 \equiv \overline {2A}B \pmod {p^n}$
via Hensel’s lemma, we may rewrite
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu40.png?pub-status=live)
When
$n = 2m$
, with
$m \geq 1$
, we simply have (with
$A = a$
and
$B = b$
)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu41.png?pub-status=live)
which implies the claim in this case. On the other hand, completing the square and using the explicit computation of Gauss sums modulo p when
$n = 2m+1$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu42.png?pub-status=live)
Again, using the
$p^{m+1}\mathbb {Z}/p^{2m+1}\mathbb {Z}$
-translation invariance of the solutions to
$y^3 \equiv \overline {2A}B \pmod {p^m}$
, at critical points the exponential here is simply 1 and we obtain (when
$A = a$
and
$B = b$
)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu43.png?pub-status=live)
The claim is proved.
Lemma 2.2. Let
$Q \geq 2$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu44.png?pub-status=live)
Proof. We reduce to the case of prime power moduli using the Chinese remainder theorem. Indeed, if
$Q = m_1m_2$
where
$m_1$
and
$m_2$
are coprime, then selecting
$r_1,r_2 \in \mathbb {Z}$
such that
$m_1r_1+m_2r_2 = 1$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn10.png?pub-status=live)
Applying this inductively over the prime power divisors of Q and taking maxima over A and B, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu45.png?pub-status=live)
Now, observe that for each
$p || Q$
prime and
$A,B \in \mathbb {Z}/p\mathbb {Z}$
we can represent
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu46.png?pub-status=live)
where
$f_{A,B}(x) = A/x^2 + Bx\in \mathbb {F}_p(x)$
. By the Bombieri–Dwork–Weil bound [Reference Bombieri1, Theorem 6] (see also [Reference Deligne3, Section 3.5]),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn11.png?pub-status=live)
for
$C'>0$
an absolute constant. On the other hand, if
$p^n||Q$
with
$n \geq 2$
, then by Lemma 2.1 we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu47.png?pub-status=live)
The solutions to
$y^3 \equiv \overline {2A}B \pmod {p}$
lift uniquely to solutions modulo
$p^{\left \lfloor n/2\right \rfloor }$
by Hensel’s lemma, so the cardinality in the previous line is
$\leq 3$
. In particular,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu48.png?pub-status=live)
for
$C := \max \{C',3\}$
.
We therefore conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu49.png?pub-status=live)
as claimed.
Combining Lemma 2.2 with (6) and
$V_1 \ll X^{1/2}$
gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu50.png?pub-status=live)
Let
$Z \geq 2$
be a parameter to be chosen later. Applying this with
$q' = \tilde q/f$
with
$f> Z$
in particular, it follows immediately that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu51.png?pub-status=live)
which, in combination with (8), thus gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn12.png?pub-status=live)
provided
$K \leq \tilde {q}/Z$
.
2.2.2 Bounds on average
It turns out (see Subsection 6.1) that merely applying Lemma 2.2 directly to
$K_2$
(after replacing q by
$\tilde {q}$
as we have done above) results in a power-saving upper bound for
$\Delta _{\mu ^2}(X;q,a)$
for any
$q \leq X^{3/4-\varepsilon }$
, provided
$\tilde {q}$
can be chosen with appropriate size. This is independent of squarefreeness considerations and is modeled after Hooley’s idea in [Reference Hooley8].
Ignoring the effect of the sum over divisors f (which will have little influence in the sequel), in order to do better we will need to find a power savings in X over the pointwise estimate from Lemma 2.2; that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu52.png?pub-status=live)
by utilising the averaging of
$K_2$
sums implicit in the definition of
$\kappa (m;k'a,\tilde {q})$
. To this end, we will apply the q-van der Corput method of Heath-Brown, as formulated by Irving in [Reference Irving9]. The following is proved mutatis mutandis by the arguments in [Reference Irving9].
Proposition 2.3. [Reference Irving9, Lemma 4.3]
Let
$K,L \geq 1$
and
$M \in \mathbb {Z}$
. Suppose
$Q \geq 4$
factors as
$Q = Q_0 \cdots Q_L$
, with
$Q_j \geq 2$
for each
$0 \leq j \leq L$
. Let J be an interval with
$|J| \leq K$
and set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu53.png?pub-status=live)
where b is a coprime residue class modulo Q. If
$K \geq \max \{Q_1,\ldots ,Q_L\}$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu54.png?pub-status=live)
where for each
$\boldsymbol {h} \in \mathbb {Z}^L$
with
$1 \leq |h_j| \leq K/Q_j$
there is an interval
$J(\boldsymbol {h})$
of size
$\leq K$
and
$b'$
coprime to q such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu55.png?pub-status=live)
$\mathcal {C}(z) := \overline {z}$
being the complex conjugation map.
Proposition 2.3 indicates that our main point of focus for the remainder of the argument will be the estimation of
$|T(\boldsymbol {h})|$
, for
$\boldsymbol {h}$
satisfying
$Q_j|h_j| \in [1,K]$
for all
$1 \leq j \leq L$
. We will estimate these terms pointwise in
$\boldsymbol {h}$
, the key point being that, outside of a sparse set of
$\boldsymbol {h}$
, we will obtain significant cancellation. This will result in the following.
Proposition 2.4. Adopt the notation of Proposition 2.3.
i) Assume that
$Q = Q_0 \cdots Q_L$
is squarefree. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu56.png?pub-status=live)
ii) Then there is a
$\delta ' = \delta '(L) \in (0,2^{-2^L}]$
such that the following holds. Suppose
$Q = Q_0\cdots Q_L$
is such that
$(Q_i,Q_j) = 1$
for all
$0 \leq i < j \leq L$
and
$(Q_0,6) = 1$
. Assume also that
$K/Q_j> Q_0^{2\delta '}$
for all
$p^{\nu } || Q_0$
and all
$1 \leq j \leq L$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu57.png?pub-status=live)
Proposition 2.4 will be proved in the next two sections. As a first step, we shall replace
$T(\boldsymbol {h})$
by analogous complete sums (13) modulo prime powers with an additional additive phase using the following.
Lemma 2.5. Let
$I \subset \mathbb {Z}/Q_0 \mathbb {Z}$
be an interval and let
$A_0 \in (\mathbb {Z}/Q_0\mathbb {Z})^{\times }$
,
$B_0\in \mathbb {Z}/Q_0\mathbb {Z}$
. Let
$N,M \geq 0$
with
$N+M \geq 1$
and let
$\boldsymbol h\in \mathbb {Z}^N$
,
$\boldsymbol h'\in \mathbb {Z}^M$
. Write
$Q_0 = \prod _{1 \leq j \leq k} p_j^{\alpha _j}$
for distinct primes
$p_j$
and
$k = \omega (Q_0)$
. Then there exist
$\boldsymbol {A},\boldsymbol {B}\in \prod _{1\le j\le k} \mathbb {Z}/p_j^{\alpha _j}\mathbb {Z}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu58.png?pub-status=live)
where for each
$Q\mid Q_0$
we set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn13.png?pub-status=live)
Proof. For
$B \in \mathbb {Z}/Q_0\mathbb {Z}$
put
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu59.png?pub-status=live)
Completing the sum over B modulo
$Q_0$
, the left-hand side is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu60.png?pub-status=live)
It thus suffices to show the existence of
$A_j,B_j \pmod {p_j^{\alpha _j}}$
for each
$1 \leq j \leq k$
, such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu61.png?pub-status=live)
We prove this by induction on k, the number of distinct prime factors of
$Q_0$
. When
$k = 1$
there is nothing to prove. Assume this works for any
$Q_0$
having k distinct prime factors and now suppose that
$Q_0$
has
$k+1$
such factors. Write
$Q_0 = Q_0'p^{\alpha }$
, where
$p\nmid Q_0'$
and
$\alpha \geq 1$
. Let
$r,s \in \mathbb {Z}$
be chosen such that
$rQ_0' + sp^{\alpha } = 1$
. By the Chinese remainder theorem, every
$B \pmod {Q_0}$
can be written uniquely as
$B = uQ_0' + vp^{\alpha }$
, where
$0 \leq u \leq p^{\alpha }-1$
and
$0 \leq v \leq Q_0'-1$
. Thus,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu62.png?pub-status=live)
Applying (10) and the symmetry
$K_2(\alpha ,\gamma \beta; q') = K_2(\gamma ^2\alpha ,\beta ;q')$
for any
$\gamma \in (\mathbb {Z}/q'\mathbb {Z})^{\times }$
, we see that the products are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu63.png?pub-status=live)
Making the change of variables
$u \mapsto uQ_0'$
and
$v \mapsto vp^{\alpha }$
, we thus get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu64.png?pub-status=live)
where the inverses are taken modulo
$p^{\alpha }$
and
$Q_0'$
respectively.
By induction, we can factor the second bracketed term similarly into k products and the claim follows.
In Irving’s work [Reference Irving9], where squarefree moduli specifically are treated, an application of a (variant of a) result of Fouvry et al. on correlations of Kloosterman sums ([Reference Fouvry, Ganguly, Kowalski and Michel5, Proposition 3.2]) is used to control the complete sums to prime moduli arising in the factorisation in Lemma 2.5. To achieve the same goal, we will prove in full detail a similar result for correlations of the complete exponential sums
$K_2$
in the next section. In Section 4, we treat the same problem for prime power moduli, using rather different techniques.
3 Correlations of
$K_2$
Sums to Prime Moduli: Cohomological Methods
The goal of this section is to provide an estimate for sums like (13). We will prove, in full detail, the following analogue of [Reference Fouvry, Ganguly, Kowalski and Michel5, Proposition 3.2] and [Reference Irving9, Section 4.3] (the latter of which cites private communications for the corresponding result for Kloosterman sums). This will be the main input to the proof of Proposition 2.4 i).
Throughout this section, fix a prime p. Given
$N,M \geq 1$
and tuples
$\boldsymbol {h} \in \mathbb {F}_p^N$
and
$\boldsymbol {h}' \in \mathbb {F}_p^M$
, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu65.png?pub-status=live)
and for each
$\tau \in T$
define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu66.png?pub-status=live)
Theorem 3.1. For
$A\in \mathbb {F}_p^\times $
,
$\psi \in \widehat {\mathbb {F}}_p$
a possibly trivial additive character and
$h_1,\ldots ,h_N$
,
$h_1',\ldots , h_M' \in \mathbb {F}_p$
(where
$N+M\ge 1$
), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn14.png?pub-status=live)
unless
$\psi $
is trivial and
$\mu (\tau ) \equiv \nu (\tau ) \pmod {3}$
for all
$\tau \in T$
. The implied constant is absolute (e.g., does not depend on N or M).
Remark 3.2. We can rewrite the left-hand side of (14) as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu67.png?pub-status=live)
Note that when
$\psi $
is trivial and
$\mu (\tau ) = \nu (\tau )$
for all
$\tau \in T$
, the summands are all nonnegative. We should therefore not expect to find any improvement over the trivial bound in general (outside of the possibility that the absolute values of
$p^{-1/2}K_2(A,B+\tau ;p)$
are small, which is atypical for large p given that these normalised sums become equidistributed according to Haar measure on
$\text {SU}_3(\mathbb {C})$
as B varies modulo p and
$p \rightarrow \infty $
). It will transpire from the proof of Theorem 3.1 that our characterisation of when savings are available for the above correlation sums is essentially sharp.
To prove Theorem 3.1 we will employ the method surveyed in [Reference Fouvry, Kowalski and Michel6]. Highlights of this method include
-
• the interpretation of
$K_2$ as the trace function of an
$\ell $ -adic sheaf, pure of weight 1 and the computation of its geometric monodromy group (following Katz [Reference Katz12]);
-
• the determination of geometric isomorphisms between shifts of these sheaves to find the monodromy of a product sheaf via the Goursat–Kolchin–Ribet criterion; and
-
• the application of the Grothendieck–Lefschetz trace formula and the Grothendieck–Ogg–Shafarevich Euler–Poincaré formula.
We will use the statements from [Reference Perret-Gentil18] that also track the dependencies in the number of factors (i.e., N and M), for completeness. For the sake of concision, we refer the reader to these (and the references therein) for additional definitions, notations and other details.
3.1 Cohomological Interpretation of
$K_2$
and (14)
In the language of [Reference Deligne3], the pointwise bound on
$K_2$
modulo primes from Lemma 2.2 (see (11)) can be seen as the outcome of applying the Grothendieck–Lefschetz trace formula and Deligne’s Riemann hypothesis over finite fields [Reference Deligne4] to the one-dimensional Artin–Schreier
$\ell $
-adic sheaf
$\mathcal {L}_{e(f_{A,B}/p)}$
on
$\mathbb {G}_m\times \mathbb {F}_p$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu68.png?pub-status=live)
where
$\ell \neq p$
is an auxiliary prime,
$\iota : \overline {\mathbb {Q}}_\ell \to \mathbb {C}$
is a compatibleFootnote
7
embedding,
$\operatorname {Frob}_{x, p}\in \pi _1^{\mathrm {geom}}(\mathbb {G}_m,\overline {\eta })$
is the geometric Frobenius class at
$x\in \mathbb {G}_m(\mathbb {F}_p)$
for
$\overline {\eta }$
a geometric generic point and
$\operatorname {Frob}_p\in \operatorname {Gal}(\overline {\mathbb {F}}_p/\mathbb {F}_p)$
is the geometric Frobenius (acting on the cohomology groups). The dimension of the first cohomology group is bounded independently from p by the Grothendieck–Ogg–Shafarevich formula, giving the constant
$C'$
in (11) above.
To handle sums of
$K_2$
sums in Theorem 3.1, we adopt a different perspective and consider
$K_2$
as an
$\ell $
-adic trace function itself, using the
$\ell $
-adic Fourier transform of Deligne. Some properties of the sheaf thus produced are given in the following lemma.
Lemma 3.3. Assume that p is an odd prime, fix an auxiliary prime
$\ell \neq p$
, a compatible embedding
$\iota : \overline {\mathbb {Q}}_\ell \to \mathbb {C}$
and let
$A\in \mathbb {F}_p^\times $
. There exists a middle-extension
$\overline {\mathbb {Q}}_\ell $
-sheaf of
$\overline {\mathbb {Q}}_\ell $
-modules
$\mathcal {G}_A$
that is lisse on
$\mathbb {G}_m\times \mathbb {F}_p$
and pointwise pure of weight
$0$
, as well as
$\gamma \in \mathbb {C}$
of modulus one, such that for every
$B\in \mathbb {G}_m(\mathbb {F}_p)$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn15.png?pub-status=live)
Moreover:
-
1.
$\mathcal {G}_A$ has rank 3, with a unique
$\infty $ -break at
$2/3$ ;
-
2.
$\operatorname {Swan}_\infty (\mathcal {G}_A)=2$ ;
-
3.
$\mathcal {G}_A$ is tamely ramified at
$0$ and its local monodromy is a unipotent pseudoreflection;
-
4. if
$p> 7$ , the arithmetic and geometric monodromy groups
$G_{\mathrm {arith}}$ ,
$G_{\mathrm {geom}}$ (that is, the Zariski closures of the images of the arithmetic/geometric fundamental groups by the corresponding representation composed with
$\iota $ ) are equal and isomorphic to
$\operatorname {SL}_3(\mathbb {C})$ .
Proof. A sheaf
$\mathcal {G}_A'$
satisfying all of the above properties but (4) is given by the
$\ell $
-adic Fourier transform of the Artin–Schreier sheaf
$\mathcal {L}_{e(f(X)/p)}$
, where
$f(X)=A/X^2\in \mathbb {F}_p(X)$
. The resulting trace function (the left-hand side of (15)) is indeed the discrete Fourier transform of
$e(f(x)/p)$
, namely,
$K_2$
. The statements of the lemma are all contained in [Reference Katz12, Section 7.3, Section 7.12 (
$\text{SL}$
-Example(3)), Theorem 7.12.3.1], with
$h=f$
,
$\alpha =0$
and
$n_0=\operatorname {ord}_0(f)=2$
. In particular, the rank is
$1+n_0=3$
.
Regarding the last property, since
$f(x)+f(-x)$
is nonconstant, the geometric monodromy group is isomorphic to
$\operatorname {SL}_3(\mathbb {C})$
for
$p> 7$
by the theorem [Reference Katz12, Theorem 7.12.3.1]. By [Reference Katz12, Section 7.12 (
$\text{SL}$
-Example(3))],
$\det \mathcal {G}^{\prime }_A$
is geometrically trivial, whence arithmetically isomorphic to
$\beta \otimes \overline {\mathbb {Q}}_\ell $
, where
$\beta $
is a p-Weil number of weight
$0$
. Therefore, setting
$\mathcal {G}_A=\beta ^{-1/3}\otimes \mathcal {G}^{\prime }_A$
yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu69.png?pub-status=live)
with
$\mathcal {G}_A$
still verifying the previous properties. The theorem then holds with the twist
$\gamma =\iota \beta ^{-1/3}\in \mathbb {C}$
.
Note that the purity and dimensionality statements encompass the bound (11) from Lemma 2.2:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn16.png?pub-status=live)
(including at
$B=0$
, when
$K_2(A,0;p)$
is, up to a unimodular factor, quadratic Gauss sum with modulus exactly
$\sqrt {p}$
).
The bound in (14) is trivial if
$p \leq 7$
, so we may assume in what follows that
$p> 7$
. Using Lemma 3.3, we may bound the modulus of the left-hand side of (14) as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn17.png?pub-status=live)
setting
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu70.png?pub-status=live)
and letting
$U(\mathbb {F}_p)$
denote its set of lisse points. Here, the tensor product
$\otimes $
and dual D are understood at the level of the corresponding
$\ell $
-adic representations (as in [Reference Katz11, Reference Katz12]). The second term in brackets in (17) arises by applying (16) to the set of ramification points of the tensor product, of which there are
$\leq N+M$
.
The trace formula will now be applied to (17).
3.2 Applying the trace formula
By the Grothendieck–Lefschetz trace formula and the Grothendieck–Ogg–Shafarevich formula (see the references in [Reference Perret-Gentil18, Theorem 2.5]),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn18.png?pub-status=live)
with an absolute implied constant, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu71.png?pub-status=live)
the inequality coming from Lemma 3.3 and the ramification properties of the tensor product recalled in [Reference Katz11, Lemma 1.3]. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu72.png?pub-status=live)
and note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu73.png?pub-status=live)
where
$H :=|T_{\boldsymbol {h},\boldsymbol {h}'}|$
. A very convenient case arises when these inclusions are equalities: in this event,
$\operatorname {Frob}_p$
acts trivially on the coinvariant space in (18) and the right-hand side becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu74.png?pub-status=live)
by Schur’s lemma (see [Reference Perret-Gentil17, Lemma 4.6, Proposition 4.8]), where
$\operatorname {mult}_1$
is the multiplicity of the trivial representation on a representation
$\rho $
. Finally, the multiplicities are zero if and only if,
$3|(\mu (\tau ) - \nu (\tau ))$
for all
$\tau \in T_{\boldsymbol {h},\boldsymbol {h}'}$
: this is precisely the content of [Reference Kowalski and Ricotta13, Prop. 4.5(2)], in the case
$N = 3$
(in the notation there,
$\operatorname {mult}_1\left (\operatorname {Std}^{\otimes \mu (\tau )} \otimes D(\operatorname {Std})^{\otimes \nu (\tau )}\right ) = A_{\nu (\tau ),\mu (\tau )}$
, for each
$\tau $
).
Therefore, it only remains to prove:
Lemma 3.4. The arithmetic and geometric monodromy groups of
$\mathcal {H}_{A,\boldsymbol {h},\psi }$
coincide and are isomorphic to
$\mathbb {Z}/p\times \operatorname {SL}_3(\mathbb {C})^H$
if
$\psi $
is nontrivial and
$\operatorname {SL}_3(\mathbb {C})^H$
otherwise, where
$H = |T_{\boldsymbol {h},\boldsymbol {h}'}|$
.
Proof. Let us first consider the case where
$\psi $
is trivial. By the Goursat–Kolchin–Ribet criterion [Reference Katz12, Section 1.8], since the pair
$(\operatorname {SL}_3(\mathbb {C}),\operatorname {Std})_{i={1,2}}$
is Goursat-adapted (in the language given there), it suffices to show that there exists no geometric isomorphism of the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu75.png?pub-status=live)
for a one-dimensional sheaf
$\mathcal {L}$
. Without loss of generality,
$h'=0$
. Let us assume by contradiction that
$h\neq 0$
. Since the left-hand side is ramified exactly at
$-h$
and
$\infty $
,
$\mathcal {L}$
must be ramified at
$0$
and
$-h$
(and possibly at
$\infty $
). It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu76.png?pub-status=live)
However, this contradicts Lemma 3.3(3), which states that the stalk at
$0$
of
$\mathcal {G}_A$
is a rank 2 pseudoreflection.
If
$\psi $
is nontrivial, let us write
$\mathcal {H}^+_{A,\boldsymbol {h}, \psi }=\mathcal {L}_\psi \oplus \mathcal {F}$
, where we may assume by the above that the arithmetic and geometric monodromy groups of
$\mathcal {F}$
coincide and are isomorphic to
$\operatorname {SL}_3(\mathbb {C})^H$
. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu77.png?pub-status=live)
and
$G_{\mathrm {geom}}$
surjects onto both
$\mathbb {F}_p$
and
$\operatorname {SL}_3(\mathbb {C})^H$
. The surjection onto
$\mathbb {F}_p$
implies that
$G_{\mathrm {geom}}$
has at least p connected components, of which the component at the identity contains
$\operatorname {SL}_3(\mathbb {C})^H$
. It follows that
$G_{\mathrm {geom}} = \mathbb {F}_p \times \operatorname {SL}_3(\mathbb {C})^H$
, as claimed.
This finishes altogether the proof of Theorem 3.1.
4 Correlations of
$K_2$
-sums to Prime Power Moduli: Stationary Phase Methods
In this section, we complement the results of the previous section, which applied to correlations of
$K_2$
sums to prime moduli, with a treatment of
$K_2$
sums to higher prime power moduli.
Before stating Theorem 4.1, we need a few elements of notation. Fix
$n \geq 2$
and
$p> 3$
. Let
$N,M \geq 0$
with
$K := N + M \geq 1$
and suppose
$\boldsymbol {h} \in \mathbb {Z}^N$
and
$\boldsymbol {h}' \in \mathbb {Z}^M$
. Similar to the previous section, given
$\tau \in \mathbb {Z}/p^n\mathbb {Z}$
we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu78.png?pub-status=live)
and we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu79.png?pub-status=live)
We will prove the following estimates.
Theorem 4.1. Let
$p> 3$
be prime and let
$n \geq 2$
. Let
$N,M \geq 0$
with
$N+M \geq 1$
and let
$\boldsymbol {h} \in \mathbb {Z}^N$
and
$\boldsymbol {h}' \in \mathbb {Z}^M$
. Let
$c \in \mathbb {Z}/p^n\mathbb {Z}$
,
$a \in (\mathbb {Z}/p^n\mathbb {Z})^{\times }$
and let
$\mu = \mu _{\boldsymbol {h}}$
,
$\nu = \nu _{\boldsymbol {h}'}$
and
$T = T_{\boldsymbol {h},\boldsymbol {h}'}$
be defined as above. Further, put
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu80.png?pub-status=live)
and if
$n> (N+M)^32^{N+M}$
, assume in addition that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu81.png?pub-status=live)
where
$|x|_p$
denotes the p-adic absolute value of
$x \in \mathbb {Q}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu82.png?pub-status=live)
unless either
-
(i)
$p \equiv 2 \pmod {3}$ ,
$c = 0$ and
$\mu (\tau ) = \nu (\tau )$ for all
$\tau \in T$ ,
-
(ii)
$p \equiv 1 \pmod {3}$ ,
$c = 0$ and
$3|(\mu (\tau )-\nu (\tau ))$ for all
$\tau \in T$ or
-
(iii)
$p \equiv 1 \pmod {3}$ ,
$p^{n-1}||c$ and
$3|(\mu (\tau )-\nu (\tau ))$ ; in this case, the bound is
$O_{N,M}(p^{(N+M+2)n/2-1/2})$ .
Remark 4.2. The condition
$3|(\mu (\tau )-\nu (\tau ))$
in (ii) of the above statement is the same condition that arose in connection with the trivial bound in Theorem 3.1. This condition, along with (i) and (iii), arises in this context for the following reason. Modulo prime powers
$p^n$
with
$n \geq 2$
, a complete sum
$K_2(a,b;p^n)$
may be explicitly evaluated as a sum over the set of critical points of a certain p-adic phase function. The correlations of the
$K_2$
sums therefore expand as a linear combination of exponential sums modulo
$p^n$
, each with a fixed frequency. The trivial bound cannot be improved whenever one of these frequencies is zero, and this occurs precisely in the degenerate cases listed in the statement of Theorem 4.1 (this is treated in Proposition 4.3).
The remainder of the section is devoted to proving this theorem.
4.1 Preparation
Fix
$a \in (\mathbb {Z}/p^n\mathbb {Z})^{\times }$
,
$c \in \mathbb {Z}/p^n\mathbb {Z}$
,
$\boldsymbol {h}\in \mathbb {Z}^N$
and
$\boldsymbol {h}' \in \mathbb {Z}^M$
and define
$\mu ,\nu $
and T as above. Set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu83.png?pub-status=live)
We can rewrite this expression as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu84.png?pub-status=live)
We deduce from Lemma 2.1 that unless
$4a^2(b+\tau ) \equiv 4a^2(d+\tau ) \in (\mathbb {Z}/p\mathbb {Z})^{\times 3}$
(i.e., the cube of a residue class prime to p) for all
$\tau \in T$
we get that
$\mathcal {S}_{p^n}(c,\mu ,\nu ;a,d) = 0$
. We will henceforth assume the condition
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu85.png?pub-status=live)
which, as T and a are fixed, depends only on d.
Now, depending on whether
$p \equiv 1 \pmod {3}$
or
$p \equiv 2 \pmod {3}$
, if d satisfies
$(\Diamond )$
, then there are either
-
• exactly 3 critical points, when
$p \equiv 1 \pmod {3}$ , or
-
• exactly one critical point, when
$p\equiv 2 \pmod {3}$ .
Letting
$u_0$
be a primitive cube root modulo
$p^{\left \lfloor n/2\right \rfloor }$
(by Hensel’s lemma, this is necessarily a lift of a primitive cube root modulo p), we may define a fixed branch of the cube root
$r \mapsto s(r)$
such that
$s(r)^3 \equiv r \pmod {p}$
whenever
$r \in (\mathbb {Z}/p\mathbb {Z})^{\times 3}$
and lift this branch to a branch of cube root modulo
$p^{\left \lfloor n/2\right \rfloor }$
as well; then, if
$x^3 \equiv r \pmod {p^{\left \lfloor n/2\right \rfloor }}$
, we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu86.png?pub-status=live)
setting
$d_p = 1$
if
$p \equiv 2 \pmod {3}$
and
$d_p = 3$
if
$p \equiv 1 \pmod {3}$
. In this way, we can write (in the notation of Lemma 2.1)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu87.png?pub-status=live)
Fix d satisfying
$(\Diamond )$
. For ease of notation, in the sequel we will write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu88.png?pub-status=live)
and study
$\mathcal {S}_{p^n}^{\ast }$
as d varies.
For each
$\tau \in T$
set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu89.png?pub-status=live)
as well as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu90.png?pub-status=live)
With these notations, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu91.png?pub-status=live)
For notational convenience, we simplify the above expression further as follows. Given
$\boldsymbol {\epsilon } = (\epsilon _{\tau })_{\tau \in T} \in (\mathbb {Z}/p^{n}\mathbb {Z})^{|T|}$
and
$b \in \mathbb {Z}/p^n\mathbb {Z}$
, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn19.png?pub-status=live)
Provided d satisfies
$(\Diamond )$
, we may thus write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu92.png?pub-status=live)
where we have set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu93.png?pub-status=live)
for each
$\boldsymbol {\epsilon } \in (\mathbb {Z}/p^n\mathbb {Z})^{|T|}$
. Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu94.png?pub-status=live)
and if
$p \equiv 2 \pmod {3}$
, then
$\phi (\boldsymbol {\epsilon }) = 1$
if
$\epsilon _{\tau } = \mu (\tau )-\nu (\tau )$
for all
$\tau \in T$
and 0 otherwise.
We now separate the
$\boldsymbol {\epsilon } = \boldsymbol {0}$
term from the remaining
$\boldsymbol {\epsilon }$
, so thatFootnote
8
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu95.png?pub-status=live)
4.2 The
$\boldsymbol {\epsilon } = \boldsymbol {0}$
Terms
The contribution to
$S_{p^n}(\boldsymbol {h},\boldsymbol {h}';c,a)$
from
$\boldsymbol {\epsilon } = \boldsymbol {0}$
can be estimated as follows.
Proposition 4.3. With the above notation, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu96.png?pub-status=live)
unless
$p^{n-1}|c$
and
$3|(\mu (\tau )-\nu (\tau ))$
for all
$\tau \in T$
. In this latter case, the following nontrivial bounds hold:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu97.png?pub-status=live)
To prove this result, we need several lemmas.
Lemma 4.4. Let
$p \equiv 1 \pmod {3}$
be prime and let
$n \geq 2$
and
$D \geq 1$
. Let
$\alpha _1,\alpha _2,\alpha _3 \in \mathbb {Z}$
with
$\max \{|\alpha _1|,|\alpha _2|,|\alpha _3|\} \leq D$
. Assume that
$p^{n/2}> 20D^3$
and let
$1 \leq u_0 \leq p^{\left \lfloor n/2 \right \rfloor }-1$
be a primitive cube root modulo
$p^{\left \lfloor n/2 \right \rfloor }$
. Then either
$\alpha _1 = \alpha _2 = \alpha _3$
or else
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu98.png?pub-status=live)
Proof. Set
$r := \left \lceil \frac {\log (20D^3)}{\log p}\right \rceil \leq n/2$
. Assume the claim is false, so that
$p^r|(\alpha _1+\alpha _2u_0 + \alpha _3 u_0^2)$
and
$\alpha _1,\alpha _2,\alpha _3$
are not all the same. As
$p \equiv 1 \pmod {3}$
and
$u_0$
is a primitive cube root, we must have
$u_0 \not \equiv 1 \pmod {p^{\left \lfloor n/2\right \rfloor }}$
. By assumption, at least one of
$\alpha _1,\alpha _2,\alpha _3$
does not vanish and up to multiplication by
$u_0^j$
for
$j \in \{0,1,2\}$
(which does not change the p-adic valuation), we may suppose
$\alpha _3$
does not. As
$u_0^3 \equiv 1 \pmod {p^r}$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu99.png?pub-status=live)
Now, on one hand this implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn20.png?pub-status=live)
On the other, taking cubes, we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu100.png?pub-status=live)
However, as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu101.png?pub-status=live)
it follows that
$(\alpha _1-\alpha _3)^3 = -(\alpha _2-\alpha _3)^3$
and therefore that
$\alpha _1-\alpha _3 = -(\alpha _2-\alpha _3)$
. Plugging this into the earlier congruence implies that either
$\alpha _1-\alpha _3 = \alpha _2-\alpha _3 = 0$
, or else
$u_0 \equiv 1 \pmod {p^r}$
. Since the
$\alpha _j$
are not all the same by assumption, the first of these is impossible. To see that the second fails as well, note that if
$u_0 \not \equiv 1 \pmod {p^{\left \lfloor n/2 \right \rfloor }}$
but
$u_0 = 1 +mp^r$
for some
$m \in \mathbb {Z}$
, then of course
$p^{\left \lfloor n/2 \right \rfloor -r} \nmid m$
. On the other hand, since
$u_0$
is a cube root of unity modulo
$p^{\left \lfloor n/2\right \rfloor }$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu102.png?pub-status=live)
which is only possible for
$p \neq 3$
if
$\nu _p(m) \geq \left \lfloor n/2 \right \rfloor - r$
, a contradiction. The claim follows.
Lemma 4.5. Let
$T \subseteq \mathbb {Z}/p^{n}\mathbb {Z}$
and suppose
$\phi (\boldsymbol {0}) \neq 0$
. Assume furthermore that
$p^n> 20(N+M)^3$
.
-
a) If
$p\equiv 2 \pmod {3}$ , then
$\mu (\tau ) = \nu (\tau )$ for all
$\tau \in T$ .
-
b) If
$p \equiv 1 \pmod {3}$ , then
$\mu (\tau ) \equiv \nu (\tau ) \pmod {3}$ for all
$\tau \in T$ .
Proof. In each case,
$\phi (\boldsymbol {0}) \neq 0$
if and only if there exist tuples
$\boldsymbol {j} \in \mathcal {U}$
,
$\boldsymbol {j}' \in \mathcal {V}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu103.png?pub-status=live)
a) When
$p \equiv 2 \pmod {3}$
, we may (trivially) take
$u_0 = 1$
and
$j_i(\tau ) = j^{\prime }_{i'}(\tau ) = 0$
for all
$i,i'$
and
$\tau $
, which leads immediately to the conclusion
$\mu (\tau ) = \nu (\tau )$
for all
$\tau \in T$
.
b) When
$p \equiv 1 \pmod {3}$
, we write the above expression as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu104.png?pub-status=live)
where
$m_{\tau },n_{\tau },p_{\tau }$
and
$m_{\tau }',n_{\tau }',p_{\tau }'$
are nonnegative integers satisying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu105.png?pub-status=live)
for all
$\tau \in T$
. By Lemma 4.4, it follows that
$m_{\tau } - m_{\tau }' = n_{\tau } - n_{\tau }' = p_{\tau } - p_{\tau }' = \ell $
, say. We conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu106.png?pub-status=live)
which implies the claim.
Lemma 4.6. Let
$p> 3$
be prime and let
$C \in \mathbb {Z}/p\mathbb {Z}$
. Let
$A \in (\mathbb {Z}/p\mathbb {Z})^{\times }$
and let
$\tilde {T} \subseteq \mathbb {Z}/p\mathbb {Z}$
.
-
a) If
$p \equiv 2 \pmod {3}$ , then
$$ \begin{align*}\sum_{\substack{d \pmod{p} \\ 4A^2(d+\tau) \in (\mathbb{Z}/p\mathbb{Z})^{\times 3} \\ \forall \tau \in \tilde{T}}} e_p(dC) = p1_{C \equiv 0 \pmod{p}} + O(|\tilde{T}|). \end{align*} $$
-
b) If
$p \equiv 1 \pmod {3}$ , then
$$ \begin{align*}\sum_{\substack{d \pmod{p} \\ 4A^2(d+\tau) \in (\mathbb{Z}/p\mathbb{Z})^{\times 3} \\ \forall \tau \in \tilde{T}}}e_p(dC) = 3^{-|\tilde{T}|}p1_{C \equiv 0 \pmod{p}} + O\left(|\tilde{T}|^2p^{1/2}\right). \end{align*} $$
Proof. a) When
$p \equiv 2 \pmod {3}$
every residue class modulo p is a cube. Thus, if d satisfies the condition in the sum on the left-hand side, then as
$p> 3$
this is equivalent to
$\prod _{\tau \in \tilde {T}} (d+\tau ) \in (\mathbb {Z}/p\mathbb {Z})^{\times }$
, which is satisfied for all but
$O(|\tilde {T}|)$
residue classes d modulo p. Thus, the sum in question is simply
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu109.png?pub-status=live)
as required.
b) Let
$\Xi _3(p) := \{\chi \pmod {p} : \chi ^3 = \chi _0\}$
, where
$\chi _0$
denotes the trivial multiplicative character modulo p. Since the set of multiplicative characters modulo p is a cyclic group of order
$p-1$
and
$3|(p-1)$
, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu110.png?pub-status=live)
for some fixed generator
$\chi _1$
for the group of characters mod p. We note that for any
$b \in \mathbb {Z}/p\mathbb {Z}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu111.png?pub-status=live)
and so the exponential sum in question is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn21.png?pub-status=live)
where we have written
$t(\boldsymbol {j}) := \sum _{\tau \in \tilde {T}} j_{\tau }$
.
When
$\boldsymbol {j} = \boldsymbol {0}$
we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn22.png?pub-status=live)
For
$\boldsymbol {j} \neq \boldsymbol {0}$
, we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu112.png?pub-status=live)
and what remains to be estimated is the expression
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu113.png?pub-status=live)
We interpret the latter sum as a sum over
$\mathbb {F}_p$
and estimate the sum using the language of
$\ell $
-adic trace functions, for an auxiliary prime
$\ell \neq p$
. For each
$\boldsymbol {j} \neq \boldsymbol {0}$
let
$\mathcal {K}_{\boldsymbol {j}}$
denote the Kummer sheaf attached to
$\xi \circ (g_{\boldsymbol {j}}/h_{\boldsymbol {j}})$
and let
$\mathcal {L}_C$
be the Artin–Schreier sheaf attached
$d \mapsto e_p(dC)$
. Then the sum we must estimate is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu114.png?pub-status=live)
where
$\mathcal {F} := \mathcal {K}_{\boldsymbol {j}} \otimes \mathcal {L}_C$
and
$U_{\boldsymbol {j}}(\mathbb {F}_p) := \{d \in \mathbb {F}_p : d \neq -\tau \ \forall \tau \in T\}$
. By Corollary 2.31 of [Reference Perret-Gentil17], this is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu115.png?pub-status=live)
When
$\boldsymbol {j} \neq \boldsymbol {0}$
, we claim that
$\mathcal {F}$
is not geometrically trivial; that is, that
$\mathcal {K}_{\boldsymbol {j}}$
and
$D(\mathcal {L}_{C})$
are not geometrically isomorphic. Indeed, on one hand, if
$C \neq 0$
, then
$\mathcal {L}_C$
(and thus
$D(\mathcal {L}_C)$
) has a lone wild ramification point at
$\infty $
(with
$\text {Swan}_{\infty }(\mathcal {L}_C) = 1$
), while in contrast
$\mathcal {K}_{\boldsymbol {j}}$
has only tame ramification points at the zeros of
$g_{\boldsymbol {j}}h_{\boldsymbol {j}}$
(and, in particular,
$\text {Swan}_{\infty }(\mathcal {K}_{\boldsymbol {j}}) = 0$
). If
$C = 0$
, then because
$g_{\boldsymbol {j}}(d)h_{\boldsymbol {j}}(d)$
has only distinct roots and is nonconstant, it is not the cube of a polynomial. Thus,
$\mathcal {K}_{\boldsymbol {j}}$
is ramified in at least one point and hence not geometrically trivial in this case as well. Finally,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu116.png?pub-status=live)
so that indeed
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu117.png?pub-status=live)
for all
$\boldsymbol {j} \neq \boldsymbol {0}$
. Inserting this and (22) into (21) and summing over
$\boldsymbol {j}$
, we reach the claim.
Proof of Proposition 4.3
Suppose
$\boldsymbol {\epsilon } = \boldsymbol {0}$
. Since
$f_{T,\boldsymbol {0}}(b) = cb$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu118.png?pub-status=live)
where
$c' = 0$
if
$p^{n-1} \nmid c$
and otherwise
$c \equiv c'p^{n-1} \pmod {p^{n}}$
. By Lemma 4.6, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu119.png?pub-status=live)
where
$\tilde {T} := \{\tau \pmod {p} : \tau \in T\}$
. As
$|\tilde {T}| \leq |T| \leq N+M$
, the above expression is thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu120.png?pub-status=live)
By Lemma 4.5, this gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu121.png?pub-status=live)
which implies the claim.
In the next two subsections, we treat the estimation of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu122.png?pub-status=live)
in two ways: first, we will prove an estimate that is efficient when n is large and subsequently a different estimate that is most efficient when n is not large (but p is).
4.3 Bounds for Large
$n$
The main result of this subsection is the following.
Proposition 4.7. Let
$p>3$
be prime. Assume that
$n \geq 2^{N+M}(N+M)^3$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu123.png?pub-status=live)
with
$\delta _1 := 2^{-N-M}$
, unless there are at least two distinct
$\tau ,\tau ' \in T$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu124.png?pub-status=live)
where we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu125.png?pub-status=live)
The above proposition will be proved using a method of Milićević and Zhang [Reference Milićević and Zhang15, Section 4], a consequence of which is the following proposition concerning exponential sums with argument function
$f_{T,\boldsymbol {\epsilon }}$
(see (19) for the definition).
Proposition 4.8. There exist constants
$\delta _i = \delta _i(|T|)> 0$
for
$i = 1,2,3$
and
$\rho = \rho (N,M,|T|)> 0$
such that the following holds.
For any positive integer
$n \geq 2$
such that
$p^{n/2}> 20(N+M)^3$
, any
$d \in \mathbb {Z}/p\mathbb {Z}$
and any nonzero
$\boldsymbol {\epsilon } \in (\mathbb {Z}/p^{n}\mathbb {Z})^{|T|}$
with
$\phi (\boldsymbol {\epsilon }) \neq 0$
, either
-
• the estimate
$$ \begin{align*} \sum_{b \in \mathbb{Z}/p^{n}\mathbb{Z} \atop b \equiv d \pmod{p}} e_{p^{n}}(f_{T,\boldsymbol{\epsilon}}(b)) \ll_{|T|} p^{(1-\delta_1)n} \end{align*} $$
-
• there are at least two distinct
$\tau ,\tau ' \in T$ such that
$\epsilon _{\tau },\epsilon _{\tau '} \not \equiv 0 \pmod {p^{n}}$ and
$$ \begin{align*} \tau \equiv \tau' \pmod{p^{\left\lfloor \delta_3(\left\lfloor \delta_2n\right\rfloor - \rho)\right\rfloor}}. \end{align*} $$
In particular, the values
$\delta _1 = \delta _2 = 2^{-|T|}$
,
$\delta _3 = \binom {|T|}{2}^{-1}$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu128.png?pub-status=live)
are admissible.
We need the following simple lemma about p-adic valuations of generalised binomial coefficients.
Lemma 4.9. Let
$p> 3$
. Then for any
$k \geq 1$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu129.png?pub-status=live)
Proof. Notice that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu130.png?pub-status=live)
and so as
$p> 3$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu131.png?pub-status=live)
Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu132.png?pub-status=live)
By Legendre’s formula for p-adic valuations of factorials, it suffices to show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu133.png?pub-status=live)
for each
$1 \leq j \leq k$
. To check this inequality, we observe first that if
$1 \leq l_0 \leq j$
is minimal such that
$p|(3l_0-2)$
and
$l> l_0$
also has this property then
$p|(l-l_0)$
. Clearly, by minimality we must have
$\nu _p(3l_0-2) = 1$
: if
$p \equiv 1 \pmod {3}$
then
$l_0$
satisfies
$p = 3l_0-2$
; if
$p \equiv 2 \pmod {3}$
then
$2p = 3l_0-2$
. In particular, if
$p> 3j/2-1$
, then
$l_0$
does not exist.
Consider next when
$p \leq 3j/2-1$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu134.png?pub-status=live)
where
$0 \leq a_r \leq p^r-1$
is a minimal representative of the residue class
$2\overline {3} \pmod {p^r}$
. We clearly have
$\left \lfloor (j-a_r)/p^r\right \rfloor \leq \left \lfloor j/p^r \right \rfloor $
, so that, summing over r, we obtain the desired bound.
The following further observations will be key. If
$b \in (\mathbb {Z}/p^n\mathbb {Z})^{\times }$
,
$\kappa \in \mathbb {N}$
and
$t \in \mathbb {Z}/p^n \mathbb {Z}$
, we note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu135.png?pub-status=live)
where the second equality is owed to the convergence in the p-adic topology of the power series
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn23.png?pub-status=live)
as long as
$|x|_p < 1$
. It follows from this that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn24.png?pub-status=live)
Analogously, we also define the ‘derivative’ functions
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu136.png?pub-status=live)
Proof of Proposition 4.8
We begin by noting that if
$|\{\tau \in T : \epsilon _{\tau } \not \equiv 0 \pmod {p^{n}}\}| \leq 1$
, then since
$\boldsymbol {\epsilon }$
is nonzero the p-adic stationary phase method (see, e.g., Lemma 1 (1) of [Reference Milićević and Zhang15]) implies that for some
$\tau _0 \in T$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu137.png?pub-status=live)
since the inner sum has at most a single summand. As
$N+M \geq 1$
this satisfies the first claim, so henceforth we may assume that
$|\{\tau \in T : \epsilon _{\tau } \not \equiv 0 \pmod {p^{n}}\}| \geq 2$
.
The second condition is now vacuously satisfied if
$0 < \delta _2n < 1$
, so we may assume that
$\delta _2 n \geq 1$
. We put
$X := \{b \pmod {p^{n}} : b \equiv d \pmod {p}\}$
, noting that this is
$p^{\left \lfloor \delta _2n \right \rfloor } \mathbb {Z}/p^{n}\mathbb {Z}$
-invariant. Putting
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu138.png?pub-status=live)
the proof of Proposition 8 of [Reference Milićević and Zhang15] shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn25.png?pub-status=live)
as long as (writing
$f_{T,\boldsymbol {\epsilon }}^{(0)} = f_{T,\boldsymbol {\epsilon }}$
) the relations
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu139.png?pub-status=live)
hold for
$0 \leq j \leq |T|-1$
; this is guaranteed by a calculation analogous to (24). The proof of Proposition 9 there shows that if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu140.png?pub-status=live)
then
$\mathcal {E}_T = \emptyset $
whenever
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu141.png?pub-status=live)
or, equivalently, whenever
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu142.png?pub-status=live)
Let us assume the latter condition. Then (25) yields the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu143.png?pub-status=live)
and it remains to check that the required constraints on the constants hold. As noted above the proof of Proposition 8 in [Reference Milićević and Zhang15], we may take
$\delta _1 = \delta _2 = 2^{-|T|}$
and
$\delta _3 = \binom {|T|}{2}^{-1}$
. Now, if
$p \equiv 2 \pmod {3}$
, then
$\epsilon _{\tau }$
can be identified with an integer in
$[-N,M]$
and we deduce that
$\nu _p(\epsilon _{\tau }) \leq \left \lceil \log (2(N+M))/\log p \right \rceil $
, which is acceptable. Thus, consider when
$p \equiv 1 \pmod {3}$
. We may then write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu144.png?pub-status=live)
and as
$\phi (\boldsymbol {\epsilon }) \neq 0$
such a representation exists with
$|\alpha _{\tau }|,|\beta _{\tau }|,|\gamma _{\tau }| \leq N+M$
for all
$\tau \in T$
. Since
$\boldsymbol {\epsilon }$
is nonzero we may find
$\tau ' \in T$
such that
$\epsilon _{\tau '} \not \equiv 0 \pmod {p^n}$
and therefore
$\alpha _{\tau '},\beta _{\tau '}$
and
$\gamma _{\tau '}$
are not the same. By Lemma 4.4 we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu145.png?pub-status=live)
Finally, by Lemma 4.9, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu146.png?pub-status=live)
We thus obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu147.png?pub-status=live)
The claim then follows by replacing
$\rho _0$
with its upper bound
$\rho $
in the second alternative of the proposition, which relaxes the condition there.
Proof of Proposition 4.7
Note that by the assumed lower bound for
$n$
, we must have
$p^{n=2} > 20(N +M)^3$
. We may partition the nonzero
$\boldsymbol {\epsilon }$
into the sets
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu148.png?pub-status=live)
Noting that
$|T| \leq N+M$
, we apply Proposition 4.8 to bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu149.png?pub-status=live)
On the other hand, if
$\mathcal {B}_T \neq \emptyset $
, then the second alternative of the proposition holds. This implies the claim.
4.4 Bounds for Small
$n$
and Large
$p$
The above estimates are useful for n sufficiently large in terms of
$N,M$
. In this subsection we provide an estimate which is more efficient for
$n \ll _{N,M} 1$
but with
$p \gg _{N,M} 1$
. As before, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu150.png?pub-status=live)
where
$T = T_{\boldsymbol {h},\boldsymbol {h}'}$
is as above. The estimate we prove in this case is as follows.
Proposition 4.10. Let
$\boldsymbol {\epsilon } \neq \boldsymbol {0}$
. Assume that
$n \leq (N+M)^32^{N+M}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu151.png?pub-status=live)
Remark 4.11. Note that the upper bound is trivially satisfied for
$p = O_{N,M}(1)$
, by choosing a suitable constant. We make no attempt to specify this dependence in the sequel, though this could be done in principle provided that one had an effective bound in the critical case
$s = \frac {1}{2}k(k+1)$
in Vinogradov’s mean value theorem (see Theorem 4.13). For some work in this direction for s slightly larger, see [Reference Steiner23].
In preparation for the proof of Proposition 4.10, note that from the identity (23) for
$|x|_p < 1$
, given
$b = d + pt$
with
$t \in \mathbb {Z}/p^{n-1}\mathbb {Z}$
we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu152.png?pub-status=live)
where we have put
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu153.png?pub-status=live)
Note that
$P_{\boldsymbol {\epsilon },d}(t)$
is a polynomial in t modulo
$p^{n-1}$
. To evaluate the exponential sum over b (and thus over
$t \pmod {p^{n-1}}$
), we will, roughly speaking, split the set of d according to the degree (modulo
$p^n$
) of
$P_{\boldsymbol {\epsilon },d}(t)$
and use bounds for Weyl sums of that degree. As we will not be able to extract cancellation when
$P_{\boldsymbol {\epsilon },d}$
has degree 0 or 1, we will need to check that the number of d (satisfying
$(\Diamond )$
) for which this happens is small. To this end, we need the following lemma, which is a modification of Proposition 4.8 of [Reference Ricotta and Royer20].
Lemma 4.12. Let
$w \in \mathbb {Z}/p\mathbb {Z}$
and
$\tilde {T} \subset \mathbb {Z}/p\mathbb {Z}$
. Let also
$\tilde {\boldsymbol {\epsilon }} \in (\mathbb {Z}/p\mathbb {Z})^{|\tilde {T}|} \backslash \{\boldsymbol {0}\}$
. Then for
$j = 1,2$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu154.png?pub-status=live)
is
$O_{|\tilde {T}|}(1)$
.
Proof. The proof when
$j = 2$
is completely similar to that of
$j = 1$
, so we focus only on the latter case.
As in the proof of Lemma 4.6, we translate the problem to
$\mathbb {F}_p$
, so that, for example,
$\tilde {T}$
is identified with a subset of
$\mathbb {F}_p$
. Put
$\mathbb {F} := \mathbb {F}_p$
if
$p \equiv 1 \pmod {3}$
and
$\mathbb {F} := \mathbb {F}_p[X]/(X^2+X+1)\mathbb {F}_p[X]$
when
$p \equiv 2 \pmod {3}$
. Define also
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu155.png?pub-status=live)
When
$p \equiv 1 \pmod {3}$
,
$N_{\tilde {T}}(w)$
is precisely the count on the left-hand side in the statement of the lemma; when
$p \equiv 2 \pmod {3}$
,
$N_{\tilde {T}}(w)$
is an upper bound for the desired quantity, since
$\mathbb {F}_p \subseteq \mathbb {F}$
. In what follows we let
$U_0$
denote a primitive cube root of unity in
$\mathbb {F}$
; naturally, this satisfies
$1+U_0 + U_0^2 = 0$
.
Let
$\boldsymbol {a} \in \mathbb {F}_p^{|\tilde {T}|}$
. Consider the product
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu156.png?pub-status=live)
which is a polynomial of total degree
$\leq 3^{|\tilde {T}|}$
in the variables
$(a_{\tau })_{\tau \in \tilde {T}} \in \mathbb {F}_p^{|\tilde {T}|}$
. Note that
$Q_w(\boldsymbol {a}) = Q_w((a_{\tau }U_0^{j_{\tau }})_{\tau \in \tilde {T}})$
for all
$\boldsymbol {j} \in \{-1,0,1\}^{|\tilde {T}|}$
. This implies that we can find a polynomial
$\tilde {Q}_w$
, defined over
$\mathbb {F}$
, such thatFootnote
9
$Q_w(\boldsymbol {a}) = \tilde {Q}_w((a_{\tau }^3)_{\tau \in \tilde {T}})$
. In particular, we can write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu157.png?pub-status=live)
where
$\{\tau _1,\ldots ,\tau _{|\tilde {T}|}\}$
is an enumeration of
$\tilde {T}$
. Now, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu158.png?pub-status=live)
which is a polynomial in Y of degree
$\leq |\tilde {T}|3^{|\tilde {T}|-1} \ll _{|\tilde {T}|} 1$
over
$\mathbb {F}$
. Every
$d \in \mathbb {F}$
counted by
$N_{\tilde {T}}(w)$
is a root of
$\tilde {R}_w(Y)$
over
$\mathbb {F}$
, since it is a root of
$Q_w((\epsilon _{\tau }s((2a)^{-1}(Y+\tau ))^{-1})_{\tau \in \tilde {T}})$
. It follows that, provided
$\tilde {R}_w(Y)$
is a nonzero polynomial, we get
$N_{\tilde {T}}(w) \ll _{|\tilde {T}|} 1$
as required. It therefore suffices to show that
$\tilde {R}_w(Y)$
is nonzero.
Assume first that
$w \neq 0$
. The leading coefficient (in Y) of
$R_w(Y)$
is
$b_{0,\ldots ,0}(w) = w^{3^{|\tilde {T}|}} \neq 0$
, so that
$\tilde {R}_w(Y)$
is necessarily nonzero in this case.
Suppose next that
$w = 0$
. Note that by hypothesis there is a
$\tau _1 \in \tilde {T}$
such that
$\tilde {\epsilon }_{\tau _1} \neq 0$
. Setting
$Y = -\tau _1$
and expanding the product we see that only the term with
$r_1 = 3^{|\tilde {T}|-1}$
(and
$r_j = 0$
for
$j \neq 1$
) survives, arising as the monomial in
$a_{\tau _1}^{3^{|\tilde {T}|}}$
in
$Q_0(\boldsymbol {a})$
. Explicitly, this term has coefficient
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu159.png?pub-status=live)
It follows that
$b_{3^{|\tilde {T}|-1},0,\ldots ,0} = -(2a\tilde {\epsilon }_{\tau _1}^3)^{3^{|\tilde {T}|-1}}$
and thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu160.png?pub-status=live)
The claim thus follows when
$w \neq 0$
as well.
For larger degree polynomials we need bounds for Weyl sums. In contrast to the work in [Reference Ricotta and Royer20], where Weyl differencing is used to obtain cancellation, we will instead apply Vinogradov’s method in order to obtain a stronger Weyl sum estimate. For this, we recall the Vinogradov main conjecture, proved in the groundbreaking work of Bourgain, Demeter and Guth [Reference Bourgain, Demeter and Guth2] (and independently in the work of Wooley [Reference Wooley25]).
Theorem 4.13. Theorem 1.1 of [Reference Bourgain, Demeter and Guth2]
Let
$k \geq 1$
,
$P \geq 1$
. Given
$\boldsymbol {x} \in [0,1]^k$
, put
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu161.png?pub-status=live)
Furthermore, for
$s \in \mathbb {N}$
define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu162.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu163.png?pub-status=live)
Proof of Proposition 4.10
Recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu164.png?pub-status=live)
We wish to estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu165.png?pub-status=live)
Let
$R \geq 1$
,
$N:= \frac {1}{2}p^{n-1}$
. Also, put
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu166.png?pub-status=live)
where we have defined
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu167.png?pub-status=live)
We define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu168.png?pub-status=live)
Set
$\ell := n(n-1)/2$
. We invoke Vinogradov’s method, as exposed in Subsection 8.5 of [Reference Iwaniec and Kowalski10]. Given
$\alpha \in \mathbb {R}$
and
$Y \geq 1$
, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu169.png?pub-status=live)
Now, for each
$|t| \leq \frac {1}{2}p^{n-1}$
, we obtain (cf. [Reference Iwaniec and Kowalski10, equation (8.76)])
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn26.png?pub-status=live)
where we have written
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu170.png?pub-status=live)
Our goal is to extract savings over the trivial bound
$\Delta (t) \ll 1$
. To this end, we consider
$D(\alpha ,Y)$
for
$\alpha $
a p-adic rational. Put
$\alpha = a/p^s$
, for
$(a,p) = 1$
and
$s \geq 1$
. We obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu171.png?pub-status=live)
in this case. We specialise
$Y = \ell R^h$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu172.png?pub-status=live)
where
$\theta _h = \theta _h(\boldsymbol {\epsilon },d,t) := \nu _p(A_h(\boldsymbol {\epsilon },d,t))$
and
$p \nmid \tilde {A}_h$
, for each
$1 \leq h \leq n-1$
. Note that
$\theta _h(\boldsymbol {\epsilon },d,t) \geq h$
, with equality if and only if we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu173.png?pub-status=live)
this condition being independent of t.
For
$\boldsymbol {\epsilon },d$
and t fixed, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu174.png?pub-status=live)
if this maximum is defined, and let
$\mathfrak {D}(\boldsymbol {\epsilon },d,t) = 0$
otherwise. If
$\mathfrak {D} \geq 1$
, then we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu175.png?pub-status=live)
Suppose now that
$\mathfrak {D} \geq 2$
. Applying Theorem 4.13, we obtain from (26) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu176.png?pub-status=live)
recalling that
$2\ell = n(n-1)$
. Taking
$R = (N/\sqrt {p})^{1/2} \asymp p^{n/2-3/4}$
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu177.png?pub-status=live)
In this way, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu178.png?pub-status=live)
It remains to treat the contribution from pairs
$(t,d)$
for which
$\mathcal {D}(\boldsymbol {\epsilon },d,t) \in \{0,1\}$
. By construction, if
$\mathcal {D}(\boldsymbol {\epsilon },d,t) = 0$
, then
$\theta _1(\boldsymbol {\epsilon },d,t) \geq n> 1$
. Similarly, if
$\mathcal {D}(\boldsymbol {\epsilon },d,t) = 1$
and
$n \geq 3$
, then
$\theta _2(d,t) \geq n> 2$
. In either of these cases, provided p is large enough in terms of n, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu179.png?pub-status=live)
Applying Lemma 4.12, we find that for each
$t \pmod {p^{n-1}}$
the number of d satisfying
$(\Diamond )$
such that this latter congruence holds is
$\ll _{N,M} 1$
. Since
$n \ll _{N,M} 1$
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu180.png?pub-status=live)
It remains to consider those d for which
$\mathcal {D}(\boldsymbol {\epsilon },d,t) = 1$
and
$n = 2$
. In this case, we know that
$p^2 \nmid A_1(\boldsymbol {\epsilon },d,t)$
and, moreover, that
$A_1(\boldsymbol {\epsilon },d,t) = a_1(\boldsymbol {\epsilon },d)$
; that is,
$A_1(\boldsymbol {\epsilon },d,t)$
is independent of t. The sum we wish to bound is therefore
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu181.png?pub-status=live)
so the bound required is satisfied in this case as well.
5 Applying the
$K_2$
Correlations Bounds: Proof of Propositon 2.4
In this section we will prove Proposition 2.4. Suppose
$Q \geq 2$
factors as
$Q = Q_0 \cdots Q_L$
, where the
$Q_i$
are mutually coprime. Let
$p^{\nu }||Q_0$
with
$\nu \geq 1$
and
$p> 3$
prime. Let
$C \in \mathbb {Z}/p^{\nu }\mathbb {Z}$
and
$\boldsymbol {h} \in \mathbb {Z}^L$
and define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu182.png?pub-status=live)
where for each
$I \subseteq \{1,\ldots ,L\}$
we set
$H_I := \sum _{i \in I} Q_ih_i$
. Writing N to denote the number of subsets of
$\{1,\ldots ,L\}$
of even cardinality and M the number of subsets with odd cardinality, the total number of
$K_2$
factors in the sum is clearly
$N + M = 2^L$
.
Define now
$T_{\boldsymbol {h}} := \{H_I : I \subseteq \{1,\ldots ,L\}\}$
, as well as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu183.png?pub-status=live)
Further, define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu184.png?pub-status=live)
The following lemma, which is analogous to [Reference Irving9, Lemma 4.5], allows us to control how frequently either
$\boldsymbol {h} \in \mathcal {T}_{p^{\nu }}$
or
$\mu _{\boldsymbol {h}}(\tau ) \equiv \nu _{\boldsymbol {h}}(\tau ) \pmod {3}$
.
Lemma 5.1. Let
$p> 3$
,
$p\mid Q_0$
and let
$\boldsymbol {h} \in \mathbb {Z}^{L}$
. If
$\mu _{\boldsymbol {h}}(\tau ) \equiv \nu _{\boldsymbol {h}}(\tau ) \pmod {3}$
for all
$\tau \in T_{\boldsymbol {h}}$
, then there is
$1 \leq i \leq L$
such that
$p|h_i$
. In particular, if
$\boldsymbol {h} \in \mathcal {T}_{p^{\nu }}$
then
$p\mid \prod _{1 \leq i\leq L} h_i$
.
Proof. If
$\boldsymbol {h} \in \mathcal {T}_{p^{\nu }}$
, then by definition
$\mu _{\boldsymbol {h}}(\tau ) \equiv \nu _{\boldsymbol {h}}(\tau ) \pmod {3}$
for all
$\tau \in T$
and the second assertion immediately follows from the first. Thus, it suffices to prove that
$p|\prod _{1 \leq i \leq L} h_i$
whenever
$3|(\mu _{\boldsymbol {h}}(\tau )-\nu _{\boldsymbol {h}}(\tau ))$
for all
$\tau \in T$
.
We denote
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu185.png?pub-status=live)
Let
$\Phi _p(z) := \sum _{0 \leq j \leq p-1} z^j = \prod _{a \in (\mathbb {Z}/p\mathbb {Z})^{\times }} (z-e_p(a))$
the cyclotomic polynomial of order p. Assume for the sake of contradiction that
$p \nmid h_i \forall i$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu186.png?pub-status=live)
using the fact
$(Q_i,Q_0) = 1$
and thus that
$p \nmid a h_iQ_i $
whenever
$p \nmid a $
, for all
$1 \leq i \leq L$
.
On the other hand, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu187.png?pub-status=live)
and since
$3|(\mu _{\boldsymbol {h}}(\tau )-\nu _{\boldsymbol {h}}(\tau ))$
for each
$\tau \in T$
, we can find
$m_{\tau } \in \mathbb {Z}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu188.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu189.png?pub-status=live)
Note that the bracketed sum over
$\tau \in T$
on the right-hand side is an algebraic integer in
$\mathbb {Q}(e_p(1))$
, so its norm is a rational integer. This implies that
$3 \mid p^L$
, which is false since
$p> 3$
. This contradiction implies that there must be an i for which
$p \mid h_i$
, as claimed.
Using Lemma 5.1, we can finally give the following bounds on the correlation sums
$M_{p^{\nu }}(C,\boldsymbol {h})$
.
Proposition 5.2. Let
$L \geq 2$
. Fix parameters
$Y = Y(L) = 2^{3L+5}$
and
$Z = Z(L) = 2^{3L}2^{2^L}$
. Let
$p^{\nu } || Q_0$
and let
$C \in \mathbb {Z}/p^{\nu } \mathbb {Z}$
. Assume additionally that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn27.png?pub-status=live)
where
$r(\nu ) := 2^{1-2L}\left \lfloor \nu 2^{-2^L}\right \rfloor - 1$
. Then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu190.png?pub-status=live)
Proof. Write
$Q_0 = \mathfrak {q}_1\mathfrak {q}_2\mathfrak {q}_3\mathfrak {q}_4\mathfrak {q}_5$
, where the
$\mathfrak {q}_j$
satisfy
$(\mathfrak {q}_i,\mathfrak {q}_j) = 1$
for
$i \neq j$
, according to the following rules:
-
(i)
$p||Q_0 \Rightarrow p|\mathfrak {q}_1$ .
-
(ii)
$p^{\nu } || Q_0, p> Y$ and
$\nu> Z \Rightarrow p^{\nu }|\mathfrak {q}_2$ .
-
(iii)
$p^{\nu } || Q_0, p \leq Y$ and
$\nu> Z \Rightarrow p^{\nu } | \mathfrak {q}_3$ .
-
(iv)
$p^{\nu } || Q_0, p> Y$ and
$\nu \leq Z \Rightarrow p^{\nu }|\mathfrak {q}_4$ .
-
(v)
$\mathfrak {q}_5 = Q_0/(\mathfrak {q}_1\mathfrak {q}_2\mathfrak {q}_3\mathfrak {q}_4)$ .
We summarise (in an effective form) the bounds that the previous sections imply for each prime power divisor of
$Q_0$
, according to which of the
$\mathfrak {q}_i$
they divide.
(I) If
$p| \mathfrak {q}_1$
, Theorem 3.1 yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn28.png?pub-status=live)
By Lemma 5.1, if
$\boldsymbol {h} \in \mathcal {T}_p$
, then
$p|\prod _i h_i$
, so we may conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn29.png?pub-status=live)
which implies the bound in the first case.
(II) Suppose
$p^{\nu }||\mathfrak {q}_2$
and
$p^{\nu -1} \nmid C$
then as
$|T| \leq 2^L$
. With a view towards applying Theorem 4.1, recall the definition
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu191.png?pub-status=live)
Since
$p> 2^{3L+5}$
, we have
$\rho = 1$
and so
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu192.png?pub-status=live)
In light of (27), Theorem 4.1 yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu193.png?pub-status=live)
If, in addition
$p^{\nu -1}|C$
, then Lemma 5.1 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn30.png?pub-status=live)
and the bound in the second case is proved.
(III) Suppose
$p^{\nu } || \mathfrak {q}_3$
; then
$3 < p \leq 2^{3L+5}$
. We thus have the uniform bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu194.png?pub-status=live)
As in case (II), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn31.png?pub-status=live)
where we used the fact that since Z is chosen suitably,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu195.png?pub-status=live)
whenever
$L \geq 2$
.
(IV) If
$p^{\nu }||\mathfrak {q}_4$
, then, again by Theorem 4.1,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn32.png?pub-status=live)
as required.
(V) For all of the primes powers
$p^{\nu }||\mathfrak {q}_5$
the bound given is trivial.
The following simple lemma allows us to bound the number of tuples
$\boldsymbol {h}$
where (27) fails.
Lemma 5.3. Let
$c \in (0,2^{-2^L}]$
and let
$d|Q_0$
. Assume that
$K/Q_j \geq Q_0^{2c}$
for all
$1 \leq j \leq L$
. Then the number of tuples
$\boldsymbol {h} \in \mathbb {Z}^L$
with
$1 \leq |h_j| \leq K/Q_j$
for all j, such that for each
$p^{\nu }||d$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu196.png?pub-status=live)
is
$\ll 2^{L} \tau (d)^{2L-1} d^{-c}K^L/(Q_1\cdots Q_L)$
.
Proof. Write
$d = \prod _{1 \leq i \leq m} p_i^{\nu _i}$
, so that
$m = \omega (d)$
. For each
$1 \leq i \leq m$
, choose a pair of disjoint subsets
$I_i,J_i \subseteq \{1,\ldots ,L\}$
, such that
$I_i\cup J_i \neq \emptyset $
. We may define a matrix
$A_{\boldsymbol {I},\boldsymbol {J}} = \{a_{i,j}\}_{i,j}$
with integer entries via
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu197.png?pub-status=live)
By composing
$A_{\boldsymbol {I},\boldsymbol {J}}$
with projections, we may view it as a homomorphism
$A_{\boldsymbol {I},\boldsymbol {J}}: \mathbb {Z}^L \rightarrow \prod _{1 \leq i \leq m} (\mathbb {Z}/p_i^{\lceil c\nu _i \rceil }\mathbb {Z})$
, such that for each
$1\leq i \leq m$
the ith entry of
$A_{\boldsymbol {I},\boldsymbol {J}}\boldsymbol {h}$
is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu198.png?pub-status=live)
whenever
$\boldsymbol {h} \in \mathbb {Z}^L$
. Note that
$\text {ker}(A_{\boldsymbol {I},\boldsymbol {J}})$
is a lattice in
$\mathbb {Z}^L$
with covolume
$\tilde {d} := \prod _{1 \leq i \leq m} p_i^{\lceil c\nu _i\rceil } \geq d^c$
and trivially
$A_{\boldsymbol {I},\boldsymbol {J}}$
is injective on the quotient
$\mathbb {Z}^L/\text {ker}(A_{\boldsymbol {I},\boldsymbol {J}})$
, with the unique reduced zero class being
$\boldsymbol {0}$
. By lattice periodicity (and
$\tilde {d}\leq Q_0^{2c} \leq K/Q_j$
for each j), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn33.png?pub-status=live)
Given these remarks, we may prove the lemma as follows. Let
$\mathcal {H}_d$
be the set of tuples
$\boldsymbol {h}$
described in the statement of the lemma. Given
$\boldsymbol {h} \in \mathcal {H}_d$
, for each prime
$p^{\nu }||d$
there are distinct subsets
$I_p = I_p(\boldsymbol {h})$
,
$J_p = J_p(\boldsymbol {h})$
of
$\{1,\ldots ,L\}$
such that
$|H_{I_p}-H_{J_p}|_p \leq p^{-\lceil c\nu \rceil }$
. Now, put
$I_p' := I_p \backslash (I_p \cap J_p)$
and
$J_p' := J_p \backslash (I_p \cap J_p)$
, so that
$I_p' \cup J_p' \neq \emptyset $
,
$I_p'$
and
$J_p'$
are disjoint and, moreover,
$H_{I_p}-H_{J_p} = H_{I_p'}-H_{J_p'}$
. We thus have, for each
$p^{\nu }||d$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu199.png?pub-status=live)
By the previous definitions, it follows that
$\boldsymbol {h} \in \text {ker}(A_{\{I_p'\}_p,\{J_p'\}_p})$
. Hence, we obtain the upper bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu200.png?pub-status=live)
The number of pairs of tuples of sets
$\boldsymbol {I},\boldsymbol {J}$
is
$\leq \binom {2^L}{2}^m \leq 2^{(2L-1)\omega (d)} \leq \tau (d)^{2L-1}$
, so by (33) we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu201.png?pub-status=live)
as claimed.
Proof of Proposition 2.4
i) Assume
$Q_0,\ldots ,Q_L$
are all coprime and squarefree. Case (I) of Proposition 5.2 gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu202.png?pub-status=live)
for each
$p\mid Q_0$
. Combining this with Lemma 2.5, we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu203.png?pub-status=live)
using
$|J(\boldsymbol {h})| \leq K$
and the obvious inequality
$(d,\prod _i h_i) \leq (Q_0, \prod _i h_i)$
for any
$d|Q_0$
. Employing
$(Q_0,\prod _i h_i)^{1/2} \leq \prod _i (Q_0,h_i)^{1/2}$
and summing in
$h_1,\ldots ,h_L$
yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu204.png?pub-status=live)
using
$Q/Q_0 = Q_1\cdots Q_L$
in the last line. This implies i).
ii) As above, we would like to estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu205.png?pub-status=live)
Here, we are assuming that
$(Q_0,6) = 1$
. We factor
$Q_0 = \mathfrak {q}_1\mathfrak {q}_2\mathfrak {q}_3\mathfrak {q}_4\mathfrak {q}_5$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu206.png?pub-status=live)
By construction,
$\mathfrak {q}_5 \ll _L 1$
, so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu207.png?pub-status=live)
We focus next on the prime power divisors of
$Q_0' := Q_0/\mathfrak {q}_5$
. As above, define
$r(\nu ) := \left \lfloor 2^{1-2L}\left \lfloor \nu 2^{-2^L-2L}\right \rfloor \right \rfloor $
. For each
$1 \leq i \leq 4$
and each
$p^{\nu }||\mathfrak {q}_i$
, we write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu208.png?pub-status=live)
where we have defined
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu209.png?pub-status=live)
as well as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu210.png?pub-status=live)
Note that
$M_{p^{\nu },1}$
depends only on
$(C,Q_0') = \prod _{1 \leq i \leq 4} (C,\mathfrak {q}_i)$
. We factor
$C= C'd$
and
$d = d_1d_2d_3d_4d_5$
, where
$d_j = (C,\mathfrak {q}_j)$
, for each
$1 \leq j \leq 5$
and get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn34.png?pub-status=live)
where the summation symbol
$\sideset {}{^{\star }}\sum _{uvw = x}$
indicates that
$(u,v) = (v,w) = (w,u) = 1$
(and, analogously,
$\sideset {}{^{\star }}\sum _{uv = x}$
indicates that
$(u,v) = 1$
), so that if
$p|u$
, say, then
$\nu _p(u) = \nu _p(x)$
.
By dropping the constraint on
$e_1,e_2,e_3,e_4$
, the innermost sum over the tuples
$\boldsymbol {h}$
can be bounded above by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu211.png?pub-status=live)
If we define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu212.png?pub-status=live)
then by applying Lemma 5.3 with
$c = \delta '$
and
$d = g_2g_3$
(which is a divisor of
$Q_0$
) and using the crude bound
$\tau (d)^{2L-1} \ll _{\varepsilon ,L} d^{\varepsilon }$
we may bound this cardinality by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu213.png?pub-status=live)
Inserting this into our earlier upper bound for
$\mathcal {T}$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu214.png?pub-status=live)
We parametrise
$d = e_1d_2d_3d_4d_5$
with
$d_j = e_jD_j$
, where
$D_j|\text {rad}(e_j)$
, for each
$2 \leq j \leq 4$
. Using
$\delta ' \leq 2^{-2^L}$
and
$\delta ' \leq Z^{-5}$
, we find
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu215.png?pub-status=live)
If we bound the sum over
$C'$
trivially, we obtain
$\ll \frac {\log Q_0}{e_1e_2e_3e_4D_2D_3D_4}$
, which finally leads to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu216.png?pub-status=live)
again using
$\mathfrak {q}_5 \ll _L 1$
and
$Q_0 = \mathfrak {q}_1 \mathfrak {q}_2\mathfrak {q}_3\mathfrak {q}_4 \mathfrak {q}_5$
. This proves claim ii).
6 Proof of Theorems 1.1 and 1.5
This section is devoted to the proofs of Theorems 1.1 and 1.5.
Let
$\varepsilon> 0$
be sufficiently small and let
$0 < \eta < 1/522$
. Let X be sufficiently large in terms of
$\varepsilon $
and let
$X^{2/3-\varepsilon } < q \leq X^{3/4+1/1044-\varepsilon }$
be
$X^{\eta }$
-smooth. We wish to show that there is a
$\delta = \delta (\varepsilon ,\eta )> 0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu217.png?pub-status=live)
for any residue class
$a \pmod {q}$
with
$(a,q) \leq X^{\varepsilon }$
, with further size constraints on q depending on whether or not q is squarefree.
Replacing
$X,q$
and a by
$X/(a,q)$
,
$q/(q,a)$
and
$a/(a,q)$
if necessary, we may reduce our problem to the case in which a is coprime to q: indeed,
$q/(q,a)$
is still
$X^{\eta }$
-smooth and as
$(a,q) \leq X^{\varepsilon }$
the bound above is implied by the case
$(a,q) = 1$
(upon taking
$\delta $
slightly smaller). In what follows, we will focus solely on when the residue class a is coprime to q.
We begin by summarising the analysis in Section 2, which is valid when
$(a,q) = 1$
. Let
$\delta> 0$
be fixed, to be selected later. We fixed a scale
$V_0 \geq X^{\delta +\varepsilon }$
and found a second scale
$\max \{X^{1-\delta -\varepsilon }/(qV_0),V_0\} \leq V_1 \ll X^{1/2}$
and an interval
$I(V_1) = (V_1,V_1 + V_1/V_0]$
such that (see (12))
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn35.png?pub-status=live)
for any divisor
$\tilde {q}$
of q and any
$Z \geq 1$
. We recall here that, given
$Q \geq 1$
and
$K\geq 1$
, we have set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu218.png?pub-status=live)
for each
$M \geq 1$
and
$N \in \mathbb {Z}$
coprime to Q.
To proceed, we need to be able to choose
$\tilde {q}$
of suitable size in order to obtain the desired
$O_{\varepsilon }(X^{1-\delta }/q)$
bound. The following lemma will be useful in this vein, especially in order to apply the results of the last few sections.
Lemma 6.1. Let
$\eta> 0$
and suppose
$X \geq 3$
is large enough relative to
$\eta $
. Let
$q \in \mathbb {N}$
be
$X^{\eta }$
-smooth.
-
a) If
$0 < v < 1$ , then there is a divisor
$q'$ of q such that
$q' \in (q^v,X^{\eta }q^v]$ .
-
b) Assume furthermore that
$q \in (X,2X]$ is
$X^{\eta }$ -ultrasmooth. Let
$k \geq 4$ and let
$u_1,\ldots ,u_k \in (\eta ,1-\eta )$ with
$u_1 + \cdots + u_k = 1$ . Then we can find
$q_1,\ldots ,q_k$ , mutually coprime with
$(q_k,6) = 1$ , such that
$q_1 \in (X^{u_1},X^{u_1+\eta }2^{\nu _2(q)}3^{\nu _3(q)}]$ ,
$q_2 \in (X^{u_2},X^{u_2+\eta }]$ ,
$q_j \in (X^{u_j},X^{u_j+\eta }]$ for each
$3 \leq j \leq k-1$ and
$q_k \in (X^{u_k-(k-1)\eta }2^{-\nu _2(q)}3^{-\nu _3(q)},2X^{u_k}]$ such that
$q = q_1\cdots q_k$ .
Proof. a) Enumerate the prime factors of q in ascending order as
$p_1 \leq p_2 \leq \cdots \leq p_{\omega (q)}$
. Let r be chosen maximally such that
$p_1\cdots p_r \leq q^v$
. Then
$q' := p_1\cdots p_rp_{r+1}> q^v$
by maximality and, moreover,
$q' \leq q^v p_{r+1} \leq q^vX^{\eta }$
. This establishes the first claim.
b) Arguing similarly as in a), order the prime power factors of q as
$p_1^{\alpha _1} < \cdots < p_{\omega (q)}^{\alpha _{\omega (q)}} \leq X^{\eta }$
. Pick
$1 \leq N_1 \leq N$
to be the minimal integer such that
$\prod _{1 \leq j \leq N_1} p_j^{\alpha _j}> X^{u_1}$
and set
$q_1 := \prod _{1 \leq j \leq N_1} p_j^{\alpha _j}$
. By minimality,
$q_1/p_{N_1}^{\alpha _{N_1}} \leq X^{u_1}$
, whence
$q_1 \in (X^{u_1} , X^{u_1+\eta }]$
.
We set
$X' := X/q_1 \in [X^{1-u_1-\eta },X^{1-u_1})$
and
$q' := q/q_1$
. As
$u_2> 0$
,
$N_1 < N$
. We then select
$N_1 < N_2 \leq N$
such that
$q_2 := \prod _{N_1 < j \leq N_2} p_j^{\alpha _j}> X^{u_2}$
, so that
$q_2 \in (X^{u_2},X^{u_2+\eta }]$
.
Repeating this process
$k-1$
times, we obtain integers
$q_1,\ldots ,q_{k-1}$
such that
$q_j \in (X^{u_j},X^{u_{j}+\eta }]$
. We replace
$q_1$
by
$q_12^{\nu _2(q)}3^{\nu _3(q)}$
if the powers of 2 and 3 dividing q are not already divisors of
$q_1,\ldots ,q_{k-1}$
. The factors
$q_j$
are mutually coprime by construction. Putting
$q_k := q/(q_1\cdots q_{k-1})$
, the above construction and
$q \in (X,2X]$
forces
$(q_k,6) = 1$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu219.png?pub-status=live)
which implies the claim since
$u_k = 1-u_1-\ldots - u_{k-1}$
by definition.
6.1 First Result:
$q \leq X^{3/4-\varepsilon }$
We begin by considering the easier range
$X^{2/3-\varepsilon } < q \leq X^{3/4-\varepsilon }$
, in which we need not assume that q is squarefree. Let
$\eta /12 \leq \delta < 1/50$
. By Lemma 6.1 a), we can choose a divisor
$\tilde {q}$
of q with
$\tilde {q} \in (X^{1/2 + 12\delta }, X^{1/2+12\delta +\eta }]$
. Take
$V_0 = K = X^{\delta +\varepsilon }$
and
$Z= X^{10\delta }$
. Using Lemma 2.2, we can bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu220.png?pub-status=live)
From (35) and the above parameter choices, as well as the lower bound
$V_1 \geq X^{1-\delta -\varepsilon }/(qV_0) \geq X^{1/4-2\delta -3\varepsilon }$
that we may assume (see (4) above), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu221.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu221.png?pub-status=live)
using the fact that
$\eta \leq 12\delta $
in the last line. This implies the claim for
$q \leq X^{3/4-\varepsilon }$
.
Remark 6.2. The above proof shows that we can obtain power-savings in the range
$q \leq X^{3/4-\varepsilon }$
for q that are
$X^{\eta }$
-smooth with any
$\eta < 6/25$
, since in this case the choice
$\delta = \eta /12$
is admissible.
6.2 Squarefree
$X^{3/4-\varepsilon } < q \leq X^{3/4+1/1044-\varepsilon }$
In this range of the modulus q we will invoke Propositions 2.3 and 2.4 i), and to this end we need a suitable divisor
$\tilde {q}$
of q as well as a suitable factorisation for
$\tilde {q}$
. We begin this subsection by outlining the parameter choices needed to this end.
Let
$L \geq 2$
. Fix
$0 < \delta < 1/10$
to be chosen later and let
$\theta := 3/4+\lambda $
, where
$\eta /2 < \lambda < \min \{1/20,1/(2L)\}$
. We will determine constraints on
$\lambda $
momentarily, from which we will conclude that any
$\lambda < 1/1044$
will be admissible.
Set
$\gamma := 2\delta +\lambda + \varepsilon $
for
$\varepsilon> 0$
small and put
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu222.png?pub-status=live)
assuming that
$\gamma $
and L are chosen so that this is
$< 1/4+\lambda $
. Also, put
$K := \left \lfloor X^{\sigma /2-\lambda }\right \rfloor $
. Suppose that
$q \in (X^{\theta },2X^{\theta }]$
is squarefree and
$X^{\eta }$
-smooth. As
$\sigma < 1/4 + \lambda $
, by Lemma 6.1 a) we may choose
$\tilde {q} \in (X^{1/2 + \sigma },X^{1/2+\sigma +\eta }]$
.
Of course,
$\tilde {q}$
is also
$X^{\eta }$
-smooth. Applying Lemma 6.1 b), we can find a factorisation
$\tilde {q} = \tilde {q}_0 \tilde {q}_1\cdots \tilde {q}_L$
, such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu223.png?pub-status=live)
This is indeed possible since
$\tilde {q} \in (X^{1/2+\sigma },X^{1/2+\sigma +\eta }]$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu224.png?pub-status=live)
Note that, by construction, we have
$K \geq \max \{\tilde {q}_1,\ldots ,\tilde {q}_L\}$
and, moreover,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn36.png?pub-status=live)
In addition, since
$\gamma \leq \sigma /2$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn37.png?pub-status=live)
Next, select
$V_0 = X^{\delta +\varepsilon }$
and
$Z = X^{\frac {2}{3}(\sigma /2+4\delta +2\lambda -2\varepsilon )}$
, which satisfies
$Z \leq \tilde {q}/K$
. We apply all of these parameter choices in (35), as well as the inequalities
-
(i)
$\eta /2 < \lambda < 1/20$ and
$\delta < 1/10$ ,
-
(ii)
$X^{1-\delta }/q \geq \frac {1}{2}X^{1/4-\delta -\lambda }$ ,
-
(iii)
$\sigma> 10\gamma > 10(\delta +\lambda )$ and
-
(iv)
$X^{1-\delta -\varepsilon }/(qV_0) \leq V_1 \ll X^{1/2}$ ,
to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqn38.png?pub-status=live)
provided that
$\varepsilon> 0$
is sufficiently small.
Fix
$f_0 \mid \tilde {q}$
with
$f_0 \leq Z$
that maximises the sum over f in (35) and let
$q' := \tilde {q}/f_0$
. We can factor
$q' = q_0' \cdots q_L'$
as in Proposition 2.3 by writing
$\tilde {q} = \tilde {q}_0\cdots \tilde {q}_L$
and setting
$q_j' := \tilde {q}_j/(\tilde {q}_j,f_0)$
, for each j. Putting
$Q = q'$
and recalling that
$K \geq \max _{1 \leq j \leq L} \tilde {q}_j$
, we may combine Proposition 2.4 i) with Proposition 2.3 to get that for each
$1 \leq m \leq q'-1$
and each
$1 \leq k \leq q'-1$
coprime to
$q'$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu225.png?pub-status=live)
using
$f_0^{-1/2+\varepsilon }(\tilde {q}_0,f_0)^{2^{-L-1}} \ll _{\varepsilon } 1$
whenever
$L \geq 2$
. Inserting this bound into (38) and summing m and k, when
$\varepsilon $
is sufficiently small we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu226.png?pub-status=live)
It remains to show that any
$\lambda < 1/1044$
is admissible. With the parameter choices made earlier, we have assumed that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu227.png?pub-status=live)
which forces
$L \geq 5$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu228.png?pub-status=live)
Since the bounds are decreasing in L, we deduce by setting
$L = 5$
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu229.png?pub-status=live)
Furthermore, as
$\gamma = 2\delta + \lambda $
, we may always choose
$\delta $
small enough so that any
$\lambda> 1/1044 -\varepsilon '$
is obtainable, for any
$\varepsilon '> 0$
. We thus deduce that for
$\eta> 0$
sufficiently small (in particular, smaller than
$2\lambda $
) we can find
$\delta = \delta (\eta ,\varepsilon )$
such that if
$q \leq X^{3/4+1/1044-\varepsilon }$
is smooth and squarefree, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu230.png?pub-status=live)
for any residue class a modulo q.
6.3 Non-squarefree
$q> X^{3/4-\varepsilon }$
The proof follows similar lines to that of Theorem 1.1 but invoking Proposition 2.4 ii) rather than i). The choice of parameters can be rigged up similarly as in the previous proof, save that the factors
$\tilde {q}_0,\ldots ,\tilde {q}_L$
must be chosen to satisfy
$K \geq \max \{\tilde {q}_1,\ldots ,\tilde {q}_L\}$
and also
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu231.png?pub-status=live)
in analogy to (36), which amounts to replacing the condition
$\tilde {q}_0^{-2^{-(L+1)}} \ll X^{-\gamma }$
by
$\tilde {q}_0^{-(1-\delta ')2^{-L}} \ll X^{\gamma }$
. We also must choose
$\tilde {q}_0$
to be coprime to
$2$
and
$3$
in order to apply the results of Section 4, but by the
$X^{\eta }$
-ultrasmooth condition this can be done at a cost of
$X^{2\eta }$
in precision in the choice of
$\tilde {q}_1$
(as is done explicitly in Lemma 6.1 b).
Finally, in order to apply Lemma 5.3 we must assume
$K/\tilde {q}_j \geq \tilde {q}_0^{\delta '}$
for all
$1 \leq j \leq L$
, where
$\delta ' = \delta '(L) \in (0,2^{-2^L}]$
arises in Proposition 2.4. This can be assured in light of the choice
$\sigma $
from the previous subsection: up to
$X^{\eta }$
factors (where
$\eta $
can be chosen as small as desired), we have, uniformly in
$1 \leq j \leq L$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu232.png?pub-status=live)
with
$\gamma = 2\delta + \lambda $
, whereas
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu233.png?pub-status=live)
so that as
$\delta ' \leq 2^{-2^L}$
it suffices, for instance, to have
$\gamma + \delta> \delta '(1/L + \eta L)$
. We leave to the interested reader the determination of an explicit choice of
$\lambda $
and
$\delta $
(both of which necessarily depend on
$\delta '$
, which could be reduced if necessary) in which the range
$q \leq X^{3/4 + \lambda }$
is admissible with power savings
$X^{1-\delta }/q$
.
Proof of Corollary 1.3
Put
$Y := X^{196/261-\varepsilon }$
and set
$u := (\log Y)/(\eta \log X)$
. It suffices to show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu234.png?pub-status=live)
Of course, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu235.png?pub-status=live)
Put
$D := (\log X)^{1/2}$
. Then we trivially bound
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu236.png?pub-status=live)
On the other hand, standard estimates for smooth numbers (see, e.g., Theorem III.5.8 of [Reference Tenenbaum24]) yield
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu237.png?pub-status=live)
where
$\rho $
denotes the Dickman function and for each
$d \leq D$
we set
$v_d := \frac {2(\log d)}{\eta \log X}$
. As
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu238.png?pub-status=live)
for
$w> 1$
, we observe that for each
$d \leq D$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu239.png?pub-status=live)
provided X is large enough in terms of
$\eta $
. We thus deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20211026135134317-0133:S2050509421000670:S2050509421000670_eqnu240.png?pub-status=live)
as
$u \ll _{\eta } 1$
, and the claim follows.
Acknowledgements
The author is grateful to the anonymous referees for a careful reading of the article, for several corrections to the content of Section 3 and for many recommendations that helped in improving the exposition. The author warmly thanks Corentin Perret-Gentil for invaluable discussions and suggested references that were crucial to the proof of Theorem 3.1, as well as many helpful comments contributing to better readability. The author would also like to thank Aled Walker for a useful suggestion leading to an improvement to the arguments in the proof of Theorem 4.1. This article began while the author was visiting the California Institute of Technology in February 2020. The author would like to thank Caltech for the excellent working conditions, as well as Maksym Radziwiłł for the invitation and for bringing the work [Reference Nunes16] to his attention.
Conflicts of Interest
None.