Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(23), proof of Theorem 7.3, p. 44 — on a finitely optimal Γ for c = −|y − x|, no y′ ≤ x′ < x and no x < x′ ≤ y′

Disproved
MartOT.HN.eq_23

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

forbidden-configurationshobson-neubergermartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the Hobson–Neuberger cost c(x,y)=−∣y−x∣c(x,y)=-|y-x|c(x,y)=−∣y−x∣ and a set Γ⊆R2\Gamma\subseteq\mathbb R^2Γ⊆R2 on which no finitely supported measure can be improved by a competitor (the property that Lemma 1.11 gives for an optimal plan). Let (x,y−),(x,y+),(x′,y′)∈Γ(x,y^-),(x,y^+),(x',y')\in\Gamma(x,y−),(x,y+),(x′,y′)∈Γ with y−<y′<y+y^-<y'<y^+y−<y′<y+. Then neither of the configurations

y′≤x′<xorx<x′≤y′y'\le x'<x\qquad\text{or}\qquad x<x'\le y'y′≤x′<xorx<x′≤y′

occurs.

These are the forbidden configurations (23) of the paper; they force optimal plans for −∣y−x∣-|y-x|−∣y−x∣ onto two monotone graphs.

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. The statement is about any such Γ\GammaΓ, so it does not mention μ\muμ, ν\nuν or the plan.

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

open MeasureTheory

theorem eq_23 (Γ : 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|) α')
    (x ym yp x' y' : ℝ) (hm : (x, ym) ∈ Γ) (hp : (x, yp) ∈ Γ) (h' : (x', y') ∈ Γ)
    (hy : ym < y' ∧ y' < yp) :
    ¬ (y' ≤ x' ∧ x' < x) ∧ ¬ (x < x' ∧ x' ≤ y') := by sorry

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