Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7.4, p. 46 — for c = |y − x| the set of optimal martingale plans is convex

Proved
MartOT.Abs.optimizers_convex

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

absolute-value-costmartingale-optimal-transport

Let μ⪯Cν\mu\preceq_C\nuμ⪯C​ν be probability measures on R\mathbb RR and c(x,y)=∣y−x∣c(x,y)=|y-x|c(x,y)=∣y−x∣. If π\piπ and π′\pi'π′ are optimal martingale transport plans for ccc, then so is every convex combination tπ+(1−t)π′t\pi+(1-t)\pi'tπ+(1−t)π′, t∈[0,1]t\in[0,1]t∈[0,1].

The proof of Theorem 7.4 (p. 46) applies Lemma 5.6 to the set of optimizers, which requires it to be a nonempty convex set of martingale plans: ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν) is convex and π↦∫c dπ\pi\mapsto\int c\,d\piπ↦∫cdπ is affine, with finite values here since ∣y−x∣|y-x|∣y−x∣ is π\piπ-integrable.

Formalization Note Optimality is IsOptimal: π∈ΠM(μ,ν)\pi\in\Pi_M(\mu,\nu)π∈ΠM​(μ,ν) and ∫c dπ≤∫c dπ′\int c\,d\pi\le\int c\,d\pi'∫cdπ≤∫cdπ′ for all π′∈ΠM(μ,ν)\pi'\in\Pi_M(\mu,\nu)π′∈ΠM​(μ,ν), with costs in EReal. The combination is ofReal(t)⋅π+ofReal(1−t)⋅π′\mathrm{ofReal}(t)\cdot\pi+\mathrm{ofReal}(1-t)\cdot\pi'ofReal(t)⋅π+ofReal(1−t)⋅π′ as measures.

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

open MeasureTheory

theorem optimizers_convex (μ ν : Measure ℝ) [IsProbabilityMeasure μ]
    [IsProbabilityMeasure ν] (hμν : MartOT.Var.ConvexLE μ ν) (π π' : Measure (ℝ × ℝ))
    (hπ : MartOT.Var.IsOptimal (fun x y => |y - x|) μ ν π)
    (hπ' : MartOT.Var.IsOptimal (fun x y => |y - x|) μ ν π')
    (t : ℝ) (ht : t ∈ Set.Icc (0 : ℝ) 1) :
    MartOT.Var.IsOptimal (fun x y => |y - x|) μ ν
      (ENNReal.ofReal t • π + ENNReal.ofReal (1 - t) • π') := by sorry

end MartOT.Abs
Source
arXiv:1208.1509v2 (Beiglböck–Juillet), proof of Theorem 7.4, p. 46 (the set of optimizers to which Lemma 5.6, p. 36, is applied is convex)

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