Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (16), proof of Theorem 6.3, p. 38 — ∫ ϕ(x)ψ(y) dπ = ∫_0^∞ ∫ ψ dν^π_{ϕ^{-1}(t)} dt

Proved
MartOT.Product.eq_16

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

layer-cakemartingale-optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-cost

Let μ\muμ be a finite Borel measure on R\mathbb RR, ν\nuν a Borel measure on R\mathbb RR and π\piπ a transport plan from μ\muμ to ν\nuν. Let ψ:R→[0,∞)\psi:\mathbb R\to[0,\infty)ψ:R→[0,∞) be Borel measurable and φ:R→[0,∞)\varphi:\mathbb R\to[0,\infty)φ:R→[0,∞) nonincreasing. For t>0t>0t>0 let {φ≥t}={x∈R:t≤φ(x)}\{\varphi\ge t\}=\{x\in\mathbb R:t\le\varphi(x)\}{φ≥t}={x∈R:t≤φ(x)}, a left half-line, and let

ν{φ≥t}π=proj#y(π∣{φ≥t}×R)\nu^\pi_{\{\varphi\ge t\}}=\mathrm{proj}^y_\#\big(\pi|_{\{\varphi\ge t\}\times\mathbb R}\big)ν{φ≥t}π​=proj#y​(π∣{φ≥t}×R​)

be the image under π\piπ of the part of μ\muμ sitting on {φ≥t}\{\varphi\ge t\}{φ≥t}. Then, in [0,∞][0,\infty][0,∞],

∫φ(x) ψ(y) dπ(x,y)=∫0+∞(∫ψ(y) dν{φ≥t}π(y)) dt.\int\varphi(x)\,\psi(y)\,d\pi(x,y)=\int_0^{+\infty}\Big(\int\psi(y)\,d\nu^\pi_{\{\varphi\ge t\}}(y)\Big)\,dt .∫φ(x)ψ(y)dπ(x,y)=∫0+∞​(∫ψ(y)dν{φ≥t}π​(y))dt.

This layer-cake representation reduces the cost of a plan for the product cost c(x,y)=φ(x)ψ(y)c(x,y)=\varphi(x)\psi(y)c(x,y)=φ(x)ψ(y) to a superposition of the costs ∫ψ dνuπ\int\psi\,d\nu^\pi_u∫ψdνuπ​ of the left parts of μ\muμ, which the left-curtain coupling minimizes one at a time.

Formalization Note The page writes the inner measure as νφ−1(t)π\nu^\pi_{\varphi^{-1}(t)}νφ−1(t)π​ with φ−1(t)=sup⁡{x:t≤φ(x)}\varphi^{-1}(t)=\sup\{x:t\le\varphi(x)\}φ−1(t)=sup{x:t≤φ(x)}, i.e. the restriction to (−∞,φ−1(t)](-\infty,\varphi^{-1}(t)](−∞,φ−1(t)]. For a nonincreasing φ\varphiφ the superlevel set {φ≥t}\{\varphi\ge t\}{φ≥t} is (−∞,φ−1(t)](-\infty,\varphi^{-1}(t)](−∞,φ−1(t)] or (−∞,φ−1(t))(-\infty,\varphi^{-1}(t))(−∞,φ−1(t)); the two differ by one point, which matters when μ\muμ has an atom there, and only for ttt in the jumps of φ\varphiφ. The statement uses the superlevel set, for which (16) holds exactly. The page's ψ\psiψ is strictly convex and φ\varphiφ is decreasing; here only measurability of ψ\psiψ and monotonicity of φ\varphiφ are assumed (a stronger statement). The integrals are lower Lebesgue integrals of nonnegative functions; for c≥0c\ge0c≥0 the left side is the cost Eπ[c]E_\pi[c]Eπ​[c] of the Setting layer.

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

open MeasureTheory

/-- **(16)** (proof of Theorem 6.3, p. 38), the layer-cake representation of the cost
`c(x, y) = ϕ(x)ψ(y)` of a plan `π` from `μ`: with `ν^π_{\{ϕ ≥ t\}} = proj^y_# π|_{\{ϕ ≥ t\}×ℝ}`,
`∫ ϕ(x)ψ(y) dπ = ∫_0^∞ ∫ ψ dν^π_{\{ϕ ≥ t\}} dt` in `[0, ∞]`. -/
theorem eq_16 (μ ν : Measure ℝ) [IsFiniteMeasure μ] (π : Measure (ℝ × ℝ)) (hπ : MartOT.Var.IsPlan μ ν π)
    (ψ ϕ : ℝ → ℝ) (hψ0 : ∀ y, 0 ≤ ψ y) (hψ : Measurable ψ) (hϕ0 : ∀ x, 0 ≤ ϕ x)
    (hϕ : Antitone ϕ) :
    ∫⁻ p, ENNReal.ofReal (ϕ p.1 * ψ p.2) ∂π =
      ∫⁻ t in Set.Ioi (0 : ℝ),
        ∫⁻ y, ENNReal.ofReal (ψ y) ∂((π.restrict ({x | t ≤ ϕ x} ×ˢ Set.univ)).map Prod.snd) := by sorry

end MartOT.Product
Source
arXiv:1208.1509v2, §6, proof of Theorem 6.3, eq. (16), p. 38
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