This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Green–Tao | |
|---|---|
| Name | Green–Tao theorem |
| Field | Number theory |
| Proved by | Ben Green, Terence Tao |
| Year | 2004 |
| Statement | The primes contain arbitrarily long arithmetic progressions |
Green–Tao
The Green–Tao theorem states that the sequence of prime numbers contains arbitrarily long finite arithmetic progressions, establishing that for every positive integer k there exists an arithmetic progression of length k consisting entirely of primes. The result connects techniques from analytic number theory, combinatorics, ergodic theory, and harmonic analysis and sits alongside major results such as the Prime Number Theorem, the Hardy–Littlewood conjectures, the Szemerédi theorem, and the Pólya–Vinogradov inequality.
For each positive integer k there exist distinct primes p_1, p_2, …, p_k in arithmetic progression; equivalently, there are integers a and d>0 such that a, a+d, a+2d, …, a+(k-1)d are all prime. This assertion refines earlier infinitude statements like Euclid's theorem about primes and complements conjectures in additive number theory such as the Elliott–Halberstam conjecture and the Twin prime conjecture in its focus on regular gaps rather than bounded gaps.
Work on patterns in prime numbers traces to classical figures including Euclid, Dirichlet, Legendre, and Gauss. Progress toward combinatorial patterns involved the development of Ramsey theory and the landmark Szemerédi theorem proved by Endre Szemerédi in 1975, itself influenced by results from Paul Erdős, Pál Turán, Kurt Gödel-era combinatorics, and later ergodic approaches by Hillel Furstenberg. Earlier partial results included work of van der Waerden on arithmetic progressions, results by Ben Green on linear equations in primes, and influential techniques from Goldston–Graham–Pintz–Yıldırım and Yitang Zhang in spacing of primes. The final proof was announced by Ben Green and Terence Tao in 2004 and published in 2008, building on prior work of Szemerédi, Gowers, and Furstenberg.
Green and Tao combined the relative version of the Szemerédi theorem with an averaged form of the von Mangoldt function and a transference principle. They constructed a pseudo-random measure majorizing the primes using ideas from sieve theory and the Selberg sieve, then applied a transference argument to import combinatorial conclusions from dense sets in integers to the sparse setting of primes. Key steps referenced bounds from Gowers norms developed by Timothy Gowers, linear equations techniques from Ben Green and Terence Tao, and harmonic analysis inputs related to Fourier analysis as used by Iwaniec and Heath-Brown.
Important ingredients include the von Mangoldt function Λ, the Selberg sieve, the Gowers uniformity norms U^k introduced by Timothy Gowers, the transference principle linking dense combinatorial theorems to sparse pseudorandom measures, and pseudorandomness notions akin to those in probabilistic method work of Paul Erdős and Alfréd Rényi. Erg odic-theoretic perspectives brought in concepts from Hillel Furstenberg's ergodic proof of Szemerédi theorem, while harmonic analytic methods echo work of Salem, Littlewood, and Hardy; estimates on exponential sums reference techniques underlying the Weyl criterion and results by Vinogradov.
Subsequent results extended the Green–Tao framework to polynomial progressions and multidimensional variants, influenced by results of Bergelson, Leibman, and Bourgain; these led to polynomial Szemerédi-type theorems and to Green–Tao–Ziegler work on linear equations in primes. Further generalizations include extensions to primes in Beatty sequences and results combining the method with the Maynard–Tao sieve as in the work of James Maynard. Connections with the Hardy–Littlewood prime k-tuples conjecture and conditional refinements using the Generalized Riemann Hypothesis or the Elliott–Halberstam conjecture were explored by researchers including Goldston, Pintz, Yıldırım, and Goldston–Pintz–Yıldırım collaborators.
The theorem had major conceptual impact across analytic number theory, additive combinatorics, and ergodic theory, inspiring new techniques in sieve theory, pseudorandomness, and harmonic analysis. It influenced later breakthroughs on bounded gaps between primes by Yitang Zhang, James Maynard, and the Polymath Project led by Terence Tao. The approach informed work on linear patterns in primes, results about prime constellations related to the Hardy–Littlewood conjecture, and motivated computational searches for long prime progressions celebrated in media involving institutions like University of Cambridge and Princeton University.
The proof garnered widespread acclaim; Ben Green and Terence Tao received awards and recognition from organizations such as the American Mathematical Society and the London Mathematical Society. The result stimulated the Polymath Project collaborative model and prompted cross-disciplinary research linking combinatorics with classical prime number theory. Subsequent research by figures like Timothy Gowers, Ben Green, Terence Tao, Terry Tao collaborators, Joni Teräväinen, and James Maynard refined techniques and produced related theorems about primes in various structured sets, while conditional improvements remain tied to advances on conjectures like the Elliott–Halberstam conjecture and the Generalized Riemann Hypothesis.
Category:Theorems in number theory