Lemma 3.2, p. 19 — if uncountably many fibres Γ_a have ≥ k points, some k-tuple is approximated from the right and from the left
ProvedMartOT.HN.lemma_3_2accumulation-pointsdescriptive-set-theorymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For write . Let be an integer and assume that there are uncountably many with .
Then there exist and in such that for every one can find and in with
and also and in with .
No measurability of is assumed. The lemma is the device by which forbidden configurations on a set of full measure become bounds on the number of points in its fibres.
Formalization Note is the cardinality in ; , , are strictly increasing -tuples; the maximum is written as a conjunction of the bounds. The same and serve both directions.
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.HN
open MeasureTheory
theorem lemma_3_2 (k : ℕ) (hk : 0 < k) (Γ : Set (ℝ × ℝ))
(hunc : ¬ {a : ℝ | (k : ℕ∞) ≤ {y : ℝ | (a, y) ∈ Γ}.encard}.Countable) :
∃ (a : ℝ) (b : Fin k → ℝ), StrictMono b ∧ (∀ i, (a, b i) ∈ Γ) ∧
∀ ε : ℝ, 0 < ε →
(∃ a' : ℝ, a < a' ∧ ∃ b' : Fin k → ℝ, StrictMono b' ∧ (∀ i, (a', b' i) ∈ Γ) ∧
|a - a'| < ε ∧ ∀ i, |b i - b' i| < ε) ∧
(∃ a'' : ℝ, a'' < a ∧ ∃ b'' : Fin k → ℝ, StrictMono b'' ∧ (∀ i, (a'', b'' i) ∈ Γ) ∧
|a - a''| < ε ∧ ∀ i, |b i - b'' i| < ε) := by sorry
end MartOT.HN
Source
arXiv:1208.1509v2, Lemma 3.2, p. 19
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.