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)
ProvedSaturatedNet.Uniqueness.proposition_5Let be a network with irreducible and , on nodes. Let and be right and left dominant eigenvectors of : nonnegative, nonzero, and . Then, for every exogenous flow , there is more than one network equilibrium if and only if
where is a solution of . Moreover, in this case, for any such solution , the set of network equilibria is the segment
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 " is any
solution" is encoded by an existential in the equivalence and a universal in the description of
; the value of the left-hand side of (29) does not depend on the solution chosen, since
two solutions differ by a multiple of . The node type is assumed nonempty so that the minima
are taken over a nonempty set. Positivity of is not assumed: it follows from Proposition 2 (iii).
import Mathlib import Definitions.Def_SaturatedNet_Uniqueness_Model open Matrix
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.