Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 — a worst-case transport plan exists in a locally compact normed space under (A1)–(A4) when λ* > 0

Proved
ModelRiskOT.PrimalOpt.corollary_1

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

distributionally-robust-optimizationexistenceoptimal-transportp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a real normed space that is locally compact in the topology of its norm ∥⋅∥\|\cdot\|∥⋅∥, with its Borel σ\sigmaσ-algebra; let μ\muμ be a probability measure on EEE and δ>0\delta>0δ>0. Let the cost ccc and the function fff satisfy Assumptions (A1)–(A4). Assume the standing assumption of §5: (λ∗,φλ∗)∈Λc,f(\lambda^*,\varphi_{\lambda^*})\in\Lambda_{c,f}(λ∗,φλ∗​)∈Λc,f​ is a dual optimal pair with

I=J=J(λ∗,φλ∗)<∞.I=J=J(\lambda^*,\varphi_{\lambda^*})<\infty.I=J=J(λ∗,φλ∗​)<∞.

If λ∗>0\lambda^*>0λ∗>0, there is a primal optimizer π∗∈Φμ,δ\pi^*\in\Phi_{\mu,\delta}π∗∈Φμ,δ​, i.e. a transport plan with first marginal μ\muμ and cost ∫c dπ∗≤δ\int c\,d\pi^*\le\delta∫cdπ∗≤δ, such that

I(π∗)=I=J=J(λ∗,φλ∗).I(\pi^*)=I=J=J(\lambda^*,\varphi_{\lambda^*}).I(π∗)=I=J=J(λ∗,φλ∗​).

Its second marginal is then a worst-case model: it attains sup⁡{∫f dν:dc(μ,ν)≤δ}\sup\{\int f\,d\nu: d_c(\mu,\nu)\le\delta\}sup{∫fdν:dc​(μ,ν)≤δ}.

Formalization Note The equality I=JI=JI=J is Theorem 1(a) of the paper, not assumed proved here; it is a hypothesis, as in the paper's standing assumption for §5. The condition λ∗>0\lambda^*>0λ∗>0 cannot be dropped: Example 2 of the paper has λ∗=0\lambda^*=0λ∗=0 and no primal optimizer. The instance PolishSpace E is redundant (a locally compact real normed space is finite-dimensional) and is included because the §2 objects are posed on a Polish space; local compactness is kept as the paper states it.

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_PrimalOpt_Basic
import Definitions.Def_ModelRiskOT_PrimalOpt_GrowthAssumptions
Formal statement
namespace ModelRiskOT.PrimalOpt

open MeasureTheory

/-- **Corollary 1** (§5, p. 27). Let `E` be a real normed space that is locally compact in its norm
topology, with its Borel σ-algebra, and let `c`, `f` satisfy (A1)–(A4). Assume the standing
assumption of §5: `(λ*, φ_{λ*}) ∈ Λ_{c,f}` is a dual optimal pair with
`I = J = J(λ*, φ_{λ*}) < ∞` (the identity `I = J` is Theorem 1(a), taken here as a hypothesis).
If `λ* > 0`, there is a primal optimizer `π* ∈ Φ_{μ,δ}` with `I(π*) = I = J = J(λ*, φ_{λ*})`. -/
theorem corollary_1 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [LocallyCompactSpace E] [PolishSpace E] [MeasurableSpace E] [BorelSpace E]
    (c : E → E → ℝ) (f : E → ℝ) (μ : Measure E) [IsProbabilityMeasure μ]
    (δ : ℝ) (hδ : 0 < δ) (hA1 : ModelRiskOT.Duality.AssumptionA1 c) (hA2 : AssumptionA2 f μ)
    (hA3 : AssumptionA3 c) (hA4 : AssumptionA4 c f)
    (lam : ℝ) (hlam : 0 < lam) (hfeas : (lam, phiLam c f lam) ∈ dualFeasible c f)
    (hIJ : ModelRiskOT.Duality.primalValue c f μ δ = ModelRiskOT.Duality.dualValue c f μ δ)
    (hopt : ModelRiskOT.Duality.dualValue c f μ δ = ModelRiskOT.Duality.dualObj μ δ lam (phiLam c f lam))
    (hfin : ModelRiskOT.Duality.dualObj μ δ lam (phiLam c f lam) < ⊤) :
    ∃ πstar ∈ ModelRiskOT.Duality.primalFeasible c μ δ,
      ModelRiskOT.Duality.primalObj f πstar = ModelRiskOT.Duality.primalValue c f μ δ ∧ ModelRiskOT.Duality.primalValue c f μ δ = ModelRiskOT.Duality.dualValue c f μ δ ∧
        ModelRiskOT.Duality.dualValue c f μ δ = ModelRiskOT.Duality.dualObj μ δ lam (phiLam c f lam) := by sorry

end ModelRiskOT.PrimalOpt
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, p. 27, Corollary 1 (with the standing assumption of §5, p. 26)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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