Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
SubSuperStoch.SuperSpec.R2_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 let R1={s∣Λs[F]<1}\mathcal R_1=\{s\mid\Lambda_s[F]<1\}R1​={s∣Λs​[F]<1} and R2={s∣Λs[F]≥1}\mathcal R_2=\{s\mid\Lambda_s[F]\ge1\}R2​={s∣Λs​[F]≥1} be non-empty. Suppose that for each k∈R2k\in\mathcal R_2k∈R2​ a non-zero element chain Ci→k=[F]kir,…,[F]i2i1,[F]i1i\mathcal C_{i\to k}=[F]_{ki_r},\dots,[F]_{i_2i_1},[F]_{i_1i}Ci→k​=[F]kir​​,…,[F]i2​i1​​,[F]i1​i​ with i∈R1i\in\mathcal R_1i∈R1​ is given, and let ∣C∗∣|\mathcal C^*|∣C∗∣ be the largest number of elements of these chains. With

α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},

assume condition (2.5):

α3∣C∗∣+1−(α3−α1)α2∣C∗∣∣C∗∣<1.\sqrt[|\mathcal C^*|]{\alpha_3^{|\mathcal C^*|+1}-(\alpha_3-\alpha_1)\alpha_2^{|\mathcal C^*|}}<1.∣C∗∣α3∣C∗∣+1​−(α3​−α1​)α2∣C∗∣​​<1.

Then for every k∈R2k\in\mathcal R_2k∈R2​,

Λk[F∣C∗∣+1]≤α3∣C∗∣+1−(α3−α1)α2∣C∗∣<1.\Lambda_k[F^{|\mathcal C^*|+1}]\le \alpha_3^{|\mathcal C^*|+1}-(\alpha_3-\alpha_1)\alpha_2^{|\mathcal C^*|}<1.Λk​[F∣C∗∣+1]≤α3∣C∗∣+1​−(α3​−α1​)α2∣C∗∣​<1.

This is the second step of the proof of Theorem 2.6: it lifts the chain bound from Fr+2F^{r+2}Fr+2 to the common power F∣C∗∣+1F^{|\mathcal C^*|+1}F∣C∗∣+1 for every row of sum at least one.

Formalization Note The chosen chains are given by a length function len\mathrm{len}len on rows: for each k∈R2k\in\mathcal R_2k∈R2​ there are i∈R1i\in\mathcal R_1i∈R1​ and a chain from iii to kkk of len(k)≥1\mathrm{len}(k)\ge1len(k)≥1 elements, and ∣C∗∣=C|\mathcal C^*|=C∣C∗∣=C is the greatest of len(k)\mathrm{len}(k)len(k) over k∈R2k\in\mathcal R_2k∈R2​. The ∣C∗∣|\mathcal C^*|∣C∗∣-th root is the real power x1/Cx^{1/C}x1/C; its radicand is nonnegative under the hypotheses (α2≤α3\alpha_2\le\alpha_3α2​≤α3​ and α1≥0\alpha_1\ge0α1​≥0), and since C≥1C\ge1C≥1 condition (2.5) is equivalent to α3C+1−(α3−α1)α2C<1\alpha_3^{C+1}-(\alpha_3-\alpha_1)\alpha_2^{C}<1α3C+1​−(α3​−α1​)α2C​<1.

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

theorem R2_rows_power_bound {n : ℕ} (F : Matrix (Fin n) (Fin n) ℝ) (hF : IsSuperStochastic F)
    (hR₁ : ∃ s, SubSuperStoch.SubSpec.rowSum F s < 1) (hR₂ : ∃ s, 1 ≤ SubSuperStoch.SubSpec.rowSum F s)
    (len : Fin n → ℕ)
    (hchain : ∀ k, 1 ≤ SubSuperStoch.SubSpec.rowSum F k → ∃ i, SubSuperStoch.SubSpec.rowSum F i < 1 ∧
      ∃ c : ℕ → Fin n, c 0 = i ∧ c (len k) = k ∧ 1 ≤ len k ∧ SubSuperStoch.SubSpec.IsChain F c (len k))
    (α₁ : ℝ) (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 : ℕ) (hC : IsGreatest {m | ∃ k, 1 ≤ SubSuperStoch.SubSpec.rowSum F k ∧ m = len k} C)
    (h25 : (α₃ ^ (C + 1) - (α₃ - α₁) * α₂ ^ C) ^ (1 / (C : ℝ)) < 1) :
    ∀ k, 1 ≤ SubSuperStoch.SubSpec.rowSum F k →
      SubSuperStoch.SubSpec.rowSum (F ^ (C + 1)) k ≤ α₃ ^ (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, second 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