Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(B.4), p. 40 — ε²_{k+8} < (1/2)(ε²_{k+1} + ε²_k) while the iterates stay on the cycle's pieces

Proved
IQCAlg.HeavyBall.eq_B_4

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

contractionheavy-balllimit-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⋆​ be its perturbation from the cycle (B.3), and fix kkk. Assume that each of xk+1,…,xk+7x_{k+1},\dots,x_{k+7}xk+1​,…,xk+7​ lies on the same linear piece of (4.11) as the corresponding x⋆x^\starx⋆ (if xj⋆<1x^\star_j<1xj⋆​<1 then xj<1x_j<1xj​<1; if xj⋆>2x^\star_j>2xj⋆​>2 then xj>2x_j>2xj​>2), and that (εk+1,εk)≠(0,0)(\varepsilon_{k+1},\varepsilon_k)\neq(0,0)(εk+1​,εk​)=(0,0). Then

εk+82<12(εk+12+εk2).\varepsilon_{k+8}^2<\tfrac12\bigl(\varepsilon_{k+1}^2+\varepsilon_k^2\bigr).εk+82​<21​(εk+12​+εk2​).

This is the eight-step contraction of the perturbation that drives the tail argument.

Formalization Note Two departures from the printed (B.4), both disclosed. (i) The page's strict inequality fails when εk=εk+1=0\varepsilon_k=\varepsilon_{k+1}=0εk​=εk+1​=0 (it would read 0<00<00<0), so (εk+1,εk)≠0(\varepsilon_{k+1},\varepsilon_k)\neq0(εk+1​,εk​)=0 is assumed. (ii) The page's middle terms involve εk+9\varepsilon_{k+9}εk+9​, which would need the same-piece condition at k+8k+8k+8 as well; the statement keeps only the outer inequality, which needs the condition at k+1,…,k+7k+1,\dots,k+7k+1,…,k+7 (since εk+8\varepsilon_{k+8}εk+8​ is the second entry of P8(εk+1,εk)P^8(\varepsilon_{k+1},\varepsilon_k)P8(εk+1​,εk​)).

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

/-- (B.4), p. 40: if `x` satisfies (B.1), the iterates `x_{k+1}, …, x_{k+7}` lie on the same
pieces of (4.11) as the cycle, and `(ε_{k+1}, ε_k) ≠ 0`, then
`ε²_{k+8} < (1/2)(ε²_{k+1} + ε²_k)`. -/
theorem eq_B_4 (x : ℕ → ℝ) (hx : IsB1Traj x) (k : ℕ)
    (hpiece : ∀ j : ℕ, 1 ≤ j → j ≤ 7 →
      (cyc (k + j) < 1 → x (k + j) < 1) ∧ (2 < cyc (k + j) → 2 < x (k + j)))
    (hne : eps x k ≠ 0 ∨ eps x (k + 1) ≠ 0) :
    eps x (k + 8) ^ 2 < 1 / 2 * (eps x (k + 1) ^ 2 + eps x k ^ 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, (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