A new proof of Hal\'asz's Theorem, and its consequences

Abstract

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function f. The bound is sharp for general such f, and, in particular, it implies that a multiplicative function with |f(n)| 1 has either mean value 0, or is "close to" nit for some fixed t. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to short intervals and to arithmetic progressions. We use these results to obtain new, arguably simpler, proofs that there are always primes in short intervals (Hoheisel's Theorem), and that there are always primes near to the start of an arithmetic progression (Linnik's Theorem).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…