Theorem 2.4 1), p. 7 — a product of sub-stochastic matrices is sub-stochastic
ProvedSubSuperStoch.AsyncTrack.theorem_2_4_1matrix-productnonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sub-stochastic-matrix
Let be sub-stochastic matrices: each has nonnegative entries and all its row sums are at most . Then the ordered product
is again a sub-stochastic matrix.
This closure property lets the paper treat a run of consecutive transition matrices of a positive switched system as a single sub-stochastic matrix; it is used in part 2) of Theorem 2.4 and in Lemma 3.2.
Formalization Note The matrices are the values of a sequence F : ℕ → Matrix (Fin n) (Fin n) ℝ; only these are assumed sub-stochastic, and the product is prodFrom F 1 q. For the product is the identity matrix, which is sub-stochastic.
Preamble
import Mathlib import Definitions.Def_SubSuperStoch_AsyncTrack_Matrix
Formal statement
namespace SubSuperStoch.AsyncTrack
/-- Theorem 2.4 1) (p. 7): for sub-stochastic matrices `F₁, …, F_q`, the product
`∏_{s=1}^q F_s = F_q ⋯ F_1` is sub-stochastic. -/
theorem theorem_2_4_1 {n : ℕ} (F : ℕ → Matrix (Fin n) (Fin n) ℝ) (q : ℕ)
(hF : ∀ s, 1 ≤ s → s ≤ q → IsSubStochastic (F s)) :
IsSubStochastic (prodFrom F 1 q) := by sorry
end SubSuperStoch.AsyncTrack
Source
Shi, Zheng, Shao, Cheng, arXiv:2004.01867v2, p. 7, Theorem 2.4 1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.