Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Section 3, eq. (3.1) — weak Monge–Kantorovich duality

Proved
MongeKantorovichYao.weak_duality

by Lucas · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

dualitymeasure-theoryoptimal-transport

Let X,YX,YX,Y be measurable spaces, μ\muμ and ν\nuν measures on XXX and YYY, and c:X×Y→Rc : X\times Y\to\mathbb Rc:X×Y→R a cost function. Let π∈Π(μ,ν)\pi\in\Pi(\mu,\nu)π∈Π(μ,ν) be a transference plan with c∈L1(π)c\in L^1(\pi)c∈L1(π), and let ψ∈L1(μ)\psi\in L^1(\mu)ψ∈L1(μ), φ∈L1(ν)\varphi\in L^1(\nu)φ∈L1(ν) satisfy ψ(x)+φ(y)≤c(x,y)\psi(x)+\varphi(y)\le c(x,y)ψ(x)+φ(y)≤c(x,y) for all x∈Xx\in Xx∈X, y∈Yy\in Yy∈Y. Then

∫Xψ dμ+∫Yφ dν≤∫X×Yc dπ.\int_X\psi\,d\mu+\int_Y\varphi\,d\nu\le\int_{X\times Y}c\,d\pi .∫X​ψdμ+∫Y​φdν≤∫X×Y​cdπ.

Taking the infimum over plans and the supremum over admissible pairs gives the weak duality inequality (3.1): inf⁡π∫c dπ≥sup⁡ψ,φ(∫ψ dμ+∫φ dν)\inf_{\pi}\int c\,d\pi\ge\sup_{\psi,\varphi}\big(\int\psi\,d\mu+\int\varphi\,d\nu\big)infπ​∫cdπ≥supψ,φ​(∫ψdμ+∫φdν).

Formalization Note The statement is given plan-by-plan (equivalent to the inf/sup form). Integrability of ccc with respect to π\piπ is assumed so that ∫c dπ\int c\,d\pi∫cdπ is a genuine finite integral; the constraint ψ+φ≤c\psi+\varphi\le cψ+φ≤c is imposed at every point, as in the proof in the source.

Preamble
import Mathlib
import Definitions.Def_MongeKantorovichYao_Defs

open MeasureTheory
Formal statement
namespace MongeKantorovichYao

theorem weak_duality {X Y : Type*} [MeasurableSpace X] [MeasurableSpace Y]
    (μ : Measure X) (ν : Measure Y) (c : X × Y → ℝ)
    (π : Measure (X × Y)) (hπ : π ∈ transferencePlans μ ν)
    (ψ : X → ℝ) (φ : Y → ℝ) (hψ : Integrable ψ μ) (hφ : Integrable φ ν)
    (hc : Integrable c π) (hfeas : ∀ x y, ψ x + φ y ≤ c (x, y)) :
    ∫ x, ψ x ∂μ + ∫ y, φ y ∂ν ≤ ∫ p, c p ∂π := by sorry

end MongeKantorovichYao
Source
Colin Yao, *Monge–Kantorovich and Transportation Theory* (paper dated September 10, 2023), pp. 5–6, Section 3 (Weak Monge–Kantorovich), inequality (3.1) and its proof
Read-back

What the Lean code literally says, in plain math · Aristotle by Harmonic (same agent as the drafter; non-blind)

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement, with full knowledge of the source paper and of the intended meaning. It is not a blind audit and must not be mistaken for independent testimony; reviewers should compare the Lean code against the source themselves (or obtain an independent read-back).

Data. Arbitrary types X,YX,YX,Y with σ-algebras (no topology). Measures μ\muμ on XXX, ν\nuν on YYY (arbitrary), a function c:X×Y→Rc : X\times Y\to\mathbb Rc:X×Y→R, a measure π\piπ on X×YX\times YX×Y, and real functions ψ\psiψ on XXX, φ\varphiφ on YYY.

Hypotheses.

  1. π∈Π(μ,ν)\pi\in\Pi(\mu,\nu)π∈Π(μ,ν): π\piπ is a probability measure whose first-coordinate pushforward is μ\muμ and second-coordinate pushforward is ν\nuν (so μ,ν\mu,\nuμ,ν are forced to be probability measures).
  2. ψ\psiψ is Bochner-integrable with respect to μ\muμ; φ\varphiφ is integrable with respect to ν\nuν.
  3. ccc is integrable with respect to π\piπ.
  4. For all x∈Xx\in Xx∈X and y∈Yy\in Yy∈Y: ψ(x)+φ(y)≤c(x,y)\psi(x)+\varphi(y)\le c(x,y)ψ(x)+φ(y)≤c(x,y).

Conclusion.

∫Xψ dμ+∫Yφ dν ≤ ∫X×Yc dπ,\int_X\psi\,d\mu+\int_Y\varphi\,d\nu\ \le\ \int_{X\times Y}c\,d\pi,∫X​ψdμ+∫Y​φdν ≤ ∫X×Y​cdπ,

all three being ordinary real-valued (Bochner) integrals. It is a statement about one fixed plan and one fixed pair; no infimum or supremum appears.

Human review
  • Endorsed by Shuze Chen · Sep 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Sep 30, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me