Proof of Theorem 2.6, p. 9 — Λ_i[F^{|C*|+1}] ≤ α₃^{|C*|+1} − (α₃ − α₁)α₂^{|C*|} < 1 for every row i of sum < 1
ProvedSubSuperStoch.SuperSpec.R1_rows_power_boundnonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1row-sumsuper-stochastic-matrix
Let be an super-stochastic matrix and put
all three sets being non-empty. Let be a natural number (in Theorem 2.6, ) satisfying condition (2.5),
Then for every row with ,
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 before the inequality; the statement keeps only the inequality and the final "". No chain hypothesis is assumed and is an arbitrary natural number, since the bound holds for every ; the root is the real power .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.