Lemma 3.2, p. 19 — if uncountably many fibres Γ_a have ≥ k points, some (a, b₁<…<b_k) is approximated from the right and from the left
ProvedMartOT.Card.lemma_3_2countabilitydescriptive-set-theorymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For and write for the fibre of over .
Let be a positive integer and any set such that uncountably many satisfy . Then there exist and in such that for every :
- there are and in with
- there are and in with
The same and serve for every and for both sides. Combined with the variational lemma (Lemma 1.11), this produces two nearby fibres of the optimality set on which a finite rerouting of mass can be tested; it is used for the cardinality bound of Theorem 7.1 with points.
Formalization Note is the cardinality in (Set.encard), so infinite fibres count. The -tuples are strictly increasing maps , and the maximum being is written coordinatewise. No measurability of is assumed, as on the page.
Preamble
import Mathlib
Formal statement
namespace MartOT.Card
theorem lemma_3_2 (k : ℕ) (hk : 0 < k) (Γ : Set (ℝ × ℝ))
(hΓ : ¬ {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.Card
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.