Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generalized von Neumann estimate with uniform cube thresholds

Proved
GreenTao.generalized_von_neumann

by raresbuhai · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsgowers-uniformitygreen-tao

Let k≥3k\ge3k≥3, let MnM_nMn​ be prime moduli tending to infinity, and let νn\nu_nνn​ be a kkk-pseudorandom family. For every η>0\eta>0η>0 there is ρ>0\rho>0ρ>0 such that, for all sufficiently large nnn, the following holds uniformly over all tuples of real functions F0,…,Fk−1F_0,\ldots,F_{k-1}F0​,…,Fk−1​ on Gn=Z/MnZG_n=\mathbb Z/M_n\mathbb ZGn​=Z/Mn​Z:

(∀j,x, ∣Fj(x)∣≤νn(x)+2) and (∃j, ∣Ck−1(Fj)∣≤ρ)\left(\forall j,x,\ |F_j(x)|\le\nu_n(x)+2\right)\ \text{and}\ \left(\exists j,\ |C_{k-1}(F_j)|\le\rho\right)(∀j,x, ∣Fj​(x)∣≤νn​(x)+2) and (∃j, ∣Ck−1​(Fj​)∣≤ρ)

imply

∣Ex,r∈Gn∏j=0k−1Fj(x+jr)∣≤η.\left|\mathbb E_{x,r\in G_n}\prod_{j=0}^{k-1}F_j(x+jr)\right|\le\eta.​Ex,r∈Gn​​j=0∏k−1​Fj​(x+jr)​≤η.

Here CdC_dCd​ is the real Gowers cube average. One sufficiently uniform factor makes a mixed progression average small. The threshold is chosen before the modulus and the tuple of functions; this uniformity is needed to apply the estimate to functions supplied by a structured decomposition.

Formalization Note. This is the qualitative threshold form of Proposition 5.3 for consecutive coefficients cj=jc_j=jcj​=j. Its additive constant is 222 in place of 111, obtained by the fixed convex-mixture/rescaling allowed by Lemma 3.4. Smallness is stated in terms of the 2k−12^{k-1}2k−1-th power of the Gowers norm.

Preamble
import Definitions.Def_GreenTao_Uniformity
open Filter
Formal statement
theorem GreenTao.generalized_von_neumann
    (k : ℕ) (hk : 3 ≤ k) (M : ℕ → ℕ+)
    (hprime : ∀ n, Nat.Prime (M n : ℕ))
    (hM : Tendsto (fun n => (M n : ℕ)) atTop atTop)
    (ν : GreenTao.Family M) (hν : GreenTao.Pseudorandom k M ν)
    (η : ℝ) (hη : 0 < η) :
    ∃ ρ : ℝ, 0 < ρ ∧ ∀ᶠ n in atTop,
      ∀ F : Fin k → ZMod (M n : ℕ) → ℝ,
        (∀ j x, |F j x| ≤ ν n x + 2) →
        (∃ j, |GreenTao.cubeAvg (k - 1) (F j)| ≤ ρ) →
        |GreenTao.mixedAPAvg k F| ≤ η := by sorry
Source
Green and Tao, The primes contain arbitrarily long arithmetic progressions, https://arxiv.org/html/math/0404188v6, §5 Proposition 5.3 and its proof, together with §3 Lemma 3.4 (including the stated extension to (1−θ)ν+θν_const) for the harmless change from ν+1 to ν+2; §5 equations (5.1), (5.4) for the cube power. The epsilon/rho statement is an equivalent qualitative uniform consequence of its O(inf_j ||F_j||_U)+o(1) estimate.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me