Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1, p. 472 — for c = d, f = g^c for some g if and only if Lip(f) ≤ 1, and then f^c = −f

Proved
CompOT.W1.proposition_6_1

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

c-transformlipschitzoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1wasserstein

Let ddd be a distance on X=Y\mathcal X=\mathcal YX=Y and use the ground cost c(x,y)=d(x,y)c(x,y)=d(x,y)c(x,y)=d(x,y). For a function ggg on X\mathcal XX write gc(y)=inf⁡x∈Xd(x,y)−g(x)g^c(y)=\inf_{x\in\mathcal X} d(x,y)-g(x)gc(y)=infx∈X​d(x,y)−g(x) for its ccc-transform, and for fff write

Lip(f)=sup⁡{∣f(x)−f(y)∣d(x,y):(x,y)∈X2, x≠y}.\mathrm{Lip}(f)=\sup\left\{\frac{|f(x)-f(y)|}{d(x,y)} : (x,y)\in\mathcal X^2,\ x\ne y\right\}.Lip(f)=sup{d(x,y)∣f(x)−f(y)∣​:(x,y)∈X2, x=y}.

Then, for every real function fff on X\mathcal XX:

  1. there exists a continuous g:X→Rg:\mathcal X\to\mathbb Rg:X→R with f=gcf=g^cf=gc if and only if Lip(f)≤1\mathrm{Lip}(f)\le1Lip(f)≤1;
  2. if Lip(f)≤1\mathrm{Lip}(f)\le 1Lip(f)≤1, then fc=−ff^c=-ffc=−f.

The proposition characterizes the ccc-concave functions for a metric cost as exactly the 1-Lipschitz ones, and shows that their ccc-transform is simply −f-f−f. It is what reduces the Kantorovich dual problem for W1\mathcal W_1W1​ to a single 1-Lipschitz potential, i.e. to the Kantorovich–Rubinstein formula (6.1).

Formalization Note X\mathcal XX is any Lean MetricSpace; Lip(f)≤1\mathrm{Lip}(f)\le1Lip(f)≤1 is LipschitzWith 1 f, equivalent to the supremum above. The infimum defining gcg^cgc is taken in EReal, and "f=gcf=g^cf=gc" is an equality in EReal, so it includes that gcg^cgc is finite everywhere. The book's g∈C(Y)g\in\mathcal C(\mathcal Y)g∈C(Y) is kept as Continuous g; the book's f∈C(X)f\in\mathcal C(\mathcal X)f∈C(X) is not assumed, since each side of the equivalence already forces fff to be 1-Lipschitz, hence continuous.

Preamble
import Mathlib
import Definitions.Def_CompOT_W1_Defs
Formal statement
namespace CompOT.W1

/-- Proposition 6.1, p. 472. Let `d` be a distance on `X = Y` and `c(x, y) = d(x, y)`. Then a
real function `f` on `X` is of the form `f = g^c` for some continuous `g` if and only if
`Lip(f) ≤ 1`; furthermore, if `Lip(f) ≤ 1`, then `f^c = -f`. -/
theorem proposition_6_1 {X : Type*} [MetricSpace X] (f : X → ℝ) :
    ((∃ g : X → ℝ, Continuous g ∧ ∀ y, (f y : EReal) = cTransform g y) ↔
        LipschitzWith 1 f) ∧
      (LipschitzWith 1 f → ∀ y, cTransform f y = ((-f y : ℝ) : EReal)) := by sorry

end CompOT.W1
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Proposition 6.1, p. 472 (proof pp. 472–473)
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