Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3, p. 10 — a positive v with Pv ≤ v exists iff ρ(P) < 1, or ρ(P) = 1 and every basic class is final

Proved
SaturatedNet.Uniqueness.proposition_3

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

non-expansivenonnegative-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perron-frobeniusspectral-radius

Let P∈R+n×nP \in \mathbb R_+^{n \times n}P∈R+n×n​ be a nonnegative square matrix. Then there is a positive vector vvv (all entries vi>0v_i > 0vi​>0) with

Pv≤vPv \le vPv≤v

if and only if either ρ(P)<1\rho(P) < 1ρ(P)<1, or ρ(P)=1\rho(P) = 1ρ(P)=1 and every basic class of PPP is final. Here a class is a strongly connected component VVV of the digraph GP\mathcal G_PGP​; it is basic when the principal block P(VV)P^{(VV)}P(VV) has ρ(P(VV))=ρ(P)\rho(P^{(VV)}) = \rho(P)ρ(P(VV))=ρ(P) and final when no link of GP\mathcal G_PGP​ leaves VVV.

The right-hand side is the definition of a non-expansive network (Definition 1). A positive vvv with Pv≤vPv \le vPv≤v yields the weighted ℓ1\ell_1ℓ1​-norm ∥x∥=∑ivi∣xi∣\|x\| = \sum_i v_i |x_i|∥x∥=∑i​vi​∣xi​∣ in which x↦S0w(P⊤x+c)x \mapsto S_0^w(P^\top x + c)x↦S0w​(P⊤x+c) 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
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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