Corollary 1, pp. 12–13 — one node partition on which every equilibrium of a non-expansive network solves the linear system (27)
ProvedSaturatedNet.Uniqueness.corollary_1linear-systemnetwork-equilibriumnon-expansivep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1saturation
Let be a non-expansive network and any exogenous flow. Then there is a partition of the nodes into three pairwise disjoint sets such that, writing for the corresponding split of a vector and for the block of with rows in and columns in :
- every network equilibrium satisfies
- any two network equilibria satisfy and .
The partition is the same for all equilibria; uniqueness can therefore be decided on the exposed block, where equilibria solve a linear system. It is the reduction used in Propositions 4 and 5.
Formalization Note. The middle equation is written coordinatewise: for , . The partition is a single triple of sets chosen before the equilibria, not a function of .
Preamble
import Mathlib import Definitions.Def_SaturatedNet_Uniqueness_Model open Matrix
Formal statement
namespace SaturatedNet.Uniqueness
theorem corollary_1 {n : Type*} [Fintype n] [DecidableEq n]
(P : Matrix n n ℝ) (hP : ∀ i j, 0 ≤ P i j) (w : n → ℝ) (hw : 0 ≤ w) (c : n → ℝ) (hne : IsNonExpansive P) :
∃ Vp V0 Vm : Finset n,
Disjoint Vp V0 ∧ Disjoint Vp Vm ∧ Disjoint V0 Vm ∧ Vp ∪ V0 ∪ Vm = Finset.univ ∧
(∀ x ∈ equilibria P w c,
(∀ i ∈ Vm, x i = 0) ∧
(∀ i ∈ V0, x i = ∑ k ∈ V0, P k i * x k + ∑ k ∈ Vp, P k i * x k + c i) ∧
(∀ i ∈ Vp, x i = w i)) ∧
(∀ x ∈ equilibria P w c, ∀ y ∈ equilibria P w c,
(∀ i ∈ Vm, x i = y i) ∧ (∀ i ∈ Vp, x i = y i)) := by sorry
end SaturatedNet.Uniqueness
Source
Massai, Como & Fagnani, Equilibria and Systemic Risk in Saturated Networks, arXiv:1912.04815v2, pp. 12–13, Corollary 1, (26)–(28)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.