Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1 (2.5), p. 232 — H_u(P_z(ξ)) − H_u(z) ≤ ⟨ξ, u − P_z(ξ)⟩ + [ω(z) + ⟨ω′(z), P_z(ξ) − z⟩ − ω(P_z(ξ))], and the bracket is ≤ 0

Proved
ProxMethodVI.Rate.lemma2_1_prox_ineq

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 EEE, and let ω\omegaω be continuously differentiable on ZZZ and α\alphaα-strongly convex in the sense of (2.2). Let Ω\OmegaΩ be the Legendre transform of ω∣Z\omega|_Zω∣Z​, let Hu(z)=Ω(ω′(z))−⟨ω′(z),u⟩H_u(z)=\Omega(\omega'(z))-\langle\omega'(z),u\rangleHu​(z)=Ω(ω′(z))−⟨ω′(z),u⟩, and let Pz(ξ)P_z(\xi)Pz​(ξ) be the prox-mapping. Let z∈Zz\in Zz∈Z, let ξ\xiξ be a dual vector, and let v=Pz(ξ)v=P_z(\xi)v=Pz​(ξ). Then for every u∈Zu\in Zu∈Z,

Hu(v)−Hu(z)≤⟨ξ,u−v⟩+[ω(z)+⟨ω′(z),v−z⟩−ω(v)],H_u(v)-H_u(z)\le\langle\xi,u-v\rangle+\big[\omega(z)+\langle\omega'(z),v-z\rangle-\omega(v)\big],Hu​(v)−Hu​(z)≤⟨ξ,u−v⟩+[ω(z)+⟨ω′(z),v−z⟩−ω(v)],

and the bracket satisfies

ω(z)+⟨ω′(z),v−z⟩−ω(v)≤0.\omega(z)+\langle\omega'(z),v-z\rangle-\omega(v)\le0.ω(z)+⟨ω′(z),v−z⟩−ω(v)≤0.

This is the basic one-step inequality of the prox-method. HuH_uHu​ plays the role of a potential, and summing (2.5) along a run gives the ergodic error bound of Proposition 2.2.

Formalization Note. "v=Pz(ξ)v=P_z(\xi)v=Pz​(ξ)" is the relation that v∈Zv\in Zv∈Z minimizes ω(y)+⟨ξ−ω′(z),y⟩\omega(y)+\langle\xi-\omega'(z),y\rangleω(y)+⟨ξ−ω′(z),y⟩ over ZZZ. Dual vectors are continuous linear functionals and ⟨ξ,x⟩\langle\xi,x\rangle⟨ξ,x⟩ is ξ(x)\xi(x)ξ(x); this is equivalent to the paper's inner-product setting.

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

theorem lemma2_1_prox_ineq {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 ω ω' α)
    (z : E) (hz : z ∈ Z) (ξ : E →L[ℝ] ℝ) (v : E) (hv : IsProxPt Z ω ω' z ξ v)
    (u : E) (hu : u ∈ Z) :
    Hfun Z ω ω' u v - Hfun Z ω ω' u z ≤ ξ (u - v) + (ω z + ω' z (v - z) - ω v) ∧
      ω z + ω' z (v - z) - ω v ≤ 0 := by sorry

end ProxMethodVI.Rate
Source
Nemirovski, Prox-Method with Rate of Convergence O(1/t), SIAM J. Optim. 15(1) (2004), p. 232, Lemma 2.1, (2.5)
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