A pretentious proof of Linnik's estimate for primes in arithmetic progressions

Abstract

In the present paper, we adopt a pretentious approach and prove a strongly uniform estimate for the sums of the von Mangoldt function $\Lambda$ on arithmetic progressions. This estimate is analogous to an estimate that Linnik established in his attempt to prove his celebrated theorem concerning the size of the smallest prime number of an arithmetic progression. Our work builds on ideas coming from the pretentious large sieve of Granville, Harper and Soundararajan and it also borrows insights from the treatment of Koukoulopoulos on multiplicative functions with small averages.

arXiv comment22 pages; A small necessary fix in the proof of Theorem 1.1 was applied, minor text changes in the Abstract and the Introduction were made, Lemma 2.1 and Theorem 2.4 were added and the proof of Lemma 2.5 (previously Lemma 2.3) was rewritten. A reference and a remark (Remark 1.1) were added and another reference was updated

References in corpus (5)

• Pretentious multiplicative functions and the prime number theorem for arithmetic progressions
• A new proof of Halász's Theorem, and its consequences
• On multiplicative functions which are small on average
• The structure of multiplicative functions with small partial sums
• On multiplicative functions with small partial sums