Remark 4, (11) for — -optimal plans nearly satisfy complementary slackness
ProvedModelRiskOT.WorstProb.remark_4_eq_11Let be a Polish space, a cost satisfying (A1), a probability measure on , , nonempty and closed, and . Let be such that is dual optimal, where ; that is,
Let and let satisfy . Then
and, if ,
The two bounds say that an -optimal transport plan almost moves mass only to maximizers of and almost exhausts the budget; they are the quantitative form of the complementary slackness conditions, and Lemma 4 and Lemma 2 are built on them.
Formalization Note The page prints the first integrand as ; the statement uses the integrand of (10), , which is nonnegative. The second bound is stated only for , where is defined (the only case the paper uses). Dual optimality is stated as the equality above, which is after the identity . The condition is written in .
import Mathlib import Definitions.Def_ModelRiskOT_WorstProb_WorstCaseProb open MeasureTheory open scoped ENNReal
namespace ModelRiskOT.WorstProb
/-- Remark 4, (11), p. 8, for `f = 1_A`. Let `(λ*, φ_{λ*})` be dual optimal, where by §2.4
`φ_{λ*}(x) = (1 − λ* c(x, A))⁺`; i.e. `I = λ*δ + E_μ[(1 − λ* c(X, A))⁺]` with
`I = sup {π(S × A) : π ∈ Φ_{μ,δ}}`. Then for `ε > 0` and every `π_ε ∈ Φ_{μ,δ}` with
`π_ε(S × A) ≥ I − ε`:
`∫ (φ_{λ*}(x) − (1_A(y) − λ* c(x, y))) dπ_ε ≤ ε`, and, when `λ* > 0`,
`(δ − ε/λ*)⁺ ≤ ∫ c dπ_ε ≤ δ`.
The integrand is the corrected one of (10) (the page prints `φ_{λ*}(x) − f(y) − λ* c(x, y)`). -/
theorem remark_4_eq_11 {S : Type*} [TopologicalSpace S] [PolishSpace S] [MeasurableSpace S]
[BorelSpace S] (c : S → S → ℝ) (hc : ModelRiskOT.Duality.AssumptionA1 c) (μ : Measure S) [IsProbabilityMeasure μ]
(δ : ℝ) (hδ : 0 < δ) (A : Set S) (hA : IsClosed A) (hAne : A.Nonempty)
(lamStar : ℝ) (hlam : 0 ≤ lamStar)
(hdual : worstProbCoupling c μ δ A = obj13 c μ δ A lamStar)
(ε : ℝ) (hε : 0 < ε) (π : Measure (S × S)) (hπ : π ∈ Phi c μ δ)
(hπε : worstProbCoupling c μ δ A ≤ π (Set.univ ×ˢ A) + ENNReal.ofReal ε) :
∫⁻ p, ENNReal.ofReal (max (1 - lamStar * costToSet c A p.1) 0 -
(A.indicator (fun _ => (1 : ℝ)) p.2 - lamStar * c p.1 p.2)) ∂π ≤ ENNReal.ofReal ε ∧
(0 < lamStar →
ENNReal.ofReal (δ - ε / lamStar) ≤ ∫⁻ p, ENNReal.ofReal (c p.1 p.2) ∂π ∧
∫⁻ p, ENNReal.ofReal (c p.1 p.2) ∂π ≤ ENNReal.ofReal δ) := by sorry
end ModelRiskOT.WorstProb
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.