Proof of Theorem 2.6, p. 9 — along a chain from a row of sum < 1, Λ_k[F^{r+2}] ≤ α₃^{r+2} − (α₃ − α₁)α₂^{r+1}
ProvedSubSuperStoch.SuperSpec.chain_rowSum_boundLet be an super-stochastic matrix. Put
all three sets being non-empty. Let be a row with , and let be a non-zero element chain of elements from to (every listed entry non-zero, consecutive indices distinct). Then
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 of the chain has a row sum of strictly below the trivial bound .
Formalization Note The chain is a function with , , . The maxima and the minimum are passed as values together with the hypotheses that each is the greatest (least) element of exactly the printed set. The page states this for ; the bound does not use , so that hypothesis is not imposed.
import Mathlib import Definitions.Def_SubSuperStoch_SuperSpec_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.