Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5 display (p. 26) — I = sup over Φ′_{µ,δ}

Proved
ModelRiskOT.PrimalOpt.primalValue_eq_sup_mono

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

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

Let SSS be a Polish space, μ\muμ a probability measure on SSS, δ>0\delta>0δ>0, and let ccc and fff satisfy (A1) and (A2). Then the primal value is unchanged if the supremum is taken over monotone plans only:

I=sup⁡{I(π):π∈Φμ,δ}=sup⁡{I(π):π∈Φμ,δ′}.I=\sup\{I(\pi):\pi\in\Phi_{\mu,\delta}\}=\sup\{I(\pi):\pi\in\Phi'_{\mu,\delta}\}.I=sup{I(π):π∈Φμ,δ​}=sup{I(π):π∈Φμ,δ′​}.

This is the starting point of the proof of Proposition 9, which picks a maximizing sequence inside Φμ,δ′\Phi'_{\mu,\delta}Φμ,δ′​.

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_PrimalOpt_PrimalFeasibleMono
Formal statement
namespace ModelRiskOT.PrimalOpt

open MeasureTheory

/-- **§5, Additional notation** (p. 26). Under (A1) and (A2),
`I = sup{I(π) : π ∈ Φ_{μ,δ}} = sup{I(π) : π ∈ Φ′_{μ,δ}}`. -/
theorem primalValue_eq_sup_mono {S : Type*} [TopologicalSpace S] [PolishSpace S]
    [MeasurableSpace S] [BorelSpace S] (c : S → S → ℝ) (f : S → ℝ) (μ : Measure S)
    [IsProbabilityMeasure μ] (δ : ℝ) (hδ : 0 < δ) (hA1 : ModelRiskOT.Duality.AssumptionA1 c)
    (hA2 : AssumptionA2 f μ) :
    ModelRiskOT.Duality.primalValue c f μ δ = ⨆ π ∈ primalFeasibleMono c f μ δ, ModelRiskOT.Duality.primalObj f π := by sorry

end ModelRiskOT.PrimalOpt
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, p. 26, §5, Additional notation (display)
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