Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.3, p. 43 — for c = −|y − x| and continuous µ the optimal martingale plan is unique and lives on two nondecreasing graphs T₁ ≤ id ≤ T₂

Proved
MartOT.HN.theorem_7_3

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

hobson-neubergermartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1uniqueness

Let μ\muμ and ν\nuν be probability measures on R\mathbb RR in convex order, and assume that μ\muμ is continuous: μ({x})=0\mu(\{x\})=0μ({x})=0 for every x∈Rx\in\mathbb Rx∈R. Consider the Hobson–Neuberger cost c(x,y)=−∣y−x∣c(x,y)=-|y-x|c(x,y)=−∣y−x∣.

  1. There is a unique optimal martingale transport plan πHN∈ΠM(μ,ν)\pi_{\mathrm{HN}}\in\Pi_M(\mu,\nu)πHN​∈ΠM​(μ,ν) for ccc, i.e. a unique minimizer of π↦∫c dπ\pi\mapsto\int c\,d\piπ↦∫cdπ over ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν).
  2. There are a Borel set S⊆RS\subseteq\mathbb RS⊆R with μ(R∖S)=0\mu(\mathbb R\setminus S)=0μ(R∖S)=0 and two functions T1,T2T_1,T_2T1​,T2​, nondecreasing on SSS, such that
T1(x)≤x≤T2(x)(x∈S),πHN({(x,y):x∈S, y∈{T1(x),T2(x)}})=1.T_1(x)\le x\le T_2(x)\quad(x\in S),\qquad \pi_{\mathrm{HN}}\Big(\big\{(x,y):x\in S,\ y\in\{T_1(x),T_2(x)\}\big\}\Big)=1 .T1​(x)≤x≤T2​(x)(x∈S),πHN​({(x,y):x∈S, y∈{T1​(x),T2​(x)}})=1.

Minimizing −∣y−x∣-|y-x|−∣y−x∣ maximizes the expected absolute displacement ∫∣y−x∣ dπ\int|y-x|\,d\pi∫∣y−x∣dπ; Hobson and Neuberger studied this problem for the robust pricing of forward-start straddles. The theorem identifies the optimizer as a plan that splits each starting point into at most two destinations, one below and one above, along two monotone maps.

Formalization Note The paper states T1,T2:R→RT_1,T_2:\mathbb R\to\mathbb RT1​,T2​:R→R nondecreasing on all of R\mathbb RR with T1(x)≤x≤T2(x)T_1(x)\le x\le T_2(x)T1​(x)≤x≤T2​(x) for every xxx. Read literally this is false whenever μ\muμ has bounded support and ν\nuν does not (for instance μ\muμ uniform on [0,1][0,1][0,1] and ν\nuν the law of U+ZU+ZU+Z with ZZZ independent, centred and unbounded): monotone real maps are bounded on [0,1][0,1][0,1], so a plan carried by their graphs over [0,1][0,1][0,1] would have a boundedly supported second marginal. The paper's proof constructs T1,T2T_1,T_2T1​,T2​ on proj⁡x(Γ)\operatorname{proj}^x(\Gamma)projx(Γ) with T1(x)≤x≤T2(x)T_1(x)\le x\le T_2(x)T1​(x)≤x≤T2​(x) for μ\muμ-almost every xxx. The statement is therefore made on a Borel set SSS of full μ\muμ-measure, as in the paper's Corollary 1.6. Continuity of μ\muμ is written μ({x})=0\mu(\{x\})=0μ({x})=0 for every xxx. Uniqueness is among all optimal plans in ΠM(μ,ν)\Pi_M(\mu,\nu)ΠM​(μ,ν).

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

open MeasureTheory

theorem theorem_7_3 (μ ν : Measure ℝ) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]
    (hμν : MartOT.Var.ConvexLE μ ν) (hμc : ∀ x : ℝ, μ {x} = 0) :
    ∃ π : Measure (ℝ × ℝ), MartOT.Var.IsOptimal (fun x y => -|y - x|) μ ν π ∧
      (∀ π' : Measure (ℝ × ℝ), MartOT.Var.IsOptimal (fun x y => -|y - x|) μ ν π' → π' = π) ∧
      ∃ (S : Set ℝ) (T₁ T₂ : ℝ → ℝ), MeasurableSet S ∧ μ Sᶜ = 0 ∧
        MonotoneOn T₁ S ∧ MonotoneOn T₂ S ∧ (∀ x ∈ S, T₁ x ≤ x ∧ x ≤ T₂ x) ∧
        π {p : ℝ × ℝ | ¬ (p.1 ∈ S ∧ (p.2 = T₁ p.1 ∨ p.2 = T₂ p.1))} = 0 := by sorry

end MartOT.HN
Source
arXiv:1208.1509v2, Theorem 7.3, p. 43 (proof pp. 44–45)
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