Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 12 — for a non-expansive network, the surplus/exposed/deficit partition (19) is the same for all equilibria

Proved
SaturatedNet.Uniqueness.theorem_1

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

financial-networksnetwork-equilibriumnon-expansivep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1saturation

Let (P,w)(P, w)(P,w) be a non-expansive network (P≥0P \ge 0P≥0, w≥0w \ge 0w≥0, and either ρ(P)<1\rho(P) < 1ρ(P)<1 or ρ(P)=1\rho(P) = 1ρ(P)=1 with every basic class final) and let c∈Rnc \in \mathbb R^nc∈Rn be any exogenous flow. For an equilibrium xxx partition the nodes into

V+x={i:ci+∑kPkixk>wi},V0x={i:0≤ci+∑kPkixk≤wi},V−x={i:ci+∑kPkixk<0}.\mathcal V_+^x = \{i : c_i + \textstyle\sum_k P_{ki}x_k > w_i\},\quad \mathcal V_0^x = \{i : 0 \le c_i + \textstyle\sum_k P_{ki}x_k \le w_i\},\quad \mathcal V_-^x = \{i : c_i + \textstyle\sum_k P_{ki}x_k < 0\}.V+x​={i:ci​+∑k​Pki​xk​>wi​},V0x​={i:0≤ci​+∑k​Pki​xk​≤wi​},V−x​={i:ci​+∑k​Pki​xk​<0}.

Then this partition does not depend on the equilibrium: for any two equilibria x,yx, yx,y, V+x=V+y\mathcal V_+^x = \mathcal V_+^yV+x​=V+y​, V0x=V0y\mathcal V_0^x = \mathcal V_0^yV0x​=V0y​ and V−x=V−y\mathcal V_-^x = \mathcal V_-^yV−x​=V−y​.

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 ∑k≠i\sum_{k \ne i}∑k=i​; they are read as the full sums ∑k\sum_k∑k​, 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 ρ(P)=1\rho(P) = 1ρ(P)=1 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
  • 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