Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 33 — lower and upper bounds on a dual minimizer

Proved
OTDRO.StrongCvx.dual_optimizer_bounds

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

distributionally-robust-optimizationoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-convexity

Assume the paper's Assumptions 1–3 and δ>0\delta>0δ>0. For β∈B\beta\in Bβ∈B, let λ∗(β)≥0\lambda_*(\beta)\ge0λ∗​(β)≥0 minimize the extended-real dual objective fδ(β,λ)f_\delta(\beta,\lambda)fδ​(β,λ) over λ≥0\lambda\ge0λ≥0. Write Sβ=EP0[ℓ′(βTX)2]S_\beta=\mathbb E_{P_0}[\ell'(\beta^{\mathsf T}X)^2]Sβ​=EP0​​[ℓ′(βTX)2]. Then

∥β∥Sβ2ρmax⁡≤λ∗(β)≤∥β∥Sβρmin⁡+δM∥β∥22ρmin⁡.\frac{\|\beta\|\sqrt{S_\beta}}{2\sqrt{\rho_{\max}}}\le\lambda_*(\beta)\le\frac{\|\beta\|\sqrt{S_\beta}}{\sqrt{\rho_{\min}}}+\frac{\sqrt\delta M\|\beta\|^2}{2\rho_{\min}}.2ρmax​​∥β∥Sβ​​​≤λ∗​(β)≤ρmin​​∥β∥Sβ​​​+2ρmin​δ​M∥β∥2​.

These are the paper's λmin⁡(β)\lambda_{\min}(\beta)λmin​(β) and λmax⁡(β)\lambda_{\max}(\beta)λmax​(β); Proposition 1 makes them uniform over a compact decision set.

Formalization Note Membership λ∗≥0\lambda_*\ge0λ∗​≥0 is stated separately because Lean's IsMinOn predicate alone does not include membership in the minimizing set.

Preamble
import Mathlib
import Definitions.Def_OTDRO_StrongCvx_Assumptions
Formal statement
namespace OTDRO.StrongCvx

open MeasureTheory

/-- Lemma 7, p. 33: explicit lower and upper bounds for any nonnegative
dual minimizer. -/
theorem dual_optimizer_bounds {d : ℕ}
    (P0 : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure P0]
    (A : EuclideanSpace ℝ (Fin d) → Matrix (Fin d) (Fin d) ℝ)
    (ρmin ρmax : ℝ) (hA : OTDRO.Dual.Assumption1 P0 A ρmin ρmax)
    (ℓ : ℝ → ℝ) (h2 : OTDRO.Dual.Assumption2 P0 ℓ)
    (δ : ℝ) (hδ : 0 < δ) (B : Set (EuclideanSpace ℝ (Fin d)))
    (hB : Convex ℝ B) (M : ℝ) (h3 : Assumption3 P0 ℓ B M)
    (β : EuclideanSpace ℝ (Fin d)) (hβB : β ∈ B)
    (lamStar : ℝ) (hlam : 0 ≤ lamStar)
    (hmin : IsMinOn (fun lam => OTDRO.Dual.fDelta P0 ℓ A δ β lam) (Set.Ici 0) lamStar) :
    (1 / 2) / Real.sqrt ρmax * ‖β‖ *
      Real.sqrt (∫ x, (deriv ℓ (inner ℝ β x)) ^ 2 ∂P0) ≤ lamStar ∧
    lamStar ≤ (1 / Real.sqrt ρmin) * ‖β‖ *
      Real.sqrt (∫ x, (deriv ℓ (inner ℝ β x)) ^ 2 ∂P0) +
      (1 / 2) * Real.sqrt δ * M / ρmin * ‖β‖ ^ 2 := by sorry

end OTDRO.StrongCvx
Source
Blanchet, Murthy & Zhang, arXiv:1810.02403v3, Lemma 7, p. 33; proof pp. 33–34
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