Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.6, p. 36 — a nonempty convex set of martingale plans, each on a set with |Γ_x| ≤ 2, is a single point

Proved
MartOT.HN.lemma_5_6

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

convexitymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1uniqueness

Let μ\muμ and ν\nuν be finite measures on R\mathbb RR in convex order, and let E\mathcal EE be a nonempty convex set of martingale transport plans from μ\muμ to ν\nuν. Assume that every π∈E\pi\in\mathcal Eπ∈E is concentrated on some set Γπ⊆R2\Gamma^\pi\subseteq\mathbb R^2Γπ⊆R2 with ∣Γxπ∣≤2|\Gamma^\pi_x|\le2∣Γxπ​∣≤2 for every x∈Rx\in\mathbb Rx∈R. Then

E={π}for a single plan π.\mathcal E=\{\pi\}\quad\text{for a single plan }\pi.E={π}for a single plan π.

Together with the convexity of the set of optimizers, this turns "every optimizer lives on two graphs" into "the optimizer is unique".

Formalization Note Convexity of E\mathcal EE is closure under ofReal(t) π+ofReal(1−t) π′\mathrm{ofReal}(t)\,\pi+\mathrm{ofReal}(1-t)\,\pi'ofReal(t)π+ofReal(1−t)π′, t∈[0,1]t\in[0,1]t∈[0,1]. "Concentrated on Γ\GammaΓ" is π(Γc)=0\pi(\Gamma^c)=0π(Γc)=0; Γπ\Gamma^\piΓπ is not assumed measurable, as on the page. The convex order of Definition 2.1 makes μ,ν\mu,\nuμ,ν finite with finite first moments.

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

open MeasureTheory

theorem lemma_5_6 (μ ν : Measure ℝ) (hμν : MartOT.Var.ConvexLE μ ν) (E : Set (Measure (ℝ × ℝ)))
    (hE : ∀ π ∈ E, MartOT.Var.IsMartingalePlan μ ν π) (hne : E.Nonempty)
    (hconv : ∀ π ∈ E, ∀ π' ∈ E, ∀ t ∈ Set.Icc (0 : ℝ) 1,
      ENNReal.ofReal t • π + ENNReal.ofReal (1 - t) • π' ∈ E)
    (hfib : ∀ π ∈ E, ∃ Γ : Set (ℝ × ℝ), π Γᶜ = 0 ∧ ∀ x : ℝ, {y : ℝ | (x, y) ∈ Γ}.encard ≤ 2) :
    ∃ π : Measure (ℝ × ℝ), E = {π} := by sorry

end MartOT.HN
Source
arXiv:1208.1509v2, Lemma 5.6, p. 36
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