Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.2, p. 239 — with γ = α/(√2L), the second inner iterate w_{t,2} always passes (3.4)

Proved
ProxMethodVI.Rate.theorem3_2_second_inner_step

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

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

Let ZZZ be a nonempty convex compact subset of a finite-dimensional normed space EEE, let FFF satisfy (2.1) with a constant L>0L>0L>0 (Lipschitz from ∥⋅∥\|\cdot\|∥⋅∥ to ∥⋅∥∗\|\cdot\|_*∥⋅∥∗​ and monotone on ZZZ), and let ω\omegaω be continuously differentiable on ZZZ and α\alphaα-strongly convex in the sense of (2.2). Let γ=α/(2L)\gamma=\alpha/(\sqrt2L)γ=α/(2​L) as in (3.2). Let z∈Zz\in Zz∈Z, let w1=Pz(γF(z))w_1=P_z(\gamma F(z))w1​=Pz​(γF(z)) and w2=Pz(γF(w1))w_2=P_z(\gamma F(w_1))w2​=Pz​(γF(w1​)). Then

⟨γF(w1),w1−w2⟩+ω(z)+⟨ω′(z),w2−z⟩−ω(w2)≤0,\langle\gamma F(w_1),w_1-w_2\rangle+\omega(z)+\langle\omega'(z),w_2-z\rangle-\omega(w_2)\le0,⟨γF(w1​),w1​−w2​⟩+ω(z)+⟨ω′(z),w2​−z⟩−ω(w2​)≤0,

that is, the test (3.4) is met at the second inner iteration s=2s=2s=2.

This is the display of the proof of Theorem 3.2. It is what makes every step of the basic implementation cost at most two evaluations of FFF and two prox problems.

Formalization Note. The statement is unconditional: it does not assume that (3.4) fails at s=1s=1s=1, because the proof's display never uses that failure. It is therefore slightly stronger than the sentence "if (3.4) is not met with st=1s_t=1st​=1, it is met with st=2s_t=2st​=2". L>0L>0L>0 is needed for (3.2) to make sense. Prox points are minimizers over ZZZ.

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

theorem theorem3_2_second_inner_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[ℝ] ℝ) (L : ℝ) (hL : 0 < L) (hLip : IsLipschitzOnWRT Z F L)
    (hmono : IsMonotoneOnWRT Z F)
    (z : E) (hz : z ∈ Z) (w₁ : E) (hw₁ : IsProxPt Z ω ω' z ((α / (Real.sqrt 2 * L)) • F z) w₁)
    (zp : E) (hzp : IsProxPt Z ω ω' z ((α / (Real.sqrt 2 * L)) • F w₁) zp) :
    test34 (α / (Real.sqrt 2 * L)) F ω ω' z w₁ zp := by sorry

end ProxMethodVI.Rate
Source
Nemirovski, Prox-Method with Rate of Convergence O(1/t), SIAM J. Optim. 15(1) (2004), p. 239, proof of Theorem 3.2, display; (3.2)–(3.4)
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