Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (27)–(28) — 0<F(w)≤Pw0<\mathcal F(w)\le Pw0<F(w)≤Pw and F(w)−1≤P(w−1)\mathcal F(w)^{-1}\le P(w^{-1})F(w)−1≤P(w−1)

Proved
GlobalSinkhorn.F_le_P

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

doubly-stochasticmatrix-scalingp2o-gran-per-chapterp2o-plan-paperp2o-v1sinkhorn-knoppspectral-gap

Let n≥1n\ge1n≥1, let SSS be a nonnegative doubly stochastic n×nn\times nn×n matrix, put P=S⊤SP=S^\top SP=S⊤S, and let w∈R>0nw\in\mathbb R^n_{>0}w∈R>0n​. Then

  1. (Sw)i>0(Sw)_i>0(Sw)i​>0 for every iii;
  2. F(w)j>0\mathcal F(w)_j>0F(w)j​>0 for every jjj;
  3. F(w)≤Pw\mathcal F(w)\le PwF(w)≤Pw componentwise;
  4. F(w)−1≤P(w−1)\mathcal F(w)^{-1}\le P(w^{-1})F(w)−1≤P(w−1) componentwise,

where F(w)=[S⊤(Sw)−1]−1\mathcal F(w)=[S^\top(Sw)^{-1}]^{-1}F(w)=[S⊤(Sw)−1]−1 and reciprocals are componentwise. Items 1–2 make M(w)M(w)M(w) and F(w)\mathcal F(w)F(w) well defined; items 3–4 (Cauchy–Schwarz and Jensen) reduce the potential of F(w)\mathcal F(w)F(w) to second moments of PwPwPw and P(w−1)P(w^{-1})P(w−1).

Differences from the source:

  • encoding: indices [n] = {1,…,n} → Fin n (0-based); reason: Lean convention; same instances
  • encoding: n a positive integer (p.13: n ∈ ℤ_{>0}) → hypothesis 0 < n; reason: the paper's standing convention made explicit
  • encoding: S nonnegative and doubly stochastic → S ∈ doublyStochastic ℝ (Fin n) (entries ≥ 0, all row and column sums 1); reason: Mathlib's doubly stochastic matrices are exactly the paper's
  • encoding: M(w), F(w) defined with (Sw)⁻¹ and [Sᵀ(Sw)⁻¹]⁻¹ for w > 0 → Lean's total inverse in Mw, Fw; reason: for w > 0 and doubly stochastic S every inverted entry is positive (p.15), so the junk value 0 is never used
  • encoding: vector inequalities "componentwise" → ∀ j, …; reason: written out
Preamble
import Mathlib
import Definitions.Def_GlobalSinkhorn_Fw

open Matrix
Formal statement
namespace GlobalSinkhorn

/-- `S w > 0`, `F(w) > 0`, `F(w) ≤ P w` and `F(w)⁻¹ ≤ P(w⁻¹)` componentwise, with `P = SᵀS`.
He, Global Sinkhorn Convergence and Spectral Stability of Matrix Scaling, manuscript (STOC 2027 submission, sha256 b452ef13…34ad), p.15 after Eq. (22) and proof of Lemma 3.2, Eqs. (27)–(28), pp.16–17. -/
theorem F_le_P {n : ℕ} (hn : 0 < n) (S : Matrix (Fin n) (Fin n) ℝ)
    (hS : S ∈ doublyStochastic ℝ (Fin n)) (w : Fin n → ℝ) (hw : ∀ j, 0 < w j) :
    (∀ i, 0 < (S *ᵥ w) i) ∧ (∀ j, 0 < Fw S w j) ∧
      (∀ j, Fw S w j ≤ ((Sᵀ * S) *ᵥ w) j) ∧
      ∀ j, (Fw S w j)⁻¹ ≤ ((Sᵀ * S) *ᵥ (fun k => (w k)⁻¹)) j := by sorry

end GlobalSinkhorn
Source
He, Global Sinkhorn Convergence and Spectral Stability of Matrix Scaling, manuscript (STOC 2027 submission, sha256 b452ef1311fa669023fddd0c074df8a61571bf17b5712615c09d1495a34034ad), p.15 after Eq. (22), and proof of Lemma 3.2, Eqs. (27)–(28), pp.16–17
Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 6, 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