Green–Tao theorem: the primes contain -term arithmetic progressions
Provedgreen_tao_theoremadditive-combinatoricsarithmetic-progressionsnumber-theoryprime-numbers
Green–Tao theorem (2004). For every there are natural numbers and such that
are all prime; that is, the primes contain arithmetic progressions of every finite length.
The requirement excludes the degenerate progression in which all terms coincide, so the listed terms are pairwise distinct.
This is the arithmetic form of the theorem of Green and Tao. It is stated here in the same shape as the existing platform theorem green_tao_theorem in the other Lean environments, so that reductions in this environment can cite it.
Preamble
import Mathlib
Formal statement
theorem green_tao_theorem (k : ℕ) (hk : 1 ≤ k) :
∃ a d : ℕ, 1 ≤ d ∧ ∀ j : Fin k, Nat.Prime (a + j.val * d) := by
sorrySource
B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Annals of Mathematics 167 (2008), 481-547, Theorem 1.1, arXiv:math/0404188, https://arxiv.org/abs/math/0404188