Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix B, p. 40 — eight consecutive ε² < ε̄² (ε̄ = r − 2) force ε²_k < ε̄² for the whole tail

Proved
IQCAlg.HeavyBall.tail_bound

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

heavy-ballinductionlimit-cyclep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (xk)(x_k)(xk​) satisfy (B.1), let εk=xk−xk⋆\varepsilon_k=x_k-x^\star_kεk​=xk​−xk⋆​, and let εˉ=r−2=142/1225\bar\varepsilon=r-2=142/1225εˉ=r−2=142/1225, the distance from the cycle (B.3) to the nearest transition point 111 or 222 of (4.11). If for some iii

εi+j2<εˉ2(j=0,1,…,7),\varepsilon_{i+j}^2<\bar\varepsilon^2\qquad (j=0,1,\dots,7),εi+j2​<εˉ2(j=0,1,…,7),

then εk2<εˉ2\varepsilon_k^2<\bar\varepsilon^2εk2​<εˉ2 for every k≥ik\ge ik≥i.

Once eight consecutive iterates are within εˉ\bar\varepsilonεˉ of the cycle, all later iterates stay on the cycle's pieces, so the linear perturbation recursion applies forever after.

Formalization Note The page first says "some εˉ\bar\varepsilonεˉ" and then fixes εˉ=r−2\bar\varepsilon=r-2εˉ=r−2; the statement uses that value.

Preamble
import Mathlib
import Definitions.Def_IQCAlg_HeavyBall_Setting
Formal statement
namespace IQCAlg.HeavyBall

/-- Tail argument, p. 40: if `x` satisfies (B.1) and eight consecutive perturbations
`ε_i, …, ε_{i+7}` have `ε² < ε̄²` with `ε̄ = r − 2`, then `ε_k² < ε̄²` for every `k ≥ i`. -/
theorem tail_bound (x : ℕ → ℝ) (hx : IsB1Traj x) (i : ℕ)
    (h8 : ∀ j : ℕ, j < 8 → eps x (i + j) ^ 2 < epsBar ^ 2) :
    ∀ k : ℕ, i ≤ k → eps x k ^ 2 < epsBar ^ 2 := by sorry

end IQCAlg.HeavyBall
Source
Lessard, Recht & Packard, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, arXiv:1408.3595v7, p. 40, the paragraph after (B.4)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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