The Bombieri-Vinogradov theorem for nilsequences

- Department of Mathematics, University of Kentucky
- More about Xuancheng Shao

- Mathematical Insitute, University of Oxford
- More about Joni Teräväinen

### Editorial introduction

The Bombieri-Vinogradov theorem for nilsequences, Discrete Analysis 2021:21, 55 pp.

The prime number theorem asserts that the density of the primes in the vicinity of a large integer n is approximately 1/logn, or equivalently that the number of primes up to n is approximately equal to the logarithmic integral ∫n0(logt)−1dt (which in turn is close to n/logn but when one is discussing the size of the error it is important to use the slightly more complicated expression).

Dirichlet’s theorem asserts that every infinite arithmetic progression a,a+q,a+2q,… such that a and q are coprime contains infinitely many primes. It is natural to ask whether there is a simultaneous generalization of this result and the prime number theorem, and indeed there is: the Siegel-Walfisz theorem gives an estimate for the number of primes up to n in a given arithmetic progression, and shows that when n is large, the primes are roughly equidistributed among the allowable residue classes. That is, if a and q are coprime, then the proportion of primes congruent to a mod q converges to 1/ϕ(q), where ϕ is Euler’s totient function.

A convenient way to express these results is by using the *von Mangoldt function* Λ, which is defined on the positive integers by taking Λ(n) to be logp if n=pk for some prime p, and 0 otherwise. One can regard Λ as correcting for the density of the primes: that is, because it takes the value logp at a prime p, the average size of Λ near a large integer n is roughly 1. (This does not explain why one takes Λ to be non-zero at prime powers: the reason for choosing this definition is that it has a negligible effect on the average value of Λ, and for every positive integer n one has that ∑d|nΛ(d)=logn, as can easily be checked.) The prime number theorem is then equivalent to the statement that ∑n≤xΛ(n) is approximately x for large x, and the Siegel-Walfisz theorem states that ∑n≤x,n≡a mod qΛ(n) is approximately x/ϕ(q). More precisely, it states this with an error term of size roughly xexp(−C√logx), where C depends on the size of logq/loglogx, so if q is bounded by some fixed power of logx, then C is bounded (but the proof of the theorem is ineffective, so no estimate for C is known – this is because of the possible existence of a so-called Siegel zero, which is a zero of a Dirichlet L-function that is very close to 1).

The generalized Riemann hypothesis implies a much better estimate for this error term: it brings it down to x1/2+ϵ for any ϵ>0. But in the absence of a spectacular breakthrough, we have to content ourselves with the weaker estimate coming from the Siegel-Walfisz theorem if we want unconditional results.

However, it turns out that for many applications to statements about the primes, one does not in fact need to know accurate estimates for how they are distributed in *all* arithmetic progressions – it is sufficient if one has good estimates for *almost* all arithmetic progressions in a suitable sense. The Bombieri-Vinogradov theorem is a major result in analytic number theory that shows that on average the error term is of the kind of size that the generalized Riemann hypothesis predicts.

One can understand the statement of the theorem as follows. For any given x and q, let us measure the error E(q) associated with the common difference q as

maxy≤xmax(a,q)=1)|∑n≤y, n≡a mod qΛ(n)−y/ϕ(q)|.

In other words, it is the worst error that can be obtained on an arithmetic progression of integers less than or equal to x that belong to a residue class mod q. The Bombieri-Vinogradov theorem concerns the average value of E(q) over a suitable range. If x1/2(logx)−A≤Q≤x1/2 for some constant A, then it states that the average of E(q) over all q≤Q is at most x1/2(logx)5.

Proving results about the behaviour of primes in arithmetic progressions is closely related to proving results about exponential sums of the form ∑n≤xΛ(n)e(αn). (Here e(x) stands for e2πix.) This paper considers more general sums, such as sums of the form ∑n≤xΛ(n)e(P(n)), where P is a polynomial, or more generally still sums of the form ∑n≤xΛ(n)ψ(n) where ψ(n) is an object known as a *nilsequence*. Nilsequences are generalizations of polynomial phase functions e(P(n)) that play a central role in “higher-order Fourier analysis”, where they replace the role of the trigonometric functions e(αn) and allow one to obtain results about more general configurations. In particular, they were crucial to results of Green, Tao and Ziegler concerning solutions of linear equations in the primes, which generalized their famous theorem that the primes contain arbitrarily long arithmetic progressions.

The paper obtains Bombieri-Vinogradov-type results for these more general sums, which allows them to obtain a remarkably diverse collection of applications. One of these is a strengthening of the Green-Tao theorem, which states that if Q≤x1/4−ϵ, then for almost all q≤Q, every residue class {n:n≡a mod q} with (a,q)=1 contains an arithmetic progression of length k consisting of primes. Another is a strengthening of Zhang’s bounded-gaps theorem: they show that for any η>0 and any polynomial P with at least one irrational coefficient that is not the coefficient of the constant term, the set of primes p such that P(p) is within η of an integer has bounded gaps. A third is a strengthening of Chen’s theorem that there are infinitely many primes p such that p+2 is a product of two primes. They prove that there is some θ>0 such that this is true even if one insists that P(p) is within p−θ of an integer, where P is as in the previous application. (Here θ depends on the degree of P.) Further applications that are slightly more technical to state can be found in the paper.