Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 (Birkhoff–Hopf), p. 440 — d_H(Kv, Kv′) ≤ λ(K) d_H(v, v′) with λ(K) < 1 for a positive matrix K

Proved
CompOT.Sinkhorn.theorem_4_1

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

birkhoff-hopfhilbert-projective-metricoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1perron-frobenius

Let n,m≥1n, m \ge 1n,m≥1 and let K∈Rn×mK \in \mathbb{R}^{n\times m}K∈Rn×m have positive entries. Define

η(K)=max⁡i,j,k,ℓKi,kKj,ℓKj,kKi,ℓ,λ(K)=η(K)−1η(K)+1.\eta(K) = \max_{i,j,k,\ell} \frac{K_{i,k}K_{j,\ell}}{K_{j,k}K_{i,\ell}}, \qquad \lambda(K) = \frac{\sqrt{\eta(K)}-1}{\sqrt{\eta(K)}+1}.η(K)=i,j,k,ℓmax​Kj,k​Ki,ℓ​Ki,k​Kj,ℓ​​,λ(K)=η(K)​+1η(K)​−1​.

Then λ(K)<1\lambda(K) < 1λ(K)<1, and for all v,v′∈Rmv, v' \in \mathbb{R}^mv,v′∈Rm with positive entries,

dH(Kv,Kv′)≤λ(K) dH(v,v′),d_{\mathcal H}(Kv, Kv') \le \lambda(K)\, d_{\mathcal H}(v, v'),dH​(Kv,Kv′)≤λ(K)dH​(v,v′),

where dHd_{\mathcal H}dH​ is Hilbert's projective metric.

This is the Birkhoff–Hopf theorem: a matrix with positive entries is a strict contraction of the positive cone for Hilbert's projective metric. It is the engine of the global linear convergence of Sinkhorn's algorithm (Theorem 4.2) and gives a quantitative Perron–Frobenius theorem (Remark 4.13).

Formalization Note The book quotes this theorem (Birkhoff 1957; Samelson et al. 1957) without proof.

Preamble
import Mathlib
import Definitions.Def_CompOT_Sinkhorn_Defs
Formal statement
namespace CompOT.Sinkhorn

open Matrix

/-- Theorem 4.1 (Birkhoff–Hopf), p. 440: a matrix with positive entries is a strict
contraction for Hilbert's projective metric, with ratio
`λ(K) = (√η(K) − 1)/(√η(K) + 1) < 1`. -/
theorem theorem_4_1 {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (K : Matrix (Fin n) (Fin m) ℝ) (hK : ∀ i j, 0 < K i j)
    (v v' : Fin m → ℝ) (hv : ∀ j, 0 < v j) (hv' : ∀ j, 0 < v' j) :
    hilbertMetric (K *ᵥ v) (K *ᵥ v') ≤ lam K * hilbertMetric v v' ∧ lam K < 1 := by sorry

end CompOT.Sinkhorn
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Remark 4.12, Theorem 4.1, p. 440
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