Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7.3, p. 45 — on a finitely optimal Γ for c = −|y − x|, maps T₁ ≤ id ≤ T₂ with graphs in Γ are nondecreasing

Proved
MartOT.HN.graphs_monotone

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

hobson-neubergermartingale-optimal-transportmonotonicityp2o-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 S⊆RS\subseteq\mathbb RS⊆R and T1,T2T_1,T_2T1​,T2​ be real functions such that, for every x∈Sx\in Sx∈S, (x,T1(x))∈Γ(x,T_1(x))\in\Gamma(x,T1​(x))∈Γ, (x,T2(x))∈Γ(x,T_2(x))\in\Gamma(x,T2​(x))∈Γ and

T1(x)≤x≤T2(x).T_1(x)\le x\le T_2(x).T1​(x)≤x≤T2​(x).

Then T1T_1T1​ and T2T_2T2​ are nondecreasing on SSS.

This is the monotonicity step of Theorem 7.3: the two maps describing an optimal plan for −∣y−x∣-|y-x|−∣y−x∣ are nondecreasing.

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 page assumes Γx={T1(x),T2(x)}\Gamma_x=\{T_1(x),T_2(x)\}Γx​={T1​(x),T2​(x)}; only the inclusion {T1(x),T2(x)}⊆Γx\{T_1(x),T_2(x)\}\subseteq\Gamma_x{T1​(x),T2​(x)}⊆Γx​ is assumed here, which makes the statement stronger. The page's "for μ\muμ-almost every xxx" is built into the choice of SSS.

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

open MeasureTheory

theorem graphs_monotone (Γ : 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|) α')
    (S : Set ℝ) (T₁ T₂ : ℝ → ℝ) (h₁ : ∀ x ∈ S, (x, T₁ x) ∈ Γ) (h₂ : ∀ x ∈ S, (x, T₂ x) ∈ Γ)
    (hT : ∀ x ∈ S, T₁ x ≤ x ∧ x ≤ T₂ x) :
    MonotoneOn T₁ S ∧ MonotoneOn T₂ S := by sorry

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