Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6.1, (15), p. 37 — d(t) = λh(y⁺ − t) + (1 − λ)h(y⁻ − t) − h(y′ − t) is strictly decreasing when h′ is strictly convex

Proved
MartOT.Opt.d_strictAnti

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

convexitymartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let h:R→Rh:\mathbb R\to\mathbb Rh:R→R be differentiable with strictly convex derivative h′h'h′. Let y−<y′<y+y^-<y'<y^+y−<y′<y+ and λ∈(0,1)\lambda\in(0,1)λ∈(0,1) with λy++(1−λ)y−=y′\lambda y^+ + (1-\lambda)y^- = y'λy++(1−λ)y−=y′. Then the function

d(t)=λ h(y+−t)+(1−λ) h(y−−t)−h(y′−t),t∈R,d(t)=\lambda\,h(y^+-t)+(1-\lambda)\,h(y^--t)-h(y'-t),\qquad t\in\mathbb R,d(t)=λh(y+−t)+(1−λ)h(y−−t)−h(y′−t),t∈R,

is strictly decreasing on R\mathbb RR.

For the cost c(x,y)=h(y−x)c(x,y)=h(y-x)c(x,y)=h(y−x) this is the function (15), d(t)=λc(t,y+)+(1−λ)c(t,y−)−c(t,y′)d(t)=\lambda c(t,y^+)+(1-\lambda)c(t,y^-)-c(t,y')d(t)=λc(t,y+)+(1−λ)c(t,y−)−c(t,y′); its monotonicity is the analytic heart of the optimality of the left-curtain coupling.

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

open MeasureTheory

theorem d_strictAnti (h : ℝ → ℝ) (hd : Differentiable ℝ h)
    (hconv : StrictConvexOn ℝ Set.univ (deriv h)) (ym yp y' l : ℝ)
    (hym : ym < y') (hyp : y' < yp) (hl0 : 0 < l) (hl1 : l < 1)
    (hcomb : l * yp + (1 - l) * ym = y') :
    StrictAnti (fun t : ℝ => l * h (yp - t) + (1 - l) * h (ym - t) - h (y' - t)) := by sorry

end MartOT.Opt
Source
arXiv:1208.1509v2, proof of Theorem 6.1, display (15) and the lines after it, p. 37
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