Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Iteration of squared Cauchy–Schwarz bounds

Proved
GreenTao.iterated_cauchy_schwarz

by raresbuhai · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsgowers-uniformitygreen-tao

Let d≥1d\ge1d≥1 and let Jl,PlJ_l,P_lJl​,Pl​ be real sequences. Suppose

∣Jl∣2≤PlJl+1(0≤l<d).|J_l|^2\le P_lJ_{l+1}\qquad(0\le l<d).∣Jl​∣2≤Pl​Jl+1​(0≤l<d).

Then

∣J0∣2d≤Jd∏l=0d−1Pl2d−1−l.|J_0|^{2^d}\le J_d\prod_{l=0}^{d-1}P_l^{2^{d-1-l}}.∣J0​∣2d≤Jd​l=0∏d−1​Pl2d−1−l​.

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 sorry
Source
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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me