1 Introduction and results
The Goldbach problem of representing every even integer larger than 2 as the sum of two primes has several variants, one being that in which the summands are primes in given arithmetic progressions. Similar to the original problem it is known that almost all even integers satisfying some congruence condition can be written as the sum of two primes in congruence classes. Quantitatively, the exceptional set of integers less than
$X$
and satisfying the necessary congruence condition, which cannot be written as the sum of primes congruent to a common modulus
$q$
may be estimated as
$O(\unicode[STIX]{x1D711}(q)^{-1}X^{1-\unicode[STIX]{x1D6FF}})$
for a computable positive constant
$\unicode[STIX]{x1D6FF}$
and all
$q\leqslant X^{\unicode[STIX]{x1D6FF}}$
(see, for example, [Reference Bauer1, Reference Liu, Zhan and Motohashi13]).
Though the complete solution of these binary Goldbach problems is out of sight, the related question of the average number of representations of integers as sums of primes seems more accessible. The study of the average order of the weighted function
where
$\unicode[STIX]{x1D6EC}$
is the von Mangoldt function has begun with Fujii [Reference Fujii8] and continues to be actively pursued. However the current state of knowledge on the zeros of the Riemann zeta function
$\unicode[STIX]{x1D701}(s)$
is not enough to obtain “good” error terms unconditionally and the Riemann Hypothesis is always assumed in such studies. In fact obtaining sufficiently sharp error terms for average orders of the mean value of
$G(n)$
is expected to solve other conjectures like the Riemann Hypothesis, as elaborated by Granville [Reference Granville11] in the classical case of unrestricted primes. This paper is an analogous study with the two primes in arithmetic progressions with a common modulus.
The function that we consider here, with
$a,b$
positive integers coprime to
$q$
, is
whose summatory function defined as
was introduced by Rüppel [Reference Rüppel16] and further studied by the fourth author [Reference Suzuki17].
On the lines of Granville we consider the relations between an explicit formula for
$S(x;q,a,b)$
and zeros of
$L$
-functions. In [Reference Granville11, 1A] it is stated that there is an equivalence between the estimate
and the Riemann Hypothesis (RH) for
$\unicode[STIX]{x1D701}(s)$
where
$J(n)=0$
for odd
$n$
and, with
$C_{2}=2\prod _{p>2}(1-1/(p-1)^{2})$
being the twin prime constant,
$$\begin{eqnarray}J(n)=n\cdot C_{2}\mathop{\prod }_{\substack{ p\mid n \\ p>2}}\frac{p-1}{p-2}\end{eqnarray}$$
for even
$n$
. The function
$J(n)$
is believed since Hardy and Littlewood to be a good approximation for
$G(n)$
(cf. [Reference Hardy and Littlewood12]).
We denote by
$\unicode[STIX]{x1D712}$
a Dirichlet character
$(\text{mod}\;q)$
, by
$L(s,\unicode[STIX]{x1D712})$
the associated Dirichlet
$L$
-function and by
$\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}$
its non-trivial zeros. Let
$B_{\unicode[STIX]{x1D712}}=\sup \{\Re \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\}$
and
$B_{q}=\sup \{B_{\unicode[STIX]{x1D712}}\mid \unicode[STIX]{x1D712}\,(\text{mod}\;q)\}$
. Hence
$1/2\leqslant B_{q}\leqslant 1$
for
$q\geqslant 1$
.
In the context of primes in congruence classes we first need to formulate the distinct zero conjecture (DZC) on zeros of
$L$
-functions as:
For any
$q\geqslant 1$
, any two distinct Dirichlet
$L$
-functions associated with characters of modulus
$q$
do not have a common non-trivial zero, except for a possible multiple zero at
$s=1/2$
.
Though weaker than the non-coincidence conjecture found in literature that expects all zeros of all primitive
$L$
-functions to be linearly independent except for the possible multiple zero at
$s=1/2$
(cf. [Reference Conrey5, p. 353]), this suffices for our purpose.
In this paper,
$q$
denotes an arbitrary positive integer. If an implied constant for Landau’s or Vinogradov’s symbol depends on certain parameters then we indicate this dependence by attaching subscripts, e.g.
$O_{A}(x\log x)$
, or
$\ll _{A,B}x\log x$
. When there is no explicit mention an implied constant should be understood to be absolute.
Theorem 1. Let
$a,b,q$
be integers with
$(ab,q)=1$
,
$q\geqslant 1$
.
(1) For
$x\geqslant 2$
and
$\unicode[STIX]{x1D6FF}>0$
we have (1.2)and
$$\begin{eqnarray}S(x;q,a,b)=\frac{x^{2}}{2\unicode[STIX]{x1D711}(q)^{2}}+O(x^{1+B_{q}^{\ast }})\end{eqnarray}$$
with
$$\begin{eqnarray}B_{q}^{\ast }=B_{q}^{\ast }(x)=\min (B_{q},1-\unicode[STIX]{x1D702}),\end{eqnarray}$$
for a small positive constant
$$\begin{eqnarray}\unicode[STIX]{x1D702}=\unicode[STIX]{x1D702}_{q}(x)=\frac{c_{1}(\unicode[STIX]{x1D6FF})}{\max (q^{\unicode[STIX]{x1D6FF}},(\log x)^{2/3}(\log \log x)^{1/3})}\end{eqnarray}$$
$c_{1}(\unicode[STIX]{x1D6FF})$
depending only on
$\unicode[STIX]{x1D6FF}$
.(2) Let DZC be true, let
$\unicode[STIX]{x1D712}(a)+\unicode[STIX]{x1D712}(b)\neq 0$
for all characters
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
and let
$1/2\leqslant d<1$
. If the asymptotic formula (1.3)holds for any
$$\begin{eqnarray}S(x;q,a,b)=\frac{x^{2}}{2\unicode[STIX]{x1D711}(q)^{2}}+O_{q,\unicode[STIX]{x1D700}}(x^{1+d+\unicode[STIX]{x1D700}})\end{eqnarray}$$
$\unicode[STIX]{x1D700}>0$
, then either
$B_{q}\leqslant d$
or
$B_{q}=1$
. Further, if (1.3) holds with
$a=b$
, then we obtain
$B_{q}\leqslant d$
.
Remark 1. The parameter
$B_{q}^{\ast }$
introduced above enables us to obtain a non-trivial estimate in (1.2) even for the case
$B_{q}=1$
, where
$B_{q}$
alone would have given no information on the distribution of non-trivial zeros of Dirichlet
$L$
-functions.
Remark 2. Our result thus falls short of an equivalence with the Generalized Riemann Hypothesis (GRH) for
$L$
-functions modulo
$q$
since we have an additional possibility of
$B_{q}=1$
where the meromorphic continuation is not available (see Proposition 3 below). Using the idea from [Reference Bhowmik and Ruzsa2] we were able to exclude the possibility of
$B_{q}=1$
for the case
$a=b$
still assuming the DZC.
Though the proof of the equivalence between the RH and (1.1) is now complete (see also [Reference Bhowmik and Ruzsa2]) the equivalences for primes in arithmetic progressions are still partial.
Remark 3. We need the condition that
$\unicode[STIX]{x1D712}(a)+\unicode[STIX]{x1D712}(b)\neq 0$
for all
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
in order to assure that the residue
$r_{1}(\unicode[STIX]{x1D70C}_{q})$
of Proposition 3 does not vanish. It is easy to see that
$\unicode[STIX]{x1D712}(a)+\unicode[STIX]{x1D712}(b)\neq 0$
for all
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
if and only if the residue
$ab^{-1}~(\text{mod}\;q)$
is of odd order in the multiplicative group of the reduced residue classes
$(\text{mod}\;q)$
. (See also Remarks 6 and 7 below.)
To prove Theorem 1 we need an explicit formula for
$S(x;q,a,b)$
, which can be stated as follows.
Theorem 2. Let
$a,b,q$
be integers with
$(ab,q)=1$
,
$q\geqslant 1$
. Then, for
$x\geqslant 2$
and for any
$\unicode[STIX]{x1D6FF}>0$
,
$$\begin{eqnarray}\displaystyle S(x;q,a,b) & = & \displaystyle \frac{x^{2}}{2\unicode[STIX]{x1D711}(q)^{2}}\nonumber\\ \displaystyle & & \displaystyle -\,\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})\mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle +\,O(x^{2B_{q}^{\ast }}(\log qx)^{5}).\end{eqnarray}$$
Remark 4. The constant
$c_{1}(\unicode[STIX]{x1D700})$
cannot be effectively computed due to Siegel’s theorem.
In §3 we prove an explicit formula with a weaker error estimate (Proposition 1) using a generalized Landau–Gonek formula for
$L$
-functions (Proposition 2 in §4). This weaker form is an analogue of Granville’s [Reference Granville11, Corrigendum, (2)], that states
$$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}G(n)=\frac{x^{2}}{2}-2\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C} \\ |\Im \unicode[STIX]{x1D70C}|\leqslant x}}\frac{x^{\unicode[STIX]{x1D70C}+1}}{\unicode[STIX]{x1D70C}(\unicode[STIX]{x1D70C}+1)}+O(x^{(2+4B)/3}(\log x)^{2}),\end{eqnarray}$$
where
$\unicode[STIX]{x1D70C}$
runs through the non-trivial zeros of
$\unicode[STIX]{x1D701}(s)$
and
$B=\sup \{\Re \unicode[STIX]{x1D70C}\}$
, and the proof of Proposition 1 essentially runs along the line suggested by [Reference Granville11]. Thus §§3 and 4 include a reconstruction of Granville’s argument for the asymptotic order. However we can go further; we take this opportunity to prove (in §§5 and 6) the stronger error estimate (1.4), an analogue of that announced in [Reference Granville11, (5.1)] (cf. [Reference Granville11, Corrigendum, comments before (2)]), using a kind of circle method of the first author and Schlage-Puchta [Reference Bhowmik and Schlage-Puchta3].
With the help of Theorem 2 above the analytic continuation of the Dirichlet series
is examined in Proposition 3 (in §7) and this enables us to establish relations between the error terms in the average of Goldbach problems in arithmetic progressions and zeros of Dirichlet
$L$
-functions.
Further, we examine the case of
$n$
with congruence conditions as in [Reference Granville11, 1B] where it is stated that the GRH for Dirichlet
$L$
-functions
$L(s,\unicode[STIX]{x1D712})$
, over all characters
$\unicode[STIX]{x1D712}$
, the modulus of which are odd squarefree divisors of
$q$
, is equivalent to the estimate
Moreover in [Reference Granville11, Corrigendum, 1C] it is stated that if the estimate
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ q\mid n}}G(n)=\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{n\leqslant x}G(n)+O_{q}(x^{1+o(1)})\end{eqnarray}$$
is attained then the GRH for Dirichlet
$L$
-functions
$L(s,\unicode[STIX]{x1D712})$
,
$\unicode[STIX]{x1D712}\,(\text{mod}\;q)$
holds; and under this hypothesis the last estimate would have the error term
$O(x^{4/3}(\log x)^{2})$
.
Here we extend (1.6) with the general congruence condition
$n\equiv c$
for an arbitrary positive integer
$c$
instead of the special case
$n\equiv 2$
. Assuming the GRH for
$L$
-functions
$(\text{mod}\;q)$
we can deduce the estimate
However in the other direction, we could not deduce satisfactory conclusions on the size of
$B_{q}$
when
$a\neq b$
. In particular we were unable then to reconstruct the reverse implications for (1.6) and (1.7). In the following we elaborate conditions under which reverse implications on the distribution of zeros would be true.
Theorem 3. Let
$q,c$
be integers such that
$(2,q)\mid c$
.
(1) For
$x\geqslant 2$
, we have (1.9)
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}(G(n)-J(n))\ll x^{1+B_{q}^{\ast }}.\end{eqnarray}$$
(2) Assume that
(1.10)holds for some
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}(G(n)-J(n))\ll _{q,\unicode[STIX]{x1D700}}x^{1+d+\unicode[STIX]{x1D700}}\end{eqnarray}$$
$1/2\leqslant d\leqslant 1$
and any
$\unicode[STIX]{x1D700}>0$
. If there exists a zero
$\unicode[STIX]{x1D70C}_{0}$
of
$\prod _{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}L(s,\unicode[STIX]{x1D712})$
such that:(a)
$B_{q}=\Re \unicode[STIX]{x1D70C}_{0}$
;(b)
$\unicode[STIX]{x1D70C}_{0}$
belongs to a unique character
$\unicode[STIX]{x1D712}_{1}~(\text{mod}\;q)$
;(c) the conductor
$q^{\ast }$
of
$\unicode[STIX]{x1D712}_{1}~(\text{mod}\;q)$
is squarefree and satisfies
$(c,q^{\ast })=1$
,
then
$B_{q}=\Re \unicode[STIX]{x1D70C}_{0}\leqslant d$
.
One possible candidate for
$\unicode[STIX]{x1D70C}_{0}$
in the above theorem is the Siegel zero
$\unicode[STIX]{x1D6FD}_{1}$
. However, we cannot exclude the existence of some other non-trivial zero
$\unicode[STIX]{x1D70C}_{0}=\unicode[STIX]{x1D6FD}_{0}+i\unicode[STIX]{x1D6FE}_{0}$
such that
$\unicode[STIX]{x1D6FD}_{0}>\unicode[STIX]{x1D6FD}_{1}$
and
$|\unicode[STIX]{x1D6FE}_{0}|$
is large.
To obtain the above results we require an asymptotic formula with
$B_{q}^{\ast }$
as in Theorem 2. We denote the principal character
$\text{mod}\;q$
by
$\unicode[STIX]{x1D712}_{0}~(\text{mod}\;q)$
. For a given Dirichlet character
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, let
$\unicode[STIX]{x1D712}^{\ast }~(\text{mod}\;q^{\ast })$
be the primitive character inducing
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
.
Theorem 4. For
$x\geqslant 2$
, and for any positive integer
$c$
we have
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}G(n) & = & \displaystyle \frac{\mathfrak{S}_{q}(c)}{2}x^{2}-2\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathfrak{S}_{q}(c,\overline{\unicode[STIX]{x1D712}})\mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle +\,O(x^{2B_{q}^{\ast }}(\log qx)^{5}),\nonumber\end{eqnarray}$$
where
$$\begin{eqnarray}\mathfrak{S}_{q}(c,\unicode[STIX]{x1D712})=\frac{\unicode[STIX]{x1D707}^{2}(q^{\ast })\unicode[STIX]{x1D712}^{\ast }(c)}{\unicode[STIX]{x1D711}(q)\unicode[STIX]{x1D711}(q^{\ast })}\mathop{\prod }_{\substack{ p\mid q \\ p\nmid q^{\ast }c}}\frac{p-2}{p-1}\quad \text{and}\quad \mathfrak{S}_{q}(c)=\mathfrak{S}_{q}(c,\unicode[STIX]{x1D712}_{0}).\end{eqnarray}$$
Note that
$\mathfrak{S}_{q}(c)=0$
if
$(2,q)\nmid c$
. The above theorem is proven in §6. The singular series
$\mathfrak{S}_{q}(c,\unicode[STIX]{x1D712})$
appears again in Lemma 12. To ensure the uniformity of
$q$
it is not enough to sum Theorem 2 over residues and we need other tools like Lemma 11. Finally, using Theorem 4, we give the proof of (1.8) and Theorem 3 in §7. In §8 we give the proof for the supplement of Theorem 1(2) in the case
$a=b$
.
2 Some preliminaries
In this section we fix notations and give some basic lemmas on Dirichlet
$L$
-functions.
As mentioned in §1, we denote by
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
a Dirichlet character modulo
$q$
and by
$\unicode[STIX]{x1D712}^{\ast }~(\text{mod}\;q^{\ast })$
the primitive character inducing
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
. We denote the principal character modulo
$q$
by
$\unicode[STIX]{x1D712}_{0}~(\text{mod}\;q)$
. We refer to the constant function
$1$
as the trivial character and regard it as the primitive character
$(\text{mod}\;1)$
. If there is no specific mention a statement with
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
holds true for any
$q\geqslant 1$
and any character
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
.
We denote the Dirichlet
$L$
-function associated with
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
by
$L(s,\unicode[STIX]{x1D712})$
. We say that a zero of
$L(s,\unicode[STIX]{x1D712})$
is non-trivial if it is contained in the strip
$0<\unicode[STIX]{x1D70E}<1$
. We denote by
$\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}$
non-trivial zeros of
$L(s,\unicode[STIX]{x1D712})$
with the real part
$\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}$
and the imaginary part
$\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}$
. As a summation variable, the letter
$\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}$
runs through all non-trivial zeros of
$L(s,\unicode[STIX]{x1D712})$
counted with multiplicity. We denote the Siegel zero by
$\unicode[STIX]{x1D6FD}_{1}$
.
We set
$\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})=1$
if
$\unicode[STIX]{x1D712}=\unicode[STIX]{x1D712}_{0}$
is the principal character and
$\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})=0$
otherwise. Similarly we let
$\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})=1$
if
$\unicode[STIX]{x1D712}$
is the exceptional character (that is, whose
$L$
-function has a Siegel zero) and
$\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})=0$
otherwise.
We now recall the Vinogradov–Korobov zero free region in a suitable form.
Lemma 1. For any
$\unicode[STIX]{x1D6FF}>0$
, there is some constant
$c_{1}=c_{1}(\unicode[STIX]{x1D6FF})>0$
such that
Proof. By the Korobov–Vinogradov estimate [Reference Montgomery14, p. 176], we have, for
$c_{2}$
an absolute positive constant,
$L(s,\unicode[STIX]{x1D712})\neq 0$
for
except real zeros. For the real zeros, we can apply Siegel’s theorem [Reference Montgomery and Vaughan15, Corollary 11.15]. ◻
We next evoke some lemmas for sums over non-trivial zeros.
Lemma 2 [Reference Montgomery and Vaughan15, Theorem 10.17].
For any
$T\geqslant 0$
, we have
Lemma 3. For any
$T\geqslant 1$
and
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, we have
$$\begin{eqnarray}\displaystyle & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\ll (\log 2qT)^{2}, & \displaystyle \nonumber\\ \displaystyle & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\ll (\log 2qT)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}. & \displaystyle \nonumber\end{eqnarray}$$
Proof. For the first estimate we dissect the sum at
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|=1$
as
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}=\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}+\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ 1<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}.\end{eqnarray}$$
For the first sum Lemma 2 gives
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|} & {\leqslant} & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1}}\frac{1}{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}}=\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq \unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1}}\frac{1}{1-\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}}\nonumber\\ \displaystyle & \ll & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1 \\ \unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}>1-c_{0}/\!\log 2q}}\frac{1}{1-\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}}\nonumber\\ \displaystyle & \ll & \displaystyle (\log 2q)\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1}}1\ll (\log 2q)^{2}\ll (\log 2qT)^{2},\nonumber\end{eqnarray}$$
where
$c_{0}>0$
is some small absolute constant while for the second sum Lemma 2 gives
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ 1<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\leqslant \mathop{\sum }_{n\leqslant T}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ n<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant n+1}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\ll \mathop{\sum }_{n\leqslant T}\frac{\log q(n+2)}{n}\ll (\log 2qT)^{2}.\end{eqnarray}$$
Thus the first estimate follows. The second estimate is obtained from the first combined with the well-known bound [Reference Montgomery and Vaughan15, Corollary 11.12] of the Siegel zero
where
$c_{2}>0$
is some absolute constant.◻
Lemma 4. For any
$T\geqslant 1$
and
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, we have
$$\begin{eqnarray}\displaystyle & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{2}}\ll \frac{\log 2qT}{T}, & \displaystyle \nonumber\\ \displaystyle & \displaystyle \mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)|}\ll (\log 2q)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}. & \displaystyle \nonumber\end{eqnarray}$$
Proof. The first estimate is again obtained by using Lemma 2, i.e.
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{2}}\leqslant \mathop{\sum }_{n=[T]}^{\infty }\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ n<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant n+1}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{2}}\ll \mathop{\sum }_{n=[T]}^{\infty }\frac{\log qn}{n^{2}}\ll \frac{\log qT}{T},\end{eqnarray}$$
whereas the last estimate can be obtained by comparison with an integral. For the latter estimate, we combine the former with Lemma 3. This gives
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)|} & {\leqslant} & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}+\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>1}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{2}}\nonumber\\ \displaystyle & \ll & \displaystyle (\log 2q)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}.\Box \nonumber\end{eqnarray}$$
We next consider some explicit formulæ for the sum
For a Dirichlet character
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, we introduce the constant
where
$\unicode[STIX]{x1D6FE}$
is the Euler–Mascheroni constant.
Lemma 5. For any
$u,T\geqslant 2$
, the explicit formula
$$\begin{eqnarray}\unicode[STIX]{x1D713}(u,\unicode[STIX]{x1D712})=\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})u-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}+C(\unicode[STIX]{x1D712}^{\ast })+E(u,T,\unicode[STIX]{x1D712})\end{eqnarray}$$
holds, where
and
$C(\unicode[STIX]{x1D712})$
is defined by (2.2).
Proof. For primitive
$\unicode[STIX]{x1D712}$
, this follows immediately from [Reference Montgomery and Vaughan15, Theorems 12.5 and 12.10] as below. If
$\unicode[STIX]{x1D712}$
is trivial so that
$q=1$
, we use [Reference Montgomery and Vaughan15, Theorem 12.5] with
$x=u$
. We can estimate the last three terms on the right-hand side of [Reference Montgomery and Vaughan15, (12.3)] as
by using [Reference Montgomery and Vaughan15, (12.4)]. This gives the assertion for the case when
$\unicode[STIX]{x1D712}$
is trivial. If
$\unicode[STIX]{x1D712}$
is non-principal, we use [Reference Montgomery and Vaughan15, Theorem 12.10] with
$x=u$
. The last four terms on the right-hand side of [Reference Montgomery and Vaughan15, (12.6)] can be rewritten as
$$\begin{eqnarray}\displaystyle & & \displaystyle -\frac{1}{2}\log (u-1)-\frac{\unicode[STIX]{x1D712}(-1)}{2}\log (u+1)+C(\unicode[STIX]{x1D712})+R(u,T;\unicode[STIX]{x1D712})\nonumber\\ \displaystyle & & \displaystyle \quad =C(\unicode[STIX]{x1D712})+O\biggl((\log 2q)(\log u)+\frac{u}{T}(\log quT)^{2}\biggr).\nonumber\end{eqnarray}$$
This gives the assertion for the case of
$\unicode[STIX]{x1D712}$
being primitive and non-principal.
If
$\unicode[STIX]{x1D712}$
is imprimitive, then it suffices to note that the non-trivial zeros of
$L(s,\unicode[STIX]{x1D712})$
are those of
$L(s,\unicode[STIX]{x1D712}^{\ast })$
and that
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D713}(u,\unicode[STIX]{x1D712})-\unicode[STIX]{x1D713}(u,\unicode[STIX]{x1D712}^{\ast }) & \ll & \displaystyle \mathop{\sum }_{\substack{ n\leqslant u \\ (n,q)>1}}\unicode[STIX]{x1D6EC}(n)=\mathop{\sum }_{p\mid q}(\log p)\biggl[\frac{\log u}{\log p}\biggr]\nonumber\\ \displaystyle & {\leqslant} & \displaystyle \biggl(\frac{\log u}{\log 2}\biggr)\mathop{\sum }_{p\mid q}(\log p)\ll (\log 2q)(\log u),\end{eqnarray}$$
which is absorbed into
$E(u,T,\unicode[STIX]{x1D712})$
.◻
When we substitute the above explicit formula into some sum or integral, we need to use a uniform parameter
$T$
and a uniform bound of the error term. Also it is convenient to work with the case
$0\leqslant u<2$
. Thus we modify the above explicit formula in the following form.
Lemma 6. Let
$x\geqslant 2$
be a real number. For any
$x\geqslant T\geqslant 2$
and
$x\geqslant u\geqslant 0$
, the explicit formula
$$\begin{eqnarray}\unicode[STIX]{x1D713}(u,\unicode[STIX]{x1D712})=\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})u-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}+O\biggl(\frac{x}{T}(\log qx)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}\biggr)\end{eqnarray}$$
holds.
Proof. We first consider the case
$u\geqslant 2$
. For this we use Lemma 5. Since
$u,T\leqslant x$
, the error term of Lemma 5 is
Further, by [Reference Montgomery and Vaughan15, Theorem 11.4], we know that
$(L^{\prime }/L)(1,\overline{\unicode[STIX]{x1D712}^{\ast }})\ll \log 2q$
if
$\unicode[STIX]{x1D712}$
is not exceptional, while for the exceptional
$\unicode[STIX]{x1D712}$
and Siegel zero
$\unicode[STIX]{x1D6FD}_{1}$
, (2.1) gives
Therefore by [Reference Montgomery and Vaughan15, (12.7)], we obtain
for non-principal
$\unicode[STIX]{x1D712}$
, from which the lemma follows for the case
$u\geqslant 2$
.
The remaining case is when
$0\leqslant u<2$
. Now the sum on the right-hand side of (2.4) is estimated by using Lemma 3 as
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\ll u\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|} & \ll & \displaystyle (\log qT)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}\nonumber\\ \displaystyle & \ll & \displaystyle \frac{x}{T}(\log qx)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}\nonumber\end{eqnarray}$$
since
$T\leqslant x$
. On the other hand, when
$u<2$
, the left-hand side of (2.4) is zero. Therefore the assertion holds trivially.◻
3 An asymptotic formula for
$S(x;q,a,b)$
In this section we deduce a prototype of Theorem 2 along the lines of [Reference Granville11].
Proposition 1. For integers
$a,b,q$
with
$(ab,q)=1$
, we have
$$\begin{eqnarray}\displaystyle S(x;q,a,b) & = & \displaystyle \frac{x^{2}}{2\unicode[STIX]{x1D711}(q)^{2}}-\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})\mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle +\,O(x^{(2+4B_{q}^{\ast })/3}(\log qx)^{4}).\nonumber\end{eqnarray}$$
Proof. The proof is divided into three steps.
Step 1. The first substitution in the explicit formula.
With
we can write
Using the orthogonality relation of Dirichlet characters, we have
We substitute the explicit formula given by Lemma 6 here. This gives
for
$x\geqslant T\geqslant 2$
and
$x\geqslant u\geqslant 0$
, where
$$\begin{eqnarray}A(u,T;q,b)=u-\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\end{eqnarray}$$
and
$B(u,T;q,b)$
is the error term satisfying
where for estimating the term involving
$\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}$
, we use the fact that there is at most one exceptional character
$(\text{mod}\;q)$
. Substituting (3.2) into (3.1), we obtain
$$\begin{eqnarray}S(x;q,a,b)=\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )A(x-\ell ,T;q,b)+O\biggl(\frac{x^{2}}{T}(\log qx)^{2}\biggr).\end{eqnarray}$$
Step 2. The second substitution in the explicit formula.
Now we evaluate the sum on the right-hand side of (3.3) by splitting it in two parts
$\unicode[STIX]{x1D6F4}_{1}$
and
$\unicode[STIX]{x1D6F4}_{2}$
.
$$\begin{eqnarray}\displaystyle & & \displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )A(x-\ell ,T;q,b)\nonumber\\ \displaystyle & & \displaystyle \quad =\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )(x-\ell )\nonumber\\ \displaystyle & & \displaystyle \qquad -\,\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{(x-\ell )^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\nonumber\\ \displaystyle & & \displaystyle \quad =\unicode[STIX]{x1D6F4}_{1}-\unicode[STIX]{x1D6F4}_{2},\quad \text{say}.\end{eqnarray}$$
Consider
$\unicode[STIX]{x1D6F4}_{1}$
. We have
$$\begin{eqnarray}\unicode[STIX]{x1D6F4}_{1}=\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )\int _{\ell }^{x}\,du=\frac{1}{\unicode[STIX]{x1D711}(q)}\int _{0}^{x}\unicode[STIX]{x1D713}(u;q,a)\,du,\end{eqnarray}$$
so, using (3.2), we obtain
Inserting the definition of
$A(u,T;q,a)$
yields
$$\begin{eqnarray}\unicode[STIX]{x1D6F4}_{1}=\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\biggl(\frac{x^{2}}{2}-\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(a)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\biggr)+O\biggl(\frac{x^{2}}{T}(\log qx)^{2}\biggr).\end{eqnarray}$$
Next consider
$\unicode[STIX]{x1D6F4}_{2}$
. We have
$$\begin{eqnarray}\unicode[STIX]{x1D6F4}_{2}=\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\unicode[STIX]{x1D6F9}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},x;q,a),\end{eqnarray}$$
where
$$\begin{eqnarray}\unicode[STIX]{x1D6F9}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},x;q,a)=\frac{1}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )(x-\ell )^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}.\end{eqnarray}$$
Again using (3.2),
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D6F9}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},x;q,a) & = & \displaystyle \frac{1}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\,d\unicode[STIX]{x1D713}(u;q,a)\nonumber\\ \displaystyle & = & \displaystyle \frac{1}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggl(\frac{1}{\unicode[STIX]{x1D711}(q)}\,dA(u,T;q,a)+dB(u,T;q,a)\biggr)\nonumber\\ \displaystyle & = & \displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\,du\nonumber\\ \displaystyle & & \displaystyle -\,\frac{1}{\unicode[STIX]{x1D711}(q)\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\mathop{\sum }_{\unicode[STIX]{x1D712}^{\prime }\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}^{\prime }(a)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T}}\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}-1}\,du\nonumber\\ \displaystyle & & \displaystyle +\,\frac{1}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\,dB(u,T;q,a)\nonumber\\ \displaystyle & = & \displaystyle J_{1}-J_{2}+J_{3},\quad \text{say}.\nonumber\end{eqnarray}$$
Obviously
Since
we have
$$\begin{eqnarray}J_{2}=\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}^{\prime }\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}^{\prime }(a)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T}}{\mathcal{Z}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}},\end{eqnarray}$$
where
Lastly,
$$\begin{eqnarray}\displaystyle J_{3} & = & \displaystyle \frac{1}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}[(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}B(u,T;q,a)]_{u=0}^{x}+\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}B(u,T;q,a)\,du\nonumber\\ \displaystyle & = & \displaystyle O\biggl(\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\frac{x^{2}}{T}(\log qx)^{2}\biggr)+\int _{0}^{x}(x-u)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}B(u,T;q,a)\,du.\nonumber\end{eqnarray}$$
Therefore we now obtain
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D6F9}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},x;q,a) & = & \displaystyle \frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D711}(q)\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle -\,\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}^{\prime }\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}^{\prime }(a)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T}}{\mathcal{Z}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}}\nonumber\\ \displaystyle & & \displaystyle +\,\int _{0}^{x}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}B(x-u,T;q,a)\,du+O\biggl(\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\frac{x^{2}}{T}(\log qx)^{2}\biggr).\nonumber\end{eqnarray}$$
Substituting this into (3.7) and using Lemma 3, we obtain
$$\begin{eqnarray}\unicode[STIX]{x1D6F4}_{2}=\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}-\unicode[STIX]{x1D6F4}_{3}+\unicode[STIX]{x1D6F4}_{4}+O\biggl(\frac{x^{2}}{T}(\log qx)^{4}\biggr),\end{eqnarray}$$
where
$$\begin{eqnarray}\displaystyle & \displaystyle \unicode[STIX]{x1D6F4}_{3}=\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\mathop{\sum }_{\unicode[STIX]{x1D712}^{\prime }\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}^{\prime }(a)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T}}{\mathcal{Z}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}}, & \displaystyle \nonumber\\ \displaystyle & \displaystyle \unicode[STIX]{x1D6F4}_{4}=\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\int _{0}^{x}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}B(x-u,T;q,a)\,du. & \displaystyle \nonumber\end{eqnarray}$$
Combining (3.3) with (3.4) yields
so with (3.6) and (3.9) we now arrive at
$$\begin{eqnarray}\displaystyle S(x;q,a,b) & = & \displaystyle \frac{x^{2}}{2\unicode[STIX]{x1D711}(q)^{2}}-\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle +\,\unicode[STIX]{x1D6F4}_{3}-\unicode[STIX]{x1D6F4}_{4}+O\biggl(\frac{x^{2}}{T}(\log qx)^{4}\biggr).\nonumber\end{eqnarray}$$
We next extend the sum over zeros. By Lemma 4, we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>T}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\ll x^{2}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>T}}\frac{1}{|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|^{2}}\ll \frac{x^{2}}{T}(\log qx).\end{eqnarray}$$
Therefore our sum becomes
$$\begin{eqnarray}\displaystyle S(x;q,a,b) & = & \displaystyle \frac{x^{2}}{2\unicode[STIX]{x1D711}(q)^{2}}-\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})\mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle +\,\unicode[STIX]{x1D6F4}_{3}-\unicode[STIX]{x1D6F4}_{4}+O\biggl(\frac{x^{2}}{T}(\log qx)^{4}\biggr).\end{eqnarray}$$
Step 3. The estimation of
$\unicode[STIX]{x1D6F4}_{3}$
and
$\unicode[STIX]{x1D6F4}_{4}$
.
Lastly we estimate the remaining error terms
$\unicode[STIX]{x1D6F4}_{3}$
and
$\unicode[STIX]{x1D6F4}_{4}$
.
First consider
$\unicode[STIX]{x1D6F4}_{4}$
. The contribution of the integral on the interval
$0\leqslant u\leqslant 3$
is
$$\begin{eqnarray}\displaystyle & & \displaystyle \ll \frac{1}{\unicode[STIX]{x1D711}(q)}\frac{x}{T}(\log qx)^{2}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\int _{0}^{3}u^{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}-1}\,du\nonumber\\ \displaystyle & & \displaystyle \ll \frac{1}{\unicode[STIX]{x1D711}(q)}\frac{x}{T}(\log qx)^{2}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}}\nonumber\\ \displaystyle & & \displaystyle \ll \frac{1}{\unicode[STIX]{x1D711}(q)}\frac{x}{T}(\log qx)^{2}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}}+\frac{q^{1/2}}{\unicode[STIX]{x1D711}(q)}\frac{x}{T}(\log qx)^{4}\nonumber\\ \displaystyle & & \displaystyle \ll \frac{1}{\unicode[STIX]{x1D711}(q)}\frac{x}{T}(\log qx)^{2}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T \\ \unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}>1-c_{0}/\!\log qT}}\frac{1}{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}}+\frac{x}{T}(\log qx)^{4}\nonumber\\ \displaystyle & & \displaystyle \ll \frac{1}{\unicode[STIX]{x1D711}(q)}\frac{x}{T}(\log qx)^{3}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}1+\frac{x}{T}(\log qx)^{4}\ll x(\log qx)^{4}\nonumber\end{eqnarray}$$
by (2.1) provided
$T\leqslant x$
, so we have
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D6F4}_{4} & = & \displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(b)}\int _{3}^{x}\biggl(\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\biggr)B(x-u,T;q,a)\,du\nonumber\\ \displaystyle & & \displaystyle +\,O(x(\log qx)^{4}).\end{eqnarray}$$
If
$3\leqslant u\leqslant x$
and
$T\leqslant x$
, then Proposition 2, proven in the next section, yields
Note that Proposition 2 is stated for primitive
$\unicode[STIX]{x1D712}$
, but the above estimate is valid for any
$\unicode[STIX]{x1D712}$
. Using this estimate from (3.12) we obtain
if
$T\leqslant x$
.
Next consider
$\unicode[STIX]{x1D6F4}_{3}$
. The following argument is inspired by [Reference Granville11, Corrigendum], but in our case we have to treat the zeros near the real line more carefully since
$\unicode[STIX]{x1D6E4}(s)$
has a simple pole at
$s=0$
. We evaluate
${\mathcal{Z}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})$
defined in (3.8) for
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|$
by using Stirling’s formula
If
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant 1$
, then
$|\unicode[STIX]{x1D6E4}(1+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})|\asymp 1$
, and hence
If
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant 1\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|$
, then applying Stirling’s formula to
$\unicode[STIX]{x1D6E4}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})$
and
$\unicode[STIX]{x1D6E4}(1+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})$
,
$$\begin{eqnarray}\displaystyle {\mathcal{Z}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}) & \ll & \displaystyle |\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{-1}\frac{|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|^{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}-1/2}\text{e}^{-(\unicode[STIX]{x1D70B}/2)|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|}}{(|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|+1)^{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2}\text{e}^{-(\unicode[STIX]{x1D70B}/2)|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|}}\nonumber\\ \displaystyle & \ll & \displaystyle |\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{-1}|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|^{-\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}-1}\ll |\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{-1}|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}|^{-1}\ll T^{1/2}|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{-1}|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}|^{-1}\nonumber\end{eqnarray}$$
as in the case
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant 1$
. If
$1\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T$
, we have
When
$\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}$
and
$\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}$
have the same sign, then the exponential factors are cancelled and we obtain
since
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T$
. When they have opposite signs the contribution of the exponential factors is
$O(\text{e}^{-\unicode[STIX]{x1D70B}|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|})$
, and
$$\begin{eqnarray}\displaystyle & & \displaystyle (|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|+1)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}\nonumber\\ \displaystyle & & \displaystyle \quad =(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|-|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}\nonumber\\ \displaystyle & & \displaystyle \quad =(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}\biggl(1-\frac{|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|}\biggr)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}\nonumber\\ \displaystyle & & \displaystyle \quad \leqslant \,(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|)^{(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}\nonumber\\ \displaystyle & & \displaystyle \quad \leqslant \,(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|)^{\unicode[STIX]{x1D70B}}\nonumber\\ \displaystyle & & \displaystyle \quad \leqslant \,(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|)^{-(\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}+1/2)}\text{e}^{\unicode[STIX]{x1D70B}|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|},\nonumber\end{eqnarray}$$
we again obtain
${\mathcal{Z}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }})\ll T^{1/2}|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|^{-1}|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|^{-1}$
. Therefore, the estimate
holds for all
$|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|,|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}|\leqslant T$
by symmetry between
$\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}$
and
$\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}^{\prime }}$
.
By using the estimate (3.15) and Lemma 1, we have
Therefore, by Lemma 3, we have
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D6F4}_{3} & \ll & \displaystyle x^{2B_{q}^{\ast }}T^{1/2}\biggl(\frac{1}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}~(\text{mod}\;q)}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\biggr)^{2}\nonumber\\ \displaystyle & \ll & \displaystyle x^{2B_{q}^{\ast }}T^{1/2}\biggl((\log qx)^{2}+\frac{q^{1/2}(\log q)^{2}}{\unicode[STIX]{x1D711}(q)}\biggr)^{2}\ll x^{2B_{q}^{\ast }}T^{1/2}(\log qx)^{4}\nonumber\end{eqnarray}$$
if
$T\leqslant x$
.
All the error terms on the right-hand side of (3.11) have now been estimated. We choose the optimal
$T$
by requiring that
$x^{2B_{q}^{\ast }}T^{1/2}=x^{2}/T$
, hence
$T=x^{4(1-B_{q}^{\ast })/3}$
. Since
$B_{q}^{\ast }\geqslant 1/2$
this choice satisfies the condition
$T\leqslant x$
. Substituting this choice of
$T$
into (3.11), we obtain the assertion of Proposition 1.◻
4 The Landau–Gonek formula for
$L$
-functions
The Landau–Gonek result [Reference Gonek10], originally a formula on the zeros of
$\unicode[STIX]{x1D701}(s)$
, has been extended to other situations, for example Ford et al [Reference Ford, Soundararajan and Zaharescu7] worked on a general setting of the Selberg class. We did not find any instance where the uniformity with respect to
$q$
was treated and we do so here for the sake of completeness.
Proposition 2. Let
$x,T,q>1$
and
$\unicode[STIX]{x1D712}$
be a primitive character
$(\text{mod}\;q)$
. Then
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}} & = & \displaystyle -\frac{T}{\unicode[STIX]{x1D70B}}\unicode[STIX]{x1D712}(x)\unicode[STIX]{x1D6EC}(x)+O(x(\log 2qxT)(\log \log 3x))\nonumber\\ \displaystyle & & \displaystyle +\,O\biggl((\log x)\min \biggl\{T,\frac{x}{\langle x\rangle }\biggr\}\biggr)+O\biggl((\log 2qT)\min \biggl\{T,\frac{1}{\log x}\biggr\}\biggr),\nonumber\end{eqnarray}$$
where
$\unicode[STIX]{x1D712}(x)=\unicode[STIX]{x1D6EC}(x)=0$
if
$x$
is not an integer, and
$\langle x\rangle$
denotes the distance from
$x$
to the nearest prime power other than
$x$
itself.
Proof. The proof essentially follows the original one of Gonek [Reference Gonek10]. Let
$c=1+1/\!\log 3x$
, and consider the integral
$$\begin{eqnarray}\displaystyle I & = & \displaystyle \frac{1}{2\unicode[STIX]{x1D70B}\text{i}}\biggl(\int _{c-\text{i}T}^{c+\text{i}T}+\int _{c+\text{i}T}^{1-c+\text{i}T}+\int _{1-c+\text{i}T}^{1-c-\text{i}T}+\int _{1-c-\text{i}T}^{c-\text{i}T}\biggr)\frac{L^{\prime }}{L}(s,\unicode[STIX]{x1D712})x^{s}\,ds\nonumber\\ \displaystyle & = & \displaystyle I_{1}+I_{2}+I_{3}+I_{4},\end{eqnarray}$$
say. First suppose that the horizontal paths do not cross any zero of
$L(s,\unicode[STIX]{x1D712})$
. The poles inside the rectangle are the non-trivial zeros of
$L(s,\unicode[STIX]{x1D712})$
and at most one trivial zero of
$L(s,\unicode[STIX]{x1D712})$
at
$s=0$
. Hence the residue theorem gives
We evaluate
$I_{1},I_{2},I_{3}$
and
$I_{4}$
. First consider
$I_{2}$
. We use the well-known formula
$$\begin{eqnarray}\frac{L^{\prime }}{L}(s,\unicode[STIX]{x1D712})=\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-t|\leqslant 1}}\frac{1}{s-\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}+O(\log q(|t|+2))\end{eqnarray}$$
uniformly in
$-1\leqslant \unicode[STIX]{x1D70E}\leqslant 2$
[Reference Montgomery and Vaughan15, Lemma 12.6]. We have
$$\begin{eqnarray}I_{2}=\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-T|\leqslant 1}}\int _{c+\text{i}T}^{1-c+\text{i}T}\frac{x^{s}}{s-\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\,ds+O\biggl(\log 2qT\int _{1-c}^{c}x^{\unicode[STIX]{x1D70E}}\,d\unicode[STIX]{x1D70E}\biggr),\end{eqnarray}$$
whose error term is
For each integral on the first sum of (4.4), we first observe that
$T-1\leqslant \unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}\leqslant T+1$
. When
$T-1\leqslant \unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}\leqslant T$
, we deform the path of integration as
Noting that the denominator on the second term is
$\gg 1$
and that
$\log 3x\gg 1$
,
$\log \log 3x\gg 1$
, we obtain in this case
$$\begin{eqnarray}\displaystyle \int _{c+\text{i}T}^{1-c+\text{i}T}\frac{x^{s}}{s-\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\,ds & \ll & \displaystyle x^{c}\int _{T}^{T+1}\frac{dt}{|(c-\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}})+\text{i}(t-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}})|}\nonumber\\ \displaystyle & & \displaystyle +\,\int _{1-c}^{c}x^{\unicode[STIX]{x1D70E}}\,d\unicode[STIX]{x1D70E}+\frac{x^{1-c}}{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}-(1-c)}\nonumber\\ \displaystyle & \ll & \displaystyle x\int _{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}}^{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+2}\min \biggl\{\log 3x,\frac{1}{t-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}}\biggr\}\,dt+x+\log 3x\nonumber\\ \displaystyle & \ll & \displaystyle x\biggl(\int _{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}}^{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+1/\!\log 3x}\log 3x\,dt+\int _{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+1/\text{log}\,3x}^{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+2}\frac{dt}{t-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}}\biggr)+x\nonumber\\ \displaystyle & \ll & \displaystyle x\biggl(\frac{1}{\log 3x}\cdot \log 3x+[\log (t-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}})]_{t=\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+1/\text{log}\,3x}^{\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}+2}\biggr)+x\nonumber\\ \displaystyle & \ll & \displaystyle x\log \log 3x.\nonumber\end{eqnarray}$$
If
$T<\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}\leqslant T+1$
, we deform the path to that including the segment with the imaginary part
$T-1$
, and argue similarly. We can conclude that
and hence, by using Lemma 2,
The estimate of
$I_{4}$
is similar.
Next consider
$I_{3}$
. We first write the equation
[Reference Montgomery and Vaughan15, (10.35)], where
$\unicode[STIX]{x1D705}=0$
or 1 depending on whether
$\unicode[STIX]{x1D712}$
is an even or an odd character, respectively. We see easily that
for
$|t|\geqslant 1$
and
$\Re s=1-c$
. Therefore, putting
$s=1-c+\text{i}t$
and applying Stirling’s formula we have
for
$t\geqslant 1$
, where
$C$
denotes a constant. Hence, the part
$[1-c\pm \text{i},1-c\pm \text{i}T]$
of the integral
$I_{3}$
is
whose error term is
$O(\log T)$
. The integral is
whose first part is
The second part is trivially
$O(T\log 2qT)$
, while integration by parts gives
(Note that
$\log x\gg 1$
does not hold.) The part
$[1-c-\text{i},1-c+\text{i}]$
of the integral
$I_{3}$
is
$\ll \text{log}\,2qx$
by (4.7). Therefore we conclude
$$\begin{eqnarray}\displaystyle I_{3} & \ll & \displaystyle \log 2qx+(\log 2qT)\min \biggl\{T,\frac{1}{\log x}\biggr\}+\log T\nonumber\\ \displaystyle & \ll & \displaystyle x(\log 2qT)(\log \log 3x)+(\log 2qT)\min \biggl\{T,\frac{1}{\log x}\biggr\}\end{eqnarray}$$
since
$T>1$
.
We next consider
$I_{1}$
. Substituting the Dirichlet series expansion, we have
$$\begin{eqnarray}\displaystyle I_{1} & = & \displaystyle -\mathop{\sum }_{n=2}^{\infty }\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)\frac{1}{2\unicode[STIX]{x1D70B}}\int _{-T}^{T}(x/n)^{c+\text{i}t}\,dt\nonumber\\ \displaystyle & = & \displaystyle -\frac{T}{\unicode[STIX]{x1D70B}}\unicode[STIX]{x1D712}(x)\unicode[STIX]{x1D6EC}(x)+O\biggl(\mathop{\sum }_{n\neq x}\unicode[STIX]{x1D6EC}(n)(x/n)^{c}\min \biggl\{T,\frac{1}{|\!\log x/n|}\biggr\}\biggr).\end{eqnarray}$$
The error term here can be estimated by [Reference Gonek10, Lemma 2], and so
The formula of the lemma follows by combining (4.6), (4.9) and (4.11).
Finally if the path of
$I_{2}$
or
$I_{4}$
crosses some zero we choose
$T^{\prime }$
slightly larger than
$T$
, and define
$I^{\prime }$
, similar to
$I$
but now
$T$
is replaced by
$T^{\prime }$
. Then instead of (4.2) we obtain
(by Lemma 2), while the evaluation of integrals on the edges of the rectangle can be done in the same way as for
$I$
, so the assertion of the lemma is also valid in this case.◻
5 Lemmas for the proof of Theorem 2
In this section we present some preparatory material for the improvement of the error term of Proposition 1. We start with a lemma on an integral of the Selberg-type. In order to prove this first lemma, we need to calculate the following sum over the non-trivial zeros of
$L(s,\unicode[STIX]{x1D712})$
.
Lemma 7. For any
$x\geqslant 2$
and real number
$y$
, we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|}\ll (\log qx)^{2}.\end{eqnarray}$$
Proof. If
$|y|>2x$
, then each term above is
$\ll x^{-1}$
and the lemma holds trivially. So we consider the case
$|y|\leqslant 2x$
. Then by the triangle inequality, we have
Thus we can extend the sum and dissect it as
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|} & {\leqslant} & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|\leqslant 3x}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|}\nonumber\\ \displaystyle & {\leqslant} & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|\leqslant 1}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|}\nonumber\\ \displaystyle & & \displaystyle +\,\mathop{\sum }_{1\leqslant n\leqslant 3x}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ n<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|\leqslant n+1}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|}\nonumber\\ \displaystyle & {\leqslant} & \displaystyle \mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|\leqslant 1}}1+\mathop{\sum }_{1\leqslant n\leqslant 3x}\frac{1}{n}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ n<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-y|\leqslant n+1}}1.\nonumber\end{eqnarray}$$
By using Lemma 2, we can estimate the last sum to be
We now obtain an estimate for an integral of the Selberg-type.
Lemma 8. For any
$2\leqslant h\leqslant x$
and any
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, we have
Proof. By taking the difference between
$u=t+h$
and
$u=t$
in Lemma 5, we have
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{t<n\leqslant t+h}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n) & = & \displaystyle \unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})h-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant T}}\frac{(t+h)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}-t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\nonumber\\ \displaystyle & & \displaystyle +\,E(t+h,T,\unicode[STIX]{x1D712})-E(t,T,\unicode[STIX]{x1D712}),\nonumber\end{eqnarray}$$
where the term
$C(\unicode[STIX]{x1D712}^{\ast })$
is cancelled out since it is independent of the main variable
$u$
in Lemma 5. We take the parameter
$T=x$
. Then the error term is estimated by
Therefore, we obtain
$$\begin{eqnarray}\displaystyle & & \displaystyle \mathop{\sum }_{t<n\leqslant t+h}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})h\nonumber\\ \displaystyle & & \displaystyle \quad =-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{(t+h)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}-t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}+O((\log qx)^{2})\nonumber\\ \displaystyle & & \displaystyle \quad =-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}\int _{t}^{t+h}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\,du-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{(t+h)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}-t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}+O((\log qx)^{2})\nonumber\\ \displaystyle & & \displaystyle \quad =-\int _{t}^{t+h}\biggl(\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\biggr)\,du-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{(t+h)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}-t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\nonumber\\ \displaystyle & & \displaystyle \qquad +\,O((\log qx)^{2})\nonumber\\ \displaystyle & & \displaystyle \quad =-\unicode[STIX]{x1D713}_{1}(t)-\unicode[STIX]{x1D713}_{2}(t)+O((\log qx)^{2}),\quad \text{say.}\nonumber\end{eqnarray}$$
Substituting this explicit formula into the integral of the assertion, we have
$$\begin{eqnarray}\displaystyle & & \displaystyle \int _{x}^{2x}\biggl|\mathop{\sum }_{t<n\leqslant t+h}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})h\biggr|^{2}\,dt\nonumber\\ \displaystyle & & \displaystyle \quad \ll \,\int _{x}^{2x}|\unicode[STIX]{x1D713}_{1}(t)|^{2}\,dt+\int _{x}^{2x}|\unicode[STIX]{x1D713}_{2}(t)|^{2}\,dt+x(\log qx)^{4}.\nonumber\end{eqnarray}$$
Hence it suffices to prove the two estimates
since
$B_{q}^{\ast }\geqslant 1/2$
implies
$x(\log qx)^{4}\leqslant hx^{2B_{q}^{\ast }}(\log qx)^{4}$
.
Applying the Cauchy–Schwarz inequality to the first integral we have
$$\begin{eqnarray}|\unicode[STIX]{x1D713}_{1}(t)|^{2}\ll h\int _{t}^{t+h}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\biggr|^{2}\,du\end{eqnarray}$$
so that
$$\begin{eqnarray}\displaystyle \hspace{-2.0pt}\int _{x}^{2x}|\unicode[STIX]{x1D713}_{1}(t)|^{2}\,dt & \ll & \displaystyle h\int _{x}^{2x}\int _{t}^{t+h}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\biggr|^{2}\,du\,dt\nonumber\\ \displaystyle & = & \displaystyle h\int _{x}^{2x+h}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\biggr|^{2}\biggl(\int _{\max (u-h,x)}^{\min (u,2x)}\,dt\biggr)\,du\nonumber\\ \displaystyle & \ll & \displaystyle h^{2}\int _{x}^{3x}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}-1}\biggr|^{2}\,du\,\ll \,h^{2}x^{-2}\int _{x}^{3x}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}u^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggr|^{2}\,du\nonumber\end{eqnarray}$$
since
$h\leqslant x$
. We now expand the square and integrate over
$u$
. This gives
$$\begin{eqnarray}\int _{x}^{2x}|\unicode[STIX]{x1D713}_{1}(t)|^{2}\,dt\ll h^{2}x^{-2}\sum _{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}^{\prime } \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|,|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|\leqslant x/h}}\frac{x^{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}^{\prime }+1}}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|}.\end{eqnarray}$$
From Lemma 1 we can estimate
$\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}$
and
$\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}^{\prime }}$
by
$B_{q}^{\ast }$
. Therefore,
$$\begin{eqnarray}\displaystyle \int _{x}^{2x}|\unicode[STIX]{x1D713}_{1}(t)|^{2}\,dt & \ll & \displaystyle h^{2}x^{2B_{q}^{\ast }-1}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}^{\prime } \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|\leqslant x}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|}\nonumber\\ \displaystyle & \ll & \displaystyle h^{2}x^{2B_{q}^{\ast }-1}(\log qx)^{2}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x/h}}1\ll hx^{2B_{q}^{\ast }}(\log qx)^{3}\nonumber\end{eqnarray}$$
by Lemma 7.
For the latter integral, we ignore the difference as
$$\begin{eqnarray}\displaystyle \int _{x}^{2x}|\unicode[STIX]{x1D713}_{2}(t)|^{2}\,dt & \ll & \displaystyle \int _{x}^{2x}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{(t+h)^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggr|^{2}\,dt+\int _{x}^{2x}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggr|^{2}\,dt\nonumber\\ \displaystyle & = & \displaystyle \int _{x+h}^{2x+h}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggr|^{2}\,dt+\int _{x}^{2x}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggr|^{2}\,dt\nonumber\\ \displaystyle & \ll & \displaystyle \int _{x}^{3x}\biggl|\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{t^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\biggr|^{2}\,dt.\nonumber\end{eqnarray}$$
Then we expand the square and integrate over
$t$
. This gives
$$\begin{eqnarray}\int _{x}^{2x}|\unicode[STIX]{x1D713}_{2}(t)|^{2}\,dt\ll \sum _{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}},\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}^{\prime } \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|,|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|\leqslant x}}\frac{x^{\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}+\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D712}}^{\prime }+1}}{|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}||\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|(1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|)}.\end{eqnarray}$$
Obviously,
By using the symmetry of the terms in
$\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}$
and
$\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}^{\prime }}$
, we have
$$\begin{eqnarray}\displaystyle \int _{x}^{2x}|\unicode[STIX]{x1D713}_{2}(t)|^{2}\,dt & \ll & \displaystyle x^{1+2B_{q}^{\ast }}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{1}{|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|^{2}}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}^{\prime } \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|\leqslant x}}\frac{1}{1+|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}^{\prime }|}\nonumber\\ \displaystyle & \ll & \displaystyle x^{1+2B_{q}^{\ast }}(\log qx)^{2}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ x/h<|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{1}{|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|^{2}}\ll hx^{2B_{q}^{\ast }}(\log qx)^{3},\nonumber\end{eqnarray}$$
where we used Lemma 4 for the last estimate. This completes the proof.◻
Now let
and
where
$e(\unicode[STIX]{x1D6FC})=\exp (2\unicode[STIX]{x1D70B}\text{i}\unicode[STIX]{x1D6FC})$
. Our next task is to translate the previous estimate of the integral into this exponential sum setting.
Lemma 9. Let
$x^{-1}\leqslant \unicode[STIX]{x1D709}\leqslant 1/2$
. For any
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, we have
Proof. We first note that
Thus using Gallagher’s lemma [Reference Gallagher9, Lemma 1], we have
$$\begin{eqnarray}\displaystyle \int _{-\unicode[STIX]{x1D709}}^{\unicode[STIX]{x1D709}}|W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})|^{2}\,d\unicode[STIX]{x1D6FC} & = & \displaystyle \int _{-\unicode[STIX]{x1D709}}^{\unicode[STIX]{x1D709}}\biggl|\mathop{\sum }_{0<n\leqslant x}(\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}))e(n\unicode[STIX]{x1D6FC})\biggr|^{2}\,d\unicode[STIX]{x1D6FC}.\nonumber\\ \displaystyle & \ll & \displaystyle \unicode[STIX]{x1D709}^{2}\int _{-(2\unicode[STIX]{x1D709})^{-1}}^{x}\biggl|\mathop{\sum }_{a(t)<n\leqslant b(t)}(\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}))\biggr|^{2}\,dt,\nonumber\end{eqnarray}$$
where
We decompose this integral as
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{n\leqslant t}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})t & \ll & \displaystyle x^{B_{q}^{\ast }}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}\neq 1-\unicode[STIX]{x1D6FD}_{1} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|}\nonumber\\ \displaystyle & & \displaystyle +\,\biggl|\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})\frac{t^{1-\unicode[STIX]{x1D6FD}_{1}}}{1-\unicode[STIX]{x1D6FD}_{1}}-C(\unicode[STIX]{x1D712}^{\ast })\biggr|+(\log qx)^{2}\nonumber\end{eqnarray}$$
for
$2\leqslant t\leqslant 2x$
. The second term on the right-hand side is estimated by using [Reference Montgomery and Vaughan15, Theorem 11.4 and formula (12.7)] as
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})\frac{t^{1-\unicode[STIX]{x1D6FD}_{1}}}{1-\unicode[STIX]{x1D6FD}_{1}}-C(\unicode[STIX]{x1D712}^{\ast }) & = & \displaystyle \unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})\frac{t^{1-\unicode[STIX]{x1D6FD}_{1}}-1}{1-\unicode[STIX]{x1D6FD}_{1}}+O(\log 2q)\nonumber\\ \displaystyle & = & \displaystyle \unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})\frac{\log t}{1-\unicode[STIX]{x1D6FD}_{1}}\int _{0}^{1-\unicode[STIX]{x1D6FD}_{1}}t^{\unicode[STIX]{x1D70E}}\,d\unicode[STIX]{x1D70E}+O(\log 2q)\nonumber\\ \displaystyle & \ll & \displaystyle x^{1-\unicode[STIX]{x1D6FD}_{1}}(\log 2x)+\log 2q\ll x^{1/2}(\log qx),\nonumber\end{eqnarray}$$
since
$\unicode[STIX]{x1D6FD}_{1}>1/2$
. Thus, by Lemma 3, we have
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{n\leqslant t}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})t & \ll & \displaystyle x^{B_{q}^{\ast }}(\log qx)^{2}+x^{1/2}(\log qx)+(\log qx)^{2}\nonumber\\ \displaystyle & \ll & \displaystyle x^{B_{q}^{\ast }}(\log qx)^{2},\nonumber\end{eqnarray}$$
which also holds trivially for
$0\leqslant t<2$
. Thus for any
$0\leqslant a\leqslant b\leqslant 2x$
, we have
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{a<n\leqslant b}(\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})) & = & \displaystyle \mathop{\sum }_{a<n\leqslant b}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})(b-a)+O(1)\nonumber\\ \displaystyle & \ll & \displaystyle x^{B_{q}^{\ast }}(\log qx)^{2}.\nonumber\end{eqnarray}$$
By substituting this estimate into
$I_{\pm }$
, we obtain
since
$I_{\pm }$
are integrals taken over intervals of length
${\leqslant}\unicode[STIX]{x1D709}^{-1}$
. Finally,
$$\begin{eqnarray}\displaystyle \unicode[STIX]{x1D709}^{2}I & = & \displaystyle \unicode[STIX]{x1D709}^{2}\int _{(2\unicode[STIX]{x1D709})^{-1}}^{x-(2\unicode[STIX]{x1D709})^{-1}}\biggl|\mathop{\sum }_{t<n\leqslant t+(2\unicode[STIX]{x1D709})^{-1}}(\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}))\biggr|^{2}\,dt\nonumber\\ \displaystyle & \ll & \displaystyle \unicode[STIX]{x1D709}^{2}\int _{(2\unicode[STIX]{x1D709})^{-1}}^{x}\biggl|\mathop{\sum }_{t<n\leqslant t+(2\unicode[STIX]{x1D709})^{-1}}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})(2\unicode[STIX]{x1D709})^{-1}\biggr|^{2}\,dt+\unicode[STIX]{x1D709}^{2}x\nonumber\\ \displaystyle & \ll & \displaystyle \unicode[STIX]{x1D709}^{2}\mathop{\sum }_{k=0}^{O(\log x)}\int _{x/2^{k+1}}^{x/2^{k}}\biggl|\mathop{\sum }_{t<n\leqslant t+(2\unicode[STIX]{x1D709})^{-1}}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})(2\unicode[STIX]{x1D709})^{-1}\biggr|^{2}\,dt+\unicode[STIX]{x1D709}^{2}x\nonumber\\ \displaystyle & \ll & \displaystyle \unicode[STIX]{x1D709}x^{2B_{q}^{\ast }}(\log qx)^{4}\nonumber\end{eqnarray}$$
by Lemma 8. Summing up the above calculations, we obtain the lemma. ◻
Let
Now by using the previous results we can obtain an estimate for this quantity.
Lemma 10. We have
Proof. We dissect the integral dyadically as
$$\begin{eqnarray}\displaystyle J(\unicode[STIX]{x1D712}) & {\leqslant} & \displaystyle \int _{|\unicode[STIX]{x1D6FC}|\leqslant 1/x}|W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})|^{2}|T(\unicode[STIX]{x1D6FC})|\,d\unicode[STIX]{x1D6FC}\nonumber\\ \displaystyle & & \displaystyle +\,\mathop{\sum }_{k=1}^{O(\log x)}\int _{1/2^{k+1}<|\unicode[STIX]{x1D6FC}|\leqslant 1/2^{k}}|W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})|^{2}|T(\unicode[STIX]{x1D6FC})|\,d\unicode[STIX]{x1D6FC}.\nonumber\end{eqnarray}$$
Then since
$T(\unicode[STIX]{x1D6FC})\ll \min (x,|\unicode[STIX]{x1D6FC}|^{-1})$
for
$|\unicode[STIX]{x1D6FC}|\leqslant 1/2$
, we have
by Lemma 9. ◻
6 Proofs of Theorems 2 and 4
We let
$$\begin{eqnarray}\displaystyle & \displaystyle G(n;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})=\mathop{\sum }_{\ell +m=n}\unicode[STIX]{x1D712}_{1}(\ell )\unicode[STIX]{x1D6EC}(\ell )\unicode[STIX]{x1D712}_{2}(m)\unicode[STIX]{x1D6EC}(m), & \displaystyle \nonumber\\ \displaystyle & \displaystyle S(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})=\mathop{\sum }_{n\leqslant x}G(n;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}) & \displaystyle \nonumber\end{eqnarray}$$
and prove the following intermediate lemma.
Lemma 11. For
$x\geqslant 2$
and
$\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}~(\text{mod}\;q)$
, we have
$$\begin{eqnarray}\displaystyle S(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}) & = & \displaystyle \frac{\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{1})\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{2})}{2}x^{2}-\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{2})H(x,\unicode[STIX]{x1D712}_{1})\nonumber\\ \displaystyle & & \displaystyle -\,\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{1})H(x,\unicode[STIX]{x1D712}_{2})+R(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})\nonumber\\ \displaystyle & & \displaystyle +\,O(\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{2})(1+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712}_{1})q^{1/2})x(\log qx)^{2}\nonumber\\ \displaystyle & & \displaystyle +\,\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{1})(1+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712}_{2})q^{1/2})x(\log qx)^{2} ),\nonumber\end{eqnarray}$$
where
$$\begin{eqnarray}\displaystyle & \displaystyle H(x,\unicode[STIX]{x1D712})=\mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}, & \displaystyle \nonumber\\ \displaystyle & \displaystyle R(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})=\int _{0}^{1}W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712}_{1})W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712}_{2})T(-\unicode[STIX]{x1D6FC})\,d\unicode[STIX]{x1D6FC}. & \displaystyle \nonumber\end{eqnarray}$$
Proof. By the orthogonality of the exponential function we have
From the definition we have an expansion
Substituting this decomposition into the integral expression (6.1), we have
where
Therefore it is sufficient to show that
$$\begin{eqnarray}\begin{array}{@{}c@{}}\displaystyle I=\frac{x^{2}}{2}+O(x),\\ \displaystyle I(\unicode[STIX]{x1D712})=\frac{\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})x^{2}}{2}-H(x,\unicode[STIX]{x1D712})+O((1+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2})x(\log qx)^{2}).\end{array}\end{eqnarray}$$
The first integral
$I$
is evaluated by using the orthogonality as
The second integral
$I(\unicode[STIX]{x1D712})$
is
$$\begin{eqnarray}\displaystyle I(\unicode[STIX]{x1D712}) & = & \displaystyle \mathop{\sum }_{\ell +m\leqslant x}\unicode[STIX]{x1D712}(\ell )\unicode[STIX]{x1D6EC}(\ell )=\mathop{\sum }_{n\leqslant x}(x-n)\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)+O(x)\nonumber\\ \displaystyle & = & \displaystyle \mathop{\sum }_{n\leqslant x}\unicode[STIX]{x1D712}(n)\unicode[STIX]{x1D6EC}(n)\int _{n}^{x}\,du+O(x)=\int _{0}^{x}\unicode[STIX]{x1D713}(u,\unicode[STIX]{x1D712})\,du+O(x)\nonumber\end{eqnarray}$$
by partial summation. We substitute Lemma 6 with
$T=x$
. Then
$$\begin{eqnarray}I(\unicode[STIX]{x1D712})=\frac{\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712})x^{2}}{2}-\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}+O(x(\log qx)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2}x).\end{eqnarray}$$
We then extend the sum over zeros which gives the error term of the size
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>x}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\ll x^{2}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>x}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}|^{2}}\ll x(\log qx)^{2},\end{eqnarray}$$
by the use of Lemma 4 in the last estimate. Substituting this estimate into (6.4), we obtain (6.3) for
$I(\unicode[STIX]{x1D712})$
.◻
Now Theorem 2 can be proven.
Proof of Theorem 2.
By the orthogonality of characters, we have
Thus, by Lemma 11, it suffices to show that
By the Cauchy–Schwarz inequality and Lemma 10, the left-hand side above is
This completes the proof. ◻
Remark 6. Though it is true that characters
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
with
$\unicode[STIX]{x1D712}(a)+\unicode[STIX]{x1D712}(b)=0$
have no contribution to the second term on the right-hand side of Theorem 2, we see in the last proof that such characters may contribute to the last term on the right-hand side. This is also true of Theorem 4.
We move on to the proof of Theorem 4. At first, it might seem that we can obtain this asymptotic formula by summing up Theorem 2 over residues. However this procedure violates the uniformity over
$q$
and so instead we take advantage of the “bilinear nature” of the error term
$R(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})$
in Lemma 11. With this in mind we prove the following which will be used in its full generality in the proof of Theorem 3.
Lemma 12. For positive integers
$c,q$
and a character
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\unicode[STIX]{x1D712}(a)=\frac{1}{\unicode[STIX]{x1D719}(q)^{2}}\unicode[STIX]{x1D707}(q^{\ast })\unicode[STIX]{x1D712}^{\ast }(c)\frac{\unicode[STIX]{x1D711}(q)}{\unicode[STIX]{x1D711}(q^{\ast })}\mathop{\prod }_{\substack{ p\mid q \\ p\nmid q^{\ast }c}}\frac{p-2}{p-1}=\frac{1}{\unicode[STIX]{x1D719}(q)^{2}}\mathfrak{S}_{q}(c,\unicode[STIX]{x1D712}),\end{eqnarray}$$
where
$\unicode[STIX]{x1D712}^{\ast }~(\text{mod}\;q^{\ast })$
is the primitive character which induces
$\unicode[STIX]{x1D712}$
.
Proof. By using the Chinese remainder theorem and decomposing the character into the product of characters of prime power moduli it is sufficient to prove the lemma in the case where
$q$
is a prime power, say
$q=p^{k}$
and
$q^{\ast }=p^{\ell }$
. If
$\ell =0$
, then
$$\begin{eqnarray}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\unicode[STIX]{x1D712}(a)=\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),p)=1}}^{p^{k}}1=\mathop{\sum }_{\substack{ a=1 \\ a\not \equiv 0,c\,(\text{mod}\;p)}}^{p^{k}}1=\left\{\begin{array}{@{}ll@{}}\displaystyle p^{k-1}(p-1) & (\text{if }p\mid c),\\ \displaystyle p^{k-1}(p-2) & (\text{if }p\nmid c),\end{array}\right.\end{eqnarray}$$
which coincides with the assertion. If
$\ell \geqslant 1$
, then we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\unicode[STIX]{x1D712}(a)=\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),p)=1}}^{p^{k}}\unicode[STIX]{x1D712}^{\ast }(a)=p^{k-\ell }\mathop{\sum }_{\substack{ a=1 \\ a\not \equiv 0,c\,(\text{mod}\;p)}}^{p^{\ell }}\unicode[STIX]{x1D712}^{\ast }(a).\end{eqnarray}$$
If
$\ell =1$
, then by the orthogonality, this is
$$\begin{eqnarray}=p^{k-1}\biggl(\mathop{\sum }_{a=1}^{p}\unicode[STIX]{x1D712}^{\ast }(a)-\mathop{\sum }_{\substack{ a=1 \\ a\equiv c\,(\text{mod}\;p)}}^{p}\unicode[STIX]{x1D712}^{\ast }(a)\biggr)=\unicode[STIX]{x1D707}(p)\unicode[STIX]{x1D712}^{\ast }(c)\frac{\unicode[STIX]{x1D711}(p^{k})}{\unicode[STIX]{x1D711}(p)},\end{eqnarray}$$
which also coincides with the assertion. If
$\ell \geqslant 2$
, then by [Reference Montgomery and Vaughan15, Theorem 9.4] we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\unicode[STIX]{x1D712}(a)=p^{k-\ell }\biggl(\mathop{\sum }_{a=1}^{p^{\ell }}\unicode[STIX]{x1D712}^{\ast }(a)-\mathop{\sum }_{\substack{ a=1 \\ a\equiv c\,(\text{mod}\;p)}}^{p^{\ell }}\unicode[STIX]{x1D712}^{\ast }(a)\biggr)=0,\end{eqnarray}$$
which again satisfies the claimed equality. ◻
Proof of Theorem 4.
By using the symmetry between
$\ell$
and
$m$
, we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}G(n)=\mathop{\sum }_{\substack{ \ell +m\leqslant x \\ \ell +m\equiv c\,(\text{mod}\;q) \\ (\ell m,q)=1}}\unicode[STIX]{x1D6EC}(\ell )\unicode[STIX]{x1D6EC}(m)+O\biggl(\mathop{\sum }_{\substack{ \ell +m\leqslant x \\ \ell +m\equiv c\,(\text{mod}\;q) \\ (m,q)>1}}\unicode[STIX]{x1D6EC}(\ell )\unicode[STIX]{x1D6EC}(m)\biggr).\end{eqnarray}$$
This error term can be estimated as
$$\begin{eqnarray}\mathop{\sum }_{\substack{ \ell +m\leqslant x \\ \ell +m\equiv c\,(\text{mod}\;q) \\ (m,q)>1}}\unicode[STIX]{x1D6EC}(\ell )\unicode[STIX]{x1D6EC}(m)\ll \mathop{\sum }_{\ell \leqslant x}\unicode[STIX]{x1D6EC}(\ell )\mathop{\sum }_{\substack{ m\leqslant x \\ (m,q)>1}}\unicode[STIX]{x1D6EC}(m)\ll x(\log qx)^{2},\end{eqnarray}$$
using the same estimate as in (2.3). Thus it suffices to consider
$$\begin{eqnarray}\displaystyle & & \displaystyle \mathop{\sum }_{\substack{ \ell +m\leqslant x \\ \ell +m\equiv c\,(\text{mod}\;q) \\ (\ell m,q)=1}}\unicode[STIX]{x1D6EC}(\ell )\unicode[STIX]{x1D6EC}(m)\nonumber\\ \displaystyle & & \displaystyle \quad =\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\mathop{\sum }_{\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}_{1}(a)}\overline{\unicode[STIX]{x1D712}_{2}(c-a)}S(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}).\nonumber\end{eqnarray}$$
We apply Lemma 11 to the right-hand side, and evaluate the resulting expression. Clearly,
$$\begin{eqnarray}\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\mathop{\sum }_{\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}\,(\text{mod}\;q)}\unicode[STIX]{x1D6FF}_{0}(\unicode[STIX]{x1D712}_{2})(1+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712}_{1})q^{1/2})x(\log qx)^{2}\ll x(\log qx)^{2}.\end{eqnarray}$$
Also,
$$\begin{eqnarray}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}1=\unicode[STIX]{x1D711}(q)^{2}\mathfrak{S}_{q}(c)\end{eqnarray}$$
by Lemma 12 with the principal character. Therefore, it suffices to show that
$$\begin{eqnarray}\displaystyle R & = & \displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\mathop{\sum }_{\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}_{1}(a)}\overline{\unicode[STIX]{x1D712}_{2}(c-a)}R(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})\nonumber\\ \displaystyle & \ll & \displaystyle x^{2B_{q}^{\ast }}(\log qx)^{5}.\nonumber\end{eqnarray}$$
We have
$$\begin{eqnarray}\displaystyle & & \displaystyle \mathop{\sum }_{\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}_{1}(a)}\overline{\unicode[STIX]{x1D712}_{2}(c-a)}R(x;\unicode[STIX]{x1D712}_{1},\unicode[STIX]{x1D712}_{2})\nonumber\\ \displaystyle & & \displaystyle \quad =\int _{0}^{1}\biggl(\mathop{\sum }_{\unicode[STIX]{x1D712}_{1}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}_{1}(a)}W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712}_{1})\biggr)\biggl(\mathop{\sum }_{\unicode[STIX]{x1D712}_{2}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}_{2}(c-a)}W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712}_{2})\biggr)T(-\unicode[STIX]{x1D6FC})\,d\unicode[STIX]{x1D6FC}.\nonumber\end{eqnarray}$$
Next the Cauchy–Schwarz inequality gives
$$\begin{eqnarray}R\ll \frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\int _{-1/2}^{1/2}\biggl|\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(a)}W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})\biggr|^{2}|T(\unicode[STIX]{x1D6FC})|\,d\unicode[STIX]{x1D6FC}.\end{eqnarray}$$
By the orthogonality of characters, we have
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\biggl|\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(a)}W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})\biggr|^{2} & \ll & \displaystyle \mathop{\sum }_{\substack{ a=1 \\ (a,q)=1}}^{q}\biggl|\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\overline{\unicode[STIX]{x1D712}(a)}W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})\biggr|^{2}\nonumber\\ \displaystyle & = & \displaystyle \unicode[STIX]{x1D711}(q)\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}|W(\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D712})|^{2}.\nonumber\end{eqnarray}$$
Thus, by Lemma 10,
Summing up the above calculations, we complete the proof. ◻
7 The connection between
$S(x;q,a,b)$
and GRH
Consider the Dirichlet series
which converges absolutely and is analytic for
$\unicode[STIX]{x1D70E}>2$
. Analytic properties of
$F(s)$
have been studied by Egami and the third author [Reference Egami, Matsumoto, Kanemitsu and Liu6], the first author and Schlage-Puchta [Reference Bhowmik and Schlage-Puchta4] (in the case
$q=1$
), and by Rüppel [Reference Rüppel16] (general case). In particular, the connection between
$S(x;q,a,b)$
and GRH can be understood through the analytic continuation of
$F(s)$
. We first find the meromorphic continuation of
$F(s)$
via Theorem 2 in the following proposition. This type of result, under GRH was obtained in [Reference Egami, Matsumoto, Kanemitsu and Liu6, Reference Rüppel16].
Proposition 3. Assume
$B_{q}<1$
. The function
$F(s)$
can be continued meromorphically to the half plane
$\unicode[STIX]{x1D70E}>2B_{q}$
. Its poles in the half plane
$\unicode[STIX]{x1D70E}>2B_{q}$
are:
(i) a simple pole at
$s=2$
with residue
$\unicode[STIX]{x1D711}(q)^{-2}$
;(ii) a possible pole at
$s=\unicode[STIX]{x1D70C}_{q}+1$
of at most order
$1$
with residue where
$$\begin{eqnarray}r(\unicode[STIX]{x1D70C}_{q})=-\frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\frac{1}{\unicode[STIX]{x1D70C}_{q}}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D712}\,(\text{mod}\;q) \\ L(\unicode[STIX]{x1D70C}_{q},\unicode[STIX]{x1D712})=0}}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})m_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{q}),\end{eqnarray}$$
$\unicode[STIX]{x1D70C}_{q}$
is a zero of
$\prod _{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}L(s,\unicode[STIX]{x1D712})$
with
$0<\Re \unicode[STIX]{x1D70C}_{q}<1$
and
$m_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{q})$
is the multiplicity of
$\unicode[STIX]{x1D70C}_{q}$
as a zero of
$L(s,\unicode[STIX]{x1D712})$
.
In particular, assuming DZC and
$\overline{\unicode[STIX]{x1D712}}(a)+\overline{\unicode[STIX]{x1D712}}(b)\neq 0$
for all
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
we obtain
Proof. From Theorem 2, we have
for
$x\geqslant 1$
, where
since
$B_{q}^{\ast }\leqslant B_{q}$
. For
$\unicode[STIX]{x1D70E}>2$
, we have
with integration by parts, because
$S(x;q,a,b)=0$
for
$x<4$
. Substitute (7.1) in the right-hand side of the above. The swapping of summation and integration is justified due to absolute convergence. Therefore we have
$$\begin{eqnarray}\displaystyle F(s) & = & \displaystyle \frac{s}{2\unicode[STIX]{x1D711}(q)^{2}(s-2)}+\mathop{\sum }_{\unicode[STIX]{x1D70C}_{q}}\frac{r(\unicode[STIX]{x1D70C}_{q})s}{(\unicode[STIX]{x1D70C}_{q}+1)(s-\unicode[STIX]{x1D70C}_{q}-1)}\nonumber\\ \displaystyle & & \displaystyle +\,s\int _{1}^{\infty }E(u;q,a,b)u^{-s-1}\,du\nonumber\\ \displaystyle & = & \displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)^{2}(s-2)}+\mathop{\sum }_{\unicode[STIX]{x1D70C}_{q}}\frac{r(\unicode[STIX]{x1D70C}_{q})}{s-\unicode[STIX]{x1D70C}_{q}-1}+s\int _{1}^{\infty }E(u;q,a,b)u^{-s-1}\,du\nonumber\\ \displaystyle & & \displaystyle +\,C_{1}(q,a,b),\end{eqnarray}$$
where
and the sum converges due to Lemma 4 to yield a certain constant depending on
$a,b,q$
. The sum on the right-hand side of (7.3) converges uniformly on every compact subset of
$\mathbb{C}\setminus \{\unicode[STIX]{x1D70C}_{q}+1\}$
and determines a meromorphic function on
$\mathbb{C}$
. (Since for
$|\Im \unicode[STIX]{x1D70C}_{q}|=|\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>2|\Im s|$
, we have
$|\unicode[STIX]{x1D70C}_{q}+1-s|\geqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}-\Im s|\geqslant |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|/2$
, then the uniform convergence on compact subsets can be justified by Lemma 4. Further, note that in Lemma 4, each zero appears with multiplicity.) The first and second term on the right-hand side of (7.3) already give the announced residues of the proposition. Using the estimate (7.2) we see that the integral
converges uniformly on the half plane
$\unicode[STIX]{x1D70E}>2B_{q}$
and so it defines an analytic function on
$\unicode[STIX]{x1D70E}>2B_{q}$
. This completes the proof of the meromorphic continuation.
For the last assertion, the inequality
follows from the above meromorphic continuation, since
$1+B_{q}\geqslant 2B_{q}$
. We next prove the reverse inequality. If
$B_{q}=1/2$
, then the implication is trivial. Hence we can assume that
$1/2<B_{q}<1$
and we have
$\max (2B_{q},3/2)<1+B_{q}$
, so that we can take
$\unicode[STIX]{x1D700}>0$
such that
$\max (2B_{q},3/2)<1+B_{q}-\unicode[STIX]{x1D700}$
. By the definition of
$B_{q}$
, we can find a zero
$\unicode[STIX]{x1D70C}_{q}$
such that
$1/2<B_{q}-\unicode[STIX]{x1D700}<\Re \unicode[STIX]{x1D70C}_{q}$
. Then by the above meromorphic continuation, we have a possible pole of
$F(s)$
of residue
$r(\unicode[STIX]{x1D70C}_{q})$
at
$\unicode[STIX]{x1D70C}_{q}+1$
. (Note that we do not necessarily have meromorphic continuation on
$\unicode[STIX]{x1D70E}>1+B_{q}-\unicode[STIX]{x1D700}$
if
$B_{q}=1$
, since then
$B_{q}+1-\unicode[STIX]{x1D700}=2B_{q}-\unicode[STIX]{x1D700}<2B_{q}$
.) By DZC and the assumption that
$\Re \unicode[STIX]{x1D70C}_{q}>1/2$
we have
where
$m\geqslant 1$
. Since we have assumed that
$\overline{\unicode[STIX]{x1D712}}(a)+\overline{\unicode[STIX]{x1D712}}(b)\neq 0$
for all
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
, this residue is non-zero so that
$\unicode[STIX]{x1D70C}_{q}+1$
is a pole of
$F(s)$
in the half plane
$\unicode[STIX]{x1D70E}>1+B_{q}-\unicode[STIX]{x1D700}>3/2$
. This implies
so that on letting
$\unicode[STIX]{x1D700}\rightarrow 0$
we obtain the reverse inequality.◻
Remark 7. The condition
$\unicode[STIX]{x1D712}(a)+\unicode[STIX]{x1D712}(b)\neq 0$
for all
$\unicode[STIX]{x1D712}~(\text{mod}\;q)$
occurs naturally in the proof of Proposition 3. It could be replaced by a weaker one which would be rather difficult to state.
We can now prove Theorem 1.
Proof of Theorem 1.
First we prove the assertion (1). If
$q>x^{(1-B_{q}^{\ast })/2}(\log x)$
, then the left-hand side of (1.2) is
$$\begin{eqnarray}{\leqslant}\biggl(\mathop{\sum }_{\substack{ \ell \leqslant x \\ \ell \equiv a\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(\ell )\biggr)\biggl(\mathop{\sum }_{\substack{ m\leqslant x \\ m\equiv b\,(\text{mod}\;q)}}\unicode[STIX]{x1D6EC}(m)\biggr)\ll \frac{(x\log x)^{2}}{q^{2}}+(\log x)^{2}\ll x^{1+B_{q}^{\ast }}.\end{eqnarray}$$
Since the first term on the right-hand side of (1.2) is
$\ll x^{1+B_{q}^{\ast }}$
, (1.2) holds trivially. Therefore we may assume
$q\leqslant x^{(1-B_{q}^{\ast })/2}(\log x)$
. By using Lemma 1 and the second estimate of Lemma 4 we obtain
$$\begin{eqnarray}\displaystyle & & \displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle \quad \ll \,\frac{x^{B_{q}^{\ast }+1}}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}((\log 2q)^{2}+\unicode[STIX]{x1D6FF}_{1}(\unicode[STIX]{x1D712})q^{1/2}(\log q)^{2})\ll x^{1+B_{q}^{\ast }}.\nonumber\end{eqnarray}$$
Now from the second estimate of Lemma 4 we have
$$\begin{eqnarray}\displaystyle \frac{1}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}(\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)})\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>x}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)} & \ll & \displaystyle \frac{x}{\unicode[STIX]{x1D711}(q)^{2}}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\log qx\nonumber\\ \displaystyle & \ll & \displaystyle x^{1+B_{q}^{\ast }}.\nonumber\end{eqnarray}$$
Therefore, by Theorem 2, we obtain
If
$1-B_{q}^{\ast }>5\log \log x/\!\log x$
, then we see that
so that (1.2) follows. Thus we may assume that
$1-B_{q}^{\ast }\leqslant 5\log \log x/\!\log x$
. Further using the assumption on
$q$
we find that
$q\leqslant x^{(1-B_{q}^{\ast })/2}(\log x)\leqslant (\log x)^{7/2}$
. At this point we recall the definition of
$\unicode[STIX]{x1D702}=\unicode[STIX]{x1D702}_{q}(x)$
and choose
$\unicode[STIX]{x1D6FF}=1/7$
to obtain
$$\begin{eqnarray}\displaystyle B_{q}^{\ast }\leqslant 1-\unicode[STIX]{x1D702} & {\leqslant} & \displaystyle 1-\frac{c_{1}}{\max ((\log x)^{1/2},(\log x)^{2/3}(\log \log x)^{1/3})}\nonumber\\ \displaystyle & = & \displaystyle 1-\frac{c_{1}}{(\log x)^{2/3}(\log \log x)^{1/3}},\nonumber\end{eqnarray}$$
where
$c_{1}=c_{1}(1/7)$
is an absolute constant. This gives
Therefore we always arrive at (1.2).
We next prove the assertion (2). Assume that the formula (1.3) holds, i.e.
for arbitrary
$\unicode[STIX]{x1D700}>0$
and use it to obtain the meromorphic continuation of
$F(s)$
. In the same manner as in the proof of Proposition 3 we have
for
$\unicode[STIX]{x1D70E}>2$
. Then, by (7.4), the right-hand side gives an analytic function on
$\unicode[STIX]{x1D70E}>1+d$
. Therefore under the last assertion of Proposition 3, we have
$B_{q}\leqslant d$
provided that DZC holds, that
$B_{q}<1$
and that
$\overline{\unicode[STIX]{x1D712}(a)}+\overline{\unicode[STIX]{x1D712}(b)}\neq 0$
for any
$\unicode[STIX]{x1D712}\,(\text{mod}\;q)$
. This now completes the proof. The supplement for the case
$a=b$
is proved in §8.◻
We next move on to Theorem 3. The strategy is the same as in the proof of Theorem 1. We consider the Dirichlet series
$$\begin{eqnarray}F_{1}(s)=F_{1}(s;q;c)=\mathop{\sum }_{\substack{ n=1 \\ n\equiv c\,(\text{mod}\;q)}}^{\infty }\frac{G(n)}{n^{s}}.\end{eqnarray}$$
The meromorphic continuation of
$F_{1}(s)$
is obtained via Theorem 4.
Proposition 4. Assume
$B_{q}<1$
. The function
$F_{1}(s)$
can be continued meromorphically to the half plane
$\unicode[STIX]{x1D70E}>2B_{q}$
. Its poles in the half plane
$\unicode[STIX]{x1D70E}>2B_{q}$
are:
(i) a possible pole at
$s=2$
of order at most 1 with residue
$\mathfrak{S}_{q}(c)$
;(ii) a possible pole at
$s=\unicode[STIX]{x1D70C}_{q}+1$
of at most order 1 with residue where
$$\begin{eqnarray}r_{1}(\unicode[STIX]{x1D70C}_{q})=-\frac{2}{\unicode[STIX]{x1D711}(q)^{2}}\frac{1}{\unicode[STIX]{x1D70C}_{q}}\mathop{\sum }_{\substack{ \unicode[STIX]{x1D712}\,(\text{mod}\;q) \\ L(\unicode[STIX]{x1D70C}_{q},\unicode[STIX]{x1D712})=0}}m_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{q})\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\overline{\unicode[STIX]{x1D712}(a)},\end{eqnarray}$$
$\unicode[STIX]{x1D70C}_{q}$
is a zero of
$\prod _{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}L(s,\unicode[STIX]{x1D712})$
with
$0<\Re \unicode[STIX]{x1D70C}<1$
.
Proof. This can be proven in the same manner as Proposition 3. ◻
We also require the following lemma.
Lemma 13. For
$x\geqslant 2$
and positive integers
$c,q$
, we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}J(n)=\frac{\mathfrak{S}_{q}(c)}{2}x^{2}+O(x\log x).\end{eqnarray}$$
Proof. We first consider the case of
$(2,q)\nmid c$
, i.e.
$q$
is even while
$c$
is odd. Since there is no even number
$n\equiv c~(\text{mod}\;q)$
the sum on the left-hand side is
$0$
since
$J(n)=0$
for odd
$n$
. Also,
$\mathfrak{S}_{q}(c)=0$
by definition in this case. Thus the assertion trivially holds for
$(2,q)\nmid c$
. We next consider the case
$(2,q)\mid c$
. We use an expression
$$\begin{eqnarray}J(2N)=2C_{2}N\mathop{\sum }_{\substack{ d|N \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}}{\unicode[STIX]{x1D711}_{2}(d)},\qquad \unicode[STIX]{x1D711}_{2}(n)=\mathop{\prod }_{p\mid n}(p-2),\end{eqnarray}$$
to obtain
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}J(n)=\mathop{\sum }_{\substack{ 2N\leqslant x \\ 2N\equiv c\,(\text{mod}\;q)}}J(2N)=2C_{2}\mathop{\sum }_{\substack{ d\leqslant x \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}d}{\unicode[STIX]{x1D711}_{2}(d)}\mathop{\sum }_{\substack{ 2dn\leqslant x \\ 2dn\equiv c\,(\text{mod}\;q)}}n.\end{eqnarray}$$
Let
$q_{1}=q/(2d,q)$
. The congruence
has a solution, say
$c_{1}~(\text{mod}\;q_{1})$
if
$(2d,q)\mid c$
, and no solution if
$(2d,q)\nmid c$
. Moreover, the condition
$(2d,q)\mid c$
is equivalent to
$(d,q)\mid c$
since
$d$
is odd and
$(2,q)\mid c$
. Hence from (7.5), we have
$$\begin{eqnarray}\displaystyle & & \displaystyle \mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}J(n)=2C_{2}\mathop{\sum }_{\substack{ d\leqslant x/2 \\ d:\,\text{odd} \\ (d,q)\mid c}}\frac{\unicode[STIX]{x1D707}(d)^{2}d}{\unicode[STIX]{x1D711}_{2}(d)}\mathop{\sum }_{\substack{ n\leqslant x/2d \\ n\equiv c_{1}\,(\text{mod}\;q_{1})}}n\nonumber\\ \displaystyle & & \displaystyle \quad =\frac{C_{2}x^{2}}{4q}\mathop{\sum }_{\substack{ d\leqslant x/2 \\ d:\,\text{odd} \\ (d,q)\mid c}}\frac{\unicode[STIX]{x1D707}(d)^{2}(2d,q)}{d\unicode[STIX]{x1D711}_{2}(d)}+O\biggl(x\mathop{\sum }_{\substack{ d\leqslant x/2 \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}}{\unicode[STIX]{x1D711}_{2}(d)}\biggr).\end{eqnarray}$$
As for the second term on the right-hand side of (7.6), we have
$$\begin{eqnarray}\mathop{\sum }_{\substack{ d\leqslant x/2 \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}}{\unicode[STIX]{x1D711}_{2}(d)}\leqslant \mathop{\prod }_{2<p\leqslant x}\biggl(1+\frac{1}{p-2}\biggr)\ll \log x.\end{eqnarray}$$
For the first term on the right-hand side of (7.6), we have
$$\begin{eqnarray}\frac{C_{2}}{4q}\mathop{\sum }_{\substack{ d\leqslant x/2 \\ d:\,\text{odd} \\ (d,q)\mid c}}\frac{\unicode[STIX]{x1D707}(d)^{2}(2d,q)}{d\unicode[STIX]{x1D711}_{2}(d)}=\frac{C_{2}\cdot (2,q)}{4q}\mathop{\sum }_{\substack{ d:\,\text{odd} \\ (d,q)\mid c}}\frac{\unicode[STIX]{x1D707}(d)^{2}(d,q)}{d\unicode[STIX]{x1D711}_{2}(d)}+O\biggl(\mathop{\sum }_{\substack{ d>x/2 \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}}{d\unicode[STIX]{x1D711}_{2}(d)}\biggr).\end{eqnarray}$$
This remainder term is estimated by using (7.7) as
$$\begin{eqnarray}\mathop{\sum }_{\substack{ d>x/2 \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}}{d\unicode[STIX]{x1D711}_{2}(d)}=\mathop{\sum }_{\substack{ d>x/2 \\ d:\,\text{odd}}}\frac{\unicode[STIX]{x1D707}(d)^{2}}{\unicode[STIX]{x1D711}_{2}(d)}\int _{d}^{\infty }\,\frac{du}{u^{2}}\leqslant \int _{x/2}^{\infty }\biggl(\mathop{\sum }_{\substack{ d\leqslant u \\ d:\,\text{odd}}}\,\frac{\unicode[STIX]{x1D707}(d)^{2}}{\unicode[STIX]{x1D711}_{2}(d)}\biggr)\,\frac{du}{u^{2}}\ll \frac{\log x}{x}.\end{eqnarray}$$
On the other hand we have
$$\begin{eqnarray}\frac{C_{2}\cdot (2,q)}{4q}\mathop{\sum }_{\substack{ d:\,\text{odd} \\ (d,q)\mid c}}\frac{\unicode[STIX]{x1D707}(d)^{2}(d,q)}{d\unicode[STIX]{x1D711}_{2}(d)}=\frac{C_{2}\cdot (2,q)}{4q}\mathop{\prod }_{\substack{ p>2 \\ p\mid (q,c)}}\frac{p-1}{p-2}\mathop{\prod }_{\substack{ p>2 \\ p\nmid q}}\frac{(p-1)^{2}}{p(p-2)}.\end{eqnarray}$$
Using the definition of
$C_{2}$
, i.e.
the right-hand side of the above is equal to
$$\begin{eqnarray}=\frac{(2,q)}{2q}\mathop{\prod }_{\substack{ p>2 \\ p\mid (q,c)}}\frac{p}{p-1}\mathop{\prod }_{\substack{ p>2 \\ p\mid q \\ p\nmid c}}\frac{p(p-2)}{(p-1)^{2}}=\frac{\mathfrak{S}_{q}(c)}{2}\end{eqnarray}$$
when
$(2,q)\mid c$
. Substituting (7.9) and (7.10) into (7.8), we have
$$\begin{eqnarray}\frac{C_{2}}{4q}\mathop{\sum }_{\substack{ d\leqslant x \\ d:\,\text{odd} \\ (d,q)\mid c}}\frac{\unicode[STIX]{x1D707}(d)^{2}(2d,q)}{d\unicode[STIX]{x1D711}_{2}(d)}=\frac{\mathfrak{S}_{q}(c)}{2}+O\biggl(\frac{\log x}{x}\biggr).\end{eqnarray}$$
We finally prove Theorem 3.
Proof of Theorem 3.
We first prove (1). By using Lemmas 1 and 12,
$$\begin{eqnarray}\displaystyle & & \displaystyle \mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathfrak{S}_{q}(c,\overline{\unicode[STIX]{x1D712}})\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|\leqslant x}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)}\nonumber\\ \displaystyle & & \displaystyle \quad \ll \frac{x^{B_{q}^{\ast }+1}}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\frac{1}{\unicode[STIX]{x1D711}(q^{\ast })}\mathop{\sum }_{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}\frac{1}{|\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)|}.\nonumber\end{eqnarray}$$
By Lemma 4, this can be estimated as
$$\begin{eqnarray}\displaystyle & & \displaystyle \ll x^{1+B_{q}^{\ast }}\frac{q^{1/2}(\log 2q)^{2}}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\frac{1}{\unicode[STIX]{x1D711}(q^{\ast })}\nonumber\\ \displaystyle & & \displaystyle \ll x^{1+B_{q}^{\ast }}\frac{q^{1/2}(\log 2q)^{2}}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{q^{\ast }|q}\frac{1}{\unicode[STIX]{x1D711}(q^{\ast })}\sum ^{\ast }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q^{\ast })}1\nonumber\\ \displaystyle & & \displaystyle \leqslant x^{1+B_{q}^{\ast }}\frac{q^{1/2}(\log 2q)^{2}\unicode[STIX]{x1D70F}(q)}{\unicode[STIX]{x1D711}(q)}\ll x^{1+B_{q}^{\ast }}\nonumber\end{eqnarray}$$
where the summation symbol with
$\ast$
denotes the sum over primitive characters and
$\unicode[STIX]{x1D70F}(q)$
denotes the number of divisors of
$q$
. Similarly, by Lemma 4, we also have
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\mathfrak{S}_{q}(c,\overline{\unicode[STIX]{x1D712}})\mathop{\sum }_{\substack{ \unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}} \\ |\unicode[STIX]{x1D6FE}_{\unicode[STIX]{x1D712}}|>x}}\frac{x^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1}}{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}(\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}+1)} & \ll & \displaystyle \frac{x}{\unicode[STIX]{x1D711}(q)}\mathop{\sum }_{\unicode[STIX]{x1D712}\,(\text{mod}\;q)}\frac{\log qx}{\unicode[STIX]{x1D711}(q^{\ast })}\nonumber\\ \displaystyle & \ll & \displaystyle x\frac{\unicode[STIX]{x1D70F}(q)\log qx}{\unicode[STIX]{x1D711}(q)}\ll x^{1+B_{q}^{\ast }}.\nonumber\end{eqnarray}$$
Thus Theorem 4 gives
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}G(n)=\frac{\mathfrak{S}_{q}(c)}{2}x^{2}+O(x^{1+B_{q}^{\ast }}+x^{2B_{q}^{\ast }}(\log qx)^{5}).\end{eqnarray}$$
Then an argument similar to that for (1) of Theorem 1 gives (1.9).
We next prove (2). Assume that formula (1.10) holds. Then by Lemma 13,
$$\begin{eqnarray}\mathop{\sum }_{\substack{ n\leqslant x \\ n\equiv c\,(\text{mod}\;q)}}G(n)=\frac{\mathfrak{S}_{q}(c)}{2}x^{2}+E_{d}(x),\qquad E_{d}(x)\ll _{q,\unicode[STIX]{x1D700}}x^{1+d+\unicode[STIX]{x1D700}}\end{eqnarray}$$
for arbitrary
$\unicode[STIX]{x1D700}>0$
. As in the case of
$F(s)$
we can obtain the meromorphic continuation of
$F_{1}(s)$
to the half plane
$\unicode[STIX]{x1D70E}>1+d$
, which has only one possible pole at
$s=2$
. We compare this analytic continuation with Proposition 4. By assumption (a) we have
$B_{q}=\Re \unicode[STIX]{x1D70C}_{0}<1$
so that
$2B_{q}<1+\Re \unicode[STIX]{x1D70C}_{0}$
. Thus by using assumption (b)
$F_{1}(s)$
has a possible pole of order
${\leqslant}1$
with residue
$$\begin{eqnarray}-\!\frac{2}{\unicode[STIX]{x1D711}(q)^{2}}\frac{m}{\unicode[STIX]{x1D70C}_{0}}\mathop{\sum }_{\substack{ a=1 \\ (a(c-a),q)=1}}^{q}\overline{\unicode[STIX]{x1D712}(a)},\end{eqnarray}$$
where
$m\geqslant 1$
. By Lemma 12, we find that this residue is non-zero provided under the assumption (c):
$q^{\ast }$
is squarefree,
$(c,q^{\ast })=1$
, and yet another assumption
the last of which is assured by the condition
$(2,q)\mid c$
of Theorem 3. Therefore
$\unicode[STIX]{x1D70C}_{0}+1$
is a pole of
$F_{1}(s)$
. By comparing the position of this pole and the analytic continuation we have
$1+B_{q}\leqslant 1+d$
. This completes the proof.◻
8 Exclusion of
$B_{q}=1$
for
$a=b$
In this last section, we exclude the possibility of
$B_{q}=1$
for
$a=b$
in Theorem 1(2) following an idea of Ruzsa [Reference Bhowmik and Ruzsa2] for the case of the classical Goldbach problem.
Let
$G_{a,q}(n)=G(n;q,a,a)$
, so that
$S(x;q,a,a)=\sum _{n\leqslant x}G_{a,q}(n)$
.
Then our assumption (1.3) in Theorem 1(2) reads
for some
$1/2\leqslant d<1$
and any
$\unicode[STIX]{x1D700}>0$
. We prove that (8.1) together with DZC implies that
$B_{q}<1$
.
Proof.
Step 1. For
$|z|<1$
let
Then, since
$(1-z)^{-1}=1+z+z^{2}+\cdots \,$
, we obtain an identity
$$\begin{eqnarray}\frac{1}{1-z}F_{a,q}^{2}(z)=\mathop{\sum }_{n\geqslant 1}\biggl(\mathop{\sum }_{\substack{ i+j=n \\ i\geqslant 1,\,j\geqslant 0}}G_{a,q}(i)\biggr)z^{n}=\mathop{\sum }_{n\geqslant 1}S(n;q,a,a)z^{n}.\end{eqnarray}$$
From (8.1) we deduce that
Taking the derivative of the geometric series twice, we find that
for
$|z|<1$
so we can evaluate the main term in (8.2). The above error terms are estimated with the help of the following lemma.
Lemma 14. For a sequence of positive real numbers
$(a_{n})_{n=0}^{\infty }$
satisfying
for all
$x\geqslant 0$
with some constants
$C,\unicode[STIX]{x1D705}\geqslant 0$
, we have
for any real number
$X\geqslant 1$
.
Proof. By partial summation and (8.3), the above series is expressed as
Also by (8.3), we estimate this integral as
Thus the lemma follows. ◻
In what follows we work on the circle
$|z|=R$
with
$R=\text{e}^{-1/N}$
for a large positive integer
$N$
. Since
$\sum _{n\leqslant x}n^{1+d+\unicode[STIX]{x1D700}}\ll x^{2+d+\unicode[STIX]{x1D700}}$
, by Lemma 14, we continue (8.2) by
on the circle
$|z|=R$
. Therefore, we obtain
Note that the second term on the right-hand side is smaller than the first term if
with a sufficiently small constant
$c>0$
depending only on
$q$
and
$d$
. Thus on the arc
$|z|=R$
with (8.5), which we may call a major arc on
$|z|=R$
, we can take the complex square root of the formula for
$F_{a,q}(z)$
which yields
as an asymptotic formula for all
$z$
on the major arc. We get the same sign
$\pm$
on the whole major arc since
$F_{a,q}(z)$
is continuous. Since
$F_{a,q}(z)$
has only non-negative coefficients, the left-hand side in (8.6) is non-negative for the choice
$z=\text{e}^{-1/N}$
. With this choice the main term in (8.6) is real and therefore must also be non-negative. Therefore instead of
$\pm$
on the right-hand side of (8.6) we can take only the
$+$
.
At this point we notice that we are unable to obtain a similar asymptotic formula when
$a\neq b$
. The square root step here shows that using this method we can prove the exclusion of
$B_{q}=1$
in Theorem 1(2) only when
$a=b$
.
Step 2. Now we use the kernel
Then by using Cauchy’s integral formula, we obtain
Thus we deduce that
By the second expression of
$K(z)$
in (8.7), we see that
$K(z)\ll |1-z|^{-1}$
. Therefore, on the major arc (8.5) of length
$O(N^{-C/3})$
we insert the asymptotic formula (8.6) and the contribution to this integral is
$O(N^{C-2C/3})=O(N^{C/3})$
with
$C/3<1$
.
Step 3. For the rest of the circle the minor arc where
$|1-z|>cN^{-C/3}$
we proceed with the Cauchy–Schwarz inequality and apply the Parseval identity to obtain the estimate over the full arc
where we used the estimate
and Lemma 14.
On the other hand, we use the decay of the kernel
$K(z)$
on the minor arc. By using the estimate
$K(z)\ll |1-z|^{-1}$
, we start with
Now we use the parametrization
$z=R\text{e}^{\text{i}\unicode[STIX]{x1D6FC}}=\text{e}^{-1/N+\text{i}\unicode[STIX]{x1D6FC}}$
with
$-\unicode[STIX]{x1D70B}\leqslant \unicode[STIX]{x1D6FC}\leqslant \unicode[STIX]{x1D70B}$
. On the minor arc, we have
so, by recalling that
$C<3$
, we have
$|\unicode[STIX]{x1D6FC}|\geqslant c_{1}N^{-C/3}$
with some small
$c_{1}>0$
depending only on
$q$
and
$d$
. Also, note that
By using the inequality of the arithmetic and geometric mean
we find that
When
$|\unicode[STIX]{x1D6FC}|\geqslant \unicode[STIX]{x1D70B}/2$
then
$\cos \unicode[STIX]{x1D6FC}<0$
so (8.10) implies
$|1-z|^{2}\geqslant 1$
. This yields
$$\begin{eqnarray}\displaystyle I & \ll & \displaystyle \int _{c_{1}N^{-C/3}<|\unicode[STIX]{x1D6FC}|\leqslant \unicode[STIX]{x1D70B}}\,\frac{d\unicode[STIX]{x1D6FC}}{|1-R\text{e}^{\text{i}\unicode[STIX]{x1D6FC}}|^{2}}\nonumber\\ \displaystyle & \ll & \displaystyle \int _{c_{1}N^{-C/3}<|\unicode[STIX]{x1D6FC}|\leqslant \unicode[STIX]{x1D70B}/2}\,\frac{d\unicode[STIX]{x1D6FC}}{(\sin \unicode[STIX]{x1D6FC})^{2}}+2\int _{\unicode[STIX]{x1D70B}/2<|\unicode[STIX]{x1D6FC}|\leqslant \unicode[STIX]{x1D70B}}\,d\unicode[STIX]{x1D6FC}\nonumber\\ \displaystyle & \ll & \displaystyle \int _{c_{1}N^{-C/3}<|\unicode[STIX]{x1D6FC}|\leqslant \unicode[STIX]{x1D70B}/2}\,\frac{d\unicode[STIX]{x1D6FC}}{\unicode[STIX]{x1D6FC}^{2}}+1\ll N^{C/3}.\nonumber\end{eqnarray}$$
Putting everything together the Cauchy–Schwarz inequality gives the minor arc estimate for the integral in (8.8) as
with
$1/2+C/6<1$
. This together with the major arc estimate allows us to conclude that
The exponent of
$N$
is
${<}1$
for small
$\unicode[STIX]{x1D700}>0$
. In the explicit formula for
that we obtain by inserting the explicit formula for
$\unicode[STIX]{x1D713}(N,\unicode[STIX]{x1D712})$
from Lemma 5 with
$T=N$
and assuming DZC, no two terms
$N^{\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}}/\unicode[STIX]{x1D70C}_{\unicode[STIX]{x1D712}}$
will cancel out for different characters. We conclude that
$B_{q}<1$
.◻
Acknowledgements
The first two authors are grateful to Professor Andrew Granville for helpful discussions. Thanks are due to Professor Masatoshi Suzuki for useful information, and to Professor Keiju Sono and the referee for their valuable comments on the earlier versions of the manuscript. We particularly thank Professor Imre Ruzsa for the idea that improves Theorem 1(2) in the case
$a=b$
.
The first and third authors benefit from the financial support of the French-Japanese Joint Project “Zeta-functions of Several Variables and Applications” (PRC CNRS/JSPS 2015-2016).



