Iteration of squared Cauchy–Schwarz bounds
ProvedGreenTao.iterated_cauchy_schwarzadditive-combinatoricsgowers-uniformitygreen-tao
Let and let be real sequences. Suppose
Then
This is the algebraic accumulation of the Cauchy–Schwarz inequalities in Green–Tao equation (5.21). The recurrence itself is the full hypothesis; no separate sign assumption on the sequences is needed.
Preamble
import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Data.Real.Basic open scoped BigOperators
Formal statement
theorem GreenTao.iterated_cauchy_schwarz (d : ℕ) (hd : 1 ≤ d) (J P : ℕ → ℝ)
(hstep : ∀ l < d, |J l| ^ 2 ≤ P l * J (l + 1)) :
|J 0| ^ (2 ^ d) ≤ J d * ∏ l ∈ Finset.range d, P l ^ (2 ^ (d - 1 - l)) := by sorrySource
Green and Tao, The primes contain arbitrarily long arithmetic progressions, https://arxiv.org/html/math/0404188v6, §5 equations (5.19) and (5.21), iteration of Lemma 5.4.