Improving and Maximal Inequalities for Primes in Progressions
Abstract
Assume that y < N are integers, and that (b,y) =1. Define an average along the primes in a progression of diameter y, given by integer (b,y)=1 . align* AN,y,b := φ (y)N Σ n <N\ by (n) f(x-n) align* Above, is the von Mangoldt function and φ is the totient function. We establish improving and maximal inequalities for these averages. These bounds are uniform in the choice of progression. For instance, for 1< r < ∞ there is an integer N y, r so that align* N>N y,r AN,y,b f r fr. align* The implied constant is only a function of r. The uniformity over progressions imposes several novel elements on the proof.
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.