Proof of Theorem 6.1, p. 37 — for c = h(y − x), h′ strictly convex, the rerouting of the forbidden configuration is strictly cheaper
ProvedMartOT.Opt.reroute_cheaperconvexitymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis
Let be differentiable with strictly convex derivative , and let . Let , and with . Then
The left side is the cost of the three-point measure sitting on the forbidden configuration of Definition 1.4, the right side the cost of its competitor ; so an optimal martingale plan cannot charge such a configuration.
Formalization Note The cost is a function with the hypothesis for all . No measure appears; the statement is about real numbers.
Preamble
import Mathlib import Definitions.Def_MartOT_Var_Setting
Formal statement
namespace MartOT.Opt
open MeasureTheory
theorem reroute_cheaper (h : ℝ → ℝ) (hd : Differentiable ℝ h)
(hconv : StrictConvexOn ℝ Set.univ (deriv h)) (c : ℝ → ℝ → ℝ)
(hc : ∀ x y, c x y = h (y - x)) (x x' ym yp y' l : ℝ) (hx : x < x')
(hym : ym < y') (hyp : y' < yp) (hl0 : 0 < l) (hl1 : l < 1)
(hcomb : l * yp + (1 - l) * ym = y') :
l * c x yp + (1 - l) * c x ym + c x' y' > l * c x' yp + (1 - l) * c x' ym + c x y' := by sorry
end MartOT.Opt
Source
arXiv:1208.1509v2, proof of Theorem 6.1, p. 37 (unnumbered: "It leads to smaller costs if and only if …")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.