Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.6, p. 9 — Λ_i[F^{|C*|+1}] ≤ α₃^{|C*|+1} − (α₃ − α₁)α₂^{|C*|} < 1 for every row i of sum < 1

Proved
SubSuperStoch.SuperSpec.R1_rows_power_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 and 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\},\quad \alpha_2=\min\{[F]_{ij}\mid [F]_{ij}>0\},\quad \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 CCC be a natural number (in Theorem 2.6, C=∣C∗∣C=|\mathcal C^*|C=∣C∗∣) satisfying condition (2.5),

α3C+1−(α3−α1)α2CC<1.\sqrt[C]{\alpha_3^{C+1}-(\alpha_3-\alpha_1)\alpha_2^{C}}<1.Cα3C+1​−(α3​−α1​)α2C​​<1.

Then for every row iii with Λi[F]<1\Lambda_i[F]<1Λi​[F]<1,

Λi[FC+1]≤α3C+1−(α3−α1)α2C<1.\Lambda_i[F^{C+1}]\le \alpha_3^{C+1}-(\alpha_3-\alpha_1)\alpha_2^{C}<1.Λi​[FC+1]≤α3C+1​−(α3​−α1​)α2C​<1.

This is the third step of the proof of Theorem 2.6: the rows of sum less than one need no chain, because their own deficit already gives the bound.

Formalization Note The page writes the identity Λi[F∣C∗∣+1]=∑j[F]ijΛj[F∣C∗∣]\Lambda_i[F^{|\mathcal C^*|+1}]=\sum_j[F]_{ij}\Lambda_j[F^{|\mathcal C^*|}]Λi​[F∣C∗∣+1]=∑j​[F]ij​Λj​[F∣C∗∣] before the inequality; the statement keeps only the inequality and the final "<1<1<1". No chain hypothesis is assumed and CCC is an arbitrary natural number, since the bound holds for every CCC; the root is the real power x1/Cx^{1/C}x1/C.

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

theorem R1_rows_power_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} α₃)
    (C : ℕ) (h25 : (α₃ ^ (C + 1) - (α₃ - α₁) * α₂ ^ C) ^ (1 / (C : ℝ)) < 1) :
    ∀ i, SubSuperStoch.SubSpec.rowSum F i < 1 →
      SubSuperStoch.SubSpec.rowSum (F ^ (C + 1)) i ≤ α₃ ^ (C + 1) - (α₃ - α₁) * α₂ ^ C ∧
        α₃ ^ (C + 1) - (α₃ - α₁) * α₂ ^ C < 1 := by sorry

end SubSuperStoch.SuperSpec
Source
Shi, Zheng, Shao, Cheng, arXiv:2004.01867v2, p. 9, proof of Theorem 2.6, third display; condition (2.5)
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