Proof of Theorem 7.3, p. 45 — on a finitely optimal Γ for c = −|y − x|, maps T₁ ≤ id ≤ T₂ with graphs in Γ are nondecreasing
ProvedMartOT.HN.graphs_monotonehobson-neubergermartingale-optimal-transportmonotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and let be a set on which no finitely supported measure is improved by a competitor. Let and be real functions such that, for every , , and
Then and are nondecreasing on .
This is the monotonicity step of Theorem 7.3: the two maps describing an optimal plan for are nondecreasing.
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 page assumes ; only the inclusion is assumed here, which makes the statement stronger. The page's "for -almost every " is built into the choice of .
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.HN
open MeasureTheory
theorem graphs_monotone (Γ : 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|) α')
(S : Set ℝ) (T₁ T₂ : ℝ → ℝ) (h₁ : ∀ x ∈ S, (x, T₁ x) ∈ Γ) (h₂ : ∀ x ∈ S, (x, T₂ x) ∈ Γ)
(hT : ∀ x ∈ S, T₁ x ≤ x ∧ x ≤ T₂ x) :
MonotoneOn T₁ S ∧ MonotoneOn T₂ S := by sorry
end MartOT.HN
Source
arXiv:1208.1509v2, proof of Theorem 7.3, p. 45 (second paragraph)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.