Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.4 1), p. 7 — a product of sub-stochastic matrices is sub-stochastic

Proved
SubSuperStoch.AsyncTrack.theorem_2_4_1

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

matrix-productnonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sub-stochastic-matrix

Let F1,F2,…,Fq∈Rn×nF_1,F_2,\dots,F_q\in\mathbb R^{n\times n}F1​,F2​,…,Fq​∈Rn×n be sub-stochastic matrices: each has nonnegative entries and all its row sums Λi[Fs]=∑j[Fs]ij\Lambda_i[F_s]=\sum_j[F_s]_{ij}Λi​[Fs​]=∑j​[Fs​]ij​ are at most 111. Then the ordered product

∏s=1qFs=FqFq−1⋯F1\prod_{s=1}^q F_s=F_qF_{q-1}\cdots F_1s=1∏q​Fs​=Fq​Fq−1​⋯F1​

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 F(1),…,F(q)F(1),\dots,F(q)F(1),…,F(q) of a sequence F : ℕ → Matrix (Fin n) (Fin n) ℝ; only these are assumed sub-stochastic, and the product is prodFrom F 1 q. For q=0q=0q=0 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
  • 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