Theorem 2, p. 16 — for ρ(P) ≤ 1, equilibria are unique on classes with ρ < 1, and on classes with ρ = 1 non-unique iff (35)–(36), forming the segment (37)
ProvedSaturatedNet.Uniqueness.theorem_2Let be a network (, ) with , and any exogenous flow. Let be a class of (a strongly connected component of ) with principal block , and fix a network equilibrium . Consider the set of projections on of all network equilibria that coincide with on the nodes upstream of (the paper's "given "), and write
- If , the projection is unique: the set is .
- If , let and be right and left dominant eigenvectors of (nonnegative, nonzero, , ). The projection is non-unique if and only if
for a solution of ((35)–(36)). In that case, for every such solution , the set of projections is exactly
Applied class by class along the block-triangular order (14), this describes the whole lattice of equilibria of a network with : unique on the classes of spectral radius below one, and a segment, or a point, on each class of spectral radius one.
Formalization Note. The statement is permutation-free: instead of assuming in block triangular form, it quantifies over a class and fixes the equilibrium on the nodes upstream of (outside , with a path into ). Fixing every earlier class of a compatible ordering gives the same set of projections, since earlier classes that are not upstream neither feed nor are fed by . The equilibria range over equilibria of the whole network. The third bullet of the paper prints , a slip for the sum over used here (compare (35) and (38)). As in Proposition 5, "any solution " is an existential in the equivalence and a universal in (37), and (37) is stated as an equality of sets (the proof reduces to Proposition 5, (30)). The hypothesis ensures every class falls under case 1 or 2.
import Mathlib import Definitions.Def_SaturatedNet_Uniqueness_Model open Matrix
namespace SaturatedNet.Uniqueness
theorem theorem_2 {n : Type*} [Fintype n] [DecidableEq n]
(P : Matrix n n ℝ) (hP : ∀ i j, 0 ≤ P i j) (w : n → ℝ) (hw : 0 ≤ w) (c : n → ℝ) (hρ : specRad P ≤ 1)
(V : Finset n) (hV : IsClass P V) (x : n → ℝ) (hx : x ∈ equilibria P w c) :
(specRad (block P V) < 1 → classProj P w c V x = {fun i : V => x i}) ∧
(specRad (block P V) = 1 →
∀ p π : V → ℝ, 0 ≤ p → p ≠ 0 → block P V *ᵥ p = p →
0 ≤ π → π ≠ 0 → π ᵥ* block P V = π →
((classProj P w c V x).Nontrivial ↔
(p ⬝ᵥ classInflow P c V x = 0 ∧
∃ ν : V → ℝ, ν = ν ᵥ* block P V + classInflow P c V x ∧
minRatio ν π hV.univ_nonempty +
minRatio (fun i : V => w i - ν i) π hV.univ_nonempty > 0)) ∧
((classProj P w c V x).Nontrivial →
∀ ν : V → ℝ, ν = ν ᵥ* block P V + classInflow P c V x →
classProj P w c V x =
{z | ∃ α : ℝ, -minRatio ν π hV.univ_nonempty ≤ α ∧
α ≤ minRatio (fun i : V => w i - ν i) π hV.univ_nonempty ∧
z = ν + α • π})) := by sorry
end SaturatedNet.Uniqueness
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.