Linear-forms condition is preserved by convex mixing with one
ProvedGreenTao.linear_forms_convex_mixtureadditive-combinatoricsgowers-uniformitygreen-tao
Let satisfy the linear-forms condition on the cyclic groups . For any fixed , define
Then satisfies the same linear-forms condition, including uniformity over all sequences of translation terms. This is the linear-forms part of the smoothing lemma used at the start of the generalized von Neumann argument. It does not assert the separate correlation condition.
Preamble
import Definitions.Def_GreenTao_Pseudorandom import Mathlib open scoped BigOperators Topology open Filter GreenTao
Formal statement
theorem GreenTao.linear_forms_convex_mixture (M : ℕ → ℕ+) (ν : GreenTao.Family M) (m₀ t₀ L₀ : ℕ)
(hν : GreenTao.LinearFormsCondition M ν m₀ t₀ L₀)
(θ : ℝ) (hθ₀ : 0 ≤ θ) (hθ₁ : θ ≤ 1) :
GreenTao.LinearFormsCondition M (fun n x => (1 - θ) * ν n x + θ) m₀ t₀ L₀ := by sorrySource
Green and Tao, The primes contain arbitrarily long arithmetic progressions, https://arxiv.org/html/math/0404188v6, §3 Lemma 3.4 and its proof, including the stated extension to (1−θ)ν+θν_const. This theorem isolates the linear-forms assertion; it is not the full pseudorandomness assertion.