Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 12 — under (8), v_{k+1} − v_k = h(β_{k+1} + k(β_{k+1} − β_k) − b_khk)∇f(x_{k+1})

Proved
HessianDamping.IPAHD.vK_succ_sub

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

hessian-dampinginertial-algorithmlyapunovp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let H\mathcal HH be a real Hilbert space, f:H→Rf:\mathcal H\to\mathbb Rf:H→R, x⋆∈Hx^\star\in\mathcal Hx⋆∈H, α,h∈R\alpha,h\in\mathbb Rα,h∈R, real sequences (βk)(\beta_k)(βk​), (bk)(b_k)(bk​) and a sequence (xk)(x_k)(xk​) in H\mathcal HH. Put

vk:=(α−1)(xk−x⋆)+k(xk−xk−1+βkh∇f(xk)).v_k:=(\alpha-1)(x_k-x^\star)+k\big(x_k-x_{k-1}+\beta_kh\nabla f(x_k)\big).vk​:=(α−1)(xk​−x⋆)+k(xk​−xk−1​+βk​h∇f(xk​)).

If k≥1k\ge1k≥1 and the discretization (8) holds at kkk,

k(xk+1−2xk+xk−1)+α(xk+1−xk)+βkhk(∇f(xk+1)−∇f(xk))+bkh2k ∇f(xk+1)=0,k(x_{k+1}-2x_k+x_{k-1})+\alpha(x_{k+1}-x_k)+\beta_khk\big(\nabla f(x_{k+1})-\nabla f(x_k)\big)+b_kh^2k\,\nabla f(x_{k+1})=0,k(xk+1​−2xk​+xk−1​)+α(xk+1​−xk​)+βk​hk(∇f(xk+1​)−∇f(xk​))+bk​h2k∇f(xk+1​)=0,

then

vk+1−vk=h(βk+1+k(βk+1−βk)−bkhk)∇f(xk+1).v_{k+1}-v_k=h\big(\beta_{k+1}+k(\beta_{k+1}-\beta_k)-b_khk\big)\nabla f(x_{k+1}).vk+1​−vk​=h(βk+1​+k(βk+1​−βk​)−bk​hk)∇f(xk+1​).

This identity drives the energy estimate of Theorem 4: the increment of vkv_kvk​ is a multiple hCkhC_khCk​ of the gradient at the new iterate.

Formalization Note. The statement is purely algebraic and assumes nothing on fff beyond the existence of the vectors ∇f(xk)\nabla f(x_k)∇f(xk​) (Mathlib's gradient f).

Preamble
import Mathlib
import Definitions.Def_GoldenRatioVI_Shared_IsProxPoint
import Definitions.Def_HessianDamping_IPAHD_Setting
Formal statement
namespace HessianDamping.IPAHD

/-- Proof of Theorem 4, p. 12: if (8) holds at step `k ≥ 1`, then
`v_{k+1} - v_k = h (β_{k+1} + k (β_{k+1} - β_k) - b_k h k) ∇f(x_{k+1})`. -/
theorem vK_succ_sub
    {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (f : H → ℝ) (xstar : H) (α h : ℝ) (β b : ℕ → ℝ) (x : ℕ → H)
    (k : ℕ) (hk : 1 ≤ k)
    (h8 : (k : ℝ) • (x (k + 1) - (2 : ℝ) • x k + x (k - 1)) + α • (x (k + 1) - x k)
      + (β k * h * k) • (gradient f (x (k + 1)) - gradient f (x k))
      + (b k * h ^ 2 * k) • gradient f (x (k + 1)) = 0) :
    vK f α h β x xstar (k + 1) - vK f α h β x xstar k
      = (h * (β (k + 1) + k * (β (k + 1) - β k) - b k * h * k)) • gradient f (x (k + 1)) := by sorry

end HessianDamping.IPAHD
Source
Attouch, Chbani, Fadili, Riahi, First-order optimization algorithms via inertial systems with Hessian driven damping, arXiv:1907.10536v2, §3.1.1, proof of Theorem 4, p. 12
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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