Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.1, third display, p. 17 — by (72), γ_k(v_{k+1} − v_k, v_{k+1} − x*) = μα_k(…) − α_k⟨∇f(x_{k+1}), v_{k+1} − x*⟩

Proved
NAGFlow.Implicit.scheme_identity

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

convex-optimizationimplicit-schemelyapunov-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let VVV be a real Hilbert space, ∇f:V→V\nabla f:V\to V∇f:V→V any map, x∗∈Vx^*\in Vx∗∈V, μ∈R\mu\in\mathbb Rμ∈R, (xk),(vk)(x_k),(v_k)(xk​),(vk​) sequences in VVV and (αk),(γk)(\alpha_k),(\gamma_k)(αk​),(γk​) real sequences. Fix kkk with αk>0\alpha_k>0αk​>0 and γk>0\gamma_k>0γk​>0, and suppose the second line of the implicit scheme (72) holds at step kkk:

vk+1−vkαk=μγk(xk+1−vk+1)−1γk∇f(xk+1).\frac{v_{k+1}-v_k}{\alpha_k}=\frac{\mu}{\gamma_k}(x_{k+1}-v_{k+1})-\frac1{\gamma_k}\nabla f(x_{k+1}).αk​vk+1​−vk​​=γk​μ​(xk+1​−vk+1​)−γk​1​∇f(xk+1​).

Then

γk(vk+1−vk,vk+1−x∗)=μαk(xk+1−vk+1,vk+1−x∗)−αk⟨∇f(xk+1),vk+1−x∗⟩.\gamma_k\left(v_{k+1}-v_k,v_{k+1}-x^*\right)=\mu\alpha_k\left(x_{k+1}-v_{k+1},v_{k+1}-x^*\right)-\alpha_k\langle\nabla f(x_{k+1}),v_{k+1}-x^*\rangle .γk​(vk+1​−vk​,vk+1​−x∗)=μαk​(xk+1​−vk+1​,vk+1​−x∗)−αk​⟨∇f(xk+1​),vk+1​−x∗⟩.

The identity substitutes the scheme into the cross term of the Lyapunov difference.

Formalization Note. The hypothesis γk>0\gamma_k>0γk​>0 is not written in the display; the page's (72) divides by γk\gamma_kγk​, and along a run of (72)–(73) it follows from γ0>0\gamma_0>0γ0​>0, μ≥0\mu\ge0μ≥0, αk>0\alpha_k>0αk​>0 (Remark 4.1 records 0<γk0<\gamma_k0<γk​). Without it Lean's convention 1/0=01/0=01/0=0 would change the meaning of (72). Inner product and duality pairing are both the real inner product (Riesz).

Preamble
import Mathlib
import Definitions.Def_NAGFlow_Implicit_Setting
Formal statement
namespace NAGFlow.Implicit

open scoped RealInnerProductSpace

/-- Proof of Theorem 4.1, third display, p. 17: if `α_k > 0`, `γ_k > 0` and the second line of
(72) holds at step `k`, then
`γ_k ⟪v_{k+1} - v_k, v_{k+1} - x*⟫
  = μ α_k ⟪x_{k+1} - v_{k+1}, v_{k+1} - x*⟫ - α_k ⟪∇f(x_{k+1}), v_{k+1} - x*⟫`. -/
theorem scheme_identity {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V]
    [CompleteSpace V] (gradf : V → V) (xstar : V) (μ : ℝ) (α γ : ℕ → ℝ) (x v : ℕ → V)
    (k : ℕ) (hα : 0 < α k) (hγ : 0 < γ k)
    (hv : (1 / α k) • (v (k + 1) - v k)
      = (μ / γ k) • (x (k + 1) - v (k + 1)) - (1 / γ k) • gradf (x (k + 1))) :
    γ k * ⟪v (k + 1) - v k, v (k + 1) - xstar⟫
      = μ * α k * ⟪x (k + 1) - v (k + 1), v (k + 1) - xstar⟫
        - α k * ⟪gradf (x (k + 1)), v (k + 1) - xstar⟫ := by sorry

end NAGFlow.Implicit
Source
Luo & Chen, arXiv:1909.03145v4, proof of Theorem 4.1, third display ('By (72), it follows that'), p. 17; scheme (72), p. 16
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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