Proof of Proposition 2.2, pp. 377–378 — W_p(a, b) > 0 whenever a ≠ b
ProvedCompOT.Metric.prop_2_2_posoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1wasserstein
Let be a distance on (symmetric, , triangle inequality), let , and let with . Then
Together with this is the definiteness of the Wasserstein distance: the off-diagonal entries of are positive, and every coupling of two distinct histograms puts mass off the diagonal.
Formalization Note is a real infimum over ; the strict inequality needs the infimum to be attained, which is a compactness fact to be proved, not a hypothesis.
Preamble
import Mathlib import Definitions.Def_CompOT_Metric_Defs
Formal statement
namespace CompOT.Metric
open Matrix
/-- Proof of Proposition 2.2, pp. 377–378: by the positivity of all off-diagonal
elements of `D^p`, `W_p(a, b) > 0` whenever `a ≠ b`. -/
theorem prop_2_2_pos {n : ℕ} (D : Matrix (Fin n) (Fin n) ℝ) (p : ℝ) (hp : 1 ≤ p)
(hD_nonneg : ∀ i j, 0 ≤ D i j)
(hD_symm : ∀ i j, D i j = D j i)
(hD_zero : ∀ i j, D i j = 0 ↔ i = j)
(hD_tri : ∀ i j k, D i k ≤ D i j + D j k)
(a b : Fin n → ℝ) (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin n))
(hab : a ≠ b) :
0 < W D p a b := by sorry
end CompOT.Metric
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), proof of Proposition 2.2, pp. 377–378
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.