The primes contain arbitrarily long arithmetic progressions
By Ben Joseph Green, Terence Tao. 2004
975 citations recorded by the source corpus.
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi�s theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemeredi�s theorem that any subset of a suficiently pseudorandom set (or measure) of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim, which we reproduce here. Using this, one may place (a large fraction of) the primes inside a pseudorandom set of �almost primes� (or more precisely, a pseudorandom measure concentrated on almost primes) with positive relative density.
Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- Terence Tao
- Nikos Frantzikinakis
- William T. Gowers
- T. Ziegler
- Ben Joseph Green
- Bryna Kra
- David Conlon
- B. Host
In Discrete Mathematics and Combinatorics
- Terence Tao
- Nikos Frantzikinakis
- William T. Gowers
- Ben Joseph Green
- T. Ziegler
- B. Host
- David Conlon
- Bryna Kra
Citations in the corpus
- Boosting and Differential Privacy (2010, background): “(This can be viewed as an information-theoretic analogue of the “dense model theorems” of [15], [25], [21], [20].”
- An Inverse Theorem for the Uniformity Seminorms Associated with the Action of $${{\mathbb {F}^{\infty}_{p}}}$$ (2009, background): “Dual functions in this setting play an important role in the finitary theory of arithmetic progressions and similar patterns; see [13].”
- Assouad Dimension and Fractal Geometry (2020, background): “Recall, for example, the Erdős conjecture on arithmetic progressions, of which the celebrated Green-Tao Theorem [123] is a special case.”
- Multiple recurrence and convergence for hardy sequences of polynomial growth (2009, result): “Key for our study is the structure theorem of Host and Kra (Theorem 3.3) and the quantitative equidistribution result of Green and Tao (Theorem 3.2).”
- Arithmetic Progressions in Sets of Fractional Dimension (2007, methodology): “ the trilinear form Λ in a Fourier representation and a decomposition of the measure µinto “random” and “periodic” parts. However, our actual argument is quite different in its execution from those of [10] or [23]. For instance, in [9], [11], [23] the restriction estimate is applied to the “random” t”
- New bounds for Szemeredi's theorem, II: A new bound for r_4(N) (2006, background): “The second norm that controls Λ is the Gowers U 3 -norm f U 3 ( Z /p Z ) of a function f : Z /p Z → C , defined as This norm was introduced in [4, 5] and studied further in such papers as [10, 11, 12, 28].”
- Norm convergence of multiple ergodic averages for commuting transformations (2007, neutral): “Then, if P is sufficiently large depending on M∗, F, f1, . . . , fl, x0, ε, we can ensure that (5) Ev∈[P ]l ∣ ∣ ∣ ∣ ∣ En∈[F (M)] l ∏ i=1 fi(T n i T vx0) − En∈[M ] l ∏ i=1 fi(T n i T vx0) ∣ ∣ ∣ ∣ ∣ 2 > 2ε2 for all 1 ≤M ≤M∗.”
- The primes contain arbitrarily long polynomial progressions (2006, methodology): “eudorandom. In view of [36] however, it should be possible (though time-consuming) to obtain a counterpart to Theorem 1.3 for the Gaussian primes. The philosophy of the proof is similar to the one in [18]. The first key idea is to think of the primes (or any large subset thereof) as a set of positive”
- Maximal multilinear operators (2005, result): “s considered earlier. These averages are related to the Furstenberg recurrence theorem [10] and to Szemer´edi’s theorem on arithmetic progressions [20], and are also connected to the recent result in [11] that the primes contain arbitrarily long progressions. For instance, the Furstenberg recurrence”
- Open problems in additive combinatorics (2007, positive): “…this, we just focus on the three most famous: Gow-ers’ new proof of Szemer´edi’s theorem [45], the Bourgain-Katz-Tao [16] and Bourgain-Glibichuk-Konyagin [15] sum-product estimates in finite fields, and the Green-Tao proof [51] that the set of primes contains arbitrarily long arithmetic progressions.”
- Universal characteristic factors and Furstenberg averages (2004, methodology): “In particular, we do not use the Gowers uniformity norms [G01], which are fundamental in the approach of Host and Kra to this problem (and in the works of Gowers [G01], and Green–Tao [GT04] on problems of a similar nature).”
- Growth in groups: ideas and perspectives (2013, neutral): “hur, van der Waerden, Roth [Rot53], Szemer´edi [Sze69], Furstenberg [Fur77] (leading to the ergodic work of Host-Kra [HK05] and Ziegler [Zie07]; see also Szegedy [Sze]), Gowers [Gow01], and Green-Tao [GT08], among many others, and another one based on the study of growth in abelian groups, starting ”
- Topology of random simplicial complexes: a survey (2013, background): “The primes are not random, but they are “pseudorandom” and for many purposes behave as if they were a random subset of the integers with density predicted by the prime number theorem — the Green–Tao theorem is a celebrated example [23].”