Theorem 1, p. 10 — Mahalanobis transport dual reformulation and attainment
ProvedOTDRO.Dual.dual_reformulationLet be a Borel probability law on . Let satisfy Assumption 1, let , and let be convex. For a decision , suppose is upper semicontinuous and is integrable under . The worst case over transport plans of cost at most satisfies
Moreover, some attains the infimum: . The reformulation expresses the worst-case loss through an expectation under the baseline law and a one dimensional dual search.
Formalization Note The left side uses the paper's equivalent coupling linear program from §2.1. Both sides live in the extended reals. Integrability of is stated explicitly because the cited strong duality theorem [6, Theorem 1] requires it; Theorem 1 on p. 10 omits this condition. The standing convexity of and are retained.
import Mathlib import Definitions.Def_OTDRO_Dual_Setting import Definitions.Def_ModelRiskOT_Duality_primalValue
namespace OTDRO.Dual
open MeasureTheory
/-- Theorem 1, p. 10: the Mahalanobis-transport worst-case loss has the one-dimensional
dual representation, and the dual infimum is attained for decisions in `B`. -/
theorem dual_reformulation {d : ℕ}
(P0 : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure P0]
(A : EuclideanSpace ℝ (Fin d) → Matrix (Fin d) (Fin d) ℝ)
(ρmin ρmax : ℝ) (hA : Assumption1 P0 A ρmin ρmax)
(ℓ : ℝ → ℝ) (hℓ : UpperSemicontinuous ℓ)
(δ : ℝ) (hδ : 0 < δ)
(B : Set (EuclideanSpace ℝ (Fin d))) (hB : Convex ℝ B)
(β : EuclideanSpace ℝ (Fin d)) (hβ : β ∈ B)
(hint : Integrable (fun x => ℓ (inner ℝ β x)) P0) :
ModelRiskOT.Duality.primalValue (mahalCost A) (fun x => ℓ (inner ℝ β x)) P0 δ =
⨅ lam ∈ Set.Ici (0 : ℝ), fDelta P0 ℓ A δ β lam ∧
∃ lamStar : ℝ, 0 ≤ lamStar ∧
fDelta P0 ℓ A δ β lamStar =
⨅ lam ∈ Set.Ici (0 : ℝ), fDelta P0 ℓ A δ β lam := by sorry
end OTDRO.Dual
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.