1. Introduction and statement of results
The argument of the Riemann zeta-function
$\zeta$
on the critical line, usually denoted as S(t), is a fascinating and intricate aspect of one of the most celebrated functions in number theory. The function is defined by
$S(t) \;:\!=\; ({1}/{\pi})\arg{\zeta({1}/{2} + \mathrm{i} t)} = ({1}/{\pi})\operatorname{Im} \int_{\infty}^{1/2}\frac{\zeta'}{\zeta}(\alpha + \mathrm{i} t)\, \mathrm{d}\alpha$
if t is equal to neither 0 nor the imaginary part of a zero of
$\zeta$
. If t is equal to 0 or the imaginary part of a zero, then
$S(t) = (S(t + 0) + S(t - 0)) / 2$
. By the argument principle, this function is influenced by the distribution of zeros of the Riemann zeta-function. The relationship is visualised by the Riemann–von Mangoldt formula:
where N(T) denotes the number of zeros
$\rho = \beta + \mathrm{i} \gamma$
satisfying
$0 \lt \gamma \lt T$
of
$\zeta$
counted with multiplicity. If T is equal to the imaginary part of a zero,
$N(T) = (N(T + 0) + N(T - 0)) / 2$
.
In this paper, we discuss extreme values of
$S(t + h) - S(t)$
. The values of
$S(t + h) - S(t)$
capture information on the number of zeros, as expressed by
Since detailed information about the zeros of the Riemann zeta-function has rich applications to the prime numbers, the study of
$S(t + h) - S(t)$
is therefore also important. For this object, Selberg showed in an unpublished work that there exists a positive number
$c = c(a, b)$
, depending on arbitrary absolute positive constants a, b, such that for any large T and any
$h \in [a (\!\log{T})^{-1}, b(\!\log\log{T})^{-1}]$
,
holds with
$\eta = 1/2$
under the Riemann Hypothesis (RH). Later, Tsang gave a proof of this result in [
Reference Tsang13
] and also proved that (1·2) holds with
$\eta = 1/3$
unconditionally. More recently, the first author in [
Reference Inoue8
] used his results to study the distribution of zeros. In the paper, under RH, the first author also considered the explicit extreme values of
$S(t + h) - S(t)$
and showed that
$c = c(a, b)$
in inequality (1·2) can be calculated by (4·1) in [
Reference Inoue8
, section 4], which is essentially obtained by following the argument of Selberg/Tsang straightforwardly. With this approach, one inevitably has
$c \lt 1 / \sqrt{2 e \pi}$
when a is large, and b is small. The aim of this paper is to improve the explicit extreme values by using the method of Montgomery–Odlyzko [
Reference Montgomery and Odlyzko9
]. The first result is the following.
Theorem 1·1. Assume RH. For any large T and any
$h \in [C / \log{T}, c / \log\log{T}]$
with positive constants C large and c small, we have
where the error term E satisfies
\begin{align*} E \ll \sqrt{h \log\log{T}} + \min\left\{\sqrt{\frac{\log^{3}(h \log{T})}{h \log{T}}}, \frac{(\!\log\log{T})^{3/2}}{h^{3/2} \log{T}}\right\}\!. \end{align*}
This theorem can be applied to evaluate gaps of zeros of the Riemann zeta-function. Let
$0 \lt \gamma_{1} \leq \gamma_{2} \leq \cdots \leq \gamma_{n} \leq \cdots$
denote the sequence of ordinates of the zeros of
$\zeta$
in the upper half plane. We define the normalised large/small r-gap of nontrivial zeros by
From the Riemann–von Mangoldt formula, we have the trivial bounds
$\mu_{r} \leq 1 \leq \lambda_{r}$
. The nontrivial bounds in the case
$r = 1$
have been studied by many mathematicians. The current best bounds under RH are
$\lambda_{1} \gt 3.18$
by Bui–Milinovich [
Reference Bui and Milinovich3
] and
$\mu_{1} \lt0.515396$
by Preobrazhenskiĭ [
Reference Preobrazhenskiĭ10
]. For general r, Selberg [
Reference Selberg11
, p.355] announced the nontrivial bounds of
$\lambda_{r}$
,
$\mu_{r}$
of the form
for all positive integer r. The numbers
$\Theta$
,
$\vartheta$
which may depend on r are greater than some absolute positive constants. Here, we may take
$\alpha$
as
$2/3$
unconditionally, and as
$1/2$
under RH. Recently, Conrey and Turnage–Butterbaugh [
Reference Conrey and Turnage–Butterbaugh5
] proved an explicit result for the conditional bound. Specifically, they showed that (1·3) holds for
$\Theta = 0.599648$
and
$\vartheta = 0.379674$
with
$\alpha = 1/2$
uniformly for
$r \geq 1$
under RH. These results have been improved to
$\Theta = A_{0} \;:\!=\; \max_{B \gt 0}({2B}/{\pi})\arctan({\pi}/{B^{2}}) = 0.9064997 \cdots$
, and
$\vartheta = 0.484604$
in [
Reference Inoue8
]. Moreover, Conrey and Turnage–Butterbaugh proved that
$\Theta = \vartheta = A_{0} + o(1)$
as
$r \rightarrow + \infty$
. As a consequence of Theorem 1·1 combined with the Riemann–von Mangoldt formula, we can improve the constant
$A_{0}$
to
$\sqrt{2} = 1.4142\dots$
.
Theorem 1·2. Assume RH. For any sufficiently large r, we have
Here,
$C_{1}$
and
$C_{2}$
are some absolute positive constants.
To prove Theorem 1·1, we employ the resonance method established by Soundararajan [
Reference Soundararajan12
]. From the celebrated works due to Soundararajan [
Reference Soundararajan12
], and Bondarenko and Seip [
Reference Bondarenko and Seip1
], the resonance method is now widely regarded as a powerful tool for detecting extreme values of number-theoretic objects. Inspired by these studies, we apply the resonance method to
$S(t + h) - S(t)$
. The method due to Montgomery and Odlyzko is a precursor of our approach. In fact, by combining our method using the resonance method with the Riemann–von Mangoldt formula, we can recover the original result of Montgomery and Odlyzko.
In [
Reference Montgomery and Odlyzko9
], Montgomery and Odlyzko showed that
$\lambda_1\gt1.9799$
and
$\mu_1\lt0.5179$
. For a large real number T and
$L \leq T/(\!\log T)^2$
, they studied the function
$\tau$
defined by
\begin{align*} \tau(\xi;\;\, f) \;:\!=\; \xi - \!\left(\operatorname{Re} \frac{2}{\pi}\sum_{k m \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\pi \xi \tfrac{\log{k}}{\log T}\big)\,f(m)\,\overline{f(k m)} \bigg/ \sum_{n \leq L} |f(n)|^2 \right)\!, \end{align*}
where
$\xi$
is a positive number, and f is a certain arithmetic function. They showed (for the case
$r=1$
and extended
$r \geq 2$
by Conrey and Turnage–Butterbaugh [
Reference Conrey and Turnage–Butterbaugh5
]) that if there exists
$\xi_r$
such that
$\tau(\xi_{r};\;\, f) \lt r$
, then
$\lambda_{r} \geq \xi_{r}$
, and if there exists
$\xi_r$
such that
$\tau(\xi_{r};\;\, f) \gt r$
, then
$\mu_{r} \leq \xi_{r}$
.
To conclude this section, we give a limitation of the method of Montgomery and Odlyzko.
Theorem 1·3. Let f be an arithmetic function not identically zero, let L be large, and let
$h \gt 0$
. For any
$W \gt 0$
, we have
\begin{align} &\bigg|\operatorname{Re}\frac{2}{\pi} \sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)}\bigg| \bigg/ \sum_{n \leq L}|f(n)|^{2}\\ &\quad \leq \max_{1 \leq l \leq L} \left\{\frac{\sqrt{W}}{2} \varphi\!\left( \tfrac{h}{2\pi} \log\!(L / l) \right) + \frac{h \log{l}}{\pi\sqrt{W}}\right\} + O(h \sqrt{W}).\nonumber \end{align}
Here,
$\varphi(x) = \int_{0}^{x}(\!\sin\!(\pi u) / \pi u)^{2}\, \mathrm{d} u$
. In particular, we have
\begin{align*} |\tau(\xi;\;\, f) - \xi| \leq \max_{1 \leq l \leq L} \left\{\frac{\sqrt{W}}{2} \varphi\!\left( \xi \frac{\log\!(L / l)}{\log T} \right) + \frac{2 \xi}{\sqrt{W}}\frac{\log{l}}{\log T}\right\} + O\!\left(\frac{\xi}{\log T} \sqrt{W}\right) \end{align*}
for any
$\xi \gt 0$
, any large L, T, and any
$W \gt 0$
.
By this theorem together with a numerical calculation, we obtain that the limitations of large/small gaps of zeros in the method of Montgomery–Odlyzko are
$\lambda_{1} \geq 3.022$
,
$\mu_{1} \leq 0.508$
when
$L \leq T$
. There are previous works on such limitations in the method [
Reference Conrey, Ghosh and Gonek4, Reference Goldston, Trudgian and Turnage–Butterbaugh6
]. Conrey, Ghosh, and Gonek [
Reference Conrey, Ghosh and Gonek4
] showed that
$\lambda_{1} \geq 3.74$
and
$\mu_{1} \lt 1/2$
are limitations of the Montgomery–Odlyzko method. Moreover, the recent work by Goldston, Trudgian and Turnage–Butterbaugh [
Reference Goldston, Trudgian and Turnage–Butterbaugh6
] improved on the result on their limitation of small gaps to
$\mu_{1} \leq 0.5042$
. They also remarked that their method can be applied to the bound of
$\lambda_{1}$
, which leads us to
$\lambda_{1} \geq 3.6747$
. Our result gives an improvement on those results. On the other hand, Bui and Milinovich [
Reference Bui and Milinovich3
] applied Hall’s method [
Reference Hall7
] to prove
$\lambda_1\gt3.18$
under RH. Our limitation for
$\lambda_{1}$
shows that the result of Bui–Milinovich goes beyond the barrier imposed by the method of Montgomery–Odlyzko. Furthermore, we can also see that
$\lambda_{r} \geq 1 + \sqrt{2/r} - O(1/r)$
,
$\mu_{r} \leq 1 - \sqrt{2/r} + O(1 / r)$
are limitations of their method for r-gaps of zeros when
$L \leq T$
. This observation shows that the constant
$\sqrt{2}$
in Theorem 1·2 is optimal.
This paper is organised as follows. In Section 2 we discuss the relationship between large values of S(t) in short intervals and the gaps between consecutive r zeros of the Riemann zeta-function. In Section 3, we apply the resonance method to S(t) in short intervals. Combining this result and Proposition 4·1, we prove Theorem 1·1 in Section 4. In Section 5, we prove Theorem 1·2 by using Theorem 1·1 and the relationship between S(t) and gaps of zeros established in Section 2. In Section 6, we prove Theorem 1·3, and finally in Section 7, we derive the resulting limitations on large and small gaps between zeros that follow from Theorem 1·3.
2. A relationship between S(t) and large/small gaps of consecutive r zeros
By the same strategy as in the proof of [ Reference Inoue8 , theorem 1], we obtain the following relation between S(t) and gaps of zeros.
Proposition 2·1. Let r be a positive integer, and let
$\theta$
be a positive number which may depend on r. Then the inequality
$\lambda_r \gt \theta$
holds if and only if there exist numbers
$b \gt 0$
,
$\theta' \gt 1$
and a sequence
$\{T_{n}\}$
satisfying
$\theta' \gt \theta$
,
$b \gt r(\theta' - 1)$
, and
$T_{n} \rightarrow +\infty$
as
$n \rightarrow + \infty$
such that
Similarly, the inequality
$\mu_{r} \lt \theta$
holds if and only if there exist numbers
$b \gt 0$
,
$0 \lt \theta' \lt 1$
and a sequence
$\{T_{n}\}$
satisfying
$\theta' \lt \theta$
,
$b \gt r(1 - \theta')$
, and
$T_{n} \rightarrow +\infty$
as
$n \rightarrow + \infty$
such that
Proof. Since the first and second assertion can be proved by the same argument, we only give the proof of the first assertion. We use the simple equivalence which is that, for any
$\{ T_{n} \}$
satisfying
$T_{n} \rightarrow +\infty$
as
$n \rightarrow + \infty$
, there exists some
$t \in [T_{n}, 2T_{n}]$
such that
if and only if the inequality
holds.
First, we assume
$\lambda_{r} \gt \theta$
. Then there exist a number
$\theta'$
and a sequence
$\{T_{n}\}$
satisfying
$\theta' \gt \theta$
and
$T_{n} \rightarrow +\infty$
as
$n \rightarrow + \infty$
such that
holds for any sufficiently large n. Therefore, (2·2) holds when
$h = 2 \pi r \theta' / \log T_{n}$
and n is sufficiently large. Hence, there exists a
$t \in [T_{n}, 2T_{n}]$
such that (2·1) holds with
$h = 2 \pi r \theta' / \log T_{n}$
, which is also equivalent to
Combining this with (1·1), we have
\begin{align*} \inf_{t \in [T_{n}, 2T_{n}]} (S(t + 2 \pi r \theta' / \log T_{n}) - S(t)) &\leq \inf_{t \in [T_{n}, 2T_{n}]} (S(t + 2 \pi r \theta' / \log T_{n}) - S(t))\\ &\leq r - 1 / 2 - r \theta' + o(1) \leq -b \end{align*}
with
$b = r(\theta' - 1) + 1 / 3$
.
Next, we assume that there exist numbers
$b, \theta'$
and a sequence
$\{T_{n}\}$
satisfying
$\theta' \gt \theta$
,
$b \gt r(\theta' - 1)$
, and
$T_{n} \rightarrow +\infty$
as
$n \rightarrow + \infty$
such that
for any sufficiently large n. Then, it holds by (1·1) that for any large n
for some
$t \in [T_{n}, 2T_{n}]$
. Therefore, (2·1) holds when
$h = 2 \pi r \theta' / \log T_{n}$
and n is sufficiently large. Hence, we find that
\begin{align*} \lambda_{r} &= \limsup_{m \rightarrow + \infty}\frac{\gamma_{m + r} - \gamma_{m}}{2\pi r / \log{\gamma_{m}}} \geq \lim_{n \rightarrow + \infty}\sup_{\gamma_{m}, \gamma_{m + r} \in [T_{n}, 2T_{n} + h]} \frac{\gamma_{m + r} - \gamma_{m}}{2\pi r / \log{\gamma_{m}}}\\ &= \lim_{n \rightarrow + \infty}\sup_{\gamma_{m}, \gamma_{m + r} \in [T_{n}, 2T_{n} + h]} \frac{\gamma_{m + r} - \gamma_{m}}{h}\frac{h}{2\pi r / \log{T_{n}}}\frac{\log{\gamma_{m}}}{\log{T_{n}}} \geq \theta' \gt \theta, \end{align*}
which completes the proof of Proposition 2·1.
Remark 2·2. In Proposition 2·1, if we change the interval
$[T_{n}, 2T_{n}]$
to
$[T_{n}^{a}, 2T_{n}]$
for some
$0 \lt a \lt 1$
, then the equivalence no longer holds. Although the statement can be suitably modified, the resulting inequalities for
$\lambda_{r}$
,
$\mu_{r}$
become weaker than the original form. Hence, we consider the extreme value of
$S(t + h) - S(t)$
over the interval [T, 2T] in Theorem 1·1.
3. Resonance method
The resonance method aims to extract the large values of an objective function by comparing the mean value of the objective function multiplied by a “resonator” with that of the resonator itself. In this paper, we take the resonator to be the Dirichlet polynomial
following the works [
Reference Bondarenko and Seip1, Reference Bondarenko and Seip2, Reference Montgomery and Odlyzko9, Reference Soundararajan12
]. Here, the arithmetic function f is chosen suitably depending on the objective function. In this section, we evaluate the extreme value of
$S(t + h) - S(t)$
by means of general forms of resonators. We construct a suitable resonator for our purpose in Section 4.
In this section, we aim to prove the following proposition.
Proposition 3·1. Assume RH. For any arithmetic function f that is not identically zero, any large L, T satisfying
$L \leq T / (\!\log{T})^{2}$
, and any
$0 \lt h \leq 1$
we have
\begin{align*} &\sup_{T \leq t \leq 2T}\left\{\pm\!\left(S(t + h) - S(t) \right)\right\}\\ &\quad \geq \mp\!\left( 1 + O\!\left(\frac{1}{T}\right) \right)\frac{2}{\pi} \operatorname{Re} \sum_{k m \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)} \bigg/ \sum_{n \leq L} |f(n)|^{2} + O\!\left( \frac{1}{T} \right)\!. \end{align*}
Here, the implicit constant is absolute.
3·1. Preliminaries
Throughout this paper, we set
$\Phi(t) = e^{-t^{2}/2}$
. As an auxiliary result, we first prove the following proposition.
Proposition 3·2. Assume RH. For any arithmetic function f, any
$L, T \geq 3$
satisfying
$L \leq T / (\!\log{T})^{2}$
, and any
$0 \lt h \leq 1$
we have
\begin{align*} &\int_{-\infty}^{\infty}\left\{ S\big(t + \tfrac{h}{2}\big) - S\big(t - \tfrac{h}{2}\big) \right\} |R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\\ &\quad = -\sqrt{2\pi}\frac{T}{\log{T}}\frac{2}{\pi}\operatorname{Re}\sum_{k m \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)} + O\!\left( \frac{1}{T}\sum_{n \leq L}|f(n)|^{2} \right)\!. \end{align*}
To show this proposition, we require some auxiliary lemmata.
Lemma 3·3. For any arithmetic function f and any
$L \geq 3$
we have
Proof. The first inequality of (3·1) is obvious by the triangle inequality. We also find by the Cauchy–Schwarz inequality that
\begin{align*} \sum_{m, n \leq L} |f(m)\,f(n)| = \!\left( \sum_{n \leq L}|f(n)| \right)^{2} \leq \sum_{n \leq L} 1 \times \sum_{n \leq L}|f(n)|^{2} = L \times \sum_{n \leq L}|f(n)|^{2}. \end{align*}
Hence, we obtain inequality (3·1).
The following lemma gives an explicit bound for estimates shown in [ Reference Bondarenko and Seip2 , lemma 5].
Lemma 3·4. For any arithmetic function f and any
$L, T \geq 3$
satisfying
$L \leq T / (\!\log{T})^{2}$
we have
Proof. It holds from the definition of R(t) that
since
$\int_{-\infty}^{\infty} \Phi(u) e^{-\mathrm{i} x u} \, \mathrm{d} u = \sqrt{2\pi} \Phi(x)$
. Using (3·1), we find that
\begin{align*} \left|\sum_{\substack{m, n \leq L\\ m\not= n}} f(m)\,\overline{f(n)} \!\left( \frac{m}{n} \right)^{3 \mathrm{i} T / 2} \Phi\!\left( \frac{T}{\log{T}} \log{\frac{m}{n}} \right)\right| &\leq \Phi\!\left(\frac{T}{\log{T}} \frac{(\!\log{T})^{2}}{2T}\right)\sum_{m, n \leq L}|f(m)f(n)|\\ &\leq \Phi\!\left(\tfrac{1}{2}\log{T}\right) L \sum_{n \leq L}|f(n)|^{2} \leq \frac{1}{T} \sum_{n \leq L}|f(n)|^{2}. \end{align*}
Adding the diagonal-terms to this, we complete the proof of Lemma 3·4.
Lemma 3·5. Let V be an analytic function in the horizontal strip
$\left\{ z \in \mathbb{C}: -({3}/{2}) \leq \operatorname{Im} z \leq 0 \right\}$
satisfying
$ \displaystyle{\sup_{-\frac{3}{2} \leq y \leq 0}|V(x + \mathrm{i} y)| \ll (|x| \log^{2}{x})^{-1}}. $
For any
$v \in \mathbb{R}$
, we have
\begin{align*} &\int_{-\infty}^{\infty}\log\zeta\big(\tfrac{1}{2} + \mathrm{i}(t + v)\big)V(t)\, \mathrm{d} t\\ &= \sum_{n = 2}^{\infty}\frac{\Lambda(n)}{n^{\frac{1}{2} + \mathrm{i} v}\log{n}}\widehat{V}\!\left( \frac{\log{n}}{2\pi} \right) + 2\pi \sum_{\beta \gt \frac{1}{2}}\int_{0}^{\beta - \frac{1}{2}}V(\gamma - v - \mathrm{i}\sigma)\, \mathrm{d}\sigma - 2\pi \int_{0}^{\frac{1}{2}}V(- v - \mathrm{i}\sigma)\, \mathrm{d}\sigma. \end{align*}
Here,
$\widehat{V}$
is the Fourier transform of V defined by
$\widehat{V}(z) = \int_{-\infty}^{\infty}V(x)e^{-2\pi \mathrm{i} x z}\, \mathrm{d} x$
.
Proof. This is obtained by (2·14) in [ Reference Tsang13 ] and the argument below (2·14).
3·2. Proof of Proposition 3·2
We write
\begin{align*} &\int_{-\infty}^{\infty}\log\zeta\big(\tfrac{1}{2} + \mathrm{i}\big(t \pm \tfrac{h}{2}\big)\big) |R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\\ &\quad = \sum_{m, n \leq L}f(m)\,\overline{f(n)} \int_{-\infty}^{\infty}\log\zeta\big(\tfrac{1}{2} + \mathrm{i}\big(t \pm \tfrac{h}{2}\big)\big) \!\left( \frac{m}{n} \right)^{-\mathrm{i}t} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t. \end{align*}
We use Lemma 3·5 with
$V_{m, n}(z) = (n / m)^{\mathrm{i}z} \Phi((z - 3T / 2) / (T / \log{T}))$
to find that this equals
\begin{align*} & \sum_{m, n \leq L}f(m)\,\overline{f(n)} \Biggl\{\sum_{k = 2}^{\infty}\frac{\Lambda(k)}{k^{\frac{1}{2} \pm \mathrm{i}h / 2}\log{k}}\widehat{V_{m, n}}\!\left( \frac{\log{k}}{2\pi} \right)\\ &- 2\pi\int_{0}^{\frac{1}{2}}\!\left( \frac{m}{n} \right)^{-\sigma \pm \mathrm{i}(h / 2)}\Phi\!\left( \frac{\mp (h / 2) - \mathrm{i}\sigma - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} \sigma \Biggr\} \end{align*}
under RH. The latter term is
by (3·1). Also, the former term is
\begin{align*} &= \sqrt{2\pi}\frac{T}{\log{T}}\sum_{m, n \leq L} \sum_{k = 2}^{\infty} f(m)\,\overline{f(n)} \frac{\Lambda(k)}{\sqrt{k} \log{k}} k^{\mp \mathrm{i}h/2} \!\left( \frac{km}{n} \right)^{-3\mathrm{i}T / 2} \Phi\!\left( \frac{T}{\log{T}}\log\!\left( \frac{km}{n} \right) \right) \end{align*}
since
$\int_{-\infty}^{\infty} \Phi(u) e^{-\mathrm{i} x u} \, \mathrm{d} u = \sqrt{2\pi} \Phi(x)$
. Simple calculations using (3·1) show that
\begin{align*} &\underset{km \not= n}{\sum_{m, n \leq L} \sum_{2 \leq k \leq T^{2}}} |f(m)\,f(n)| \frac{1}{k^{1/2}} \Phi\!\left( \frac{T}{\log{T}}\log\!\left( \frac{km}{n} \right) \right)\\ &\quad \ll L \sum_{n \leq L} |f(n)|^{2} \sum_{2 \leq k \leq T^{2}} \frac{1}{k^{1/2}} \Phi(\!\log{T}) \ll \frac{1}{T^{2}} \sum_{n \leq L}|f(n)|^{2}, \end{align*}
and that
\begin{align*} &\underset{km \not= n}{\sum_{m, n \leq L} \sum_{k \gt T^{2}}} |f(m)\,f(n)| \frac{1}{k^{1/2}} \Phi\!\left( \frac{T}{\log{T}}\log\!\left( \frac{km}{n} \right) \right)\\ &\quad \ll \sum_{m, n \leq L}|f(m)\,f(n)| \sum_{k \gt T^{2}} \frac{1}{k^{1/2}} k^{-T / 2\log{T}} \ll L \sum_{n \leq L} |f(n)|^{2} \times T^{-3} \ll \frac{1}{T^{2}} \sum_{n \leq L}|f(n)|^{2}. \end{align*}
Following these, we have
\begin{align*} &\int_{-\infty}^{\infty}\log\zeta\big(\tfrac{1}{2} + \mathrm{i}\big(t \pm \tfrac{h}{2}\big)\big) |R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\\ &\quad = \sqrt{2\pi}\frac{T}{\log{T}}\sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}}k^{\mp \mathrm{i}h /2} f(m)\,\overline{f(k m)} + O\!\left( \frac{1}{T}\sum_{n \leq L}|f(n)|^{2} \right)\!. \end{align*}
This also leads to
\begin{align*} &\int_{-\infty}^{\infty}\left\{ S\big(t + \tfrac{h}{2}\big) - S\big(t - \tfrac{h}{2}\big) \right\} |R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\\ &\quad = -\sqrt{2\pi}\frac{T}{\log{T}}\frac{2}{\pi}\operatorname{Re}\sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)} + O\!\left( \frac{1}{T}\sum_{n \leq L}|f(n)|^{2} \right)\!. \end{align*}
Thus, we complete the proof of Proposition 3·2.
3·3. Proof of Proposition 3·1
Let L, T be large numbers that satisfy
$L \leq T / (\!\log{T})^{2}$
, and let
$0 \lt h \leq 1$
. Write
We then find by Proposition 3·2 that
\begin{align} I = -\frac{\sqrt{2\pi} T}{\log{T}}\frac{2}{\pi}\operatorname{Re}\sum_{2 \leq k \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\sum_{k m \leq L}f(m)\,\overline{f(k m)} + O\!\left( \frac{1}{T}\sum_{n \leq L}|f(n)|^{2} \right)\!. \end{align}
First, we show that
\begin{align} I &= \int_{4T/3 \leq t \leq 5T/3}\!\left(S\big(t + \tfrac{h}{2}\big) - S\big(t - \tfrac{h}{2}\big)\right) |R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\nonumber \\ &\quad+ O\!\left( \frac{1}{T} \sum_{n \leq L}|f(n)|^{2} \right)\!. \end{align}
Using Lemma 3·3 and the estimate
$S(t) \ll \log\!(|t| + 3)$
, we find by simple calculations that
and that
Therefore, we obtain (3·3).
We extract extreme values of
$\pm\{S(t + h) - S(t)\}$
by
\begin{align*} &\pm \int_{4T/3 \leq t \leq 5T/3}\!\left(S\big(t + \tfrac{h}{2}\big) - S\big(t - \tfrac{h}{2}\big)\right) |R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\\ &\quad \leq \sup_{T \leq t \leq 2T}\left\{\pm \!\left(S(t + h) - S(t)\right)\right\} \int_{-\infty}^{\infty}|R(t)|^{2} \Phi\!\left( \frac{t - 3T / 2}{T / \log{T}} \right)\!\mathrm{d} t\\ &\quad \leq \frac{\sqrt{2\pi} T}{\log{T}} \!\left( 1 + O\!\left( \frac{1}{T} \right) \right) \sup_{T \leq t \leq 2T}\left\{\pm \!\left(S(t + h) - S(t)\right)\right\} \sum_{n \leq L}|f(n)|^{2}. \end{align*}
In the last step, we have used Lemma 3·4. Combining this with (3·2), we obtain
\begin{align*} &\sup_{T \leq t \leq 2T}\left\{\pm\!\left(S(t + h) - S(t)\right)\right\} \times \sum_{n \leq L} |f(n)|^{2}\\ &\geq \mp\!\left( 1 + O\!\left(\frac{1}{T}\right) \right)\frac{2}{\pi} \operatorname{Re}\sum_{2 \leq k \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big) \sum_{k m \leq L}f(m)\,\overline{f(k m)} + O\!\left(\!\frac{1}{T}\sum_{n \leq L}|f(n)|^{2} \!\right)\!. \end{align*}
This completes the proof of Proposition 3·1.
4. Proof of Theorem 1·1
In this section, we let L denote a large number,
$h \in [C / \log{L}, c / \log\log{L}]$
with positive constants C large and c small. We choose
$f = f_{\pm}$
as the multiplicative function supported on square-free numbers such that for any prime p
if
$\exp(\sqrt{\log\log{L}} / \sqrt{h}) \;=\!:\; M \lt p \leq L$
and
$f_{\pm}(p) = 0$
otherwise. Here, the numbers
$\kappa$
and Q are to be chosen as
where
$ y = \sqrt{\log\!(h \log{L}) / h \log{L}}. $
It then holds that
$Q \asymp h \log{L}$
and
$\kappa, y$
are sufficiently small when
$h \in [C / \log{L}, c / \log\log{L}]$
. These parameters are determined to optimise quantity (4·2) below. For this
$f_{\pm}$
, we give a lower bound of the ratio of resonator in the following proposition.
Proposition 4·1. Let L be large, and let
$C / \log{L} \leq h \leq c / \log\log{L}$
with positive constants C large and c small. Then we have
\begin{align*} &\pm \frac{2}{\pi} \sum_{k m \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f_{\pm}(m)\,f_{\pm}(k m) \bigg/ \sum_{n = 1}^{\infty}f_{\pm}(n)^{2}\\ &\quad \geq \left\{1 + O\!\left(\sqrt{h \log\log{L}} + \min\left\{ \sqrt{\frac{\log^{3}(h \log{L})}{h \log{L}}}, \frac{(\!\log\log{L})^{3/2}}{h^{3/2} \log{L}} \right\}\right) \right\}\sqrt{\frac{h}{\pi} \log{L}}. \end{align*}
Theorem 1·1 immediately follows from Proposition 3·1 and this proposition in the case
$L = T / (\!\log T)^{2}$
.
Proof. Put
$\alpha = \kappa h$
. First, we observe by the definition of
$f_{\pm}$
that
\begin{align} &\pm \frac{2}{\pi} \sum_{k m \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f_{\pm}(m)\,f_{\pm}(k m)\nonumber \\ &= \sqrt{Q} \frac{2}{\pi} \sum_{M\lt p \leq L} \frac{\sin^{2}\big(\tfrac{h}{2}\log{p}\big)}{p^{1 + \alpha} h \log{p}} \sum_{\substack{m \leq L / p\\ p \nmid m}}f_{\pm}(m)^{2}. \end{align}
We find by the definition of
$f_{\pm}$
and Rankin’s trick that
\begin{align*} &\sum_{\substack{m \leq L / p\\ p \nmid m}}f_{\pm}(m)^{2}\\ &\quad \geq \sum_{\substack{n = 1\\ p \nmid n}}^{\infty} f_{\pm}(n)^{2} - \!\left(\frac{p}{L}\right)^{\alpha}\sum_{\substack{n = 1\\ p \nmid n}}^{\infty}f_{\pm}(n)^{2}n^{\alpha}\\ &\quad = \prod_{\substack{M \lt q \leq L\\ q \not= p}}\!\left( 1 + f_{\pm}(q)^{2} \right) - \!\left(\frac{p}{L}\right)^{\alpha}\prod_{\substack{M \lt q \leq L\\ q \not= p}}\!\left(1 + f_{\pm}(q)^{2}q^{\alpha}\right) \end{align*}
\begin{align*} &\quad = \frac{1}{1 + f_{\pm}(p)^{2}} \prod_{M \lt q \leq L}\!\left( 1 + f_{\pm}(q)^{2} \right) - \!\left(\frac{p}{L}\right)^{\alpha} \frac{1}{1 + f_{\pm}(p)^{2}p^{\alpha}} \prod_{M \lt q \leq L}\!\left(1 + f_{\pm}(q)^{2}q^{\alpha}\right)\\ & \quad= \!\left( \frac{1}{1 + f_{\pm}(p)^{2}} - \frac{\!\left( p/ L \right)^{\alpha}}{1 + f_{\pm}(p)^{2}p^{\alpha}}\prod_{M \lt q \leq L}\frac{1 + f_{\pm}(q)^{2} q^{\alpha}}{1 + f_{\pm}(q)^{2}} \right) \times \prod_{M \lt q \leq L}\!\left( 1 + f_{\pm}(q)^{2} \right)\!. \end{align*}
Since the estimate
$f_{\pm}(p)^{2} p^{\alpha} \ll Q / \log{L} \asymp h$
holds and
$f_{\pm}$
is supported on square-free and
$M \lt p \leq L$
, this is also equal to
\begin{align*} \left\{ 1 - \!\left( 1 + O\!\left( \frac{Q}{\log{L}} \right) \right) \!\left( \frac{p}{L} \right)^{\alpha} \prod_{M \lt q \leq L}\frac{1 + f_{\pm}(q)^{2} q^{\alpha}}{1 + f_{\pm}(q)^{2}} + O\!\left( \frac{Q}{\log{L}} \right) \right\} \sum_{n = 1}^{\infty}f_{\pm}(n)^{2}. \end{align*}
Observe that
\begin{align*} \prod_{M \lt q \leq L}\frac{1 + f_{\pm}(q)^{2} q^{\alpha}}{1 + f_{\pm}(q)^{2}} &= \prod_{M \lt q \leq L}\!\left(1 + \frac{f_{\pm}(q)^{2} (q^{\alpha} - 1)}{1 + f_{\pm}(q)^{2}}\right)\\ &= \exp\!\left( \!\left( 1 + O\!\left( \frac{Q}{\log{L}} \right) \right)\sum_{M \lt q \leq L} f_{\pm}(q)^{2} (q^{\alpha} - 1) \right)\!. \end{align*}
Routine calculations using the prime number theorem and partial summation show that
\begin{align*} \sum_{M \lt p \leq L} \frac{\sin^{2}\big(\tfrac{h}{2}\log{p}\big)}{p^{1 + \alpha} h \log{p}} = \frac{\pi}{2} \varphi_{2}(\mathscr{L};\; \kappa) + O\!\left( \sqrt{h \log\log{L}} \right)\!, \end{align*}
and that
\begin{align*} \sum_{M \lt p \leq L} \frac{\sin^{2}\big(\tfrac{h}{2}\log{p}\big)}{p h \log{p}} = \frac{\pi}{2} \varphi(\mathscr{L}) + O\!\left( \sqrt{h \log\log{L}} \right)\!, \end{align*}
where
$\mathscr{L} = ({h}/{2\pi}) \log{L}$
, and
$\varphi$
is as in the statement of Theorem 1·3, and
$\varphi_{2}$
,
$\varphi_{3}$
are by
Therefore, quantity (4·1) is
Here, the error terms
$E_{1}, E_{2}, E_{3}$
satisfy
$E_{1} \ll h$
, and
$ E_{2}, E_{3} \ll \sqrt{h \log\log{L}}$
. By the choice of Q, we find that this lower bound is
\begin{align} \left\{ \varphi_{2}(\mathscr{L};\; \kappa) - (1 + E_{1})\varphi(\mathscr{L})\exp\!\left(- \kappa (y - (1 - y) E_{2}) h \log{L} \right) + E_{3} \right\} \sqrt{\frac{4 \kappa (1 - y)}{\pi \varphi_{3}(\mathscr{L};\; \kappa)}} \sqrt{h \log{L}}. \end{align}
Noting the choices of y and
$\kappa$
, we see that for
$l = 1 / \kappa \sqrt{\log\!(1 / \kappa)}$
\begin{align*} \varphi_{2}(\mathscr{L};\; \kappa) &= \int_{0}^{l} \!\left( \frac{\sin\!(\pi u)}{\pi u} \right)^{2} \!\left( 1 + O\!\left( \kappa u \right) \right)\!\mathrm{d} u + O\!\left(\int_{l}^{\mathscr{L}} \frac{\mathrm{d} u}{u^{2}} \right)\\ &= \int_{0}^{\infty} \!\left( \frac{\sin\!(\pi u)}{\pi u} \right)^{2} \, \mathrm{d} u + O\!\left( \kappa \log{l} + \frac{1}{l} \right) = \frac{1}{2} + O\!\left( \kappa \log\!(1 / \kappa) \right)\!, \end{align*}
and that
\begin{align*} \varphi_{3}(\mathscr{L};\; \kappa) &= 2 \kappa \int_{0}^{l} \!\left( \frac{\sin\!(\pi u)}{\pi u} \right)^{2} \!\left( 1 + O\!\left( \kappa u \right) \right)\!\mathrm{d} u + O\!\left(\int_{l}^{\mathscr{L}} \frac{\mathrm{d} u}{u^{3}} \right)\\ &= 2 \kappa \int_{0}^{\infty} \!\left( \frac{\sin\!(\pi u)}{\pi u} \right)^{2} \, \mathrm{d} u + O\!\left( \kappa^{2} \log{l} + \frac{1}{l^{2}} \right) = \kappa \!\left(1 + O\!\left( \kappa \log\!(1 / \kappa) \right) \right)\!. \end{align*}
Hence, (4·3) is
\begin{align*} \left\{1 + O\!\left(\sqrt{h \log\log{T}} + \min\left\{ \sqrt{\frac{\log^{3}(h \log{T})}{h \log{T}}}, \frac{(\!\log\log{T})^{3/2}}{h^{3/2} \log{T}} \right\}\right) \right\}\sqrt{\frac{h}{\pi} \log{L}}, \end{align*}
which completes the proof of Proposition 4·1.
The above proof gives a good lower bound of the ratio of resonators. In particular, we obtain the following theorem by combining the lower bound with Theorem 1·3.
Theorem 4·2. Let
$\mathscr{A}$
be the set of arithmetic functions such that the value at one is not equal zero. For any large L and for
$h \in [C / \log{L}, c / \log\log{L}]$
with positive constants C large and c small, we have
\begin{align*} &\sup_{f \in \mathscr{A}} \left\{\pm \operatorname{Re} \sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)} \bigg/ \sum_{n \leq L} |f(n)|^{2}\right\} = (1 + E) \sqrt{\frac{h}{\pi} \log{L}}, \end{align*}
where
\begin{align*} E \ll \min\left\{\sqrt{\frac{\log^{3}(h \log{L})}{h \log{L}}}, \frac{(\!\log\log{L})^{3/2}}{h^{3/2} \log{L}}\right\} + \sqrt{h \log\log{L}}. \end{align*}
Proof. The lower bound has already shown in (4·1). The upper bound can be also proved by Theorem 1·3. Actually, we use Theorem 1·3 with
$W = ({4}/{\pi}) h \log L$
to obtain that
\begin{align*} &\bigg|\operatorname{Re} \sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)}\bigg| \bigg/ \sum_{n \leq L} |f(n)|^{2}\\ &\quad \leq \frac{\varphi(\frac{h}{2\pi} \log L)}{2} \sqrt{\frac{4}{\pi} h \log T} + \frac{h \log L}{\pi \sqrt{\frac{4}{\pi} h \log L}} + O(h\sqrt{h \log L}) \leq \left( 1 + O(h) \right)\sqrt{\frac{h}{\pi} \log{L}} \end{align*}
since
$\varphi(x) \leq 1/2$
. Thus, we also obtain the upper bound.
5. Proof of Theorem 1·2
Let r be a sufficiently large positive integer. For any
$\theta' \gt 0$
and any large
$T \geq T_{0}(r, \theta')$
, we have
\begin{align*} \inf_{T \leq t \leq 2T}S(t + 2\pi r \theta' / \log T) - S(t) &\leq -\!\left( 1 + O\!\left( \frac{(\!\log r)^{3/2}}{r^{1/2}} \right) \right)\sqrt{2 r \theta'}\\ &= -r \!\left( \sqrt{\frac{2}{r}\theta'} + O\!\left( \frac{(\!\log r)^{3/2}}{r} \right) \right) \end{align*}
by Theorem 1·1. Therefore, if
$\theta$
is chosen as
with
$C_{1}$
a sufficiently large absolute positive constant, then the inequality
holds for any large T, where
and
Hence, by Proposition 2·1, we obtain the inequality of
$\lambda_{r}$
in (1·4). Similarly, we can prove the inequality of
$\mu_{r}$
.
6. Proof of Theorem 1·3
Let h be an arbitrary positive number, and let L be large. Let W be an arbitrary positive number. Define
$g(n) = \sqrt{W} / h \sqrt{n} \log{n}$
. Then we adapt Soundararajan’s method, which uses an inequality similar to
$2|f(m) \sin\!(({h}/{2}) \log{k})\,f(k m)| \leq |f(m)|^{2} \sin^{2}(({h}/{2})\log{k}) g(k) + |f(k m)|^{2} / g(k)$
, to obtain
\begin{align*} &\bigg|\operatorname{Re}\frac{2}{\pi} \sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)}\bigg|\\ &\quad \leq \frac{1}{\pi} \sum_{2 \leq k \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sum_{k m \leq L} \!\left( |f(m)|^{2} \sin^{2}\big(\tfrac{h}{2}\log{k}\big) g(k) + \frac{|f(k m)|^{2}}{g(k)}\right) \end{align*}
\begin{align*} &\quad = \frac{1}{\pi} \sum_{n \leq L} |f(n)|^{2} \!\left( \sqrt{W}\sum_{p^{a} \leq L / n} \frac{\sin^{2}(\frac{h}{2}\log{p^{a}})}{l^{2} p^{a} h \log{p}} + \sum_{k \mid n} \frac{h \Lambda(k)}{\sqrt{W}}\right)\\ &\quad = \frac{1}{\pi} \sum_{n \leq L} |f(n)|^{2} \!\left( \sqrt{W} \sum_{p^{a} \leq L / n} \frac{\sin^{2}(\frac{h}{2}\log{p^{a}})}{a^{2} p^{a} h \log{p}} + \frac{h \log{n}}{\sqrt{W}}\right)\!. \end{align*}
Routine calculations using the prime number theorem and partial summation show that
\begin{align*} \sum_{p^{a} \leq L / n} \frac{\sin^{2}(\frac{h}{2}\log{p^{a}})}{a^{2} p^{a} h \log{p}} &= \sum_{p \leq L / n} \frac{\sin^{2}(\frac{h}{2}\log{p})}{p h \log{p}} + O(h)\\ &= \int_{2}^{L / n} \frac{\sin^{2}(\frac{h}{2}\log{\xi})}{\xi h (\!\log{\xi})^{2}}\, \mathrm{d}\xi + O(h) = \frac{\pi}{2} \varphi\!\left(\tfrac{h}{2\pi}\log\!(L / n)\right) + O(h). \end{align*}
Therefore, it holds that
\begin{align*} &\frac{1}{\pi} \sum_{n \leq L} |f(n)|^{2} \left\{ \sqrt{W} \sum_{p^{a} \leq L / n} \frac{\sin^{2}(\frac{h}{2}\log{p^{a}})}{l^{2} p^{a} h \log{p}} + \frac{h \log{n}}{\sqrt{W}}\right\}\\ &\quad \leq \frac{1}{\pi} \!\left( \max_{n \leq L} \left\{ \sqrt{W} \frac{\pi}{2} \varphi\!\left( \tfrac{h}{2\pi} \log\!(L / n) \right) + \frac{h \log{n}}{\sqrt{W}}\right\} + O(h \sqrt{W})\right) \sum_{n \leq L} |f(n)|^{2}\\ &\quad \leq \!\left( \max_{1 \leq l \leq L} \left\{ \frac{\sqrt{W}}{2} \varphi\!\left( \tfrac{h}{2\pi} \log\!(L / l) \right) + \frac{h \log{l}}{\pi \sqrt{W}}\right\} + O(h \sqrt{W})\right) \sum_{n \leq L} |f(n)|^{2}. \end{align*}
Hence, we have
\begin{align*} &\bigg|\operatorname{Re}\frac{2}{\pi} \sum_{km \leq L} \frac{\Lambda(k)}{\sqrt{k} \log{k}} \sin\!\big(\tfrac{h}{2}\log{k}\big)\,f(m)\,\overline{f(k m)}\bigg|\\ &\quad \leq \!\left( \max_{1 \leq l \leq L} \left\{ \frac{\sqrt{W}}{2} \varphi\!\left( \tfrac{h}{2\pi} \log\!(L / l) \right) + \frac{h \log{l}}{\pi\sqrt{W}}\right\} + O(h \sqrt{W})\right) \sum_{n \leq L} |f(n)|^{2}. \end{align*}
Since the parameter W is arbitrary, we have (1·5).
7. Limitations of
$\lambda_{1}$
and
$\mu_{1}$
deduced from Theorem 1·3
If
$\tau(\xi;\;\, f) \gt 1$
for any
$L \leq T$
, any arithmetic function f, and any
$\xi \geq \xi_{0}$
, then the bound
$\lambda_{1} \geq \xi_{0}$
becomes the limitation for the Montgomery–Odlyzko method. Note that the right hand side of the inequality in Theorem 1·3 is increasing for L, and hence we may assume
$L = T$
in the following argument. Using Theorem 1·3 with
$l = T^{x}$
,
$W = 22.6$
, we have
\begin{align*} \tau(\xi;\;\, f) \geq \xi - \max_{0 \leq x \leq 1}\left\{\frac{\sqrt{W}}{2} \varphi\!\left( \xi (1 - x) \right) + \frac{2 \xi x}{\sqrt{W}}\right\} - o(1) \end{align*}
for any arithmetic function f that is not identically zero. The right-hand side exceeds one when
$\xi \geq \xi_{0} = 3.022$
. From this observation, we deduce that the limitation of
$\lambda_{1}$
for the Montgomery–Odlyzko method is
$\lambda_{1} \geq 3.022$
. Similarly, we conclude that the limitation of
$\mu_{1}$
for the Montgomery–Odlyzko method is
$\mu_{1} \leq 0.508$
by using Theorem 1·3 with
$W = 4.9$
.
Remark 7·1. We should mention the difference between our work and Goldston, Trudgian, Turnage–Butterbaugh [
Reference Goldston, Trudgian and Turnage–Butterbaugh6
]. The works [
Reference Conrey, Ghosh and Gonek4, Reference Goldston, Trudgian and Turnage–Butterbaugh6
] used the inequality
$|z w| \leq (|z|^{2} + |w|^{2})/2$
for
$w, z \in \mathbb{C}$
, partial summation, and the inequality
$|\sin x| \leq |x|$
for
$x \in \mathbb{R}$
. On the other hand, we avoid using the final inequality and instead derive the result by a direct analysis of the sine function.
Acknowledgements
The authors would like to thank Professor Timothy Trudgian for providing us with valuable comments. The first author is supported by JSPS KAKENHI Grant Number 24K16907. The second author is supported by JSPS KAKENHI Grant Number 25K17245. The third author is supported by Grant-in-Aid for JSPS Research fellow Grant Number 24KJ1235.

