Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7.3, p. 45 — on a finitely optimal Γ for c = −|y − x|, the set of a with |Γ_a| > 2 is countable, hence µ-null

Disproved
MartOT.HN.fibres_le_two

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

cardinality-boundhobson-neubergermartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let c(x,y)=−∣y−x∣c(x,y)=-|y-x|c(x,y)=−∣y−x∣ and let Γ⊆R2\Gamma\subseteq\mathbb R^2Γ⊆R2 be a set on which no finitely supported measure is improved by a competitor. Let μ\muμ be a continuous measure on R\mathbb RR, that is, μ({x})=0\mu(\{x\})=0μ({x})=0 for every xxx. Then the set

A={a∈R: ∣Γa∣>2},Γa={y:(a,y)∈Γ},A=\{a\in\mathbb R:\ |\Gamma_a|>2\},\qquad \Gamma_a=\{y:(a,y)\in\Gamma\},A={a∈R: ∣Γa​∣>2},Γa​={y:(a,y)∈Γ},

is countable, and therefore μ(A)=0\mu(A)=0μ(A)=0.

After discarding A×RA\times\mathbb RA×R, every fibre of Γ\GammaΓ has at most two points, which is where the two maps T1,T2T_1,T_2T1​,T2​ of Theorem 7.3 come from.

Formalization Note The hypothesis on Γ\GammaΓ is the conclusion of Lemma 1.11 for the cost c(x,y)=−∣y−x∣c(x,y)=-|y-x|c(x,y)=−∣y−x∣: for every finitely supported α=∑s∈Swsδs\alpha=\sum_{s\in S}w_s\delta_sα=∑s∈S​ws​δs​ with S⊆ΓS\subseteq\GammaS⊆Γ finite and ws≥0w_s\ge0ws​≥0, and every competitor α′\alpha'α′ of α\alphaα, ∫c dα≤∫c dα′\int c\,d\alpha\le\int c\,d\alpha'∫cdα≤∫cdα′. We call such a Γ\GammaΓ finitely optimal. Continuity of μ\muμ is the hypothesis μ({x})=0\mu(\{x\})=0μ({x})=0 for every xxx; μ\muμ is otherwise arbitrary. Cardinalities are in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}.

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

open MeasureTheory

theorem fibres_le_two (μ : Measure ℝ) (hμc : ∀ x : ℝ, μ {x} = 0) (Γ : 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 => -|y - x|) (∑ p ∈ S, (w p : ENNReal) • Measure.dirac p) ≤
          MartOT.Var.cost (fun x y => -|y - x|) α') :
    {a : ℝ | 2 < {y : ℝ | (a, y) ∈ Γ}.encard}.Countable ∧
      μ {a : ℝ | 2 < {y : ℝ | (a, y) ∈ Γ}.encard} = 0 := by sorry

end MartOT.HN
Source
arXiv:1208.1509v2, proof of Theorem 7.3, p. 45 (first paragraph)
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