Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Three weighted moments control all dominated errors uniformly

Proved
GreenTao.weighted_error_from_moments

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

additive-combinatoricsgowers-uniformitygreen-tao

For each nnn, let AnA_nAn​ be a finite set and let Vn,Wn:An→RV_n,W_n:A_n\to\mathbb RVn​,Wn​:An​→R, with Vn≥0V_n\ge0Vn​≥0. Suppose

EVn⟶1,E(WnVn)⟶1,E(Wn2Vn)⟶1.\mathbb E V_n\longrightarrow1,\qquad\mathbb E(W_nV_n)\longrightarrow1,\qquad\mathbb E(W_n^2V_n)\longrightarrow1.EVn​⟶1,E(Wn​Vn​)⟶1,E(Wn2​Vn​)⟶1.

Then for every η>0\eta>0η>0, all sufficiently large nnn satisfy, uniformly over real test functions HHH on AnA_nAn​,

∣H∣≤Vn⟹∣E((Wn−1)H)∣≤η.|H|\le V_n\quad\Longrightarrow\quad\left|\mathbb E((W_n-1)H)\right|\le\eta.∣H∣≤Vn​⟹∣E((Wn​−1)H)∣≤η.

The finite sets may vary with nnn. No sign restriction is imposed on WnW_nWn​ or HHH. This is the uniform dominated-error consequence of the three moments used to show that a pseudorandom measure covers its cubes uniformly.

Preamble
import Definitions.Def_GreenTao_Pseudorandom
import Mathlib
open scoped BigOperators Topology
open Filter GreenTao
Formal statement
theorem GreenTao.weighted_error_from_moments (A : ℕ → Type) [∀ n, Fintype (A n)]
    (V W : ∀ n, A n → ℝ) (hV : ∀ n x, 0 ≤ V n x)
    (h₀ : Tendsto (fun n => avg (V n)) atTop (𝓝 1))
    (h₁ : Tendsto (fun n => avg (fun x => W n x * V n x)) atTop (𝓝 1))
    (h₂ : Tendsto (fun n => avg (fun x => W n x ^ 2 * V n x)) atTop (𝓝 1)) :
    ∀ η : ℝ, 0 < η → ∀ᶠ n in atTop,
      ∀ H : A n → ℝ, (∀ x, |H x| ≤ V n x) →
        |avg (fun x => (W n x - 1) * H x)| ≤ η := by sorry
Source
Green and Tao, The primes contain arbitrarily long arithmetic progressions, https://arxiv.org/html/math/0404188v6, §5, the Cauchy–Schwarz reduction immediately before Lemma 5.5 and the expansion into q=0,1,2 moments in its proof. This auxiliary general finite-space formulation isolates that analytic implication.

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