Endpoint reparameterizations of the progression CS stages
ProvedGreenTao.cs_endpoint_identitiesadditive-combinatoricsgowers-uniformitygreen-tao
Let , let be prime, let be a real majorant on , and let be arbitrary real functions. For each distinguished position , the explicit Cauchy–Schwarz stages satisfy
The first identity reparameterizes ordered progressions by the coordinate forms . The second changes the fully duplicated coordinate vectors into a Gowers cube and the explicit cube weight. Both statistics use uniform averages and include zero common differences. This isolates the finite endpoint changes of variables from the Cauchy–Schwarz inequalities and the asymptotic moment calculations.
Preamble
import Definitions.Def_GreenTao_ProgressionCS
Formal statement
theorem GreenTao.cs_endpoint_identities
(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 : ℕ) → ℝ) :
GreenTao.csStage d j μ F 0 = GreenTao.mixedAPAvg (d + 1) F ∧
GreenTao.csStage d j μ F d =
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 equations (5.22), (5.23), and (5.25), including the uniform-cover argument and the paired expression for the cube weight. The weight is expressed in the project’s progression-difference coordinates.