Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.10, p. 67 — existence and uniqueness of the OMD update

Proved
ModernOnlineLearning.OMD.lemma_6_10_exists

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

convex-optimizationonline-mirror-descentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1strong-convexity

Let V⊆XV\subseteq XV⊆X be nonempty, closed, and convex, and assume condition (6.5) or condition (6.6), V⊆int⁡XV\subseteq\operatorname{int}XV⊆intX. Let ψ\psiψ be proper, closed, differentiable on int⁡X\operatorname{int}XintX, and λ\lambdaλ-strongly convex on VVV, where λ>0\lambda>0λ>0. For any x∈V∩int⁡Xx\in V\cap\operatorname{int}Xx∈V∩intX, positive step size η\etaη, and dual vector ggg, there is exactly one y∈Vy\in Vy∈V minimizing

z⟼⟨g,z⟩+1ηBψ(z;x)(z∈V),z\longmapsto\langle g,z\rangle+\frac{1}{\eta}B_\psi(z;x)\quad(z\in V),z⟼⟨g,z⟩+η1​Bψ​(z;x)(z∈V),

and that point lies in int⁡X\operatorname{int}XintX. Thus the next OMD iterate exists and is well defined.

Formalization Note The setting also records strict convexity of ψ\psiψ on XXX from Definition 6.4. Properness follows from V≠∅V\ne\varnothingV=∅ and V⊆XV\subseteq XV⊆X; closedness is stated through the epigraph. Condition (6.5) is encoded as lim⁡r→0+⟨∇ψ((1−r)x+ry),y−x⟩=−∞\lim_{r\to0^+}\langle\nabla\psi((1-r)x+ry),y-x\rangle=-\inftylimr→0+​⟨∇ψ((1−r)x+ry),y−x⟩=−∞ for every x∈bdry⁡Xx\in\operatorname{bdry}Xx∈bdryX and y∈int⁡Xy\in\operatorname{int}Xy∈intX; the setting assumes (6.5) or (6.6), as the book does.

Preamble
import Mathlib
import Definitions.Def_ModernOnlineLearning_OMD_Defs
Formal statement
namespace ModernOnlineLearning.OMD

/-- The existence, uniqueness, and interior-point clause of Lemma 6.10, p. 67,
under "(6.5) or (6.6)": the argmin of the update exists, is unique, and lies in
`int X`. -/
theorem lemma_6_10_exists {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [FiniteDimensional ℝ E] (X V : Set E) (ψ : E → ℝ) (lam : ℝ)
    (hsetting : IsOMDSetting X V ψ lam)
    (x : E) (hx : x ∈ V ∩ interior X)
    (η : ℝ) (hη : 0 < η) (g : E →L[ℝ] ℝ) :
    (∃! y : E, IsOMDStep V ψ η g x y) ∧
      ∀ y : E, IsOMDStep V ψ η g x y → y ∈ interior X := by sorry

end ModernOnlineLearning.OMD
Source
Orabona, arXiv:1912.13213v10, Lemma 6.10, existence and uniqueness clause, p. 67
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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