Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.6, p. 12 (necessity) — a martingale transport plan in Π_M(µ, ν) forces µ ⪯C ν (Jensen)

Proved
MartOT.Abs.theorem_2_6_necessity

by tianyipeng · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-orderjensenmartingale-optimal-transport

Let μ,ν∈M\mu,\nu\in\mathcal Mμ,ν∈M, i.e. finite measures on R\mathbb RR with finite first moment. If there exists a martingale transport plan π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν), then μ⪯Cν\mu\preceq_C\nuμ⪯C​ν: for every convex φ:R→R\varphi:\mathbb R\to\mathbb Rφ:R→R,

∫φ dμ≤∫φ dν.\int\varphi\,d\mu\le\int\varphi\,d\nu .∫φdμ≤∫φdν.

This is the necessity half of Theorem 2.6 of the paper, which it derives from Jensen's inequality: ∫φ(y) dν(y)=∬φ(y) dπx(y) dμ(x)≥∫φ(x) dμ(x)\int\varphi(y)\,d\nu(y)=\iint\varphi(y)\,d\pi_x(y)\,d\mu(x)\ge\int\varphi(x)\,d\mu(x)∫φ(y)dν(y)=∬φ(y)dπx​(y)dμ(x)≥∫φ(x)dμ(x).

Formalization Note ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν) is IsMartingalePlan (marginals μ,ν\mu,\nuμ,ν and ∫ρ(x)(y−x) dπ=0\int\rho(x)(y-x)\,d\pi=0∫ρ(x)(y−x)dπ=0 for all bounded Borel ρ\rhoρ, the paper's (4)); ⪯C\preceq_C⪯C​ is ConvexLE (Definition 2.1), whose integrals ∫φ dμ∈[−∞,+∞]\int\varphi\,d\mu\in[-\infty,+\infty]∫φdμ∈[−∞,+∞] are computed as ∫φ+−∫φ−\int\varphi^+-\int\varphi^-∫φ+−∫φ− in EReal. The measures need not be probability measures, as in the paper's class M\mathcal MM.

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

open MeasureTheory

theorem theorem_2_6_necessity (μ ν : Measure ℝ) (hμ : MartOT.Var.InM μ) (hν : MartOT.Var.InM ν)
    (π : Measure (ℝ × ℝ)) (hπ : MartOT.Var.IsMartingalePlan μ ν π) :
    MartOT.Var.ConvexLE μ ν := by sorry

end MartOT.Abs
Source
arXiv:1208.1509v2 (Beiglböck–Juillet, On a problem of optimal transport under marginal martingale constraints), Theorem 2.6, p. 12 — necessity, proved on p. 12 by Jensen's inequality

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