Proof of Theorem 7.4, p. 46 — for c = |y − x| the set of optimal martingale plans is convex
ProvedMartOT.Abs.optimizers_convexabsolute-value-costmartingale-optimal-transport
Let be probability measures on and . If and are optimal martingale transport plans for , then so is every convex combination , .
The proof of Theorem 7.4 (p. 46) applies Lemma 5.6 to the set of optimizers, which requires it to be a nonempty convex set of martingale plans: is convex and is affine, with finite values here since is -integrable.
Formalization Note Optimality is IsOptimal: and for all , with costs in EReal. The combination is as measures.
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.Abs
open MeasureTheory
theorem optimizers_convex (μ ν : Measure ℝ) [IsProbabilityMeasure μ]
[IsProbabilityMeasure ν] (hμν : MartOT.Var.ConvexLE μ ν) (π π' : Measure (ℝ × ℝ))
(hπ : MartOT.Var.IsOptimal (fun x y => |y - x|) μ ν π)
(hπ' : MartOT.Var.IsOptimal (fun x y => |y - x|) μ ν π')
(t : ℝ) (ht : t ∈ Set.Icc (0 : ℝ) 1) :
MartOT.Var.IsOptimal (fun x y => |y - x|) μ ν
(ENNReal.ofReal t • π + ENNReal.ofReal (1 - t) • π') := by sorry
end MartOT.Abs
Source
arXiv:1208.1509v2 (Beiglböck–Juillet), proof of Theorem 7.4, p. 46 (the set of optimizers to which Lemma 5.6, p. 36, is applied is convex)