Table of Contents
Fetching ...

Log-free bounds on exponential sums over primes

Priyamvad Srivastav

TL;DR

The paper proves completely log-free bounds for exponential sums over primes and the Möbius function in a broad major-arc regime, namely for α= a/q+δ/x with $(a,q)=1$, $1≤q≤x^{2/5-η}$ and $|δ|≤x^{1/5+η}/q$. A sieve-weighted Vaughan's identity is developed, combining Barban-Vehov and Selberg weights to separate Type-I and Type-II contributions while maintaining log-freeness; Helfgott’s ideas are adapted to ensure log-free handling of the Type-I component. The main results provide explicit, small-value functions $\mathscr{F}_η$ and $\mathscr{G}_η$ that bound the sums by $\frac{q}{φ(q)}\frac{x}{\sqrt{δ_0 q}}$ and $\frac{x}{\sqrt{δ_0 φ(q)}}$, respectively, substantially improving prior log-free bounds and extending the usable range of $q$. The range $q≤x^{2/5-η}$ is essentially best possible with this method, and the bounds scale favorably as $δ$ grows. The results have implications for additive problems in analytic number theory, enabling sharper minor-arc control and explicit estimates in applications such as Goldbach-type questions and prime-detecting techniques.

Abstract

We establish completely log-free bounds for exponential sums over the primes and the Möbius function. Let $0<η\leq 1/10$, and suppose $α= a/q + δ/x$, with $(a,q)=1$ and $|δ| \leq x^{1/5 + η}/q$, and set $δ_0 = \max(1, |δ|/4)$. For $x \geq x_0(η)$ sufficiently large, we show that: \begin{equation*} \Biggl| \sum_{n \leq x} Λ(n) e(nα) \Biggr| \leq \frac{q}{\varphi(q)} \frac{\mathscr{F}_η\bigl( \frac{\log δ_0 q}{\log x}, \frac{\log^+ δ_0/q}{\log x} \bigr) \cdot x }{\sqrt{δ_0 q}} \ \text{ and } \ \Biggl| \sum_{n \leq x} μ(n) e(nα) \Biggr| \leq \frac{\mathscr{G}_η\bigl( \frac{\log δ_0 q}{\log x}, \frac{\log^+ δ_0/q}{\log x} \bigr) \cdot x}{\sqrt{δ_0 \varphi(q)}}, \end{equation*} for all $1 \leq q \leq x^{2/5 - η}$, where $\log^+ z = \max(\log z, 0)$, and the functions $\mathscr{F}_η$ and $\mathscr{G}_η$ are explicitly determined, taking small to moderate values. These bounds improve substantially upon the existing results - particularly with respect to the permissible ranges of $q$, $δ$ in which log-free bounds are known to hold and potentially with respect to asymptotic functions $\mathscr{F}_η$ and $\mathscr{G}_η$ as well. Moreover, the range $1 \leq q \leq x^{2/5 - η}$ is essentially the best possible we can expect. The main innovation is a sieve-weighted version of Vaughan's identity (Lemma 2.1), which is effectively log-free. We employ several ideas and results from the pioneering work of Helfgott, and particularly, they play a central role in ensuring the log-freeness of the type-I contribution. Also, like in his work, these bounds improve as $δ$ increases.

Log-free bounds on exponential sums over primes

TL;DR

The paper proves completely log-free bounds for exponential sums over primes and the Möbius function in a broad major-arc regime, namely for α= a/q+δ/x with , and . A sieve-weighted Vaughan's identity is developed, combining Barban-Vehov and Selberg weights to separate Type-I and Type-II contributions while maintaining log-freeness; Helfgott’s ideas are adapted to ensure log-free handling of the Type-I component. The main results provide explicit, small-value functions and that bound the sums by and , respectively, substantially improving prior log-free bounds and extending the usable range of . The range is essentially best possible with this method, and the bounds scale favorably as grows. The results have implications for additive problems in analytic number theory, enabling sharper minor-arc control and explicit estimates in applications such as Goldbach-type questions and prime-detecting techniques.

Abstract

We establish completely log-free bounds for exponential sums over the primes and the Möbius function. Let , and suppose , with and , and set . For sufficiently large, we show that: \begin{equation*} \Biggl| \sum_{n \leq x} Λ(n) e(nα) \Biggr| \leq \frac{q}{\varphi(q)} \frac{\mathscr{F}_η\bigl( \frac{\log δ_0 q}{\log x}, \frac{\log^+ δ_0/q}{\log x} \bigr) \cdot x }{\sqrt{δ_0 q}} \ \text{ and } \ \Biggl| \sum_{n \leq x} μ(n) e(nα) \Biggr| \leq \frac{\mathscr{G}_η\bigl( \frac{\log δ_0 q}{\log x}, \frac{\log^+ δ_0/q}{\log x} \bigr) \cdot x}{\sqrt{δ_0 \varphi(q)}}, \end{equation*} for all , where , and the functions and are explicitly determined, taking small to moderate values. These bounds improve substantially upon the existing results - particularly with respect to the permissible ranges of , in which log-free bounds are known to hold and potentially with respect to asymptotic functions and as well. Moreover, the range is essentially the best possible we can expect. The main innovation is a sieve-weighted version of Vaughan's identity (Lemma 2.1), which is effectively log-free. We employ several ideas and results from the pioneering work of Helfgott, and particularly, they play a central role in ensuring the log-freeness of the type-I contribution. Also, like in his work, these bounds improve as increases.
Paper Structure (17 sections, 27 theorems, 156 equations)

This paper contains 17 sections, 27 theorems, 156 equations.

Key Result

Theorem 1

Let $x \geq x_0(\eta)$ be sufficiently large and $\alpha$ be as in AP with $Q = x^{4/5 - \eta}$, i.e., $\alpha = a/q + \delta/x$, $(a,q) = 1$ and $|\delta| \leq x^{1/5 + \eta}/q$. Then, with $\delta_0$ as defined in dl0, we have: andNote that $1 \leq q \leq x^{2/5 - \eta}$ is equivalent to $1 \leq \delta_0 q \leq x^{2/5 - \eta}$, since $\delta_0 q = \max(q, |\delta|q/4)$ and $|\delta|q/4 \leq x/(

Theorems & Definitions (49)

  • Theorem 1
  • Corollary 1
  • proof
  • Lemma 2.1: Sieve-weighted Vaughan's identity
  • proof
  • Theorem I
  • Lemma 4.1
  • proof
  • Proposition 4.2
  • proof
  • ...and 39 more