Abstract
We extend the Matomäki–Radziwiłł theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a function f in typical intervals of length \(h(\log X)^c\), with \(h = h(X) \rightarrow \infty \) and where \(c = c_f \ge 0\) is determined by the distribution of \(\{|f(p) |\}_p\) in an explicit way. We give three applications. First, we show that the classical Rankin–Selberg-type asymptotic formula for partial sums of \(|\lambda _f(n) |^2\), where \(\{\lambda _f(n)\}_n\) is the sequence of normalized Fourier coefficients of a primitive non-CM holomorphic cusp form, persists in typical short intervals of length \(h\log X\), if \(h = h(X) \rightarrow \infty \). We also generalize this result to sequences \(\{|\lambda _{\pi }(n) |^2\}_n\), where \(\lambda _{\pi }(n)\) is the nth coefficient of the standard L-function of an automorphic representation \(\pi \) with unitary central character for \(GL_m\), \(m \ge 2\), provided \(\pi \) satisfies the generalized Ramanujan conjecture. Second, using recent developments in the theory of automorphic forms we estimate the variance of averages of all positive real moments \(\{|\lambda _f(n) |^{\alpha }\}_n\) over intervals of length \(h(\log X)^{c_{\alpha }}\), with \(c_{\alpha } > 0\) explicit, for any \(\alpha > 0\), as \(h = h(X) \rightarrow \infty \). Finally, we show that the (non-multiplicative) Hooley \(\Delta \)-function has average value \(\gg \log \log X\) in typical short intervals of length \((\log X)^{1/2+\eta }\), where \(\eta >0\) is fixed.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction and main results
1.1 The Matomäki–Radziwiłł theorem for bounded multiplicative functions
The Matomäki–Radziwiłł theorem, in its various incarnations, gives estimates for the error term in approximating the average of a bounded multiplicative function in a typical short interval by a corresponding long interval average. In the breakthrough paper [26], the authors showed that, uniformly over all real-valued multiplicative functions \(f: \mathbb {N} \rightarrow [-1,1]\), for any \(1 \le h \le X\) such that \(h = h(X) \rightarrow \infty \) as \(X \rightarrow \infty \),
for all but o(X) integers \(x \in [X/2,X]\). A key feature of this result is that the interval length h can grow arbitrarily slowly as a function of X. This result has had countless applications to a variety of problems across mathematics, including to partial results toward Chowla’s conjecture on correlations of the Liouville function [36, 38], the resolution of the famous Erdős discrepancy problem [37], and progress on Sarnak’s Möbius disjointness conjecture (e.g., [3, 35]; see [20] for a more exhaustive list).
Since [26], the result has been extended and generalized in various directions. In [27], a corresponding short interval result was given for non-pretentious complex-valued multiplicative functions \(f:\mathbb {N} \rightarrow \mathbb {U}\), where \(\mathbb {U} := \{z \in \mathbb {C} : |z |\le 1\}\). To be precise, if we define
where \(\mathbb {D}\) denotes the Granville–Soundararajan pretentious distance, they showed that if \(f: \mathbb {N} \rightarrow \mathbb {U}\) satisfies \(D_f(X;X) \rightarrow \infty \) then
for all but o(X) integers \(x \in [X/2,X]\), whenever \(h = h(X) \rightarrow \infty \). In a different direction, exploring the heuristic relationship between the distributions of arithmetic functions in short intervals and in short arithmetic progressions, Klurman, the author and Teräväinen [19] obtained an analogue of (1.1) for typicalFootnote 1 short arithmetic progressions.
In the recent paper [25], a widely generalized version of the results of [26] was developed, which among other things extended the work of [27]. The authors showed that for a general complex-valued multiplicative function \(f: \mathbb {N} \rightarrow \mathbb {U}\), if \(t_0 = t_0(f,X)\) is a minimizer in the definition of \(D_f(X;X)\) then for all but o(X) integers \(x \in [X/2,X]\), one obtains an asymptotic formula with main term of the form
with a better quantitative dependence of the bound for the exceptional set on the interval length h than in [26].
By Shiu’s theorem (Lemma 3.2), we have
so (1.2) is trivial whenever \(\sum _{p \le X} \frac{1-|f(p) \vert }{p} \rightarrow \infty \), for instance, if \(f(p) = 0\) significantly often on the primes. Rectifying this weakness, Matomäki and Radziwiłł improved the quality of the o(1) error term for a large collection of 1-bounded functions with sparse prime support. Specifically, they showed that if there are constants \(A > 0\) and \(\theta \in (0,1]\) such that the sieve-type lower bound condition
holds then one can improve the o(1) term to
This savings comes at a natural cost, namely that the length of the interval h is no longer arbitrarily slow growing as a function of X, but must grow in a manner that depends on the sparseness of the supportFootnote 2 of f.
Precisely, the main result of [25] may be stated as follows. In the sequel, for a multiplicative function \(f: \mathbb {N} \rightarrow \mathbb {U}\) we write
Theorem
(Matomäki–Radziwiłł, [25] Thm. 1.9) Let \(A > 0\) and \(\theta \in (0,1]\). Let \(f: \mathbb {N} \rightarrow \mathbb {U}\) be a multiplicative function such that (1.3) holds for all \(2 \le z\le w \le X^{\theta }\). Let \(2 \le h_0 \le X^{\theta }\) and put \(h := h_0H(f;X)\). Also, set \(t_0 = t_0(f,X)\). Then there are constantsFootnote 3\(C = C(\theta ) > 1\), \(\rho _A > 0\) such that for any \(\delta \in (0,1/1000)\) and \(0< \rho < \rho _A\),
for all \(x \in [X/2,X]\) outside of a set of size
1.2 Divisor-bounded multiplicative functions
Let \(B \ge 1\). We define the generalized B-divisor function \(d_B(n)\) via
It can be deduced that \(d_B(n)\) is multiplicative, and moreover \(d_B(p^k) = \tfrac{\Gamma (B+k)}{k!\Gamma (B)}\), for all \(k \ge 1\). In particular, \(d_B(p) = B\). For integer values of B this coincides with the usual B-fold divisor functions, e.g., when \(B = 2\) we have \(d_B(n) = d(n)\), and when \(B = 1\) we have \(d_B(n) \equiv 1\).
We say that a multiplicative function \(f: \mathbb {N} \rightarrow \mathbb {C}\) is divisor-bounded if there is a \(B \ge 1\) such that \(|f(n) |\le d_B(n)\) for all n. When \(B = 2\), for example, this includes functions such as the twisted divisor function \(d(n,\theta ) := \sum _{d \mid n} d^{i\theta }\) for \(\theta \in \mathbb {R}\), as well as r(n)/4, where \(r(n) := |\{(a,b) \in \mathbb {Z}^2 : a^2+b^2 =n\} |\).
There is a rich literature about mean values of general, 1-bounded multiplicative functions. The works of Wirsing [43] and Halász [10] are fundamental, with noteworthy developments by Montgomery [29] and Tenenbaum [39, Thm. III.4.7]. The theory has recently undergone an important change in perspective, due in large part to the extensive, pioneering works of Granville and Soundararajan (e.g., [8, 9]). This well-formed theory significantly informs the results of [25, 26].
In comparison, the study of long averages of general unbounded multiplicative functions has only garnered significant interest more recently. Granville, Harper, and Soundararajan [7], in developing a new proof of a quantitative form of Halász’ theorem, were able to obtain bounds for averages of multiplicative functions \(f: \mathbb {N} \rightarrow \mathbb {C}\) for which the coefficients of the Dirichlet seriesFootnote 4
satisfy the bound \(|\Lambda _f(n) |\le B \Lambda (n)\) uniformly over \(n \in \mathbb {N}\) for some \(B \ge 1\), where \(\Lambda (n)\) is the von Mangoldt function. Such functions satisfy \(|f(n) |\le d_B(n)\) for all n. In [41], Tenenbaum, improving on qualitative results due to Elliott [1], established quantitative upper bounds and asymptotic formulae for the ratios \(|\sum _{n \le X} f(n) |/(\sum _{n \le X} |f(n) |)\), assuming f is uniformly bounded on the primes, not too large on average at prime powers, and satisfies a hypothesis like (1.3). See also [22, Ch. 2] for results of a similar kind under stronger hypotheses.
On the basis of these developments, it is reasonable to ask whether the results of [25, 26] can be extended to divisor-bounded functions of a certain type. This was hinted at in [25, p. 9] but, as far as the author is aware, it does not yet exist in the literature. The purpose of this paper is to establish such extensions for a broad class of divisor-bounded multiplicative functions, among other unbounded functions.
In the following subsection, we provide three examples that motivate our main theorem, Theorem 1.7. Besides the applications we give here, this result will also be applied in [23] to study short interval averages of general additive functions.
1.3 Applications
1.3.1 Rankin–Selberg estimates for \(GL_m\) in typical short intervals
Let f be a fixed even weight \(k \ge 2\), level 1 primitive Hecke-normalized holomorphic cusp form without complex multiplication, and write its Fourier expansion at \(\infty \) as
with \(\lambda _f(1) = 1\). Set also
By the Hecke relation
\(|\lambda _f |^2\) and thus also \(g_f\) are multiplicative functions. Deligne showed that \(|\lambda _f(p) |\le 2\) for all primes p, and in general \(|\lambda _f(n) |^2 \le d(n)^2\). Thus \(|\lambda _f |^2\) is bounded by a power of a divisor function, and the same can be shown for \(g_f\).
The classical Rankin–Selberg method shows [18, Sec. 14.9] that asymptotic formulae
hold as \(X \rightarrow \infty \), where \(c_f,d_f > 0\) are constants depending on f. The Rankin–Selberg problem is equivalent to asking for an improvement of the error term \(X^{-2/5}\) in both of these estimates, but this is not our point of interest here.
One can ask whether the above asymptotic formulae continue to hold in short intervals. Ivić [17] considered the variance of the error term in short interval averages. Specifically, he showed [17, Cor. 2] on the Lindelöf hypothesis that
as long as \(h \ge X^{2/5-\varepsilon }\), albeit with a power-saving error term in the latter range.
At the expense of the quality of the error term, we obtain the following improvement in the range where (1.5) holds.
Corollary 1.1
Let \(10 \le h_0 \le X/(10\log X)\) and set \(h := h_0 \log X\). Then there is a constant \(\theta > 0\) such that
The same estimate holds when \(|\lambda _f |^2\) and \(c_f\) are replaced by \(g_f\) and \(d_f\), respectively.
This corollary might appear surprising, given our currently incomplete understanding of the shifted convolution problem
Actually, our proof of Corollary 1.1 relies only on the multiplicativity of \(|\lambda _f |^2\), Deligne’s theorem, and the prime number theorem for Rankin–Selberg L-functions (see, e.g., Lemma 5.6). This suggestsFootnote 5 that a generalization to coefficients of automorphic L-functions for \(GL_n\) should be possible, provided that these satisfy the generalized Ramanujan conjecture and hence are divisor-bounded.
To be more precise, let \(m \ge 2\), let \(\mathbb {A}\) be the ring of adeles of \(\mathbb {Q}\), and let \(\pi \) be a cuspidal automorphic representation of \(GL_m(\mathbb {A})\) with unitary central character that acts trivially on the diagonally embedded copy of \(\mathbb {R}^+\). We let \(q_{\pi }\) denote the conductor of \(\pi \). The finite part of \(\pi \) factors as a tensor product \(\pi = \otimes _p \pi _p\), with local representations \(\pi _p\) at each prime p. The local L-function at p takes the form
where \(\{\alpha _{1,\pi }(p),\ldots ,\alpha _{m,\pi }(p)\} \subset \mathbb {C}\) are the Satake parameters of \(\pi _p\). The standard L-function of \(\pi \) is then
which converges absolutely when \(\text {Re}(s) > 1\). The sequence of coefficients \(\lambda _{\pi }(n)\) thus defined is multiplicative, with the property that
The generalized Ramanujan conjecture (GRC) implies that for all \(1 \le j \le m\), \(|\alpha _{j,\pi }(p) |= 1\) whenever \(p \not \mid q_{\pi }\) and otherwise \(|\alpha _{j,\pi }(p) |\le 1\). It follows that if \(\pi \) satisfies GRC then
and therefore that \(|\lambda _{\pi }(n) |\le d_m(n)\). As a consequence of these properties, we will prove the following.
Theorem 1.2
Let \(m \ge 2\) and let \(\pi \) be a fixed cuspidal automorphic representation for \(GL_m(\mathbb {A})\) as above. Assume that \(\pi \) satisfies GRC. Let \(10 \le h_0 \le X/(10(\log X)^{m^2-1})\) and let \(h:= h_0 (\log X)^{m^2-1}\). Then there is a constant \(\theta = \theta (m) > 0\) such that
Remark 1.3
In the case \(m =2\), the parameter h must grow faster than \((\log X)^3\) in Theorem 1.2, whereas Corollary 1.1 allows any h growing faster than \(\log X\). This is due to the fact that the range of h in these estimates depends on the size of \(\sum _{p \le X} |\lambda _{\pi }(p) |^4/p\). When \(\pi = \pi _f\) for a cusp form f on \(GL_2(\mathbb {A})\), we may estimate this sum using the well-known expression
for all primes p, since \(\text {Sym}^r f\) is cuspidal automorphic for \(r = 2,4\) and thus \(\sum _{p \le X} \lambda _{\text {Sym}^r f}(p)/p = O(1)\). When \(m \ge 3\), such data for \(|\lambda _{\pi }(p) |^4\) are not available unconditionally in general, to the best of the author’s knowledge. Assuming the validity of Langlands’ functoriality conjecture, a (likely more complicated) expression would follow from the factorization of the standard L-function L(s, f) of the representation \(f = \pi \otimes {\tilde{\pi }} \otimes \pi \otimes {\tilde{\pi }}\), where \({\tilde{\pi }}\) is the contragredient representation of \(\pi \). Using GRC alone, we cheaply obtain the simple upper bound
from Rankin–Selberg theory, and this is the source of the exponent \(m^2\) in the range of h.
We will instead deduce Corollary 1.1 from Theorem 1.4 below, which is tailored to \(GL_2\) cusp forms.
1.3.2 Moments of coefficients of \(GL_2\) cusp forms in typical short intervals
Our next application concerns short interval averages of the moments \(n \mapsto |\lambda _f(n) |^{\alpha }\), for any \(\alpha > 0\), with the notation of the previous subsection. This generalizes Corollary 1.1.
Theorem 1.4
Let \(\alpha > 0\) and define
Let \(10 \le h_0 \le X/(10 (\log X)^{d_{\alpha }})\) and put \(h := h_0 (\log X)^{d_{\alpha }}\). There is a constant \(\theta = \theta (\alpha ) > 0\) such that
When \(\alpha \ne 2\), the Rankin–Selberg theory is no longer available. In its place, a crucial role in the proof of this result is played by a quantitative version of the Sato–Tate theorem for non-CM cusp forms, due to Thorner [42], which uses the deep results of Newton and Thorne [30]; see Sect. 5.1 for the details.
Remark 1.5
Using the Sato–Tate theorem and [22, Thm. 1.2.4], it can be shown that \(\frac{1}{X}\sum _{X < n \le 2X} |\lambda _f(n) |^{\alpha } \gg _{\alpha } (\log X)^{c_{\alpha }-1}\), so the estimate in Theorem 1.4 is indeed non-trivial.
1.3.3 Hooley’s \(\Delta \)-function in short intervals
The distribution of divisors of a typical positive integer is a topic of classical interest and a source of many difficult problems. Given an integer \(n \in \mathbb {N}\), let
This is a distribution function on the divisors of n. A concentration function for \(\mathcal {D}_n(v)\), in the sense of probability theory, can be given by
Hooley [15] considered the unnormalized variant
now known as Hooley’s \(\Delta \)-function, and used it to attack various problems related, among other things, to inhomogeneous Diophantine approximation by squares, as well as Waring’s problem for cubes. Clearly, \(0 \le \Delta (n) \le d(n)\), but one seeks more refined data about this function. For example, Erdős [2] conjectured in 1948 that, except on a set of natural density 0, \(\Delta (n) > 1\).
Many authors have investigated the average and almost sure behavior of \(\Delta \). Maier and Tenenbaum [21] proved Erdős’ conjecture in a quantitative form. A significant portion of Hall and Tenenbaum’s book [11] is devoted to the \(\Delta \) function, including the currently best known upper bound for its mean value (see also [12]). For a partial survey of these results, see [40] .
Much less has been done concerning the local behavior of the \(\Delta \)-function. To the author’s knowledge, the only result about its short interval behavior was worked out in the setting of polynomials over a finite field by Gorodetsky [5, Cor. 1.5].
By relating \(\Delta (n)\) to integral averages of the characteristic function of \(\mathcal {D}_n\) (which is multiplicative), we can deduce the following lower bound for \(\Delta \) on average over typical short intervals of length \((\log X)^{1/2+\eta }\), for \(\eta \in (0,1/2]\).
Corollary 1.6
Fix \(\delta \in (0,1]\), and let \(10 \le h_0 \le \frac{X}{10(\log X)^{(1+\delta )/2}}\) and set \(h = h_0 (\log X)^{(1+\delta )/2}\). Then for all but \(o_{h_0 \rightarrow \infty }(X)\) integers \(x \in [X/2,X]\) we have
1.4 Statement of main results
We fix \(B,C \ge 1\), \(0 < A \le B\), and for X large we define \(\mathcal {M}(X;A,B,C)\) to denote the set of multiplicative functions \(f : \mathbb {N} \rightarrow \mathbb {C}\) such that:
-
(i)
\(|f(p) |\le B\) for all primes \(p \le X\),
-
(ii)
\(|f(n) |\le d_B(n)^C \text { for all } n\le X\),
-
(iii)
for all \(z_0 \le z\le w \le X\), we have
$$\begin{aligned} \sum _{z< p \le w} \frac{|f(p) |}{p} \ge A \sum _{z < p \le w} \frac{1}{p} - O\left( \frac{1}{\log z}\right) . \end{aligned}$$(1.6)
As described above, the work [25] treats 1-bounded multiplicative functions \(f \in \mathcal {M}(X;A,1,1)\). We are interested in generalizing the results from [25] to be applicable to the collection \(\mathcal {M}(X;A,B,C)\), with \(B \ge 1\). For the purpose of applications, we further extend \(\mathcal {M}(X;A,B,C)\) as follows.
Fixing \(\gamma > 0\) and \(0 < \sigma \le A\), we define \(\mathcal {M}(X;A,B,C;\gamma ,\sigma )\) to be the collection of multiplicative functions \(f: \mathbb {N} \rightarrow \mathbb {C}\) satisfying (i) and (ii), as well as the additional hypotheses
-
(iii’)
for all \(z_0 \le z \le w \le X\), we have
$$\begin{aligned} \sum _{z< p \le w} \frac{|f(p) |}{p} \ge A \sum _{z < p \le w} \frac{1}{p} - O\left( \frac{1}{(\log z)^{\gamma }}\right) , \end{aligned}$$(1.7) -
(iv)
letting \(t_0 \in [-X,X]\) be a minimizer on \([-X,X]\) of the map
$$\begin{aligned} t \mapsto \rho (f,n^{it};X)^2 := \sum _{p \le X} \frac{|f(p) |-\text {Re}(f(p)p^{-it})}{p}, \end{aligned}$$we have for all \(t \in [-2X,2X]\) that
$$\begin{aligned} \rho (f,n^{it};X)^2 \ge \sigma \min \{ \log \log X, \log (1+|t-t_0 |\log X)\} - O_{A,B}(1). \end{aligned}$$(1.8)(We may select \(t_0 = 0\) if \(f \ge 0\).)
Condition (iii’) is a weaker form of (iii). The full strength of (iii) is needed in [25, Lem. A.1] to obtain (iv) for all \(0< \sigma < \sigma _A\) with a particular constant \(\sigma _A > 0\), which is crucial to the proof of [25, Theorem 1.9]. We will show below, as a consequence of [25, Lem. 5.1(i)], that if \(f \in \mathcal {M}(X;A,B,C)\) then condition (iv) here holds for any \(0< \sigma < \sigma _{A,B}\), where
In particular, for any \(0< \sigma < \sigma _{A,B}\), \(\mathcal {M}(X;A,B,C) \subseteq \mathcal {M}(X;A,B,C;1,\sigma )\). In proving Corollary 1.1, for instance, it is profitable to assume (iii’) rather than (iii), given currently available quantitative versions of the Sato–Tate theorem (see (5.1)).
In the sequel, fix \(B,C \ge 1\), \(0 < A \le B\), \(\gamma > 0\) and \(0 < \sigma \le A\). We define
Given \(T \ge 1\), we set
We select \(t_0(f,T)\) to be a real number \(t \in [-T,T]\) that gives the minimum in the definition of \(M_f(X;T)\).
Finally, for a multiplicative function \(f: \mathbb {N} \rightarrow \mathbb {C}\) we recall that
observing for future reference that whenever \(|f(p) |\le B\) for all \(p \le X\),
The main result of this paper is the following.
Theorem 1.7
Let \(X \ge 100\). Let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\), and put \(t_0 = t_0(f,X)\). Let \(10 \le h_0 \le X/10H(f;X)\), and set \(h := h_0H(f;X)\). Then
Remark 1.8
By Shiu’s theorem (Lemma 3.2), it is easy to show that the long sum term in the LHS is
Thus, this theorem shows that the variance is smaller than the square of the “trivial” bound for the long sum by a factor tending to 0 provided \(h_0(X) \rightarrow \infty \), as \(X \rightarrow \infty \).
2 Outline of the proof of Theorem 1.7
To prove Theorem 1.7, we will establish two estimates. The first compares typical short averages of \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\) to typical medium-length ones (i.e., of length \(X/(\log X)^c\), for \(c = c(\sigma ) > 0\) small). The techniques involved were developed in [26], using certain corresponding refinements that arose in [25].
Theorem 2.1
Let \(B,C \ge 1\), \(0 < A \le B\), \(\gamma > 0\) and \(0 < \sigma \le A\). Assume that \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Let \(10 \le h_0 \le X/10H(f;X)\), set \(h_1 := h_0 H(f;X)\) and \(h_2 = X/(\log X)^{{\hat{\sigma }}/2}\) and assume that \(h_1 \le h_2\). Finally, put \(t_0 = t_0(f,X)\). Then
Essential to the treatment of Theorem 2.1 are strong pointwise upper bounds for Dirichlet polynomials
where \(\{a(n)\}_n \subset [0,1]\) is a particular sequence of weights, \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\) and \(t \in [-X,X]\). To obtain these estimates, we will apply some of the recent results about unbounded multiplicative functions described in Sect. 1.2. This is carried out at the beginning of Sect. 3.
The second estimate we require toward Theorem 1.7 is a “Lipschitz” bound, approximating the averages of a multiplicative function f on any sufficiently long medium-length interval by a long interval average of f. The techniques involved are different from those used in the proof of Theorem 2.1, and largely follow the work of Granville, Harper, and Soundararajan [7]; see Sect. 3.1 for the details.
Theorem 2.2
Let \(B,C \ge 1\), \(0 < A \le B\), \(\gamma > 0\) and \(0 < \sigma \le A\). Let \(X/(\log X)^{{\hat{\sigma }}/2} \le h \le X/10\), and let \(x \in [X/2,X]\). Assume that \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Then both of
are bounded by
Proof of Theorem 1.7 assuming Theorems 2.1 and 2.2
Assume the hypotheses of Theorem 1.7. If \(h > h_2\) then Theorem 1.7 follows immediately from the second estimate in Theorem 2.2. Thus, we may assume that \(h \le h'\). Applying the elementary inequality \((a+b)^2 \le 2(a^2 + b^2)\) for \(a,b \ge 0\), we get
upon trivially bounding \(h^{-1}|\int _{x-h}^x u^{it_0} \hbox {d}u |\le 1\). By Theorem 2.1 and the first estimate of Theorem 2.2,
Combining these bounds proves the claim.\(\square \)
3 Averages of divisor-bounded multiplicative functions and the proof of Theorem 2.2
In the sequel, we will require control over various averages of multiplicative functions \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). In this and the next subsection, such bounds are derived/recorded.
First, we will require some general pointwise estimates for prime power values of \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). In preparation, define
Wherever P is nonzero, we may also write the logarithmic derivative Dirichlet series
Lemma 3.1
Suppose \(f: \mathbb {N} \rightarrow \mathbb {C}\) is multiplicative and satisfies \(|f(n) |\le d_B(n)^C\) for all \(n \le X\).
(a) For any prime power \(p^{\nu } \le X\), we have
(b) For any \(\eta \in [0,1/2)\), we have
(c) \(\Lambda _{f,X}(n) = 0\) unless \(n = p^{\nu }\) for some prime power \(p^{\nu }\). In particular, if \(p^{\nu } \le X\) we have \(|\Lambda _f(p) |\le B \log p\) when \(\nu = 1\) and otherwise \( |\Lambda _{f,X}(p^{\nu }) |\ll _{\varepsilon ,B,C} p^{\varepsilon \nu }\).
Proof
(a) If \(B = 1\) then the claim is obvious since \(d_B \equiv 1\). Thus, we may assume that \(B > 1\). We may also assume that \(\nu \) is large relative to B, C, for otherwise the estimate is trivial for a suitably large implicit constant.
Given these assumptions, observe that by Stirling’s approximation,
provided that \(\nu \) is large enough that \(\left( 1+\frac{B-1}{\nu }\right) ^C \le \frac{5}{4}\). This proves a).
(b) Let \(\delta := \frac{1}{2}-\eta \). For each \(2 \le p \le X\), we have \(p^{1/2} > 5/4\), and thus by a),
We deduce (b) upon summing over \(p \le X\).
(c) We begin by giving an expression for \(\Lambda _{f,X}(p^{\nu })\).
In light of (a), we may deduce that there is \(\sigma = \sigma (B,C) > 1\) such that when \(\text {Re}(s) \ge \sigma \),
It follows from the Euler product representation of P(s) that \(P(s) \ne 0\) in the half-plane \(\text {Re}(s) \ge \sigma \). Thus, \(-P'(s)/P(s)\) is also analytic in this half-plane.
Integrating \(-P'/P\) term by term from s to \(\infty \) along a line contained in the half-plane \(\text {Re}(s) \ge \sigma \), we deduce that
Given (3.1), we obtain the Taylor expansion
By the identity theorem for Dirichlet series, we thus find that \(\Lambda _{f,X}(n) = 0\) unless \(n = p^{\nu }\) for some prime power \(p^{\nu }\) with \(p \le X\), in which case
When \(\nu = 1\), we get the expression \(\Lambda _{f,X}(p) = f(p)\log p\), so that \(|\Lambda _f(p) |\le B \log p\).
For \(\nu \ge 2\), we simply note using the uniform bound \(d_B(n)^C \ll _{B,C,\varepsilon } n^{\varepsilon }\) and the triangle inequality in (3.2) that
where \(\mathfrak {p}(\nu )\) denotes the number of partitions of the positive integer \(\nu \). By a classical bound of Hardy–Ramanujan [13, Sec. 2.3], there is an absolute constant \(c > 0\) such that
which implies the claim. \(\square \)
We will use the following upper bound for non-negative functions repeatedly in the sequel. For convenience, given a multiplicative function g and \(Y \ge 2\) we write
Lemma 3.2
[P. Shiu; [32], Thm. 1] Let \(f: \mathbb {N} \rightarrow \mathbb {C}\) be a multiplicative function satisfying \(|f(n) |\le d_B(n)^C\) for all \(n \le X\). Let \(\sqrt{X} < Y \le X\), \(\delta \in (0,1)\) and let \(Y^{\delta } \le y \le Y\). Then
Proof
The hypotheses required to apply [32, Thm. 1] are more precisely that \(|f(n) |\ll _{\varepsilon } n^{\varepsilon }\) for all \(n \le X\) and that there is a constant \(A \ge 1\) such that \(|f(p^{\nu }) |\le A^{\nu }\) for all \(p^{\nu } \le X\). The first hypothesis is obvious from \(d_B(n)^C \le d(n)^{\lceil B\rceil C} \ll _{B,C,\varepsilon } n^{\varepsilon }\), while the second is implied by Lemma 3.1 a). \(\square \)
Lemma 3.3
Let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\) and let \(t_0 = t_0(f,X)\). Let \(X^{1/5} \le Y \le X\), and let \(2 \le P \le Q \le \exp \left( \frac{\log X}{\log \log X}\right) \). Then for any \(1 \le Z \le \log X\),
Proof
Define \(\beta (n) := f(n)1_{p \mid n \Rightarrow p \notin [P,Q]}\), and for \(t \in \mathbb {R}\) set \(\beta _{t}(n) := \beta (n)n^{-it}\). Note that \(|\beta _t(n) |\le |f(n) |\) for all n and \(t \in \mathbb {R}\). As \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\), we have that
-
1.
\(\max _{p \le X} |f(p) |\le B\)
-
2.
\(\sum _{\begin{array}{c} p^k\le X \\ k \ge 2 \end{array}} \frac{|f(p^k) |\log p^k}{p^k} \ll _{B,C} 1\) by Lemma 3.1b), and
-
3.
\(\sum _{y < p \le X} \frac{|f(p) |}{p} \ge A \log \left( \frac{\log X}{\log y}\right) - O_{A,B}(1)\) uniformly in \(2 \le y \le X\),
for all \(t \in \mathbb {R}\). Thus, the hypotheses of [41, Cor. 2.1] are fulfilled with \(r = |f |\). Applying that result gives, for every \(Z < |u |\le X/2\),
Let \(t = t(u) \in [-Z/2,Z/2]\) be the minimizer implicit in \(M_{f_{t_0+u}}(Y;Z/2)\), so that
As \(X^{1/5} \le Y \le X\),
Since \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\) and \(|t_0 + u+t |\le 2X\) and \(|u+t |> Z/2\), we have by (1.8) that
It thus follows that
Finally, applying Lemma 3.2 together with Mertens’ theorem, we obtain
and the claim follows. \(\square \)
We need the following estimate for certain divisor-bounded functions on y-smoothFootnote 6 integers, which is essentially due to Song [34]. An important role is played by the function \(\rho _k(u)\) for \(k \in \mathbb {N}\) and \(u \ge 0\), which is a generalization of the classical Dickman–de Bruijn function, defined by the differential delay equation
and \(\rho _k(u) := u^{k-1}/\Gamma (k)\) for \(0\le u < 1\).
Lemma 3.4
Let \(g: \mathbb {N} \rightarrow \mathbb {R}\) be a non-negative multiplicative function for which there are real constants \(\delta \in (0,1)\), \(\eta \in (0,1/2)\) and \(D > 0\), and an integer \(k \ge 1\) such that
Let \(x \ge 3\) and let \(\exp \left( (\log x \log \log x)^{2/(2+\delta )}\right) \le y \le x\). Set \(u := \frac{\log x}{\log y}\). Then
where \(G(s,y) := \sum _{P^+(n) \le y} g(n)n^{-s}\) for \(\text {Re}(s) > 0\), and \(P^+(n)\) denotes the largest prime factor of n.
In particular, for y in the given range and such that \(u \rightarrow \infty \) we have
Proof
The first claim is a special case of the main result of [34].
For the second claim, we note that
where the penultimate estimate follows from (3.4), and the last estimate is obtained by partial summation from (3.3). Furthermore, by [33, (3.10)] and well-known upper bounds for the Dickman–de Bruijn function (e.g., [6, (1.6)]), we have
whenever u is large enough in terms of k, and the claim follows. \(\square \)
By combining the last two lemmas, we may deduce the following upper bound for Dirichlet polynomials of a special type (cf. [26, Lem. 3]).
Corollary 3.5
Let \(10 \le P \le Q \le \exp \left( \frac{\log X}{\log \log X}\right) \), and let \(1 \le Z \le \log X\). Assume the hypotheses of Lemma 3.3, and assume \(X \ge X_0(B,C)\). Then for any \(\sqrt{X} \le Y \le X\),
where \(\omega _{[P,Q]}(n) := \sum _{\begin{array}{c} p \mid n \\ P \le p \le Q \end{array}} 1\).
Proof
Fix \(u \in [-X/2,X/2] \backslash [-Z,Z]\) and set \(t := t_0 + u\). Write \(f = \alpha *\beta \), where \(\alpha \) and \(\beta \) are multiplicative functions with \(\alpha (p^k) = f(p^k)\) whenever \(P \le p \le Q\) and \(p^k \le X\), and \(\beta (p^k) = f(p^k)\) for all other primes powers \(p^k \le X\). We apply the hyperbola method with \(M = \sqrt{Y}\) to get
To bound \(\mathcal {R}_1\), we apply partial summation and Lemma 3.3 to obtain, uniformly in u,
Given the prime power support of \(\alpha \), we have
so that on combining this with the previous estimate, we obtain
Next, consider \(\mathcal {R}_2\). Note that \(\alpha (n) = f(n)1_{p \mid n \Rightarrow p \in [P,Q]}\), and so since \(|f(n) |\le d_{B}(n)^C\) uniformly over \(n \le X\) we have
where \(g(n) := d_{\lceil B\rceil }(n)^{\lceil C\rceil }\). Note that g(n) takes integer values, and in particular taking \(k := \lceil B\rceil ^{\lceil C\rceil } \in \mathbb {Z}\), for each \(XM/Y < z \le X\) we have
say, by the prime number theorem. Furthermore, that g satisfies (3.4) with some \(\eta \in (0,1/2)\) and \(D = O_{B,C}(1)\) is the content of Lemma 3.1b). Hence, as \(u_b := \log (X/b)/\log Q \ge \frac{B\log X}{2\log Q} \ge \frac{B}{2}\log \log X\), Lemma 3.4 implies that when X is sufficiently large in terms of B and C we obtain
Combining this with the bound
which again follows from partial summation and Lemma 3.2, we obtain \(\mathcal {R}_2 \ll (\log X)^{-100}\). Altogether, we conclude that
uniformly over \(Z < |u |\le X/2\), and the claim follows since \(Z^{-1/2} \ge (\log X)^{-1/2}\). \(\square \)
3.1 Lipschitz bounds and main terms
In this subsection, we derive a slight refinement of the Lipschitz bounds found in [7, Thm. 1.5]. Specifically, our estimates are sensitive to the distribution of values \(|f(p) |\), which will allow us to obtain Theorem 2.2. See also [28] for some related Lipschitz-type bounds for unbounded multiplicative functions that share some overlapFootnote 7 with the general result obtained presently.
Theorem 3.6
[Relative Lipschitz bounds] Let \(1 \le w \le X^{1/3}\) and let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Set \(t_0 = t_0(f,X)\). Then
where \({\hat{\sigma }} := \min \{1,\sigma \}\). The same bound holds for the quantity
To this end, we need to introduce some notation that is consistent with the notation from [7]. For \(\text {Re}(s) > 1\), we write
For each prime power \(p^k \le X\), \(k \ge 1\), define
where \(y\ge 2\) is a large parameter to be chosen later. We extend s and \(\ell \) multiplicatively to all \(n \in \mathbb {N}\) with \(p^k ||n \Rightarrow p^k \le X\), and set \(s(n) = \ell (n) = 0\) otherwise. For \(\text {Re}(s) > 1\), also define
We recall that \(\Lambda _{\ell }(n)\) is the nth coefficient of the Dirichlet series \(-\mathcal {L}'/\mathcal {L}(s)\), the logarithmic derivative of \(\mathcal {L}(s)\), which is well defined for all \(\text {Re}(s) > 1\) whenever \(y \ge y_0(B,C)\) by Lemma 3.1 c).
Lemma 3.7
Let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Let \(t \in \mathbb {R}\) and \(\xi \ge 1/\log X\). Then
Proof
By Lemma 3.1b) and \(\max _{p \le X} |f(p) |\le B\), we deduce that
By partial summation and the prime number theorem, given any sequence \(\{\alpha _p\}_p \subset \mathbb {C}\) with \(\max _p |\alpha _p |\ll _B 1\) the estimates
both hold. It follows that
Since \(f \in \mathcal {M}(X;A,B;\gamma ,\sigma )\), we have
We thus obtain
which proves the first claimed estimate.
To obtain the second, note that \(\rho (fn^{-it_0},n^{it};Y)^2 \ge 0\) for all \(Y \ge 2\), and so using \(|f(p) |\le B\) and \(A \ge 0\) we obtain the further bound
as claimed. \(\square \)
To bound certain error terms in the proof of Theorem 3.6, we require the following estimate, whose proof largely follows that of [7, Lem. 2.4]
Lemma 3.8
Let \(e^3 \le w \le X^{1/3}\), \(w \le y \le \sqrt{X}\) and \(\eta := 1/\log y \in (0,1/3]\). Then for any \(X/w \le Z \le X\),
Proof
In the first sum, the summands arise from a Dirichlet convolution of multiplicative functions \(|s |*|\ell |n^{-\eta }\), and we clearly have \(|s(n) |, |\ell (n) |\le d_B(n)^C\) for all \(n \le X\). By Lemmas 3.2 and (3.5), the first sum is therefore
Arguing as in the previous lemma, since \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\) this is bounded by
For the second term, we use Lemma 3.1c), which shows that \(|\Lambda _{\ell }(p)|\le B \log p \) and \(|\Lambda _{\ell }(p^{\nu })|\ll _{\varepsilon ,B,C} p^{\nu \varepsilon }\). It follows that for \(1 \le K \le X\),
say, which is acceptable. Therefore taking \(K = Z/mn\), the \(\alpha \) integral in the statement is
Extending the inner sum by positivity to all products mn with \(p^k ||mn \Rightarrow p^k \le Z\) and using the estimates (3.5) once again, we may bound the integral using Euler products as
This completes the proof. \(\square \)
Proof of Theorem 3.6
The proof follows that of [7, Thm. 1.5], and we principally highlight the differences.
We begin with the first claim of the theorem. Let \(T := (\log X)^{B+1}\) and \(y := \max \{ew,T^2\}\). Fix \(\eta := 1/\log y\), \(c_0 := 1+1/\log X\). Then [7, Lem. 2.2] (replacing \(\beta \) by \(\beta /2\)) and Lemma 3.8 combine to show that
Consider the inner integral over s. Shifting \(s \mapsto s - \alpha -\beta \) and applying [7, Lem. 2.5], this is
Extracting the maximum over \(|t |\le T\), then applying Cauchy–Schwarz and [7, Lem. 2.6], the main term for the s-integral is bounded above by
Furthermore, by (3.5) and \(\alpha ,\beta \le \eta = 1/\log y\), we see that for any \(t \in \mathbb {R}\),
Thus, we have so far shown that
Observe next that
so that we may rewrite the integral expression in (3.6) as
We first estimate \(T_2\). The integral over \(\alpha \) is
Applying Lemma 3.7 (with \(\xi = 1/\log X + \beta \)) and \(\rho (fn^{-it_0},n^{it};Y)^2 \ge 0\) for all \(Y \ge 2\),
Splitting the \(\beta \)-integral at \(1/\log X\) and evaluating, we obtain
We now turn to \(T_1\). By evaluating the \(\alpha \) integral, we have
Put \(T' := \frac{1}{2}(\log X)^B\). If the maximum occurs at \(|t |> T'\) then using the second estimate in Lemma 3.7 we obtain
Thus, suppose the maximum occurs with \(|t |\le T'\). Applying [7, Lem. 3.1], we get
Inserting this into the \(\beta \) integral yields, in this case,
Finally, we focus on the maximum here. Note that \(|1-w^{-it} |\ll \min \{1,|t |\log (ew)\}\), so combining Lemma 3.7 with our hypothesis (1.8), we obtain
Hence, as \({\hat{\sigma }} = \min \{1,\sigma \} \le A \le B\), and \((\log X)^{-1} \ll _A (\log X)^{-A} \mathcal {P}_f(X)\) by (1.7) we get
Combining all of these bounds and inserting them into (3.6), we thus find that
This proves the first claim.
The second claim can be deduced similarly, since (using the same notation as above) in the first step we have (after shifting \(s \mapsto s-it_0\))
which simply localizes the argument above to the range \(|t+t_0 |\le T\) instead. \(\square \)
Theorem 3.6 may be directly applied to obtain the first estimate in Theorem 2.2. To obtain the second, we will use the following corollary of Theorem 3.6 that allows us to pass from \(n^{-it_0}\)-twisted sums to untwisted sums of f(n) on long intervals.
Corollary 3.9
Let \(t_0 = t_0(f,X)\) be as above. Then for any \(x \in (X/2,X]\),
Proof
By partial summation, we have
We split the integral over u at \(x/(\log X)^2\). In the first range, we use the trivial bound together with Lemma 3.2, obtaining
In the remaining range \(x/(\log X)^2 < u \le x\), we apply the second claim in Theorem 3.6 (with \(1 \le w \le (\log X)^2\)), which gives
Combining this with the estimate from \(1 \le u \le x/(\log X)^2\), then inserting this into (3.7), we prove the claim. \(\square \)
Proof of Theorem 2.2
We begin by proving the first estimate in the statement of the theorem. Let \(X/(\log X)^{{\hat{\sigma }}/2} \le h \le X/10\). Note that by writing \(x-h = x/w\), where \(w := (1-h/x)^{-1} \in [1,2]\), the sum of \(f(n)n^{-it_0}\) over \((x-h,x]\) is
and similarly its sum over (X/2, X] is
Similarly, applying Theorem 3.6 twice to (3.9), we also find that
viewing \(x = X/u\) for some \(u \in [1,2]\) in the last step. Combined with the previous estimate, we deduce the first claimed estimate of the theorem.
To prove the second claimed estimate, we apply Corollary 3.9 to obtain
Setting \(w := (1-h/x)^{-1}\) as in (3.8), we have
By (3.10), the main term here is
Combining these estimates, we thus obtain
and so the second claimed estimate of the theorem follows from \(h\ge X/(\log X)^{{\hat{\sigma }}/2}\). \(\square \)
4 Applying the Matomäki–Radziwiłł method
In this section, which broadly follows the lines of the proof of [26, Thm. 3], we set out the key elements of the proof of Theorem 2.1.
4.1 Large sieve estimates
The content of this subsection can essentially all be found in [26, Sec. 6 and 7] and in [25, Sec. 3]. In what follows, a set \(\mathcal {T} \subset \mathbb {R}\) is said to be well spaced if \( |t_1-t_2 |\ge 1\) for any distinct \(t_1,t_2 \in \mathcal {T}\).
Lemma 4.1
[Sparse large sieve for multiplicative sequences] Let \(T \ge 1\) and \(2 \le N \le X\). Let \(\{a_n\}_{n \le N}\) be a sequence of complex numbers. Let \(\mathcal {T} \subset [-T,T]\) be well spaced. The following bounds hold:
-
(a)
(\(L^2\) mean value theorem, sparse version)
$$\begin{aligned} \int _{-T}^T |\sum _{n \le N} a_n n^{-it} |^2 \hbox {d}t&\ll T\sum _{n \le N} |a_n |^2 + T\sum _{n \le N} \sum _{1 \le |m |\le n/T} |a_na_{m+n} |. \end{aligned}$$ -
(b)
(\(L^2\) mean value theorem with multiplicative majorant) Let \(1 \le M \le N\), and let \(c > 0\). Assume there is a multiplicative function \(f: \mathbb {N} \rightarrow \mathbb {C}\) satisfying \(|f(n) |\le d_B(n)^C\) such that \(|a_n |\le c|f(n) |\) for all \(n\le N\). Then
$$\begin{aligned} \int _{-T}^T |\sum _{N-M < n \le N} \frac{a_nn^{-it}}{n} |^2 \hbox {d}t&\ll _{B,C} c^2\left( \frac{TM}{N^2} \mathcal {P}_{f^2}(N) + \frac{M}{N}\mathcal {P}_f(N)^2\right) . \end{aligned}$$ -
(c)
(Discrete mean value theorem)
$$\begin{aligned}&\sum _{t \in \mathcal {T}} |\sum _{N/3< n \le N} \frac{a_nn^{-it}}{n} |^2 \\ {}&\ll \min \left\{ \left( 1+\frac{T}{N}\right) \log (2N) , \left( 1+|\mathcal {T} |\frac{T^{1/2}}{N}\right) \log (2T)\right\} \frac{1}{N} \sum _{N/3 < n \le N} |a_n |^2. \end{aligned}$$
Proof
Part (a) is [25, Lem. 3.2], part (b) is proven in the same way asFootnote 8 [25, Lem. 3.4] and part (c) is a combination of [26, Lem. 7 and 9]. \(\square \)
Lemma 4.2
[Large sieve with prime support] Let \(B,T \ge 1\), \(P \ge 10\). Let \(\{a_p\}_{P < p \le 2P}\) be a sequence with \(\max _{P < p \le 2P} |a_p |\le B\). Let \(P(s) := \sum _{P < p \le 2P} a_pp^{-s}\), for \(s \in \mathbb {C}\) and let \(\mathcal {T} \subset [-T,T]\) be a well-spaced set.
-
(a)
(Halász–Montgomery estimate for primes)
$$\begin{aligned} \sum _{t \in \mathcal {T}} |P(1+it) |^2 \ll _B \frac{1}{(\log P)^2} \left( 1+ |\mathcal {T} |(\log T)^2 \exp \left( -\frac{\log P}{(\log T)^{2/3+\varepsilon }}\right) \right) . \end{aligned}$$ -
(b)
(Large values estimate) If \(\mathcal {T}\) consists only of \(t \in [-T,T]\) with \(|P(1+it)|\ge V^{-1}\) then
$$\begin{aligned} |\mathcal {T} |\ll _B T^{2\frac{\log V}{\log P}} V^2 \exp \left( 2B\frac{\log T}{\log P}\log \log T\right) . \end{aligned}$$
Proof
Part (a) is [26, Lem. 11], while part (b) is proven precisely as in [26, Lem. 8], keeping track of the upper bound condition \(|a_p |\le B\). \(\square \)
4.2 Dirichlet polynomial decomposition
The following is a variant of [26, Lem. 12] tailored to elements of \(\mathcal {M}(X;A,B,C;\gamma ,\sigma )\).
Lemma 4.3
Let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Let \(T \ge 1\), \(1 \le H \le X^{1/2}\) and \(1 \le P \le Q \le X^{1/2}\). Set \(\mathcal {I}\) to be the interval of integers \(\left\lfloor H\log P \right\rfloor \le v \le H \log Q\), and let \(\mathcal {T} \subset [-T,T]\). Then
where for \(v \in \mathcal {I}\) and \(s \in \mathbb {C}\) we have set
Proof
The proof is the same as that of [26, Lem. 12] (with \(a_n = f(n)1_{\omega _{[P,Q]} \ge 1}(n)\), \(b_m = f(m)\) and \(c_p = f(p)\) for \(P \le p \le Q\)), with appropriate appeal to Lemma 4.1 in place of the usual mean value theorem. For example (as on [26, top of p.20]), for \(Y \in \{X/(3Q),X/P\}\) we have
\(\square \)
Lemma 4.4
Let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Let \(T,Y_1,Y_2 \ge 1\), \(1 \le X' \le X/Y_1\) and let \(\ell := \lceil \frac{\log Y_2}{\log Y_1}\rceil \). Define
where \(|c_p |\le B\) for all \(Y_1/2<p \le Y_1\). Finally, let \(\mathcal {T} \subseteq [-T,T]\). Then
Proof
Writing \(c_p := B c_p'\), where now \(|c_p' |\le 1\) and letting \({\tilde{Q}}(s)\) denote the Dirichlet polynomial with \(c_p\) replaced by \(c_p'\) for all \(p \in (Y_1/2,Y_1]\), the LHS in the statement is
The rest of the proof is essentially the same as that of [25, Lem. 7.1], saving that the function \(g^{*}\) is replaced by \(|f|\) (this does not affect the proof, which depends on our Lemma 3.2 and [14, Thm. 3], both of which also apply to \(|f |\).) \(\square \)
4.3 Integral averages of Dirichlet polynomials
As above, we write \(t_0 = t_0(f,X)\) to denote an element of \([-X,X]\) that minimizes the map
Proposition 4.5
Let \(1/\log X \le \delta \le 1\), and put \(I_{\delta }:= [t_0-\delta ^{-1},t_0 + \delta ^{-1}]\). Let \(\{a_n\}_{n \le X}\) be a sequence of complex numbers. Then
where we have set
Proof
For each \(x \in [X/2,X]\), Perron’s formula gives
Subtracting the contribution from \(|t-t_0 |\le \delta ^{-1}\), the LHS in the statement becomes
The remainder of the proof is identical to that of [26, Lemma 14] (which only uses the boundedness of the coefficients \(\{a_n\}_n\) there for the corresponding contribution of \(I_{\delta }\)). \(\square \)
4.4 Restricting to a “nicely factored” set
We fix parameters \(\eta \in (0,1/12)\), \(Q_1 := h_0\), \(P_1 := (\log h_0)^{40B/\eta }\) and \(P_j := \exp \left( j^{4j/A-2/A} (\log Q_1)^{j-1}(\log P_1)\right) \), \(Q_j := \exp \left( j^{4j/A} (\log Q_1)^j\right) \), for \(1 \le j \le J\), where J is maximal with \(Q_J \le \exp \left( \sqrt{\log X}\right) \). We highlight the different choice of \(P_1\), with all other choices being the same as in [26, Sec. 2 and 8]. We also let
Remark 4.6
The following properties may be verified directly, as long as \(h_0\) is sufficiently large (in terms of B):
-
1.
\(\log P_j \ge \frac{8Bj^{2/A}}{\eta } \log \log (2BQ_{j+1})\) for all \(1 \le j \le J\)
-
2.
\(\log Q_j \le 2^{4j} (\log Q_{j-1})(\log Q_1) \le (\log Q_{j-1})^{3} \le Q_{j-1}^{1/24}\)
-
3.
\(\frac{\log P_j}{\log Q_j} = \frac{\log P_1}{j^{2/A} \log Q_1}\) for \(2 \le j \le J\), so the terms \(\{\log P_j/\log Q_j\}_{j \ge 1}\) are summable.
We will use these in due course.
We wish to reduce our work to handling short and long averages with n restricted to the set \(\mathcal {S}\). To handle averages of f(n) for \(n \notin \mathcal {S}\), we use the following result. For a set of integers \(\mathcal {A}\), we write \((n,\mathcal {A}) = 1\) to mean that \((n,a) = 1\) for all \(a \in \mathcal {A}\).
Lemma 4.7
Let \(1 < P \le Q \le X\), and let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Then for any \(10 \le h_0 \le X/10H(f;X)\) and \(h := h_0H(f;X)\),
In particular,
Proof
Expanding the square and applying the triangle inequality, the LHS is
By Lemmas 3.2 and (1.11), the first term on the RHS is bounded as
Next, to bound the correlation sums we applyFootnote 9 [25, Lem. 3.3] (with \(r_1 = r_2 = 1\)) to the pair of multiplicative functions \(f1_{\mathcal {S}^c}\) and f, which gives
Since \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\), by (1.7) we get
It follows that
The first claim now follows upon combining this with (4.1). The second claim follows similarly, saving that in the argument above the term \(\mathcal {P}_{f1_{(m,[P,Q]) = 1}}(X)\) is replaced by
\(\square \)
Having disposed of \(n \notin \mathcal {S}\), we now concentrate on \(n \in \mathcal {S}\). To prove Theorem 2.1, we will apply Proposition 4.5 to the sequence \(a_m = f(m)1_{m \in \mathcal {S}}\), in combination with the following key proposition.
Recall that \(\kappa := \frac{\min \{1,\sigma \}}{8B + 21}\). We also define \(\Delta := (2B+5)\kappa \), and
Proposition 4.8
Set \(\delta = (\log X)^{-\Delta }\). Then
Remark 4.9
We remark that both terms in Proposition 4.5 can be treated using Proposition 4.8. Indeed, by Lemma 4.1(b),
and therefore
which is obviously sufficient in Theorem 2.1. We clearly also have
This expression will also be bounded using Proposition 4.8 with h replaced by \(h/(\log h_0)^A\), which does not change the form of the final estimates.
4.5 Proof of Proposition 4.8
The proof follows the same lines as those in [26, Sec. 8], saving that we apply our versions of the corresponding lemmas that address the growth of \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). We sketch the details here, emphasizing the main differences.
We select parameters \(\alpha _1,\ldots ,\alpha _J\) such that \(\alpha _j := \frac{1}{4}-\eta \left( 1+\frac{1}{2j}\right) \). For each \(1 \le j \le J\), let
Also, with \(s \in \mathbb {C}\) we let
We split the set of \(t \in \mathcal {X} := [-X/h,X/h] \backslash I_{\delta }\) into sets
We thus have
We estimate the contributions from \(\mathcal {T}_j\) as in [26], saving that in the applications of the large sieve inequalities we use Lemma 4.1(b); as an example, we will give full details for \(j = 1\) and highlight the main changes for the corresponding bounds for \(2 \le j \le J\).
In each case, we apply Lemma 4.3 to obtain
where we set
The choice of parameters gives, by (4.1),
since \(\sum _j P_j^{-1} \ll P_1^{-1}\) and \(H(f;X)^{-1} \mathcal {P}_{f^2}(X) \ll _{B,C} \mathcal {P}_f(X)^2\).
We next consider the contribution from the main terms. When \(j = 1\), since \(v/H_1 \le \log Q_1 = \log h_0\), we have
using Lemma 4.1 (b) and treating \(\mathcal {P}_{f^2}(X)\) using (4.1). Since \(H_1^2\log Q_1 = P_1^{1/3-2\eta }(\log Q_1)^{1/3} \le P_1^{1/3-\eta }\), \(P_1^{2\alpha _1} \ge P_1^{1/2-3\eta }\) and \(\eta \in (0,1/12)\), we get
Let now \(2 \le j \le J\), if \(J \ge 2\). By definition, we have
where \(\mathcal {T}_{j,r}\) is the set of all \(t \in \mathcal {T}_j\) such that \(|Q_{r,H_{j-1}}(1+it) |> e^{-\alpha _{j-1} r/H_{j-1}}\). Pointwise bounding \(|Q_{v,H_j}(1+it) |\) for each \(v \in \mathcal {I}_j\) leads to
where \((r_0,v_0) \in \mathcal {I}_{j-1} \times \mathcal {I}_j\) yield the maximal contribution among all such pairs, and \(\ell _j := \lceil \frac{v/H_j}{r/H_{j-1}}\rceil \). Using Lemma 4.4, we get
Minor modifications to the estimates in [26, Sec. 8.2] (with \(h_0\) in place of h there), selecting \(h_0\) sufficiently large in terms of B, show that
whence it follows that
(the requirements of our parameters \(P_j,Q_j\) and \(\alpha _j\) summarized in Remark 4.6 are sufficient for this).
Finally, we consider \(\mathcal {U}\). Set \(H := (\log X)^{\kappa }\), \(P = \exp ((\log X)^{1-\kappa })\) and \(Q = \exp (\log X/\log \log X)\), put \(\mathcal {I} := [\left\lfloor H\log P\right\rfloor , H\log Q] \cap \mathbb {Z}\), and define \(Q_{v,H}\) and \(R_{v,H}\) by
Combining Lemma 4.3 with 4.1 a) and the proof of Lemma 4.7 to control those n coprime to \(P \le p \le Q\), we get that there is some \(v_0 \in \mathcal {I}\) such that
As in [26, Sec. 8.3] we may select a discrete subset \(\mathcal {V} \subset \mathcal {U}\) that is well spaced, such that
By assumption, for each \(t \in \mathcal {V}\) we have \(|Q_{r_0,H}(1+it)|> e^{-\alpha _J r_0/H_J} \ge P_J^{-\alpha _J}\), for some \(r_0 \in \mathcal {I}_J\). We have \(\log Q_{J+1} \ge \sqrt{\log X}\) by definition, and (as mentioned in Remark 4.6) \(\log P_J \ge \frac{4B}{\eta } \log \log Q_{J+1}\), whence \((\log X)^{2B/\eta } \le P_J \le Q_J \le \exp (\sqrt{\log X})\). Applying Lemma 4.2(b) for each \(r_0 \in \mathcal {I}_J\), we thus have
We now split the set \(\mathcal {V}\) into the subsets
the exponent \(B^2/2\) is present in order to cancel the \(\log X\) power that arises from
By a pointwise bound, Lemma 4.1(c) and the above estimate for \(|\mathcal {V} |\ge |\mathcal {V}_S |\), we obtain
Consider next the contribution from \(\mathcal {V}_L\). Applying Lemma 4.2(b) once again, this time using the condition \(|Q_{v_0,H}(1+it) |> (\log X)^{-\frac{1}{2}B^2-10}\), to obtain
Recall that \(\Delta = (2B+5) \kappa \in (0,1)\). Applying Lemma 3.5 (with \(Z = 1/\delta = (\log X)^{\Delta }\)) to bound \(R_{v_0,H}(1+it)\) pointwise in t, together with Lemma 4.2(a) to estimate \(Q_{v_0,H}(1+it)\) in mean square, noting that \(\kappa < 1/3-\kappa \), we obtain
Combining this estimate with the one for \(\mathcal {V}_S\), then plugging this back into our estimate (4.3), we get
since \(2(B+2) \kappa - \Delta = -\kappa \), and \(\sigma \ge {\hat{\sigma }} > (3B+5/2)\kappa \) by definition. This completes the proof of Proposition 4.8.
Proof of Theorem 2.1
Let \(f \in \mathcal {M}(X;A,B,C;\gamma ,\sigma )\). Set \(h := h_1/(\log h_0)^A\), and select \(P_1 = (\log h)^{40B/\eta }\) and \(Q_1 = h\). We may assume that X is larger than any constant depending on B, since otherwise Theorem 2.1 follows with a sufficiently large implied constant; we may also assume h is larger than any constant depending on B, since otherwise the theorem follows (again with a large enough implied constant depending at most on B) from Remark 1.8 and Lemma 4.7 (taking \(P = Q = 3/2\), say).
By Lemma 4.7, we have
Set \(\delta := (\log X)^{-(2B+5)\kappa }\) once again, and note that \(t_0(fn^{-it_0},X) = 0\) is admissible. Thus,
Set \(I(x;t,h) := h^{-1} \int _{x-h}^x u^{it} \hbox {d}u\). By the Cauchy–Schwarz inequality and the trivial bound \(\vert I(x;t,h) \vert \le 1\), we obtain
Consider \(\mathcal {I}_3\) first. Making a change of variables \(w = t-t_0\) and using \(u^{iw} = x^{iw} + O(\delta ^{-1} h_1/X)\) for \(|w |\le \delta ^{-1}\) and \(u \in [x-h_1,x]\), we see that
Similarly, we have
Applying partial summation, dropping the condition \(n \in \mathcal {S}\), and then using Lemma 3.2, we find
and thus, as \(h_1 \le h_2 = X/(\log X)^{{\hat{\sigma }}/2}\), we obtain
Next, we treat \(\mathcal {I}_1\) and \(\mathcal {I}_2\). Applying Proposition 4.5 to each of these integrals and trivially bounding the u integral in \(\mathcal {I}_2\), we find
By the argument in Remark 4.9 and our choice of h, the latter is bounded by
But by Proposition 4.8, this integral is bounded by
Combining these steps, and using \(A \le B\) and \(\log h \asymp \log h_1\), we obtain
which completes the proof.
5 Applications
5.1 Proof of Theorem 1.4
Let f be a primitive, Hecke-normalized holomorphic cusp form without complex multiplication of fixed even weight \(k \ge 2\) and level 1. Write the Fourier expansion of f at \(\infty \) as
where \(\{\lambda _f(n)\}_n\) is the sequence of normalized Fourier coefficients with \(\lambda _f(1) = 1\). As noted in Sect. 1.3.2, \(\lambda _f\) is a multiplicative function. Deligne’s proof of the Ramanujan conjecture for f shows that \(|\lambda _f(p) |\le 2\) and \(|\lambda _f(n) |\le d(n)\) for all primes p and positive integers n. Moreover, the quantitative Sato–Tate theorem of Thorner [42], which is based on the deep results of Newton and Thorne [30], shows that for any \([a,b] \subseteq [-2,2]\),
Recall that
Using this data, we will prove the following.
Proposition 5.1
Let \(\alpha > 0\) and \(\varepsilon \in (0,1/2)\). There is a constant \(\delta = \delta (\alpha ) > 0\) such that \(|\lambda _f |^{\alpha } \in \mathcal {M}(X;c_{\alpha },2^{\alpha },2;1/2-\varepsilon ,\delta )\).
Using Proposition 5.1, we will be able to apply Theorem 1.7 in order to derive Corollary 1.1.
We will check that \(|\lambda _f |^\alpha \) satisfies the required hypotheses in the following lemmas.
Lemma 5.2
For any \(2 \le z < w\), we have
Similarly, we have
Proof
Let \(\beta \in \{\alpha ,2\alpha \}\). By partial summation,
Fix \(u \in (0,2]\), and let \(I_u := [0,u] \cup [-u,0]\) so that \(|\lambda _f(p) |\le u\) if and only if \(\lambda _f(p) \in I_u\). By partial summation and (5.1),
Multiplying the main term by \(\beta u^{\beta -1}\) and integrating in u, we obtain \(I_\beta \log (\log w/\log z) + O(1/\log z)\), where
Making the change of variables \(t := (v/2)^2\), we find that
It follows, therefore, that when \(\beta \in \{\alpha ,2\alpha \}\),
and both claims follow. \(\square \)
To obtain uniform lower bound estimates for \(\rho (|\lambda _f |^{\alpha },n^{it};X)^2\), we will need some control over the product \(|\lambda _f(p) |^\alpha (1-\cos (t\log p))\), on average over p. In some ranges of t, this is furnished by the following lemma.
Lemma 5.3
Let \(|t |\ge 1\). There is a constant \(c = c(\alpha ) > 0\) such that if \(Y \ge (|t |+3)^2\) and Y is sufficiently large then
Proof
We adapt an argument due to Goldfeld and Li [4, Lem. 12.12 and 12.15] and Humphries [16, Lem. 2.1]. Let \(\eta \in (0,1/2)\) be a parameter to be chosen later. Using the Sato–Tate law, we have
Next, we estimate the cardinality
Set \(\beta := \sin ^{-1}(\eta /2)/\pi \in [0,1/2]\), Whenever \(\sin (t\log p/2) \in [-\eta /2, \eta /2]\) there is \(m \in \mathbb {Z}\) such that \((t \log p)/2 \in [\pi (m - \beta ), \pi (m + \beta )]\). By Jordan’s inequality, \(\beta \le \frac{1}{2} \sin ( \pi \beta ) = \frac{\eta }{4}\), and we see that
where \(\Vert t\Vert := \min _{m \in \mathbb {Z}} \vert t-m \vert \). Splitting up the primes \(Y < p \le 2Y\) according to the nearest integer m to \((t\log p)/(2\pi )\), the latter may be bounded above as
For each m, we have \(e^{\frac{2\pi m+\pi \eta /2}{|t |}} \le \left( 1+\frac{\pi \eta }{|t |}\right) e^{\frac{2\pi m-\pi \eta /2}{|t |}}\). By the Brun–Titchmarsh theorem, we get, uniformly over all m in the sum,
for Y large enough. Since there are \(\le 1+ |t |(\log (2Y)-\log Y)/(2\pi ) \le 2|t |\) integers in the range of summation, we obtain
We deduce from (5.2) and (5.3) that
Selecting \(\eta = \frac{1}{250}\), say, we get that if Y is sufficiently large,
Finally, we obtain that
which proves the claim with \(c = \eta ^{2+\alpha }/2\). \(\square \)
We now obtain lower bounds for \(\rho (|\lambda _f |^\alpha ,n^{it};X)^2\) for all \(|t |\le X\).
Lemma 5.4
There is a \(\delta = \delta (\alpha ) > 0\) such that whenever \(|t |\le X\) we have
Moreover, we may select the minimizing \(t \in [-X,X]\) for \(\vert \lambda _f \vert ^2\) as \(t_0(|\lambda _f |^2,X) = 0\) (see the discussion surrounding (1.8) for the definition of \(t_0\)).
Proof
We may assume that X is sufficiently large, else the estimate given is trivial. When \(|t |\le 1/\log X\) the claim is vacuous. Thus, we may focus on the case \(1/\log X < |t |\le X\). We consider the ranges \(1/\log X < |t |\le 1\), \(1 < |t |\le \log X\) and \(\log X < |t |\le X\) separately. Throughout we will introduce an auxiliary parameter \(2 \le Y \le X\), chosen case by case, and use the inequality
Suppose first that \(1/\log X < |t |\le 1\). Let \(Y := e^{1/|t |}\) and write
so that by arguments analogous to those of Lemma 5.2, \(R(X) \ll X/(\log X)^{3/2-o(1)}\). By partial summation and Lemma 5.2,
the bound in the last step arising from setting \(v := |t |\log u\) and integrating by parts. Thus, in light of Lemma 5.2
Next, we consider the intermediate range \(1 < |t |\le \log X\). Here, we set \(Y := (10\log X)^2\), employ a dyadic decomposition and apply Lemma 5.3 to obtain, when X is large enough,
for some \(c = c(\alpha ) > 0\).
Finally, assume that \(\log X \le |t |\le X\). In this case, put \(Y := \exp \left( (\log X)^{2/3+\varepsilon }\right) \), where \(\varepsilon > 0\) is small. Let \(m \ge 1\) be an integer parameter to be chosen later. By Hölder’s inequality,
We can bound \(|\lambda _f(p) |^{2\alpha m/(2m-1)} \le |\lambda _f(p) |^\alpha 2^{\alpha /(2m-1)}\), so that by Lemma 5.2 the first sum is
Now, we can write
By the zero-free region of the Riemann zeta function (see e.g., [24, Lem. 2]), we have
It follows that
and therefore in sum we have
Using the bounds \(\sqrt{2\pi n} (n/e)^n \le n! \le 2\sqrt{2\pi n} (n/e)^n\), valid for all \(n \in \mathbb {N}\) (see e.g., [31]), we get that
and thus taking \(m \ge m_0(\alpha )\), we obtain
We thus obtain in this case that
Combining our estimates from each of these ranges and putting \(\delta := c_\alpha \min \{c/(8\log 2), \frac{1}{4}(1-2^{-1/(2m)})\}\), we deduce that
This completes the proof of the lower bound. \(\square \)
Proof of Proposition 5.1
Let X be large. By Deligne’s theorem we have \(|\lambda _f(p) |^\alpha \le 2^\alpha \) for all p. In addition, we have \(|\lambda _f(n) |^\alpha \le d(n)^\alpha \le d_{2^{\alpha +1}}(n)^{\max \{1,\alpha \}}\) for all n. By Lemma 5.2, we see that we can take \(A = c_\alpha \) and any \(\gamma \in (0,1/2)\) in an estimate of the form
and finally, by Lemma 5.4 there is a constant \(\delta > 0\) such that
as \(t_0 =0\) is admissible. Thus, by definition, \(|\lambda _f |^\alpha \in \mathcal {M}(X; c_\alpha , 2^\alpha , \max \{1,\alpha \}; 1/2-\varepsilon ,\delta )\) for any \(\varepsilon \in (0,1/2)\) and X large, as claimed.\(\square \)
Proof of Theorem 1.4
In view of Proposition 5.1, we may apply Theorem 1.7 to the function \(|\lambda _f |^\alpha \). We see that if \(h = h_0 H(|\lambda _f |^\alpha ;X)\) and \(h_0 \rightarrow \infty \) then
where \(\theta = \theta (\alpha ) > 0\). Furthermore, by Lemma 5.2, we have
where \(d_\alpha = c_{2\alpha } - 2c_\alpha + 1\). Thus, changing \(h_0\) by a constant factor, we deduce that \(h = h_0 (\log X)^{d_\alpha }\) can be taken in the above estimate. The claim follows.\(\square \)
Proof of Corollary 1.1
When \(\alpha = 2\), we have \(c_2 = 1\) and \(d_2 = c_4 - 2c_2 + 1 = 1\). Hence, \(H(|\lambda _f |^2;X) \asymp \log X\). Since
the claim for \(|\lambda _f |^2\) follows immediately from Theorem 1.4.
It remains to consider \(g_f(n) = \sum _{d^2 \mid n} |\lambda _f(n/d^2)|^2\). Clearly, \(g_f(n) \le \sum _{e \mid n} d(n/e)^2 \le d(n)^3\), and \(g_f(p) = |\lambda _f(p) |^2\) for all primes p. By Proposition 5.1, we have \(g_f \in \mathcal {M}(X; 1,4,3;1/2-\varepsilon ,\delta )\) for any \(\varepsilon \in (0,1/2)\), and \(H(g_f;X) = H(|\lambda _f |^2;X)\). The result now follows in the same way as for \(|\lambda _f |^2\), using
in this case. \(\square \)
5.2 Proof of Theorem 1.2
Fix \(m \ge 2\), let \(\mathbb {A}\) denote the adeles over \(\mathbb {Q}\), and let \(\pi \) be a fixed cuspidal automorphic representation for \(GL_m(\mathbb {A})\) with unitary central character normalized so that it is trivial on the diagonally embedded copy of \(\mathbb {R}^+\). We write \(q_{\pi }\) to denote the conductor of \(\pi \). We assume that \(\pi \) satisfies GRC, and we write \(\lambda _{\pi }(n)\) to denote the nth coefficient of the standard L-function of \(\pi \). The key result of this subsection is the following analogue of Proposition 5.1.
Proposition 5.5
With the above notation, we have \(|\lambda _{\pi } |^2 \in \mathcal {M}(X; 1, m^2, 2)\) whenever X is sufficiently large in terms of \(q(\pi )\), and \(t_0(|\lambda _{\pi } |^2,X) = 0\) is admissible.
For primes \(p \not \mid q_{\pi }\), we have \(|\lambda _{\pi }(p) |^2 = \lambda _{\pi \otimes {\tilde{\pi }}}(p)\), where \({\tilde{\pi }}\) denotes the contragredient representation of \(\pi \) and \(\pi \otimes {\tilde{\pi }}\) is the Rankin–Selberg convolution of \(\pi \) and \({\tilde{\pi }}\). As \(\pi \) is fixed, the primes \(p \mid q_{\pi }\) will cause no harm to our estimates.
Lemma 5.6
There is a constant \(c = c(m) > 0\) such that
In particular, we have \(\sum _{z< p \le w} \frac{|\lambda _{\pi }(p) |^2}{p} = \sum _{z < p \le w} \frac{1}{p} + O_{\pi }(\frac{1}{\log z})\) for any \(z < p \le w\).
Proof
Assume X is sufficiently large relative to \(q_{\pi }\). Set \(f := \pi \otimes {\tilde{\pi }}\), and write \(\Lambda _{f,X}(n)\) to denote the nth coefficient of the logarithmic derivative \(-\frac{L'}{L}(s,f)\). Combining [18, Thm. 5.13] (see the remarks that follow the statement for a discussion relevant to the case of a Rankin–Selberg convolution) with [18, Exer. 6], we deduce that
for some absolute constant \(c' > 0\) (note that the exceptional zero plays no role when X is large enough). This implies the first claim. The second follows immediately from the first statement by partial summation. \(\square \)
Proof of Proposition 5.5
Lemma 5.6 implies that (1.6) holds with \(A = 1\), and by GRC we have \(|\lambda _{\pi }(n) |^2 \le d_m(n)^2\). It thus follows that \(|\lambda _{\pi } |^2 \in \mathcal {M}(X;1,m^2,2)\), as claimed. \(\square \)
Proof of Theorem 1.2
Recall that m and \(\pi \) are fixed. A direct application of Theorem 1.7 shows (after replacing X by 2X and \(x-h\) by x) that there is \(\kappa = \kappa (m) > 0\) such that
where \(h = h_0 H(|\lambda _{\pi } |^2;X)\) and \(10 \le h_0 \le X/(10 H(|\lambda _{\pi } |^2;X))\). By Lemma 5.6\(\mathcal {P}_{|\lambda _{\pi } |^2}(X) \ll _m 1\). We also have
It follows that our variance estimate holds if \(h \ge h_0 (\log X)^{m^2-1}\) and \(10 \le h_0 \le X/(10(\log X)^{m^2-1})\), and the proof of the theorem is complete.\(\square \)
5.3 Proof of Corollary 1.6
Recall that
Given \(\theta \in \mathbb {R}\), write also
This is clearly a multiplicative function, with \(d(n) = d(n,0)\). In probabilistic terms, it is also d(n) times the characteristic function of the distribution function
introduced in Sect. 1.3. The following general bounds for concentration functions in terms of characteristic functions allow us to relate \(\Delta (n)\) with integral averages of \(d(n,\theta )\).
Lemma 5.7
There are constants \(c_2> c_1 > 0\) such that, uniformly in \(n \in \mathbb {N}\),
Proof
This is Exercise 279 in [39]. \(\square \)
By Lemma 5.7, we find that for any \(x \in [X/2,X]\) and \(10 \le h \le X\),
For \(\theta \in \mathbb {R}\) and \(n \in \mathbb {N}\), we write \(f_{\theta }(n) := |d(n,\theta ) |^2/d(n)\).
Corollary 5.8
Let \(\theta \in (1/\log X,1]\). Let \(10 \le h_0 \le X/\log X\) and put \(h := h_0 (\theta ^{-1} \log X)^{1/2}\). Then there is a constant \(\kappa _{1,2} > 0\) such that for any \(0< \kappa < \kappa _{1,2}\),
The implicit constant is independent of \(\theta \).
To this end, we prove that \(f_{\theta } \in \mathcal {M}(X;1,2,1)\) for all \(1/\log X < \theta \le 1\), which is the purpose of the following lemmas.
Lemma 5.9
Let \(\theta \in (0, 1]\), and let \(\beta := \min \{1/\theta ,\log X\}\). Then
Similarly,
Proof
Observe that for each p,
Put \(Y := \min \{X,\exp (1/\theta )\} = e^{\beta }\). For \(p \le Y\), we have \(\cos (\theta \log p) = 1 +O(\theta ^2(\log p)^2)\), so that by the prime number theorem,
This proves the first claim if \(0 \le \theta \le 1/\log X\), so assume now that \(1/\log X < \theta \le 1\). By partial summation and the prime number theorem, we have
We thus deduce that
and the first claim follows for all \(\frac{1}{\log X} < \theta \le 1\) as well.
For the second claim, we simply note that
A similar partial summation argument shows that
and the claim follows. \(\square \)
Lemma 5.10
Let \(\theta \in (0,1]\). Let \(2 \le z \le w \le X\). Then
Proof
Set \(Y := \min \{X,e^{1/\theta }\}\) once again. If \(w \le Y\) then \(\cos (\theta \log p) \ge \cos (1) \ge 0\) for all \(z < p \le w\), and thus
On the other hand, if \(Y \le z\) (so that \(\theta > 1/\log X\)) then by the same partial summation argument as in Lemma 5.9 we find that
Finally, suppose \(z< Y < w\). In this case, we split the interval into the segments (z, Y] and (Y, w] and apply the arguments in each of the previous two cases to obtain
as claimed. \(\square \)
Proof of Corollary 5.8
Let \(h = h_0 (\theta ^{-1} \log X)\). Note that \(|d(n,\theta ) |^2/d(n) \le d(n)\) uniformly over n, so that combined with Lemma 5.10 we have that \(f_{\theta } \in \mathcal {M}(X;1,2,1)\) for all \(\theta \in (1/\log X,1]\). Since \(H(f_{\theta };X) \ll (\theta ^{-1} \log X)^{1/2}\) uniformly over all \(\theta \in (1/\log X,1]\) by Lemma 5.9, the claim follows from Theorem 1.7.
Proof of Corollary 1.6
Let \(\delta \in (0,1]\), set \(Y := \exp \left( (\log X)^{\delta }\right) \) and put \(h = h_0 (\log X)^{(1+\delta )/2}\), with \(10 \le h_0 \le X/10(\log X)^{(1+\delta )/2}\). By Lemma 5.9, we have \(H(f_{\theta };X) \gg (\log X)^{(1+\delta )/2}\) for all \(1/\log Y < \theta \le 1\). By Fubini’s theorem, the Cauchy–Schwarz inequality and Corollary 5.8, we thus see that
for any \(0< \kappa < \kappa _{1,2}\). By Lemma 5.9, we have
We thus deduce that for all but \(o_{h_0 \rightarrow \infty }(X)\) exceptional integers \(x \in [X/2,X]\), we have that
For any of the non-exceptional x, we apply use (5.4) to give
On the other hand, by [39, Exer. 208] we find that when \(1/\log X \le \theta \le 1\),
where for \(\text {Re}(s) > 3/4\), \(H_{\theta }(s)\) is some convergent Dirichlet series satisfying \(H_{\theta }(1) \gg 1\) uniformly in \(\theta \in [1/\log X,1]\). Integrating over \(\theta \in [1/\log Y,1]\) and using the Laurent expansion \(\zeta (1+i\theta ) = (i\theta )^{-1} + O(1)\), we deduce that
We thus have obtained
for all but \(o_{h_0 \rightarrow \infty }(X)\) integers \(x \in [X/2,X]\), and the claim follows.\(\square \)
Notes
As pointed out in [25, p. 8], it is generally unclear what the least size of such intervals must be for a given bounded multiplicative function.
In [25], they obtained the explicit constant \(\rho _A = A/3 - \frac{2}{3\pi } \sin (\pi A/2)\).
Implicitly, it is assumed that \(-\frac{L'}{L}(s,f)\) is well defined in \(\text {Re}(s) > 1\).
We would like to thank Maksym Radziwiłł and Jesse Thorner for pointing this out.
By a y-smooth or y-friable integer, we mean a positive integer n such that \(p \mid n \Rightarrow p \le y\).
Matthiesen [28] works with a slightly more rigid collection of unbounded functions, at least as far as her assumptions on lower bounds for |f(p)| on average; in particular, she assumes uniform lower bounds on the weighted sums \(x^{-1} \sum _{p \le x} |f(p)|\log p\), which is a stronger condition than (1.6), say. Therefore, we cannot simply import her related results in the sequel.
The technique used there relies on the main result of [14], which is valid generally for multiplicative functions that are bounded by a power of the divisor function.
This result is stated in [25] for bounded multiplicative functions, but the proof there works identically for divisor-bounded functions as well since it relies principally on the general setup of [14, Thm. 3]. One might invoke the work of [14] to prove this, though the implication is slightly less direct.
References
Elliott, P.D.T.A.: Multiplicative function mean values: asymptotic estimates. Func. Approx. 56(2), 217–238 (2017)
Erdös, P.: On the density of some sequences of integers. Bull. Am. Math. Soc. 54, 685–692 (1948)
Frantzikinakis, N., Host, B.: The logarithmic Sarnak conjecture for ergodic weights. Ann. Math. 187, 1–63 (2018)
Goldfeld, D., Li, X.: A standard zero-free region for Rankin–Selberg \({L}\)-functions. Int. Math. Res. Not. 2018(22), 7067–7136 (2018)
Gorodetsky, O.: Mean values of arithmetic functions of polynomials in short intervals and in arithmetic progressions. Mathematika 66(2), 373–394 (2020)
Granville, A.: Smooth Numbers: Computational Number Theory and Beyond. Algorithmic Number Theory, vol. 44 (2008)
Granville, A., Harper, A.J., Soundarararajan, K.: A new proof of Halász’ s theorem and its consequences. Compos. Math. 155, 126–163 (2019)
Granville, A., Soundararajan, K.: Decay of mean values of multiplicative functions. Can. J. Math. 55(6), 1191–1230 (2003)
Granville, A., Soundararajan, K.: Large character sums: pretentious characters and the Polya–Vinogradov theorem. J. Am. Math. Soc 20(2), 357–384 (2007)
Halász, G.: Uber die Mittelwerte multiplikativer zahlentheoretischer Funktionen. Acta Math. Acad. Sci. Hung. 19, 365–403 (1968)
Hall, R.R., Tenenbaum, G.: Divisors. In: Cambridge Tracts in Mathematics, vol. 90, Cambridge University Press, Cambridge (1988)
Hall, R.R., Tenenbaum, G.: On the average and normal orders of Hooley’s \(\Delta \)-function. J. Lond. Math. Soc. 25(3), 396–402 (1982)
Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. 17, 75–115 (1918)
Henriot, K.: Nair–Tenenbaum bounds uniform with respect to the discriminant. Math. Proc. Camb. Philos. Soc. 152(3), 405–424 (2012)
Hooley, C.: On a new technique and its applications to the theory of numbers. Proc. Lond. Math. Soc. 25(3), 115–151 (1979)
Humphries, P.: Standard zero-free regions for Rankin–Selberg \({L}\)-functions via sieve theory. Math. Zeit. 292, 1105–1122 (2019)
Ivić, A.: On the Rankin–Selberg problem in short intervals. Moscow J. Comb. Number Theory 2(3), 3–17 (2012)
Iwaniec, H., Kowalski, E.: Analytic Number Theory. American Mathematical Society Colloquium Publications, vol. 53, p. 615. American Mathematical Society, Providence, RI (2004)
Klurman, O., Mangerel, A.P.: Teräväinen: Multiplicative Functions in Short Arithmetic Progressions. arXiv:1909.12280v3 [math.NT]
Kułaga-Przymus, J., Lemańczyk, M.: Sarnak’s conjecture from the ergodic theory point of view. Discrete Continu. Dyn. Syst. 37(6), 2899–2944 (2017)
Maier, H., Tenenbaum, G.: On the set of divisors of an integer. Invent. Math. 76, 121–128 (1984)
Mangerel, A.P.: Topics in Multiplicative and Probabilistic Number Theory. PhD Thesis, University of Toronto (2018)
Mangerel, A.P.: Additive functions in short intervals, gaps and a conjecture of Erdös. Ramanujan J. 59, 1023–1090 (2022)
Matomäki, K., Radziwiłł, M.: A note on the Liouville function in short intervals. arXiv:1502.02374v1 [math.NT]
Matomäki, K., Radziwiłł, M.: Multiplicative Functions in Short Intervals II. arXiv: 2007.04290 [math.NT]
Matomäki, K., Radziwiłł, M.: Multiplicative functions in short intervals. Ann. Math. 183(3), 1015–1056 (2016)
Matomäki, K., Radziwiłł, M., Tao, T.: An averaged form of Chowla’s conjecture. Algebra Number Theory 9(9), 2167–2196 (2015)
Matthiesen, L.: Generalized Fourier coefficients of multiplicative functions. Algebra Number Theory 12, 1311–1400 (2018)
Montgomery, H.L.: A note on the mean values of multiplicative functions. Inst. Mittag-Leffler Report no. 17
Newton, J., Thorne, J.A.: Symmetric power functoriality for holomorphic modular forms (2019). arXiv:1912.11261 [math.NT]
Robbins, H.: A remark on Stirling’s formula. Am. Math. Mon. 62(1), 26–29 (1955)
Shiu, P.: A Brun–Titchmarsh theorem for multiplicative functions. J. Reine Angew. Math. 313, 161–170 (1980)
Smida, H.: Sur les puissances de convolution de la fonction de Dickman. Acta Arith. 59(2), 124–143 (1991)
Song, J.-M.: Sums of nonnegative multiplicative functions over integers free of large prime factors II. Acta Arith. 102, 105–129 (2002)
Tao, T.: Equivalence of the logarithmically averaged Chowla and Sarnak conjectures. In: Elsholtz, C., Grabner, P. (eds.), Number Theory-Diophantine Problems, Uniform Distribution and Applications: Festschrift in Honour of Robert F. Tichy’s 60th Birthday, Springer, Cham, pp. 391–421 (2017)
Tao, T.: The logarithmically averaged Chowla and Elliott conjectures for two-point correlations. Forum Math. Pi 4, 8–36 (2016)
Tao, T.: The Erdös discrepancy problem. Discrete Anal. 1, 29 (2016)
Tao, T., Teräväinen, J.: The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures. Duke Math. J. 168(11), 1977–2027 (2019)
Tenenbaum, G.: Introduction to Analytic and Probabilistic Number Theory, Graduate Studies in Mathematics, 3rd edn., vol. 163, American Mathematical Society, Providence (2015)
Tenenbaum, G.: Some of Erdös’ unconventional problems in number theory, thirty-four years later. In: Centennial, E., Bolyai, J. (eds.), Math. Soc., Budapest, pp. 651–681 (2013)
Tenenbaum, G.: Moyennes effectives de fonctions multiplicatives complexes. Ramanujan J. 44(3), 641–701 (2017)
Thorner, J.: Effective forms of the Sato–Tate conjecture. Res. Math. Sci. 8(1), 1–21 (2020)
Wirsing, E.: Das asymptotische Verhalten von Summen über multiplikative Funktionen II. Acta Math. Acad. Sci. Hung. 18, 411–467 (1967)
Acknowledgements
The author warmly thanks Oleksiy Klurman and Aled Walker for helpful suggestions about improving the exposition of the paper, as well as for their encouragement. He is also grateful to Maksym Radziwiłł and Jesse Thorner for helpful conversations and suggestions regarding the applications to automorphic forms. Finally, he thanks the anonymous referees for carefully reading the paper and for providing valuable comments. Much of this paper was written while the author held a Junior Fellowship at the Mittag–Leffler Institute for mathematical research during the Winter of 2021. He would like to thank the institute for its support.
Funding
During the writing of this paper, the author was supported by a CRM-ISM fellowship from the Centre de Recherches Mathématiques, as well as a Junior Fellowship from the Mittag-Leffler Institute.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Mangerel, A.P. Divisor-bounded multiplicative functions in short intervals. Res Math Sci 10, 12 (2023). https://doi.org/10.1007/s40687-023-00376-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40687-023-00376-0
Keywords
- Multiplicative functions
- Automorphic forms
- Hooley delta function
- Pretentious analytic number theory
- Matomäki–Radziwiłł method