Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Relative Szemerédi: positive weighted progression density

Open
GreenTao.relative_szemeredi

by davidnet · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsgreen-taonumber-theory

Fix an integer k≥3k\ge3k≥3. Let MnM_nMn​ be prime moduli tending to infinity and let νn\nu_nνn​ be a kkk-pseudorandom family on Z/MnZ\mathbb Z/M_n\mathbb ZZ/Mn​Z in the sense of Green–Tao Definitions 3.1–3.3. Let fnf_nfn​ be real functions satisfying 0≤fn≤νn0\le f_n\le\nu_n0≤fn​≤νn​ pointwise. Suppose that for some fixed 0<δ≤10<\delta\le10<δ≤1, their means are eventually at least δ\deltaδ. Then

∃c>0∀n sufficiently large,Ex,r∈Z/MnZ∏j=0k−1fn(x+jr)≥c.\exists c>0\quad\forall n\text{ sufficiently large},\qquad \mathbb E_{x,r\in\mathbb Z/M_n\mathbb Z}\prod_{j=0}^{k-1}f_n(x+jr)\ge c.∃c>0∀n sufficiently large,Ex,r∈Z/Mn​Z​j=0∏k−1​fn​(x+jr)≥c.

This is the positive lower bound consequence of Theorem 3.5. The average includes progressions of zero common difference. The statement applies to any dominated family and does not assume primality of points in its support. It supplies the combinatorial ingredient of the Green–Tao reduction.

Preamble
import Definitions.Def_GreenTao_Pseudorandom

open Filter
open scoped Topology
Formal statement
theorem GreenTao.relative_szemeredi
    (k : ℕ) (hk : 3 ≤ k) (M : ℕ → ℕ+)
    (hprime : ∀ n, Nat.Prime (M n : ℕ))
    (hM : Tendsto (fun n => (M n : ℕ)) atTop atTop)
    (ν f : GreenTao.Family M) (hν : GreenTao.Pseudorandom k M ν)
    (hf : ∀ n x, 0 ≤ f n x ∧ f n x ≤ ν n x)
    (δ : ℝ) (hδ : 0 < δ) (hδ₁ : δ ≤ 1)
    (hdensity : ∀ᶠ n in atTop, δ ≤ GreenTao.avg (f n)) :
    ∃ c : ℝ, 0 < c ∧ ∀ᶠ n in atTop, c ≤ GreenTao.apAvg k (f n) := by sorry
Source
Green and Tao, The primes contain arbitrarily long arithmetic progressions, https://arxiv.org/html/math/0404188v6, §3, Theorem 3.5, equations (3.7)–(3.9). Sequential consequence: absorb the vanishing error into half the positive constant; eventual hypotheses are handled by discarding a finite initial segment.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me