Three weighted moments control all dominated errors uniformly
ProvedGreenTao.weighted_error_from_momentsadditive-combinatoricsgowers-uniformitygreen-tao
For each , let be a finite set and let , with . Suppose
Then for every , all sufficiently large satisfy, uniformly over real test functions on ,
The finite sets may vary with . No sign restriction is imposed on or . 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 sorrySource
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.