§5 display (p. 26) — I = sup over Φ′_{µ,δ}
ProvedModelRiskOT.PrimalOpt.primalValue_eq_sup_monodistributionally-robust-optimizationoptimal-transportp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Polish space, a probability measure on , , and let and satisfy (A1) and (A2). Then the primal value is unchanged if the supremum is taken over monotone plans only:
This is the starting point of the proof of Proposition 9, which picks a maximizing sequence inside .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.