Optimal bounds for sums of non-negative arithmetic functions
Abstract
Let A(s) = Σn an n-s be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of A(s) with | s| ≤ T, and their residues, for some large constant T. It is natural to ask how such finite spectral information may be best used to estimate partial sums Σn≤ x an. Here, we prove a sharp, general result on sums Σn≤ x an n-σ for an non-negative, giving an optimal way to use information on the poles of A(s) with | s|≤ T, with no need for zero-free regions. We give not just bounds, but an explicit formula with compact support. Our bounds on (x)-x are, unsurprisingly, better and often simpler than a long list of existing explicit versions of the Prime Number Theorem. We treat the case of M(x) and similar functions in a companion paper. Our solution mixes a Fourier-analytic approach in the style of Wiener--Ikehara with contour-shifting, using optimal approximants of Beurling--Selberg type found in (Graham--Vaaler, 1981).
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.