Finite progression-to-weighted-cube Cauchy–Schwarz bound
ProvedGreenTao.progression_cs_cube_boundadditive-combinatoricsgowers-uniformitygreen-tao
Let , let be prime, and let . Let be real functions dominated in absolute value by , and distinguish a position . With the progression Cauchy–Schwarz factor and cube weight defined from the translated consecutive coefficients,
Here is the product of the stage factors from equation (5.18), and is the explicit progression-difference version of the weight in equation (5.25). This is the finite Cauchy–Schwarz part of the generalized von Neumann argument; it does not assume pseudorandomness or any asymptotic moment estimate.
Preamble
import Definitions.Def_GreenTao_ProgressionCS open scoped BigOperators
Formal statement
theorem GreenTao.progression_cs_cube_bound
(d : ℕ) (hd : 2 ≤ d) (m : ℕ+) (hm : Nat.Prime (m : ℕ)) (hdm : d < (m : ℕ))
(μ : ZMod (m : ℕ) → ℝ) (hμ : ∀ x, 0 ≤ μ x)
(j : Fin (d + 1)) (F : Fin (d + 1) → ZMod (m : ℕ) → ℝ)
(hF : ∀ i x, |F i x| ≤ μ x) :
|GreenTao.mixedAPAvg (d + 1) F| ^ (2 ^ d) ≤
GreenTao.csFactor d j μ *
GreenTao.weightedCubeAvg d (GreenTao.csWeight d j μ) (F j) := by sorrySource
Green and Tao, The primes contain arbitrarily long arithmetic progressions, https://arxiv.org/html/math/0404188v6, §5 Lemma 5.4, equations (5.19)–(5.25), including the uniform-cover reparameterization and the paired expression for W. The project’s csWeight averages directly over the progression difference, replacing redundant fiber coordinates.