Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 11 — every dual minimizer lies in V

Proved
OTDRO.StrongCvx.dual_optimizer_in_V

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

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

Under Assumptions 1–4, let L‾,L‾\underline L,\overline LL​,L be any positive pair satisfying Lemma 6's uniform squared-derivative bounds. For any β∈B\beta\in Bβ∈B and any minimizer λ∗(β)≥0\lambda_*(\beta)\ge0λ∗​(β)≥0 of fδ(β,⋅)f_\delta(\beta,\cdot)fδ​(β,⋅),

(β,λ∗(β))∈V={(b,λ):b∈B,λ≥0,K1∥b∥≤λ≤K2∥b∥},(\beta,\lambda_*(\beta))\in\mathbb V=\{(b,\lambda):b\in B,\lambda\ge0,K_1\|b\|\le\lambda\le K_2\|b\|\},(β,λ∗​(β))∈V={(b,λ):b∈B,λ≥0,K1​∥b∥≤λ≤K2​∥b∥},

where K1K_1K1​ and K2K_2K2​ have the explicit values of (28). Thus the region used by the Hessian theorems contains the dual optimizers.

Formalization Note The pair L‾,L‾\underline L,\overline LL​,L is passed with its Lemma 6 property; the proposition holds for any admissible pair. The nonnegative minimizer membership is explicit.

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

open MeasureTheory

/-- Proposition 1, p. 11, with K₁ and K₂ taken from (28), p. 34. -/
theorem dual_optimizer_in_V {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) (hB4 : Assumption4 B) (hBne : B.Nonempty)
    (M : ℝ) (h3 : Assumption3 P0 ℓ B M)
    (Llow Lbar : ℝ) (hL : DerivSqBounds P0 ℓ B Llow Lbar)
    (β : EuclideanSpace ℝ (Fin d)) (hβB : β ∈ B)
    (lamStar : ℝ) (hlam : 0 ≤ lamStar)
    (hmin : IsMinOn (fun lam => OTDRO.Dual.fDelta P0 ℓ A δ β lam) (Set.Ici 0) lamStar) :
    (β, lamStar) ∈ regionV B δ M (Rbeta B) ρmin ρmax Llow Lbar := by sorry

end OTDRO.StrongCvx
Source
Blanchet, Murthy & Zhang, arXiv:1810.02403v3, Proposition 1 and (8), p. 11; (28), p. 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