Proof of Lemma 1.11, p. 17 — for a Borel cost c, the set M of bad n-tuples is Borel
ProvedMartOT.Var.badTuples_measurableSetmartingale-optimal-transportmeasurabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be Borel measurable and . Then the set
of -tuples carrying a non-optimal finitely supported measure is a Borel subset of .
The paper asserts this when it introduces ("define a Borel set "); it is what allows Theorem 3.1 to be applied to .
Formalization Note is Fin n → ℝ × ℝ with the product -algebra, which is its Borel -algebra. is the definition BadTuples (finite , support condition written as ).
Preamble
import Mathlib import Definitions.Def_MartOT_Var_BadTuples
Formal statement
namespace MartOT.Var
open MeasureTheory
theorem badTuples_measurableSet (c : ℝ → ℝ → ℝ) (hc : Measurable (Function.uncurry c))
(n : ℕ) : MeasurableSet (BadTuples c n) := by sorry
end MartOT.Var
Source
arXiv:1208.1509v2, §3, proof of Lemma 1.11, p. 17 ("For a fixed n ∈ N, define a Borel set M by")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.