§3, p. 15 — under ψ < 1/(τd_M) every M(k) is sub-stochastic with positive diagonal; Λ_i[M(k)] < 1 iff (v₀, v_i) ∈ ℰ̃(k)
ProvedSubSuperStoch.AsyncTrack.Mmat_subStochasticConsider the asynchronous leader–follower network with step size , gain , follower weights and leader weights . Let
be the largest total absolute weight received by a follower, and suppose the gain satisfies (3.7),
Then for every the matrix is sub-stochastic, its diagonal entries are positive, and its row sums satisfy
for . Here the leader edge is present at time exactly when , that is, when is a communication instant of and .
This turns the tracking question into one about products of sub-stochastic matrices: the error system (3.6) is driven by the matrices , and only the rows of followers that hear the leader at time lose mass.
Formalization Note is passed as a value with an IsGreatest hypothesis over exactly the printed set (the sum over equals the sum over all , since the other terms vanish). (3.7) is kept in the printed form ψ < 1 / (τ * dM); in Lean , so if the hypothesis contradicts . The asynchronous-instant condition (2.10) is not assumed: the claim holds for any choice of instants.
import Mathlib import Definitions.Def_SubSuperStoch_AsyncTrack_Matrix import Definitions.Def_SubSuperStoch_AsyncTrack_AsyncModel
namespace SubSuperStoch.AsyncTrack
/-- §3, p. 15: under the gain bound (3.7) `ψ < 1/(τ d_M)`, with
`d_M = max_i (∑_{v_j ∈ 𝒩_i} |a_ij| + |a_i0|)`, every `M(k)` is sub-stochastic with positive diagonal
entries, and `Λ_i[M(k)] < 1` if the leader edge `(v₀, v_i)` is present at time `kτ` (follower `i`
communicates at `kτ` and `a_i0 ≠ 0`), while `Λ_i[M(k)] = 1` otherwise. -/
theorem Mmat_subStochastic {n : ℕ} (a : Matrix (Fin n) (Fin n) ℝ) (b : Fin n → ℝ)
(τ ψ : ℝ) (hτ : 0 < τ) (hψ : 0 < ψ) (s : Fin n → ℕ → ℕ)
(dM : ℝ) (hdM : IsGreatest {x | ∃ i, x = ∑ j, |a i j| + |b i|} dM)
(h37 : ψ < 1 / (τ * dM)) :
∀ k, IsSubStochastic (Mmat a b τ ψ s k) ∧ (∀ i, 0 < Mmat a b τ ψ s k i i) ∧
∀ i, ((active s i k ∧ b i ≠ 0) → rowSum (Mmat a b τ ψ s k) i < 1) ∧
(¬(active s i k ∧ b i ≠ 0) → rowSum (Mmat a b τ ψ s k) i = 1) := by sorry
end SubSuperStoch.AsyncTrack
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.