Proof of Theorem 7.3, p. 45 — on a finitely optimal Γ for c = −|y − x|, the set of a with |Γ_a| > 2 is countable, hence µ-null
DisprovedMartOT.HN.fibres_le_twocardinality-boundhobson-neubergermartingale-optimal-transportp2o-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 be a continuous measure on , that is, for every . Then the set
is countable, and therefore .
After discarding , every fibre of has at most two points, which is where the two maps of Theorem 7.3 come from.
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. Continuity of is the hypothesis for every ; is otherwise arbitrary. Cardinalities are in .
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.HN
open MeasureTheory
theorem fibres_le_two (μ : Measure ℝ) (hμc : ∀ x : ℝ, μ {x} = 0) (Γ : 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|) α') :
{a : ℝ | 2 < {y : ℝ | (a, y) ∈ Γ}.encard}.Countable ∧
μ {a : ℝ | 2 < {y : ℝ | (a, y) ∈ Γ}.encard} = 0 := by sorry
end MartOT.HN
Source
arXiv:1208.1509v2, proof of Theorem 7.3, p. 45 (first paragraph)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.