Lemma 4 — near-optimal plans with and
ProvedModelRiskOT.WorstProb.lemma_4Let be a Polish space, a cost satisfying (A1), a probability measure on , , and a nonempty closed set. Let and suppose attains the infimum in (13). Then there exist probability measures , , such that for every :
- ;
- ;
- .
Here is the set of §2.4.1. The plans replace a primal optimizer, which need not exist: they are nearly optimal and transport mass only along the near-optimal moves recorded in , and Lemma 2 and Theorem 3 are proved by passing to the limit along them.
Formalization Note The sequence is indexed by and the properties are required for . Item 3 is written in , so that truncated subtraction plays no role. is the outer measure and the integral over the complement is a lower integral over the restricted measure; is universally measurable, so these are the completion's values.
import Mathlib import Definitions.Def_ModelRiskOT_WorstProb_Cset open MeasureTheory open scoped ENNReal
namespace ModelRiskOT.WorstProb
/-- Lemma 4, p. 11. Under (A1), for a nonempty closed `A` and `λ* ∈ [0, ∞)` attaining the infimum in
(13), there are `π_n ∈ Φ_{μ,δ}` (`n > 1`) with `π_n(C_n) ≥ 1 − 1/n`, `∫_{(S×S) \ C_n} c dπ_n = 0`
and `I(π_n) = π_n(S × A) ≥ I − 2/n`, where `I = sup {π(S × A) : π ∈ Φ_{μ,δ}}`.
The last inequality is written `I ≤ π_n(S × A) + 2/n` in `[0, ∞]`. -/
theorem lemma_4 {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 : AttainsInf13 c μ δ A lamStar) :
∃ πs : ℕ → Measure (S × S), ∀ n : ℕ, 1 < n →
πs n ∈ Phi c μ δ ∧
ENNReal.ofReal (1 - 1 / (n : ℝ)) ≤ πs n (Cset c A lamStar n) ∧
∫⁻ p in (Cset c A lamStar n)ᶜ, ENNReal.ofReal (c p.1 p.2) ∂(πs n) = 0 ∧
worstProbCoupling c μ δ A ≤ πs n (Set.univ ×ˢ A) + ENNReal.ofReal (2 / (n : ℝ)) := by sorry
end ModelRiskOT.WorstProb
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.