Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.15), proof of Proposition 2.2, p. 235 — ⟨γ_tF(w_t), w_t − u⟩ ≤ H_u(z_{t−1}) − H_u(z_t) + ε_t

Proved
ProxMethodVI.Rate.eq2_15_one_step

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

mirror-proxp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prox-methodvariational-inequality

Let ZZZ be a nonempty convex compact subset of a finite-dimensional normed space EEE, let ω\omegaω be continuously differentiable on ZZZ and α\alphaα-strongly convex in the sense of (2.2), and let HuH_uHu​ be as in (2.3). Consider a run (zt)(z_t)(zt​), (wt)(w_t)(wt​) of the relaxed conceptual prox-method with stepsizes γt>0\gamma_t>0γt​>0 and tolerances ϵt\epsilon_tϵt​: z0∈Zz_0\in Zz0​∈Z, wt∈Zw_t\in Zwt​∈Z, zt=Pzt−1(γtF(wt))z_t=P_{z_{t-1}}(\gamma_tF(w_t))zt​=Pzt−1​​(γt​F(wt​)), and condition (2.11) holds at every step t≥1t\ge1t≥1. Then for every step t≥1t\ge1t≥1 and every u∈Zu\in Zu∈Z,

⟨γtF(wt),wt−u⟩≤Hu(zt−1)−Hu(zt)+ϵt.\langle\gamma_tF(w_t),w_t-u\rangle\le H_u(z_{t-1})-H_u(z_t)+\epsilon_t.⟨γt​F(wt​),wt​−u⟩≤Hu​(zt−1​)−Hu​(zt​)+ϵt​.

This one-step estimate telescopes over t=1,…,Nt=1,\dots,Nt=1,…,N to give (2.16) and then the ergodic bound (2.13).

Formalization Note. No property of FFF is used, so FFF is an arbitrary map (the section's standing assumption (2.1) is dropped here, which is a generalization). In Lean the step t≥1t\ge1t≥1 of the paper is the index t + 1, t : ℕ. The termination test (2.8) is not part of the run.

Preamble
import Mathlib
import Definitions.Def_ProxMethodVI_Rate_Setting
Formal statement
namespace ProxMethodVI.Rate

theorem eq2_15_one_step {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    (Z : Set E) (hZc : Convex ℝ Z) (hZk : IsCompact Z) (hZne : Z.Nonempty)
    (ω : E → ℝ) (ω' : E → E →L[ℝ] ℝ) (α : ℝ) (hω : IsStrongDGF Z ω ω' α)
    (F : E → E →L[ℝ] ℝ) (γ ε : ℕ → ℝ) (z w : ℕ → E)
    (hrun : IsRelaxedRun Z F ω ω' γ ε z w) (t : ℕ) (u : E) (hu : u ∈ Z) :
    γ (t + 1) * F (w (t + 1)) (w (t + 1) - u)
      ≤ Hfun Z ω ω' u (z t) - Hfun Z ω ω' u (z (t + 1)) + ε (t + 1) := by sorry

end ProxMethodVI.Rate
Source
Nemirovski, Prox-Method with Rate of Convergence O(1/t), SIAM J. Optim. 15(1) (2004), p. 235, proof of Proposition 2.2, (2.15)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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