Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1.1 — product bounds e−2D≤xiyj≤e2De^{-2D}\le x_iy_j\le e^{2D}e−2D≤xi​yj​≤e2D from a minimizing pair

Proved
GlobalSinkhorn.product_bounds_of_radius

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

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

Let n≥2n\ge2n≥2, let A∈R≥0n×nA\in\mathbb R^{n\times n}_{\ge0}A∈R≥0n×n​ be row-stochastic, and let BBB be a doubly stochastic positive diagonal scaling of AAA; write D=D(A;B)D=D(A;B)D=D(A;B). Then there are positive vectors x,y∈R>0nx,y\in\mathbb R^n_{>0}x,y∈R>0n​ such that

  1. B=XAYB=XAYB=XAY with X=diag⁡(x)X=\operatorname{diag}(x)X=diag(x), Y=diag⁡(y)Y=\operatorname{diag}(y)Y=diag(y);
  2. min⁡ixi=min⁡jyj\min_ix_i=\min_jy_jmini​xi​=minj​yj​;
  3. for every pair of indices i,ji,ji,j,
e−2D≤xiyj≤e2D.e^{-2D}\le x_iy_j\le e^{2D}.e−2D≤xi​yj​≤e2D.

The bounds hold for all index pairs, including those outside the support of AAA. This is the step that turns the scaling radius into the product bound T=e2DT=e^{2D}T=e2D required by Theorem 3.1.

Differences from the source:

  • encoding: indices [n] = {1,…,n} → Fin n (0-based); reason: Lean convention; same instances
  • encoding: the pair X = a·diag(e^u), Y = a⁻¹·diag(e^{−v}) built from a minimizing pair (u, v) → ∃ x y with the three properties; reason: the minimizing pair is not unique, so the page's claim about the constructed pair is an existence statement; Theorem 3.1 consumes only existence
  • encoding: min_i x_i, min_j y_j → ⨅ i, x i and ⨅ j, y j over the nonempty finite type Fin n; reason: on a nonempty finite index set the real infimum is the minimum
Preamble
import Mathlib
import Definitions.Def_GlobalSinkhorn_IsPosDiagScaling
import Definitions.Def_GlobalSinkhorn_scalingRadius

open Matrix
Formal statement
namespace GlobalSinkhorn

/-- A minimizing pair of Definition 2.1, returned to the normalization `min x = min y`, gives
`e^{-2D} ≤ xᵢ yⱼ ≤ e^{2D}` for all index pairs. He, Global Sinkhorn Convergence and Spectral Stability of Matrix Scaling, manuscript (STOC 2027 submission, sha256 b452ef13…34ad), proof of Theorem 1.1, p.21.

**Formalization Note.** On the nonempty finite type `Fin n` the real `⨅` is the minimum. -/
theorem product_bounds_of_radius {n : ℕ} (hn : 2 ≤ n) (A B : Matrix (Fin n) (Fin n) ℝ)
    (hA : A ∈ Matrix.rowStochastic ℝ (Fin n))
    (hB : B ∈ doublyStochastic ℝ (Fin n))
    (hAB : ∃ x y : Fin n → ℝ, IsPosDiagScaling A B x y) :
    ∃ x y : Fin n → ℝ, IsPosDiagScaling A B x y ∧ (⨅ i, x i) = (⨅ j, y j) ∧
      ∀ i j, Real.exp (-(2 * scalingRadius A B)) ≤ x i * y j ∧
        x i * y j ≤ Real.exp (2 * scalingRadius A B) := by sorry

end GlobalSinkhorn
Source
He, Global Sinkhorn Convergence and Spectral Stability of Matrix Scaling, manuscript (STOC 2027 submission, sha256 b452ef1311fa669023fddd0c074df8a61571bf17b5712615c09d1495a34034ad), proof of Theorem 1.1, p.21
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