1 Introduction
Let
${\mathcal{S}}=\{s_{0}<s_{1}<s_{2}<\cdots <s_{n}<\cdots \,\}=\{0,1,2,4,5,8,\ldots \}\subset \mathbb{Z}$
be the set of all numbers that are expressible as the sum of two squares of integers. The classical area in the research of the properties of this set is the study of gaps between consecutive elements, i.e. the quantity
$s_{n+1}-s_{n}$
or, equivalently, the value distribution of the distance function of
${\mathcal{S}}$
for
$x\rightarrow +\infty$
.
The following fact is well known (see [Reference Bambah and Chowla1, Reference Karatsuba6]).
Theorem 1. The inequality
holds.
Proof. Let us note that if
$f(x)=x-[\sqrt{x}]^{2}$
, where
$[y]$
is an integer part of the number
$y$
, then
$0\leqslant f(x)\ll \sqrt{x}$
for
$x\gg 1$
and
$x-f(x)=[\sqrt{x}]^{2}$
is a square of an integer. Therefore,
But
$x-f(x)$
and
$f(x)-f(f(x))$
are squares of integers, so for some integers
$a$
and
$b$
we have
which was to be proved. ◻
This estimate was probably known to L. Euler and, unfortunately, was not improved after that (it is still unknown if the identity
$R(x)=o(x^{1/4})$
as
$x\rightarrow +\infty$
is true). Conjecturally, the correct order of growth of
$R(x)$
is much smaller.
Conjecture 1. For any
$\unicode[STIX]{x1D700}>0$
, the inequality
is true.
As for the large values of
$R(x)$
, by the work [Reference Richards10] of Richards, we have the following.
Theorem 2. For any
$\unicode[STIX]{x1D700}>0$
, there exist infinitely many positive integers
$x$
such that
In addition to the upper and lower bounds, one can also consider the mean values of our function. The best result of this type was proved by Hooley [Reference Hooley5].
Theorem 3. For any
$0<\unicode[STIX]{x1D6FE}<\frac{5}{3}$
, we have
Therefore, for almost all
$n$
the inequality
$s_{n+1}-s_{n}\ll \sqrt{\ln s_{n}}$
holds. More precisely, we have the following.
Corollary 1. Let
$g(x)$
be any function that tends to infinity. Then the number of
$s_{n}\leqslant x$
with
$s_{n+1}-s_{n}\gg g(x)\sqrt{\ln x}$
is
$O(x/g(x)^{\unicode[STIX]{x1D6FE}}\sqrt{\ln x})$
for any
$\unicode[STIX]{x1D6FE}<5/3$
.
The main goal of the present work is to improve Hooley’s theorem, i.e. to prove an analogous estimate for a wider range of values of
$\unicode[STIX]{x1D6FE}$
.
Theorem 4. For any
$1<\unicode[STIX]{x1D6FE}\leqslant 2$
, the inequality
is true, where
Remark 1. Theorem 4 is non-optimal, as for
$\unicode[STIX]{x1D6FE}<5/3$
the moment of order
$\unicode[STIX]{x1D6FE}$
is bounded from above by
$c(\unicode[STIX]{x1D6FE})x(\ln x)^{(\unicode[STIX]{x1D6FE}-1)/2}$
for some
$c(\unicode[STIX]{x1D6FE})>0$
. Therefore, our estimate is worse than Hooley’s theorem for
$\unicode[STIX]{x1D6FE}<5/3$
, but yields a new and non-trivial estimate for
$5/3\leqslant \unicode[STIX]{x1D6FE}\leqslant 2$
.
Remark 2. In 1987 Plaksin published an article [Reference Plaksin8] in which he presented a proof of a result similar to Theorem 3, but for a larger range of
$\unicode[STIX]{x1D6FE}$
, namely
$0<\unicode[STIX]{x1D6FE}<2$
. However, later his paper was shown to contain some mistakes (see [Reference Harman4]) and attempts to fix the arguments were not successful (see [Reference Plaksin9]).
2 Notation
Throughout this paper,
$f=O(g)$
means that there is an absolute constant
$C>0$
such that
$|f|\leqslant Cg$
;
$f\ll g$
means that
$f=O(g)$
. The notation
$f=o(g)$
as
$x\rightarrow a$
indicates that
and
$f\sim g$
as
$x\rightarrow a$
is equivalent to
$f-g=o(g)$
as
$x\rightarrow a$
.
For a positive real number
$M$
and a real number
$x$
, we define the function
$\unicode[STIX]{x1D717}_{M}(x)$
by the formula
If
$x$
is a complex number, then the Bessel function of the first kind of order zero is equal to
For any non-negative integer
$n$
, the number of pairs
$(a,b)$
of integers with
$a^{2}+b^{2}=n$
is denoted by
$r_{2}(n)$
.
For positive real numbers
$N$
and
$M$
, we define
$I(N,M)$
,
$S(N,M)$
and
$J(N,M)$
by the formulas
$$\begin{eqnarray}\displaystyle & \displaystyle I(N,M)=\frac{1}{2\unicode[STIX]{x1D70B}}\int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}\unicode[STIX]{x1D717}_{M}(\sqrt{N}\sin \unicode[STIX]{x1D711})\unicode[STIX]{x1D717}_{M}(\sqrt{N}\cos \unicode[STIX]{x1D711})\,d\unicode[STIX]{x1D711}, & \displaystyle \nonumber\\ \displaystyle & \displaystyle S(N,M)=\mathop{\sum }_{n\geqslant 0}r_{2}(n)J_{0}(2\unicode[STIX]{x1D70B}\sqrt{Nn})\text{e}^{-\unicode[STIX]{x1D70B}n/M} & \displaystyle \nonumber\end{eqnarray}$$
and
3 Proof of the main theorem
In this section, we will prove Theorem 4 by reducing the original problem to a question about the distribution of values of a certain sum of Bessel functions.
To do this, we need some lemmas. Let us start with the transformation formula for the theta function.
Lemma 1. Let
$M$
be a positive real number. For any real
$x$
, the equality
is true.
Proof. Consider the function
$g(x)=\text{e}^{-\unicode[STIX]{x1D70B}Mx^{2}}$
on the real line. It is easy to show that
$g$
is a Schwartz function and
By the Poisson summation formula, for any
$x\in \mathbb{R}$
, we get
where
$\widehat{g}(\unicode[STIX]{x1D709})=\int _{\mathbb{R}}g(x)\text{e}^{-2\unicode[STIX]{x1D70B}\text{i}\unicode[STIX]{x1D709}x}dx$
is a Fourier transform of our function.
On the other hand, it is well known that
Using this relation, we obtain the required result. ◻
With the help of Lemma 1, we will prove the following identity, which will be crucial for the subsequent considerations.
Lemma 2. Let
$M$
and
$N$
be some positive real numbers. Then
$$\begin{eqnarray}\displaystyle I(N,M) & = & \displaystyle \frac{1}{2\unicode[STIX]{x1D70B}}\int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}\unicode[STIX]{x1D717}_{M}(\sqrt{N}\sin \unicode[STIX]{x1D711})\unicode[STIX]{x1D717}_{M}(\sqrt{N}\cos \unicode[STIX]{x1D711})\,d\unicode[STIX]{x1D711}\nonumber\\ \displaystyle & = & \displaystyle \frac{1}{M}\mathop{\sum }_{n\geqslant 0}r_{2}(n)J_{0}(2\unicode[STIX]{x1D70B}\sqrt{Nn})\text{e}^{-\unicode[STIX]{x1D70B}n/M}=\frac{1}{M}S(N,M).\nonumber\end{eqnarray}$$
Proof. Using Lemma 1, we find that
$$\begin{eqnarray}\displaystyle I(N,M) & = & \displaystyle \frac{1}{2\unicode[STIX]{x1D70B}M}\int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}\biggl(\mathop{\sum }_{a\in \mathbb{Z}}\text{e}^{2\unicode[STIX]{x1D70B}\text{i}a\sqrt{N}\sin \unicode[STIX]{x1D711}}\text{e}^{-\unicode[STIX]{x1D70B}a^{2}/M}\biggr)\nonumber\\ \displaystyle & & \displaystyle \times \,\biggl(\mathop{\sum }_{b\in \mathbb{Z}}\text{e}^{2\unicode[STIX]{x1D70B}\text{i}b\sqrt{N}\cos \unicode[STIX]{x1D711}}\text{e}^{-\unicode[STIX]{x1D70B}b^{2}/M}\biggr)\,d\unicode[STIX]{x1D711}.\nonumber\end{eqnarray}$$
Both series are absolutely and uniformly convergent, so we can replace the product of their sums by the double sum and interchange summation and integration. Consequently,
Let us now compute the inner integral for all integers
$a$
and
$b$
. If
$(a,b)=(0,0)$
, then the integrand is equal to
$1$
and so the integral equals
$2\unicode[STIX]{x1D70B}$
. If, in contrast,
$a^{2}+b^{2}\neq 0$
, then there exists some
$\unicode[STIX]{x1D703}\in [-\unicode[STIX]{x1D70B},\unicode[STIX]{x1D70B}]$
such that
Therefore,
$a\sin \unicode[STIX]{x1D711}+b\cos \unicode[STIX]{x1D711}=\sqrt{a^{2}+b^{2}}\cos (\unicode[STIX]{x1D711}-\unicode[STIX]{x1D703})$
. Applying the change of variables
$\unicode[STIX]{x1D711}=\unicode[STIX]{x1D711}_{1}+\unicode[STIX]{x1D703}$
, we obtain
Since the integrand is periodic with the period
$2\unicode[STIX]{x1D70B}$
, the last integral is equal to the integral of the same function over the interval
$[-\unicode[STIX]{x1D70B},\unicode[STIX]{x1D70B}]$
. Thus, we finally find that
$$\begin{eqnarray}\displaystyle \int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}\text{e}^{2\unicode[STIX]{x1D70B}\text{i}\sqrt{N}(a\sin \unicode[STIX]{x1D711}+b\cos \unicode[STIX]{x1D711})}\,d\unicode[STIX]{x1D711} & = & \displaystyle \int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}\text{e}^{2\unicode[STIX]{x1D70B}\text{i}\sqrt{N(a^{2}+b^{2})}\cos \unicode[STIX]{x1D711}_{1}}\,d\unicode[STIX]{x1D711}_{1}\nonumber\\ \displaystyle & = & \displaystyle 2\unicode[STIX]{x1D70B}J_{0}(2\unicode[STIX]{x1D70B}\sqrt{N(a^{2}+b^{2})}).\nonumber\end{eqnarray}$$
Substituting the obtained result into the formula for
$I(N,M)$
, we deduce the identity
which was to be proved. ◻
Remark 3. Computing the integral
$I(N,M)$
without using Lemma 1 yields
Therefore, for all
$N,M>0$
, we have
Now, if for all
$z,\unicode[STIX]{x1D70F}\in \mathbb{C}$
,
$\text{Im}\,\unicode[STIX]{x1D70F}>0$
, we have
then we get
$S(N,M)=f(i/M,\sqrt{N}/2)$
and by the identity principle
So, the function
$f(\unicode[STIX]{x1D70F},z)$
behaves like a Jacobi form. This phenomenon can be generalized to the Cohen–Kuznetsov series and provides some results on Rankin–Cohen brackets of modular forms (see [Reference Kuznetsov7] and [Reference Cohen3]).
Now we want to show that if
$R(N)$
is large, then the quantity
$S(N,M)$
is rather small. To prove this, we will need some more additional lemmas.
Lemma 3. Let
$N>0$
,
$M>1$
and denote by
$C(N)\subset \mathbb{R}^{2}$
the circle of radius
$\sqrt{N}$
centered in the point
$(0,0)$
. Let
$d(N)$
be the distance between the sets
$C(N)$
and
$\mathbb{Z}^{2}$
, that is,
where
$\unicode[STIX]{x1D70C}$
is a standard euclidean distance on the plane. Then the inequality
holds.
Proof. Let us notice first that for any
$\unicode[STIX]{x1D711}\in [-\unicode[STIX]{x1D70B},\unicode[STIX]{x1D70B}]$
, the inequality
holds. Indeed, for some integers
$a$
and
$b$
, we have
because
$(\sqrt{N}\cos \unicode[STIX]{x1D711},\sqrt{N}\sin \unicode[STIX]{x1D711})\in C(N)$
and
$(a,b)\in \mathbb{Z}^{2}$
. Then from Lemma 2 we obtain
$$\begin{eqnarray}\displaystyle S(N,M) & = & \displaystyle \frac{M}{2\unicode[STIX]{x1D70B}}\int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}\unicode[STIX]{x1D717}_{M}(\sqrt{N}\cos \unicode[STIX]{x1D711})\unicode[STIX]{x1D717}_{M}(\sqrt{N}\sin \unicode[STIX]{x1D711})\,d\unicode[STIX]{x1D711}\nonumber\\ \displaystyle & = & \displaystyle \frac{M}{2\unicode[STIX]{x1D70B}}\int _{-\unicode[STIX]{x1D70B}}^{\unicode[STIX]{x1D70B}}(\text{e}^{-\unicode[STIX]{x1D70B}M\Vert \sqrt{N}\cos \unicode[STIX]{x1D711}\Vert ^{2}}+O(\text{e}^{-\unicode[STIX]{x1D70B}M/4}))\nonumber\\ \displaystyle & & \displaystyle \times \,(\text{e}^{-\unicode[STIX]{x1D70B}M\Vert \sqrt{N}\sin \unicode[STIX]{x1D711}\Vert ^{2}}+O(\text{e}^{-\unicode[STIX]{x1D70B}M/4}))\,d\unicode[STIX]{x1D711}.\nonumber\end{eqnarray}$$
Therefore, from the previous observation, we get the desired inequality. ◻
It turns out that the distance between
$C(N)$
and
$\mathbb{Z}^{2}$
is closely related to the distance from
$N$
to the nearest sum of two squares. More precisely, the following proposition holds.
Lemma 4. For any
$N>0$
, we have
Proof. Let
$O=(0,0)$
and
$A\in C(N),B\in \mathbb{Z}^{2}$
be the points such that
(points with this condition certainly exist, because
$C(N)$
is compact and
$\mathbb{Z}^{2}$
is discrete). Then the points
$A,B$
and
$O$
are collinear, because if this is not the case then the triangle
$ABO$
is non-degenerate and thus
But then if we take
$D$
to be the intersection point of the line
$BO$
and the circle
$C(N)$
, which lies closer to
$B$
than the second point, we get
which is a contradiction. Therefore,
for some integers
$a$
and
$b$
. So, we get
and we clearly can assume that
$a^{2}+b^{2}\leqslant 2N$
, as otherwise we have
because
$R(N)\leqslant |N-0|=N$
. Now, if
$a^{2}+b^{2}\leqslant 2N$
, then
$\sqrt{N}+\sqrt{a^{2}+b^{2}}\leqslant (\sqrt{2}+1)\sqrt{N}<5\sqrt{N}/2$
. By the definition of
$R(N)$
, we also have
and so
A combination of Lemmas 3 and 4 gives us the following.
Lemma 5. Let
$H>1,N>3$
and suppose that
$R(N)\geqslant H$
. If
$M\geqslant (2N\ln N)/H^{2}$
, then
Proof. From Lemma 3, we get
As
$R(N)\ll N^{1/4}$
, the inequality
holds and so
Now, Lemma 4 gives us
Consider the function
We have
so the quantity
$t(M)$
is decreasing when
Furthermore, from Lemma 4, we get
Therefore,
And now we have by the previous estimates
so
Consequently,
which was to be proved. ◻
So, if
$R(N)$
is sufficiently large, then the quantity
$S(N,M)$
is close to 0. But the function
$J_{0}(x)$
is oscillating for
$x\rightarrow \infty$
and so
$S(x,M)-1$
is an infinite sum of certain oscillating functions. Therefore, because of possible cancellation it is reasonable to expect that
$S(x,M)$
is close to
$1$
. More precisely, the following
$L^{2}$
-estimate holds.
Lemma 6. Let
$N\geqslant 2$
,
$H\geqslant 40(\ln N)^{3/2}$
and
$M=(2N\ln N)/H^{2}\geqslant 1$
. Then the inequality
holds.
Remark 4. The constant
$40$
here is not optimal, but this has no effect on subsequent considerations.
To prove this lemma, we need three more propositions. The first of them is very well known.
Lemma 7. For any
$x\geqslant 1$
, we have
Proof. See [Reference Blomer and Granville2, Theorem 1]. ◻
We also need Weber’s second exponential integral.
Lemma 8. For arbitrary
$\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D6FD},\unicode[STIX]{x1D6FE}>0$
, the formula
is true, where
$I_{0}(x)=J_{0}(\text{i}x)$
is the modified Bessel function.
Proof. See [Reference Watson11, p. 395, §13.31]. ◻
Furthermore, we will use the asymptotic formula for the modified Bessel function.
Lemma 9. For
$x\rightarrow +\infty$
, we have the following asymptotic formula:
Proof. See [Reference Watson11, p. 203, §7.23]. ◻
Proof of Lemma 6.
Let us define
For any
$x\leqslant N$
, we have
$\text{e}^{-\unicode[STIX]{x1D70B}x/N}\geqslant \text{e}^{-\unicode[STIX]{x1D70B}}$
, so for all
$N$
and
$M$
we get
and so it is enough to prove an analogous estimate for
$J^{\ast }(N,M)$
.
Now, by the definition of
$S(x,M)$
, we have
and the series converge absolutely and uniformly for
$x\geqslant 0$
. Therefore, we obtain
$$\begin{eqnarray}\displaystyle J^{\ast }(N,M) & = & \displaystyle \int _{0}^{+\infty }(S(x,M)-1)^{2}\text{e}^{-\unicode[STIX]{x1D70B}x/N}\,dx\nonumber\\ \displaystyle & = & \displaystyle \mathop{\sum }_{n,m\geqslant 1}r_{2}(n)r_{2}(m)\text{e}^{-\unicode[STIX]{x1D70B}(n+m)/M}\nonumber\\ \displaystyle & & \displaystyle \times \,\int _{0}^{+\infty }J_{0}(2\unicode[STIX]{x1D70B}\sqrt{mx})J_{0}(2\unicode[STIX]{x1D70B}\sqrt{nx})\text{e}^{-\unicode[STIX]{x1D70B}x/N}\,dx.\nonumber\end{eqnarray}$$
The integrals can be computed using the change of variables
$x=(N/\unicode[STIX]{x1D70B})y$
and Lemma 8 as follows:
$$\begin{eqnarray}\displaystyle & & \displaystyle \int _{0}^{+\infty }J_{0}(2\unicode[STIX]{x1D70B}\sqrt{mx})J_{0}(2\unicode[STIX]{x1D70B}\sqrt{nx})\text{e}^{-\unicode[STIX]{x1D70B}x/N}\,dx\nonumber\\ \displaystyle & & \displaystyle \quad =\frac{N}{\unicode[STIX]{x1D70B}}\int _{0}^{+\infty }J_{0}(2\sqrt{\unicode[STIX]{x1D70B}nNy})J_{0}(2\sqrt{\unicode[STIX]{x1D70B}mNy})\text{e}^{-y}\,dy\nonumber\\ \displaystyle & & \displaystyle \quad =\frac{N}{\unicode[STIX]{x1D70B}}\text{e}^{-\unicode[STIX]{x1D70B}N(n+m)}I_{0}(2\unicode[STIX]{x1D70B}N\sqrt{nm}).\nonumber\end{eqnarray}$$
Therefore,
We can split this sum into “diagonal” and “non-diagonal” summands as follows:
where
and
Let us estimate
$S_{1}$
first. Note that all the summands are positive and for any pair
$(n,m)$
at least one of three pairs of inequalities is true:
or
Thus, we deduce that
$$\begin{eqnarray}\displaystyle S_{1} & {\leqslant} & \displaystyle \mathop{\sum }_{\substack{ 1\leqslant n,m\leqslant 100M\ln N \\ n\neq m}}r_{2}(n)r_{2}(m)\text{e}^{-\unicode[STIX]{x1D70B}N(n+m)-\unicode[STIX]{x1D70B}(n+m)/M}I_{0}(2\unicode[STIX]{x1D70B}N\sqrt{nm})\nonumber\\ \displaystyle & & \displaystyle +\,2\mathop{\sum }_{n\geqslant 1,m>100M\ln N}r_{2}(n)r_{2}(m)\text{e}^{-\unicode[STIX]{x1D70B}N(n+m)-\unicode[STIX]{x1D70B}(n+m)/M}I_{0}(2\unicode[STIX]{x1D70B}N\sqrt{nm})\nonumber\\ \displaystyle & = & \displaystyle S_{2}+2S_{3}.\nonumber\end{eqnarray}$$
To estimate the sum
$S_{3}$
, let us notice that Lemma 9 gives us
And so we obtain the following inequality:
$$\begin{eqnarray}\displaystyle S_{3} & \ll & \displaystyle \mathop{\sum }_{n\geqslant 1,m>100M\ln N}r_{2}(n)r_{2}(m)\text{e}^{-\unicode[STIX]{x1D70B}(n+m)/M}\nonumber\\ \displaystyle & = & \displaystyle \biggl(\mathop{\sum }_{n\geqslant 1}r_{2}(n)\text{e}^{-\unicode[STIX]{x1D70B}n/M}\biggr)\biggl(\mathop{\sum }_{n>100M\ln N}r_{2}(n)\text{e}^{-\unicode[STIX]{x1D70B}n/M}\biggr).\nonumber\end{eqnarray}$$
Now, for any
$x>0$
, we have
therefore, dividing
$\mathbb{R}_{{>}0}$
into intervals of the form
$(mM,(m+1)M]$
and using the fact that for
$n\in (mM,(m+1)M]$
we have
$\text{e}^{-\unicode[STIX]{x1D70B}n/M}<\text{e}^{-\unicode[STIX]{x1D70B}m}$
, we obtain
and
$$\begin{eqnarray}\displaystyle \mathop{\sum }_{n>100M\ln N}r_{2}(n)\text{e}^{-\unicode[STIX]{x1D70B}n/M} & {\leqslant} & \displaystyle \mathop{\sum }_{m=100\ln N}^{+\infty }\text{e}^{-\unicode[STIX]{x1D70B}m}\mathop{\sum }_{n\leqslant (m+1)M}r_{2}(n)\nonumber\\ \displaystyle & \ll & \displaystyle \mathop{\sum }_{m=100\ln N}^{+\infty }\text{e}^{-\unicode[STIX]{x1D70B}m}(m+1)M\nonumber\\ \displaystyle & \ll & \displaystyle M\ln N\text{e}^{-100\unicode[STIX]{x1D70B}\ln N}\ll N^{-313},\nonumber\end{eqnarray}$$
so we finally get
Now we turn to
$S_{2}$
. For any integer pair
$n,m$
with the conditions
$1\leqslant n,m\leqslant 100M\ln N$
, we get by Lemma 9 that
Let us notice that as
$n\neq m$
, we have
Consequently,
From this inequality and the conditions
$M=(2N\ln N)/H^{2}$
and
$H\geqslant 40(\ln N)^{3/2}$
, we obtain
Therefore,
$$\begin{eqnarray}\displaystyle S_{2} & \ll & \displaystyle \mathop{\sum }_{n,m\leqslant 100M\ln N}r_{2}(n)r_{2}(m)N^{-2\unicode[STIX]{x1D70B}}=\biggl(\mathop{\sum }_{n\leqslant 100M\ln N}r_{2}(n)\biggr)^{2}N^{-2\unicode[STIX]{x1D70B}}\nonumber\\ \displaystyle & \ll & \displaystyle N^{2-2\unicode[STIX]{x1D70B}}\ll N^{-4}.\nonumber\end{eqnarray}$$
And we deduce for the “non-diagonal” summand the estimate
It remains to prove that
From Lemma 9, we deduce that
Consequently,
Let
$K$
be the smallest integer with
$2^{K+1}>100M\ln N$
. Then we obviously have
where
From Lemma 7, we get
$$\begin{eqnarray}\displaystyle S_{0}(k) & {\leqslant} & \displaystyle \mathop{\sum }_{2^{k}\leqslant n<2^{k+1}}\frac{r_{2}(n)^{2}}{\sqrt{N}2^{k/2}}\text{e}^{-2^{k}\unicode[STIX]{x1D70B}/M}\nonumber\\ \displaystyle & {\leqslant} & \displaystyle \frac{\text{e}^{-2^{k}\unicode[STIX]{x1D70B}/M}}{\sqrt{N}2^{k/2}}\mathop{\sum }_{n<2^{k+1}}r_{2}(n)^{2}\ll \frac{(k+1)2^{k/2}\text{e}^{-2^{k}\unicode[STIX]{x1D70B}/M}}{\sqrt{N}}.\nonumber\end{eqnarray}$$
Summing this over all
$k\leqslant K$
, we obtain
Consequently,
and
which concludes the proof. ◻
Lemma 10. Let
$x,H>3$
and denote by
$E(H,x)$
the set of all real
$y\leqslant x$
with
$R(y)\geqslant H$
. Then the inequality
holds, where
$\unicode[STIX]{x1D707}$
is the Lebesgue measure.
Proof. As this bound is trivial for
$H\leqslant 40(\ln x)^{3/2}$
, we can assume that
$H\geqslant 40(\ln x)^{3/2}$
. Then from Lemma 5 we get
for any
$y\in E(H,x)$
, where
$M=(2N\ln N)/H^{2}$
. Therefore, for large enough
$y\in E(H,x)$
, we have
Thus,
Consequently, by Lemma 6,
which was to be proved. ◻
From this last lemma we deduce Theorem 4.
Proof of Theorem 4.
Observe that
$\sum _{s_{n+1}\leqslant x}(s_{n+1}-s_{n})^{\unicode[STIX]{x1D6FE}}\ll \int _{0}^{x}R(t)^{\unicode[STIX]{x1D6FE}-1}dt$
.
Indeed, for any positive integer
$n$
, we have
Summation over all
$n$
with the condition
$s_{n+1}\leqslant x$
gives the desired result.
Let
$k$
be some positive integer. Consider the set
$B_{k}\subset [0,x]$
of all real
$y$
with
$2^{k}\leqslant R(y)\leqslant 2^{k+1}$
.
Due to Lemma 10,
$\unicode[STIX]{x1D707}(B_{k})\ll x(\ln x)^{3/2}2^{-k}$
. Therefore,
Let
$B$
be the set of
$y\in [0,x]$
such that
$R(y)\leqslant c(\ln x)^{3/2}$
with some sufficiently large constant
$c$
. Trivially, we have
$B\subset [0,x]$
and so
$\unicode[STIX]{x1D707}(B)\leqslant x$
. Consequently,
Due to the fact that on the interval
$[0,x]$
the inequality
$R(x)\leqslant x$
holds, we have
Therefore,
Furthermore, we have
$$\begin{eqnarray}\displaystyle \int _{0}^{x}R(t)^{\unicode[STIX]{x1D6FE}-1}\,dt & \ll & \displaystyle x(\ln x)^{(3/2)(\unicode[STIX]{x1D6FE}-1)}+\mathop{\sum }_{x\geqslant 2^{k}\geqslant c(\ln x)^{3/2}}x(\ln x)^{3/2}2^{(\unicode[STIX]{x1D6FE}-2)k}\nonumber\\ \displaystyle & \ll & \displaystyle x(\ln x)^{(3/2)(\unicode[STIX]{x1D6FE}-1)}\unicode[STIX]{x1D6FF}(x,\unicode[STIX]{x1D6FE}).\nonumber\end{eqnarray}$$
This concludes the proof of Theorem 4. ◻
4 Conclusion
In this work, we constructed a certain sum of Bessel functions that is unusually small in the points that are far from numbers that are sums of two squares. The estimate for some mean value of this sum allowed us to prove the upper bound for the measure of the set of points with this property. However, we were not able to prove a sharp enough bound for the function
$S(N,M)-1$
. Non-trivial estimates for this quantity would allow us to improve the exponent in the inequality
$R(x)\ll x^{1/4}$
. One can show that our construction works not only for the sums of two squares, but also for the set of values of arbitrary positive-definite quadratic form with integer coefficients. It would also be interesting to generalize this construction to the case of indefinite forms.
Acknowledgements
The author thanks Maxim Aleksandrovich Korolev for useful comments and discussion. The author is partially supported by the Laboratory of Mirror Symmetry NRU HSE, RF Government grant, agreement no. 14.641.31.0001, the Simons Foundation, the Moebius Contest Foundation for Young Scientists, the “Young Russian Mathematics” contest and the Foundation for the Advancement of Theoretical Physics and Mathematics “BASIS”.

