Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
MartOT.HN.lemma_3_2

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

accumulation-pointsdescriptive-set-theorymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For Γ⊆R2\Gamma\subseteq\mathbb R^2Γ⊆R2 write Γa={y∈R:(a,y)∈Γ}\Gamma_a=\{y\in\mathbb R:(a,y)\in\Gamma\}Γa​={y∈R:(a,y)∈Γ}. Let k≥1k\ge1k≥1 be an integer and assume that there are uncountably many a∈Ra\in\mathbb Ra∈R with ∣Γa∣≥k|\Gamma_a|\ge k∣Γa​∣≥k.

Then there exist aaa and b1<⋯<bkb_1<\dots<b_kb1​<⋯<bk​ in Γa\Gamma_aΓa​ such that for every ε>0\varepsilon>0ε>0 one can find a′>aa'>aa′>a and b1′<⋯<bk′b'_1<\dots<b'_kb1′​<⋯<bk′​ in Γa′\Gamma_{a'}Γa′​ with

max⁡(∣a−a′∣,∣b1−b1′∣,…,∣bk−bk′∣)<ε,\max\big(|a-a'|,|b_1-b'_1|,\dots,|b_k-b'_k|\big)<\varepsilon,max(∣a−a′∣,∣b1​−b1′​∣,…,∣bk​−bk′​∣)<ε,

and also a′′<aa''<aa′′<a and b1′′<⋯<bk′′b''_1<\dots<b''_kb1′′​<⋯<bk′′​ in Γa′′\Gamma_{a''}Γa′′​ with max⁡(∣a−a′′∣,∣b1−b1′′∣,…,∣bk−bk′′∣)<ε\max(|a-a''|,|b_1-b''_1|,\dots,|b_k-b''_k|)<\varepsilonmax(∣a−a′′∣,∣b1​−b1′′​∣,…,∣bk​−bk′′​∣)<ε.

No measurability of Γ\GammaΓ 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 ∣Γa∣|\Gamma_a|∣Γa​∣ is the cardinality in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}; bbb, b′b'b′, b′′b''b′′ are strictly increasing kkk-tuples; the maximum is written as a conjunction of the k+1k+1k+1 bounds. The same aaa and bbb 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
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me