Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.9, p. 66 — unique minimizer of a closed strongly convex function

Proved
ModernOnlineLearning.OMD.theorem_6_9

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

convex-optimizationminimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1strong-convexity

Let fff be a proper, closed function on a finite-dimensional real normed space, with finite domain DDD. Suppose fff is λ\lambdaλ-strongly convex on DDD for λ>0\lambda>0λ>0, and its subdifferential is nonempty at some point of DDD. Then there is exactly one x∈Dx\in Dx∈D such that

f(x)≤f(z)for every z∈D.f(x)\le f(z)\qquad\text{for every }z\in D.f(x)≤f(z)for every z∈D.

This existence and uniqueness result supplies the minimizer of each strongly convex mirror-descent update.

Formalization Note The extended-valued function is represented by a real-valued function on its exact finite domain DDD and by +∞+\infty+∞ elsewhere. Closedness is closedness of that extended function's epigraph. The nonempty-subdifferential hypothesis is an explicit point and continuous linear subgradient on DDD.

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

/-- Orabona, Theorem 6.9, p. 66.  The extended function is represented by a
real-valued `f` on its exact finite domain `D`, and `+∞` elsewhere. -/
theorem theorem_6_9 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [FiniteDimensional ℝ E] (D : Set E) (f : E → ℝ) (lam : ℝ)
    (hlam : 0 < lam) (hclosed : IsClosedOnDomain D f)
    (hstrong : StrongConvexOn D lam f)
    (hsub : ∃ y ∈ D, ∃ g : E →L[ℝ] ℝ, IsSubgradientOn D f y g) :
    ∃! x : E, x ∈ D ∧ ∀ z ∈ D, f x ≤ f z := by sorry

end ModernOnlineLearning.OMD
Source
Orabona, arXiv:1912.13213v10, Theorem 6.9, p. 66
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