Optimal bounds for sums of bounded arithmetic functions

Abstract

Let A(s) = Σn an n-s be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of A(s) with | s| ≤ T for some large constant T. What is the best way to use such finite spectral data to give explicit estimates on sums Σn≤ x an? The problem of giving explicit bounds on the Mertens function M(x) = Σn≤ x μ(n) illustrates how open this basic question was. Bounding M(x) might seem equivalent to estimating (x) = Σn≤ x (n) or the number of primes ≤ x. However, we have long had fairly good explicit bounds on prime counts, while bounding M(x) remained a notoriously stubborn problem. We prove a sharp, general result on sums Σn≤ x an n-σ for an bounded, giving an optimal way to use information on the poles of A(s) with | s|≤ T and no data on the poles above. Our bounds on M(x) are stronger than previous ones by many orders of magnitude. (Similar results for (x) are given in a companion paper.) Using rigorous residue computations by D. Platt, we obtain, for x≥ 1, |M(x)|≤ 3π· 1010· x + 11.39 x. This is a corollary of our main result, essentially an explicit formula with the contribution of each pole clearly stated; we shall discuss how this finer structure can be useful. Our proof mixes a Fourier-analytic approach in the style of Wiener--Ikehara with contour-shifting, using optimal approximants of Beurling--Selberg type (Carneiro--Littmann, 2013); for σ=1, the approximant in (Vaaler, 1985) reappears. While we proceed independently of existing explicit work on M(x) and (x), our method has an important step in common with work on another problem by (Ramana--Ramar\'e, 2020).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…