Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.3, p. 29 — convex Lipschitz loss against a norm penalty

Proved
RegMT.Classif.lemma_A_3

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

classificationconvex-analysislipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let L:R→RL:\mathbb R\to\mathbb RL:R→R be convex and Lipschitz continuous. Let β\betaβ be a continuous linear functional on a finite-dimensional real normed space, let ζ^\hat\zetaζ^​ be a point of that space, and let γ>0\gamma>0γ>0. Then

sup⁡ζ{L(⟨β,ζ⟩)−γ∥ζ−ζ^∥}={L(⟨β,ζ^⟩),lip⁡(L)∥β∥∗≤γ,+∞,otherwise.\sup_\zeta\bigl\{L(\langle\beta,\zeta\rangle)-\gamma\|\zeta-\hat\zeta\|\bigr\}=\begin{cases}L(\langle\beta,\hat\zeta\rangle),&\operatorname{lip}(L)\|\beta\|_*\le\gamma,\\+\infty,&\text{otherwise.}\end{cases}ζsup​{L(⟨β,ζ⟩)−γ∥ζ−ζ^​∥}={L(⟨β,ζ^​⟩),+∞,​lip(L)∥β∥∗​≤γ,otherwise.​

This evaluates each feature supremum in the label-split reformulation. The dual norm is the operator norm induced by the same norm used in the transport cost.

Preamble
import Mathlib
import Definitions.Def_RegMT_Classif_Model
Formal statement
namespace RegMT.Classif

/-- Lemma A.3, p. 29: the supremum of a convex Lipschitz loss minus a norm
penalty is either its value at the center or positive infinity. -/
theorem lemma_A_3 {V : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V]
    [FiniteDimensional ℝ V] (L : ℝ → ℝ)
    (hconv : ConvexOn ℝ Set.univ L)
    (hLip : ∃ K : NNReal, LipschitzWith K L)
    (β : V →L[ℝ] ℝ) (ζhat : V) (γ : ℝ) (hγ : 0 < γ) :
    (⨆ ζ : V, ((L (β ζ) - γ * ‖ζ - ζhat‖ : ℝ) : EReal)) =
      if (WassersteinDRO.Duality.lipschitzModulus L).toReal * ‖β‖ ≤ γ
      then ((L (β ζhat) : ℝ) : EReal) else ⊤ := by sorry

end RegMT.Classif
Source
Shafieezadeh-Abadeh, Kuhn & Mohajerin Esfahani, Regularization via Mass Transportation, arXiv:1710.10016v3, pp. 29–30, Lemma A.3
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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