Lemma 5.6, p. 36 — a nonempty convex set of martingale plans, each on a set with |Γ_x| ≤ 2, is a single point
ProvedMartOT.HN.lemma_5_6convexitymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1uniqueness
Let and be finite measures on in convex order, and let be a nonempty convex set of martingale transport plans from to . Assume that every is concentrated on some set with for every . Then
Together with the convexity of the set of optimizers, this turns "every optimizer lives on two graphs" into "the optimizer is unique".
Formalization Note Convexity of is closure under , . "Concentrated on " is ; is not assumed measurable, as on the page. The convex order of Definition 2.1 makes finite with finite first moments.
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.HN
open MeasureTheory
theorem lemma_5_6 (μ ν : Measure ℝ) (hμν : MartOT.Var.ConvexLE μ ν) (E : Set (Measure (ℝ × ℝ)))
(hE : ∀ π ∈ E, MartOT.Var.IsMartingalePlan μ ν π) (hne : E.Nonempty)
(hconv : ∀ π ∈ E, ∀ π' ∈ E, ∀ t ∈ Set.Icc (0 : ℝ) 1,
ENNReal.ofReal t • π + ENNReal.ofReal (1 - t) • π' ∈ E)
(hfib : ∀ π ∈ E, ∃ Γ : Set (ℝ × ℝ), π Γᶜ = 0 ∧ ∀ x : ℝ, {y : ℝ | (x, y) ∈ Γ}.encard ≤ 2) :
∃ π : Measure (ℝ × ℝ), E = {π} := by sorry
end MartOT.HN
Source
arXiv:1208.1509v2, Lemma 5.6, p. 36
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.