Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.2, p. 5 — Λ_k[F^{|C*|+1}] ≤ 1 − (1 − α₁)α₂^{|C*|} < 1 for every unit row k ∈ S₂

Proved
SubSuperStoch.SubSpec.unit_rows_power_bound

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

matrix-powernonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1row-sumsub-stochastic-matrix

Let FFF be an n×nn\times nn×n sub-stochastic matrix with S1={s∣Λs[F]<1}\mathcal S_1=\{s\mid\Lambda_s[F]<1\}S1​={s∣Λs​[F]<1} and S2={s∣Λs[F]=1}\mathcal S_2=\{s\mid \Lambda_s[F]=1\}S2​={s∣Λs​[F]=1} non-empty. Suppose that for each k∈S2k\in\mathcal S_2k∈S2​ a non-zero element chain Ci→k\mathcal C_{i\to k}Ci→k​ starting at some i∈S1i\in\mathcal S_1i∈S1​ is given, and let

∣C∗∣=max⁡{∣Ci→k∣∣i∈S1, k∈S2}|\mathcal C^*|=\max\{|\mathcal C_{i\to k}|\mid i\in\mathcal S_1,\ k\in\mathcal S_2\}∣C∗∣=max{∣Ci→k​∣∣i∈S1​, k∈S2​}

be the largest number of elements among these chains. With α1\alpha_1α1​ and α2\alpha_2α2​ as in Theorem 2.2, every k∈S2k\in\mathcal S_2k∈S2​ satisfies

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

This is the step of the proof of Theorem 2.2 that passes from the bound at the end of each chain to a single power of FFF common to all rows of sum one.

Formalization Note The chosen chain for kkk has length len k (one chain per k∈S2k\in\mathcal S_2k∈S2​, as the hypothesis of Theorem 2.2 provides), and ∣C∗∣|\mathcal C^*|∣C∗∣ is C with IsGreatest {m | ∃ k, rowSum F k = 1 ∧ m = len k} C.

Preamble
import Mathlib
import Definitions.Def_SubSuperStoch_SubSpec_Setting
Formal statement
namespace SubSuperStoch.SubSpec

theorem unit_rows_power_bound {n : ℕ} (F : Matrix (Fin n) (Fin n) ℝ) (hF : IsSubStochastic F)
    (hS₁ : ∃ s, rowSum F s < 1) (hS₂ : ∃ s, rowSum F s = 1)
    (len : Fin n → ℕ)
    (hchain : ∀ k, rowSum F k = 1 → ∃ i, rowSum F i < 1 ∧
      ∃ c : ℕ → Fin n, c 0 = i ∧ c (len k) = k ∧ 1 ≤ len k ∧ IsChain F c (len k))
    (α₁ : ℝ) (hα₁ : IsGreatest {x | ∃ s, rowSum F s < 1 ∧ x = rowSum F s} α₁)
    (α₂ : ℝ) (hα₂ : IsLeast {x | ∃ i j, 0 < F i j ∧ x = F i j} α₂)
    (C : ℕ) (hC : IsGreatest {m | ∃ k, rowSum F k = 1 ∧ m = len k} C) :
    ∀ k, rowSum F k = 1 →
      rowSum (F ^ (C + 1)) k ≤ 1 - (1 - α₁) * α₂ ^ C ∧ 1 - (1 - α₁) * α₂ ^ C < 1 := by sorry

end SubSuperStoch.SubSpec
Source
Shi, Zheng, Shao, Cheng, arXiv:2004.01867v2, p. 5, proof of Theorem 2.2 (display Λ_k[F^{|C*|+1}] after "According to the definition of |C*|")
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