Remark 4.12, p. 439 — d_H is a distance on the projective cone: triangle inequality, d_H(u, u′) = 0 iff u = r u′
ProvedCompOT.Sinkhorn.remark_4_12_distancehilbert-projective-metricmetricoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Let and let have positive entries. Hilbert's projective metric is a distance on the rays of the positive cone:
- ;
- ;
- ;
- if and only if for some .
That is, is a metric on the projective cone , where means that the two vectors agree up to a positive factor. The triangle inequality is the tool behind the a posteriori bound (4.23) in the proof of Theorem 4.2.
Formalization Note The book states "distance" and spells out the triangle inequality and the zero set; nonnegativity and symmetry, which "distance" includes, are stated explicitly.
Preamble
import Mathlib import Definitions.Def_CompOT_Sinkhorn_Defs
Formal statement
namespace CompOT.Sinkhorn
/-- Remark 4.12, p. 439: `d_H` is a distance on the projective cone of positive vectors:
it is nonnegative and symmetric, satisfies the triangle inequality, and
`d_H(u, u') = 0` if and only if `u = r u'` for some `r > 0`. -/
theorem remark_4_12_distance {n : ℕ} (hn : 0 < n) (u u' u'' : Fin n → ℝ)
(hu : ∀ i, 0 < u i) (hu' : ∀ i, 0 < u' i) (hu'' : ∀ i, 0 < u'' i) :
0 ≤ hilbertMetric u u' ∧
hilbertMetric u u' = hilbertMetric u' u ∧
hilbertMetric u u'' ≤ hilbertMetric u u' + hilbertMetric u' u'' ∧
(hilbertMetric u u' = 0 ↔ ∃ r : ℝ, 0 < r ∧ u = r • u') := by sorry
end CompOT.Sinkhorn
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Remark 4.12, p. 439
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.