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₂
ProvedMartOT.HN.theorem_7_3Let and be probability measures on in convex order, and assume that is continuous: for every . Consider the Hobson–Neuberger cost .
- There is a unique optimal martingale transport plan for , i.e. a unique minimizer of over .
- There are a Borel set with and two functions , nondecreasing on , such that
Minimizing maximizes the expected absolute displacement ; 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 nondecreasing on all of with for every . Read literally this is false whenever has bounded support and does not (for instance uniform on and the law of with independent, centred and unbounded): monotone real maps are bounded on , so a plan carried by their graphs over would have a boundedly supported second marginal. The paper's proof constructs on with for -almost every . The statement is therefore made on a Borel set of full -measure, as in the paper's Corollary 1.6. Continuity of is written for every . Uniqueness is among all optimal plans in .
import Mathlib import Definitions.Def_MartOT_Var_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.