(23), proof of Theorem 7.3, p. 44 — on a finitely optimal Γ for c = −|y − x|, no y′ ≤ x′ < x and no x < x′ ≤ y′
DisprovedMartOT.HN.eq_23forbidden-configurationshobson-neubergermartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Consider the Hobson–Neuberger cost and a set on which no finitely supported measure can be improved by a competitor (the property that Lemma 1.11 gives for an optimal plan). Let with . Then neither of the configurations
occurs.
These are the forbidden configurations (23) of the paper; they force optimal plans for onto two monotone graphs.
Formalization Note The hypothesis on is the conclusion of Lemma 1.11 for the cost : for every finitely supported with finite and , and every competitor of , . We call such a finitely optimal. The statement is about any such , so it does not mention , or the plan.
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.HN
open MeasureTheory
theorem eq_23 (Γ : Set (ℝ × ℝ))
(hΓ : ∀ (S : Finset (ℝ × ℝ)) (w : ℝ × ℝ → NNReal), (↑S : Set (ℝ × ℝ)) ⊆ Γ →
∀ α' : Measure (ℝ × ℝ),
MartOT.Var.IsCompetitor (∑ p ∈ S, (w p : ENNReal) • Measure.dirac p) α' →
MartOT.Var.cost (fun x y => -|y - x|) (∑ p ∈ S, (w p : ENNReal) • Measure.dirac p) ≤
MartOT.Var.cost (fun x y => -|y - x|) α')
(x ym yp x' y' : ℝ) (hm : (x, ym) ∈ Γ) (hp : (x, yp) ∈ Γ) (h' : (x', y') ∈ Γ)
(hy : ym < y' ∧ y' < yp) :
¬ (y' ≤ x' ∧ x' < x) ∧ ¬ (x < x' ∧ x' ≤ y') := by sorry
end MartOT.HN
Source
arXiv:1208.1509v2, proof of Theorem 7.3, p. 44, display (23)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.