Proposition 3, p. 10 — a positive v with Pv ≤ v exists iff ρ(P) < 1, or ρ(P) = 1 and every basic class is final
ProvedSaturatedNet.Uniqueness.proposition_3non-expansivenonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perron-frobeniusspectral-radius
Let be a nonnegative square matrix. Then there is a positive vector (all entries ) with
if and only if either , or and every basic class of is final. Here a class is a strongly connected component of the digraph ; it is basic when the principal block has and final when no link of leaves .
The right-hand side is the definition of a non-expansive network (Definition 1). A positive with yields the weighted -norm in which is non-expansive; this is the engine of Theorem 1.
Preamble
import Mathlib import Definitions.Def_SaturatedNet_Uniqueness_Model open Matrix
Formal statement
namespace SaturatedNet.Uniqueness
theorem proposition_3 {n : Type*} [Fintype n] [DecidableEq n]
(P : Matrix n n ℝ) (hP : ∀ i j, 0 ≤ P i j) :
(∃ v : n → ℝ, (∀ i, 0 < v i) ∧ P *ᵥ v ≤ v) ↔
(specRad P < 1 ∨
(specRad P = 1 ∧ ∀ V : Finset n, IsClass P V → IsBasic P V → IsFinal P V)) := by sorry
end SaturatedNet.Uniqueness
Source
Massai, Como & Fagnani, Equilibria and Systemic Risk in Saturated Networks, arXiv:1912.04815v2, p. 10, Proposition 3 (proof pp. 25–26)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.