Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.6, p. 9 — along a chain from a row of sum < 1, Λ_k[F^{r+2}] ≤ α₃^{r+2} − (α₃ − α₁)α₂^{r+1}

Proved
SubSuperStoch.SuperSpec.chain_rowSum_bound

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

nonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1row-sumsuper-stochastic-matrix

Let FFF be an n×nn\times nn×n super-stochastic matrix. Put

α1=max⁡{Λs[F]∣Λs[F]<1},α2=min⁡{[F]ij∣[F]ij>0},α3=max⁡{Λs[F]∣Λs[F]≥1},\alpha_1=\max\{\Lambda_s[F]\mid \Lambda_s[F]<1\},\qquad \alpha_2=\min\{[F]_{ij}\mid [F]_{ij}>0\},\qquad \alpha_3=\max\{\Lambda_s[F]\mid\Lambda_s[F]\ge 1\},α1​=max{Λs​[F]∣Λs​[F]<1},α2​=min{[F]ij​∣[F]ij​>0},α3​=max{Λs​[F]∣Λs​[F]≥1},

all three sets being non-empty. Let iii be a row with Λi[F]<1\Lambda_i[F]<1Λi​[F]<1, and let [F]kir,…,[F]i2i1,[F]i1i[F]_{ki_r},\dots,[F]_{i_2i_1},[F]_{i_1i}[F]kir​​,…,[F]i2​i1​​,[F]i1​i​ be a non-zero element chain of r+1≥1r+1\ge 1r+1≥1 elements from iii to kkk (every listed entry non-zero, consecutive indices distinct). Then

Λk[Fr+2]≤α3r+2−(α3−α1)α2r+1.\Lambda_k[F^{r+2}]\le \alpha_3^{r+2}-(\alpha_3-\alpha_1)\alpha_2^{r+1}.Λk​[Fr+2]≤α3r+2​−(α3​−α1​)α2r+1​.

This is the first step of the proof of Theorem 2.6: the deficit of the starting row is carried along the chain, so that the end row kkk of the chain has a row sum of Fr+2F^{r+2}Fr+2 strictly below the trivial bound α3r+2\alpha_3^{r+2}α3r+2​.

Formalization Note The chain is a function c:N→{1,…,n}c:\mathbb N\to\{1,\dots,n\}c:N→{1,…,n} with c0=ic_0=ic0​=i, cL=kc_L=kcL​=k, L=r+1≥1L=r+1\ge 1L=r+1≥1. The maxima and the minimum are passed as values α1,α2,α3\alpha_1,\alpha_2,\alpha_3α1​,α2​,α3​ together with the hypotheses that each is the greatest (least) element of exactly the printed set. The page states this for k∈R2k\in\mathcal R_2k∈R2​; the bound does not use Λk[F]≥1\Lambda_k[F]\ge1Λk​[F]≥1, so that hypothesis is not imposed.

Preamble
import Mathlib
import Definitions.Def_SubSuperStoch_SuperSpec_Setting
Formal statement
namespace SubSuperStoch.SuperSpec

theorem chain_rowSum_bound {n : ℕ} (F : Matrix (Fin n) (Fin n) ℝ)
    (hF : IsSuperStochastic F)
    (α₁ : ℝ) (hα₁ : IsGreatest {x | ∃ s, SubSuperStoch.SubSpec.rowSum F s < 1 ∧ x = SubSuperStoch.SubSpec.rowSum F s} α₁)
    (α₂ : ℝ) (hα₂ : IsLeast {x | ∃ i j, 0 < F i j ∧ x = F i j} α₂)
    (α₃ : ℝ) (hα₃ : IsGreatest {x | ∃ s, 1 ≤ SubSuperStoch.SubSpec.rowSum F s ∧ x = SubSuperStoch.SubSpec.rowSum F s} α₃)
    (i : Fin n) (hi : SubSuperStoch.SubSpec.rowSum F i < 1)
    (c : ℕ → Fin n) (L : ℕ) (hc0 : c 0 = i) (hL : 1 ≤ L) (hc : SubSuperStoch.SubSpec.IsChain F c L) :
    SubSuperStoch.SubSpec.rowSum (F ^ (L + 1)) (c L) ≤ α₃ ^ (L + 1) - (α₃ - α₁) * α₂ ^ L := by sorry

end SubSuperStoch.SuperSpec
Source
Shi, Zheng, Shao, Cheng, arXiv:2004.01867v2, p. 9, proof of Theorem 2.6, first display (α₁, α₂ as in Theorem 2.2, p. 5; α₃ as in Theorem 2.6)
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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