Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7.1, pp. 38–39 — on the Γ of Lemma 1.11 only countably many continuity points x of µ have card(Γ_x) ≥ k + 1

Proved
MartOT.Card.exceptional_countable

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

competitorscountabilitymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let μ\muμ be a measure on R\mathbb RR, h:R→Rh:\mathbb R\to\mathbb Rh:R→R twice continuously differentiable, c(x,y)=h(y−x)c(x,y)=h(y-x)c(x,y)=h(y−x), and assume that every affine function meets h′h'h′ in at most kkk points. Let Γ⊆R2\Gamma\subseteq\mathbb R^2Γ⊆R2 have the property that Lemma 1.11 provides: for every finitely supported finite measure α\alphaα with spt⁡α⊆Γ\operatorname{spt}\alpha\subseteq\Gammasptα⊆Γ,

∫c dα≤∫c dα′for every competitor α′ of α.\int c\,d\alpha\le\int c\,d\alpha'\qquad\text{for every competitor }\alpha'\text{ of }\alpha .∫cdα≤∫cdα′for every competitor α′ of α.

Then the set of continuity points of μ\muμ whose fibre has at least k+1k+1k+1 points,

{x∈R: μ({x})=0, ∣Γx∣≥k+1},Γx={y:(x,y)∈Γ},\big\{x\in\mathbb R:\ \mu(\{x\})=0,\ |\Gamma_x|\ge k+1\big\},\qquad \Gamma_x=\{y:(x,y)\in\Gamma\},{x∈R: μ({x})=0, ∣Γx​∣≥k+1},Γx​={y:(x,y)∈Γ},

is countable.

This is the core of Theorem 7.1: these countably many μ\muμ-null fibres can be removed from Γ\GammaΓ, after which every non-atom xxx carries at most kkk points.

Formalization Note The finitely supported α\alphaα are written ∑s∈Swsδs\sum_{s\in S}w_s\delta_s∑s∈S​ws​δs​ with SSS finite and ws≥0w_s\ge0ws​≥0, as in Lemma 1.11, and costs are extended-real integrals. The property of Γ\GammaΓ is carried as a hypothesis instead of deriving Γ\GammaΓ from Lemma 1.11, so ν\nuν, π\piπ, the convex order, optimality, π(Γ)=1\pi(\Gamma)=1π(Γ)=1 and Borel measurability of Γ\GammaΓ are not needed and are dropped; this makes the statement more general. The cardinality ∣Γx∣|\Gamma_x|∣Γx​∣ is taken in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}.

Preamble
import Mathlib
import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.Card

open MeasureTheory

/-- Proof of Theorem 7.1, pp. 38–39: if `Γ` has the conclusion property of Lemma 1.11 for the MartOT.Var.cost
`c(x, y) = h(y − x)`, then only countably many continuity points `x` of `μ` have `card(Γ_x) ≥ k + 1`. -/
theorem exceptional_countable (μ : Measure ℝ) (h : ℝ → ℝ) (hh : ContDiff ℝ 2 h) (k : ℕ)
    (hk : ∀ s t : ℝ, {x : ℝ | deriv h x = s * x + t}.encard ≤ k)
    (Γ : 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 => h (y - x)) (∑ p ∈ S, (w p : ENNReal) • Measure.dirac p) ≤
            MartOT.Var.cost (fun x y => h (y - x)) α') :
    {x : ℝ | μ {x} = 0 ∧ ((k + 1 : ℕ) : ℕ∞) ≤ {y : ℝ | (x, y) ∈ Γ}.encard}.Countable := by sorry

end MartOT.Card
Source
arXiv:1208.1509v2, §7.1, proof of Theorem 7.1, pp. 38–39 (first paragraph of the proof)
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