Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5, p. 14 — for irreducible P with ρ(P) = 1, equilibria are non-unique iff pᵀc = 0 and (29), and then form the segment (30)

Proved
SaturatedNet.Uniqueness.proposition_5

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

irreducible-matrixnetwork-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perron-frobeniussaturationuniqueness

Let (P,w)(P, w)(P,w) be a network with PPP irreducible and ρ(P)=1\rho(P) = 1ρ(P)=1, on n≥1n \ge 1n≥1 nodes. Let ppp and π\piπ be right and left dominant eigenvectors of PPP: nonnegative, nonzero, Pp=pPp = pPp=p and π⊤P=π⊤\pi^\top P = \pi^\topπ⊤P=π⊤. Then, for every exogenous flow ccc, there is more than one network equilibrium if and only if

p⊤c=0,min⁡i{νiπi}+min⁡i{wi−νiπi}>0,p^\top c = 0, \qquad \min_i\Big\{\frac{\nu_i}{\pi_i}\Big\} + \min_i\Big\{\frac{w_i - \nu_i}{\pi_i}\Big\} > 0,p⊤c=0,imin​{πi​νi​​}+imin​{πi​wi​−νi​​}>0,

where ν\nuν is a solution of ν=P⊤ν+c\nu = P^\top \nu + cν=P⊤ν+c. Moreover, in this case, for any such solution ν\nuν, the set of network equilibria is the segment

X={x=ν+απ: −min⁡i{νiπi}≤α≤min⁡i{wi−νiπi}}.\mathcal X = \Big\{ x = \nu + \alpha\pi :\ -\min_i\Big\{\frac{\nu_i}{\pi_i}\Big\} \le \alpha \le \min_i\Big\{\frac{w_i - \nu_i}{\pi_i}\Big\}\Big\}.X={x=ν+απ: −imin​{πi​νi​​}≤α≤imin​{πi​wi​−νi​​}}.

This is the irreducible critical case; Theorem 2 applies it to each class whose block has spectral radius one, with the exogenous flow coming from the upstream classes.

Formalization Note. "More than one equilibrium" is Set.Nontrivial. The paper's "ν\nuν is any solution" is encoded by an existential in the equivalence and a universal in the description of X\mathcal XX; the value of the left-hand side of (29) does not depend on the solution chosen, since two solutions differ by a multiple of π\piπ. The node type is assumed nonempty so that the minima are taken over a nonempty set. Positivity of π\piπ is not assumed: it follows from Proposition 2 (iii).

Preamble
import Mathlib
import Definitions.Def_SaturatedNet_Uniqueness_Model
open Matrix
Formal statement
namespace SaturatedNet.Uniqueness

theorem proposition_5 {n : Type*} [Fintype n] [DecidableEq n]
    (P : Matrix n n ℝ) (hP : ∀ i j, 0 ≤ P i j) (w : n → ℝ) (hw : 0 ≤ w) (c : n → ℝ) [Nonempty n]
    (hirr : IsIrreducible P) (hρ : specRad P = 1)
    (p π : n → ℝ) (hp0 : 0 ≤ p) (hp : p ≠ 0) (hpP : P *ᵥ p = p)
    (hπ0 : 0 ≤ π) (hπ : π ≠ 0) (hπP : π ᵥ* P = π) :
    ((equilibria P w c).Nontrivial ↔
      (p ⬝ᵥ c = 0 ∧ ∃ ν : n → ℝ, ν = ν ᵥ* P + c ∧
        minRatio ν π Finset.univ_nonempty + minRatio (w - ν) π Finset.univ_nonempty > 0)) ∧
    ((equilibria P w c).Nontrivial →
      ∀ ν : n → ℝ, ν = ν ᵥ* P + c →
        equilibria P w c =
          {x | ∃ α : ℝ, -minRatio ν π Finset.univ_nonempty ≤ α ∧
            α ≤ minRatio (w - ν) π Finset.univ_nonempty ∧ x = ν + α • π}) := by sorry

end SaturatedNet.Uniqueness
Source
Massai, Como & Fagnani, Equilibria and Systemic Risk in Saturated Networks, arXiv:1912.04815v2, p. 14, Proposition 5, (29)–(30)
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