Theorem 3 — when
ProvedModelRiskOT.WorstProb.theorem_3Let be a Polish space, a cost satisfying (A1) (nonnegative, lower semicontinuous, ), a probability measure on , , and a nonempty closed set. Write . Suppose that attains the infimum in
and that the quantities and of (14) are equal. Then
The worst-case probability of over all models within optimal transport cost of the baseline is the baseline probability of the inflated set . No optimal transport plan is assumed to exist.
Formalization Note The threshold is written , which is the whole space at (the paper's ; then both sides equal ). The supremum is over probability measures on with , with both marginals of the couplings in fixed. Both sides are in ; of the inflated set, which is universally measurable, is its outer measure, i.e. its completion measure.
import Mathlib import Definitions.Def_ModelRiskOT_WorstProb_WorstCaseProb open MeasureTheory open scoped ENNReal
namespace ModelRiskOT.WorstProb
/-- Theorem 3, p. 10, (15). Under (A1), for a nonempty closed `A`, if `λ* ∈ [0, ∞)` attains the
infimum in (13) and `c̲ = c̄` (14), then
`sup {P(A) : d_c(μ, P) ≤ δ} = μ {x : c(x, A) ≤ 1/λ*}`.
The threshold is in multiplied form `λ* c(x, A) ≤ 1` (the whole space at `λ* = 0`, i.e. `1/0 = ∞`).
Sanity check (not part of the statement): `S = ℝ`, `c(x, y) = |x − y|`, `μ` uniform on `[0, 1]`,
`A = [1, ∞)`, `0 < δ ≤ 1/2`. Then `c(x, A) = 1 − x` on `[0, 1]`, `g(λ) = λδ + 1/(2λ)` for `λ ≥ 1`,
minimized at `λ* = 1/√(2δ)` with value `√(2δ)`, `c̲ = c̄ = δ`, and
`μ {x : 1 − x ≤ √(2δ)} = √(2δ)`: both sides agree and are strictly between 0 and 1.
With `μ` the point mass at `0` and `δ < 1`, instead, `λ* = 1`, `c̲ = 0 ≠ 1 = c̄`: the hypothesis
fails, and indeed `I = δ ≠ 1`. -/
theorem theorem_3 {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)
(hcc : cLower c μ A lamStar = cUpper c μ A lamStar) :
worstProb c μ δ A = μ {x | lamStar * costToSet c A x ≤ 1} := by sorry
end ModelRiskOT.WorstProb
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.