Proof of Proposition 6.1, pp. 472–473 — if Lip(f) ≤ 1 then g = −f satisfies g^c = f
ProvedCompOT.W1.prop_6_1_cTransform_negc-transformlipschitzoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be a metric space with cost and let satisfy . Put . Then for every ,
Hence every 1-Lipschitz function is a -transform, with the explicit choice ; this is the "if" half of Proposition 6.1.
Formalization Note is LipschitzWith 1 f; the infimum is the EReal infimum of the -transform definition and the conclusion is an equality in EReal.
Preamble
import Mathlib import Definitions.Def_CompOT_W1_Defs
Formal statement
namespace CompOT.W1
/-- Proof of Proposition 6.1, pp. 472–473 (second paragraph): if `Lip(f) ≤ 1`, then
`g = -f` satisfies `g^c = f`, i.e. `inf_{x ∈ X} [d(x, y) + f(x)] = f(y)` for every `y`. -/
theorem prop_6_1_cTransform_neg {X : Type*} [MetricSpace X] (f : X → ℝ)
(hf : LipschitzWith 1 f) :
∀ y, cTransform (fun x => -f x) y = (f y : EReal) := by sorry
end CompOT.W1
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §6.1, proof of Proposition 6.1, second paragraph, pp. 472–473
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.