Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix B, p. 40 — on the cycle's pieces, (ε_{k+2}, ε_{k+1}) = P (ε_{k+1}, ε_k)

Proved
IQCAlg.HeavyBall.perturbation_recursion

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

heavy-balllimit-cyclelinearizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (xk)k≥0(x_k)_{k\ge0}(xk​)k≥0​ be a real sequence satisfying (B.1) for every kkk, let xk⋆x^\star_kxk⋆​ be the 3-cycle p,q,r,p,…p,q,r,p,\dotsp,q,r,p,… of (B.3), and let εk=xk−xk⋆\varepsilon_k=x_k-x^\star_kεk​=xk​−xk⋆​. Fix kkk and assume that xk+1x_{k+1}xk+1​ lies on the same linear piece of (4.11) as xk+1⋆x^\star_{k+1}xk+1⋆​: if xk+1⋆<1x^\star_{k+1}<1xk+1⋆​<1 then xk+1<1x_{k+1}<1xk+1​<1, and if xk+1⋆>2x^\star_{k+1}>2xk+1⋆​>2 then xk+1>2x_{k+1}>2xk+1​>2. Then

[εk+2εk+1]=P[εk+1εk],P=[−4/3−4/910].\begin{bmatrix}\varepsilon_{k+2}\\ \varepsilon_{k+1}\end{bmatrix}=P\begin{bmatrix}\varepsilon_{k+1}\\ \varepsilon_{k}\end{bmatrix},\qquad P=\begin{bmatrix}-4/3&-4/9\\1&0\end{bmatrix}.[εk+2​εk+1​​]=P[εk+1​εk​​],P=[−4/31​−4/90​].

Near the cycle the nonlinear recursion is therefore a linear time-invariant recursion for the perturbation, which is what the remaining steps of the argument analyse.

Formalization Note The same-piece condition is stated, as on the page, by membership of the iterate in the piece of its limit point; it is needed only at index k+1k+1k+1, the argument of ∇f\nabla f∇f in (B.1).

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

/-- Perturbation recursion, p. 40: if `x` satisfies (B.1) and the iterate `x_{k+1}` lies on
the same piece of (4.11) as `x⋆_{k+1}`, then `(ε_{k+2}, ε_{k+1}) = P (ε_{k+1}, ε_k)`, i.e.
`ε_{k+2} = −(4/3) ε_{k+1} − (4/9) ε_k`. -/
theorem perturbation_recursion (x : ℕ → ℝ) (hx : IsB1Traj x) (k : ℕ)
    (hpiece : (cyc (k + 1) < 1 → x (k + 1) < 1) ∧ (2 < cyc (k + 1) → 2 < x (k + 1))) :
    ![eps x (k + 2), eps x (k + 1)] = Pm.mulVec ![eps x (k + 1), eps x k] := by sorry

end IQCAlg.HeavyBall
Source
Lessard, Recht & Packard, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, arXiv:1408.3595v7, p. 40, perturbation recursion (the display defining P)
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