Misplaced Pages

Bombieri–Vinogradov theorem

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In mathematics, the Bombieri–Vinogradov theorem (sometimes simply called Bombieri's theorem) is a major result of analytic number theory, obtained in the mid-1960s, concerning the distribution of primes in arithmetic progressions, averaged over a range of moduli. The first result of this kind was obtained by Mark Barban in 1961 and the Bombieri–Vinogradov theorem is a refinement of Barban's result. The Bombieri–Vinogradov theorem is named after Enrico Bombieri and A. I. Vinogradov, who published on a related topic, the density hypothesis, in 1965.

This result is a major application of the large sieve method, which developed rapidly in the early 1960s, from its beginnings in work of Yuri Linnik two decades earlier. Besides Bombieri, Klaus Roth was working in this area. In the late 1960s and early 1970s, many of the key ingredients and estimates were simplified by Patrick X. Gallagher.

Statement of the Bombieri–Vinogradov theorem

Let x {\displaystyle x} and Q {\displaystyle Q} be any two positive real numbers with

x 1 / 2 log − A ⁡ x ≤ Q ≤ x 1 / 2 . {\displaystyle x^{1/2}\log ^{-A}x\leq Q\leq x^{1/2}.}

Then

∑ q ≤ Q max y ≤ x max 1 ≤ a ≤ q ( a , q ) = 1 | ψ ( y ; q , a ) − y φ ( q ) | = O ( x 1 / 2 Q ( log ⁡ x ) 5 ) . {\displaystyle \sum _{q\leq Q}\max _{y\leq x}\max _{1\leq a\leq q \atop (a,q)=1}\left|\psi (y;q,a)-{y \over \varphi (q)}\right|=O\left(x^{1/2}Q(\log x)^{5}\right)\!.}

Here φ ( q ) {\displaystyle \varphi (q)} is the Euler totient function, which is the number of summands for the modulus q, and

ψ ( x ; q , a ) = ∑ n ≤ x n ≡ a mod q Λ ( n ) , {\displaystyle \psi (x;q,a)=\sum _{n\leq x \atop n\equiv a{\bmod {q}}}\Lambda (n),}

where Λ {\displaystyle \Lambda } denotes the von Mangoldt function.

A verbal description of this result is that it addresses the error term in the prime number theorem for arithmetic progressions, averaged over the moduli q up to Q. For a certain range of Q, which are around x {\displaystyle {\sqrt {x}}} if we neglect logarithmic factors, the error averaged is nearly as small as x {\displaystyle {\sqrt {x}}} . This is not obvious, and without the averaging is about of the strength of the Generalized Riemann Hypothesis (GRH).

See also

Notes

  1. Barban, M. B. (1961). "New applications of the 'large sieve' of Yu. V. Linnik". Akad. Nauk. UzSSR Trudy. Inst. Mat. 22: 1–20. MR 0171763.
  2. Bombieri, E. (1987). Le Grand Crible dans la Théorie Analytique des Nombres. Astérisque. Vol. 18 (Seconde ed.). Paris. MR 0891718. Zbl 0618.10042.{{cite book}}: CS1 maint: location missing publisher (link)
  3. Vinogradov, A. I. (1965). "The density hypothesis for Dirichlet L-series". Izv. Akad. Nauk SSSR Ser. Mat. (in Russian). 29 (4): 903–934. MR 0197414. Corrigendum. ibid. 30 (1966), pages 719-720. (Russian)
  4. Tenenbaum, Gérald (2015). Introduction to Analytic and Probabilistic Number Theory. Graduate Studies in Mathematics. Vol. 163. American Mathematical Society. pp. 102–104. ISBN 9780821898543.

External links

Categories: