Theorem 1, p. 12 — for a non-expansive network, the surplus/exposed/deficit partition (19) is the same for all equilibria
ProvedSaturatedNet.Uniqueness.theorem_1financial-networksnetwork-equilibriumnon-expansivep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1saturation
Let be a non-expansive network (, , and either or with every basic class final) and let be any exogenous flow. For an equilibrium partition the nodes into
Then this partition does not depend on the equilibrium: for any two equilibria , , and .
This invariance is the key structural fact of the paper: once the partition is known, all equilibria solve one linear system (Corollary 1).
Formalization Note. The paper prints the sums as ; they are read as the full sums , the argument of the saturation in (1), which is how the proof ((21)–(23)) and Remark 5 use them. Example 1 (p. 8) shows that the hypothesis cannot be weakened to alone.
Preamble
import Mathlib import Definitions.Def_SaturatedNet_Uniqueness_Model open Matrix
Formal statement
namespace SaturatedNet.Uniqueness
theorem theorem_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) :
∀ x ∈ equilibria P w c, ∀ y ∈ equilibria P w c,
surplus P w c x = surplus P w c y ∧ exposed P w c x = exposed P w c y ∧
deficit P c x = deficit P c y := by sorry
end SaturatedNet.Uniqueness
Source
Massai, Como & Fagnani, Equilibria and Systemic Risk in Saturated Networks, arXiv:1912.04815v2, p. 12, Theorem 1 (partition (19), p. 11)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.