Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 (3.7.d), p. 238 — ε ≤ α⁻¹γ²‖ξ − η‖²_* − (α/2)[‖w − z‖² + ‖w − z₊‖²]

Proved
ProxMethodVI.Rate.lemma3_1_d

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

bregmanmirror-proxp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prox-method

Let ZZZ be a nonempty convex compact subset of a finite-dimensional normed space (E,∥⋅∥)(E,\|\cdot\|)(E,∥⋅∥), and let ω\omegaω be continuously differentiable on ZZZ and α\alphaα-strongly convex in the sense of (2.2). Let a nonempty set U⊆ZU\subseteq ZU⊆Z be convex and closed, let z∈Zz\in Zz∈Z, let ξ,η\xi,\etaξ,η be dual vectors, let γ>0\gamma>0γ>0, and let w,z+w,z_+w,z+​ be the points (3.6) (minimizers over UUU). Then

⟨γ(η−ξ),w−z+⟩+[ω(z)+⟨ω′(z),w−z⟩+⟨ω′(w),z+−w⟩−ω(z+)]⏟ϵ≤α−1γ2∥ξ−η∥∗2−α2[∥w−z∥2+∥w−z+∥2].\underbrace{\langle\gamma(\eta-\xi),w-z_+\rangle+\big[\omega(z)+\langle\omega'(z),w-z\rangle+\langle\omega'(w),z_+-w\rangle-\omega(z_+)\big]}_{\epsilon}\le\alpha^{-1}\gamma^2\|\xi-\eta\|_*^2-\frac{\alpha}{2}\big[\|w-z\|^2+\|w-z_+\|^2\big].ϵ⟨γ(η−ξ),w−z+​⟩+[ω(z)+⟨ω′(z),w−z⟩+⟨ω′(w),z+​−w⟩−ω(z+​)]​​≤α−1γ2∥ξ−η∥∗2​−2α​[∥w−z∥2+∥w−z+​∥2].

This is part (d) of Lemma 3.1. Together with (3.7.c) it bounds the left-hand side of the test (3.4) at the second inner iteration, and it carries the constant that makes the stepsize γ=α/(2L)\gamma=\alpha/(\sqrt2L)γ=α/(2​L) work in Theorem 3.2.

Formalization Note. ϵ\epsilonϵ is written out in full. ∥ξ−η∥∗\|\xi-\eta\|_*∥ξ−η∥∗​ is the operator norm. Strong convexity is assumed only in the monotonicity form (2.2); its function-value form is not a hypothesis.

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

theorem lemma3_1_d {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 ω ω' α)
    (U : Set E) (hUZ : U ⊆ Z) (hUne : U.Nonempty) (hUc : Convex ℝ U) (hUcl : IsClosed U)
    (z : E) (hz : z ∈ Z) (ξ η : E →L[ℝ] ℝ) (γ : ℝ) (hγ : 0 < γ)
    (w : E) (hw : IsProxPt U ω ω' z (γ • ξ) w)
    (zp : E) (hzp : IsProxPt U ω ω' z (γ • η) zp) :
    γ * (η - ξ) (w - zp) + (ω z + ω' z (w - z) + ω' w (zp - w) - ω zp)
      ≤ α⁻¹ * γ ^ 2 * ‖ξ - η‖ ^ 2 - α / 2 * (‖w - z‖ ^ 2 + ‖w - zp‖ ^ 2) := by sorry

end ProxMethodVI.Rate
Source
Nemirovski, Prox-Method with Rate of Convergence O(1/t), SIAM J. Optim. 15(1) (2004), pp. 237–238, Lemma 3.1, (3.6), (3.7.d)
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