Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 (Existence and Uniqueness of Stable Point), Expanded Version

Proved
IncentiveFinNet.theorem_1

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

financial-networkslinear-algebraoperations-researchp2o-gran-per-chapterp2o-plan-paperp2o-v1stability

Fix a network setting (μi,γi,Σi,Ψi)i∈[n](\mu_i, \gamma_i, \Sigma_i, \Psi_i)_{i\in[n]}(μi​,γi​,Σi​,Ψi​)i∈[n]​: nnn agents, an expected-return matrix M∈Rn×nM \in \mathbb R^{n\times n}M∈Rn×n whose iii-th column is μi\mu_iμi​, risk aversions γi>0\gamma_i > 0γi​>0, covariance matrices Σi≻0\Sigma_i \succ 0Σi​≻0 (one per agent), and permitted counterparty sets JiJ_iJi​ with k∈Ji  ⟺  i∈Jkk \in J_i \iff i \in J_kk∈Ji​⟺i∈Jk​. Let Qi=Ψi⊤(2γiΨiΣiΨi⊤)−1ΨiQ_i = \Psi_i^{\top}(2\gamma_i\Psi_i\Sigma_i\Psi_i^{\top})^{-1}\Psi_iQi​=Ψi⊤​(2γi​Ψi​Σi​Ψi⊤​)−1Ψi​, let F={(i,j):1≤i<j≤n, Ψiej≠0}F = \{(i,j) : 1 \le i < j \le n,\ \Psi_ie_j \ne 0\}F={(i,j):1≤i<j≤n, Ψi​ej​=0}, and define the n×nn\times nn×n matrices

Aij=ei⊤QjMej,B(i,j)=eiej⊤Qi,C(i,j)=(B(i,j)−B(j,i))−(B(i,j)−B(j,i))⊤.A_{ij} = e_i^{\top}Q_jMe_j, \qquad B_{(i,j)} = e_ie_j^{\top}Q_i, \qquad C_{(i,j)} = \bigl(B_{(i,j)} - B_{(j,i)}\bigr) - \bigl(B_{(i,j)} - B_{(j,i)}\bigr)^{\top}.Aij​=ei⊤​Qj​Mej​,B(i,j)​=ei​ej⊤​Qi​,C(i,j)​=(B(i,j)​−B(j,i)​)−(B(i,j)​−B(j,i)​)⊤.

Let ZFZ_FZF​ be the ∣F∣×∣F∣|F|\times|F|∣F∣×∣F∣ matrix whose rows are uvec(C(i,j))F\mathrm{uvec}(C_{(i,j)})_Fuvec(C(i,j)​)F​, (i,j)∈F(i,j) \in F(i,j)∈F. Then:

  1. a stable point (W,P)(W,P)(W,P) exists if and only if uvec(A−A⊤)F\mathrm{uvec}(A - A^{\top})_Fuvec(A−A⊤)F​ lies in the column space of ZFZ_FZF​;
  2. every stable point (W,P)(W,P)(W,P) satisfies
ZF uvec(P)F=uvec(A−A⊤)F;Z_F\,\mathrm{uvec}(P)_F = \mathrm{uvec}(A - A^{\top})_F ;ZF​uvec(P)F​=uvec(A−A⊤)F​;
  1. if ZFZ_FZF​ has full rank, there is exactly one stable point (W,P)(W,P)(W,P).

Here a stable point is a pair (W,P)(W, P)(W,P) with WWW symmetric, PPP skew-symmetric, both zero on prohibited pairs, such that no agent can raise its mean-variance utility gi(W′,P)=wi′⊤(μi−Pei)−γiwi′⊤Σiwi′g_i(W', P) = w_i'^{\top}(\mu_i - Pe_i) - \gamma_i w_i'^{\top}\Sigma_i w_i'gi​(W′,P)=wi′⊤​(μi​−Pei​)−γi​wi′⊤​Σi​wi′​ by changing to another feasible network W′W'W′ at the same prices.

The theorem turns a fixed-point question about selfish agents into linear algebra: the existence of stable contracts and prices is the solvability of one linear system in the prices, and uniqueness follows from the invertibility of its matrix.

Formalization Note The column space of ZFZ_FZF​ is the range of the linear map p↦ZFpp \mapsto Z_Fpp↦ZF​p; full rank of the square matrix ZFZ_FZF​ is rank⁡ZF=∣F∣\operatorname{rank} Z_F = |F|rankZF​=∣F∣; uniqueness in part 3 is uniqueness of the pair (W,P)(W,P)(W,P). Every nnn is covered, including n=0n = 0n=0 and settings with F=∅F = \emptysetF=∅, where ZFZ_FZF​ is the empty matrix and has full rank.

Differences from the source:

  • reading: if k ∉ J_i (and hence i ∉ J_k) → the setting assumes k ∈ J_i ↔ i ∈ J_k; reason: the parenthetical states the symmetry of the permitted sets
  • reading: W and P obey the constraints encoded in (Ψ_i) (Definition 2) → k ∉ J_i implies W_ik = 0 and P_ik = 0; reason: the p.9 sentence "if k ∉ J_i (and hence i ∉ J_k), we have W_ik = W_ki = P_ik = P_ki = 0", together with the symmetry of J, W and −P
  • reading: g_i(W,P) = max over feasible (W′,P) of g_i(W′,P) (Definition 3) → g_i(W′,P) ≤ g_i(W,P) for every feasible (W′,P); reason: equivalent because (W,P) is itself feasible
  • encoding: agents [n], ordered sets J_i and F, vectors in ℝ^|F|, the |F| × |F| matrix Z_F → Fin n, Finset J_i, the subtype F of pairs, functions on F and a matrix indexed by F × F; reason: Lean conventions; the orders of J_i and F change no quantity of the theorem
  • encoding: Σ_i ≻ 0 → Matrix.PosDef (symmetric); reason: a covariance matrix is symmetric
  • encoding: column space of Z_F; Z_F is full rank; a unique stable point exists → LinearMap.range of Z_F.mulVecLin; rank Z_F = card F; ∃! of the pair (W, P); reason: standard Lean forms of the same notions
Preamble
import Mathlib
import Definitions.Def_IncentiveFinNet_NetworkSetting
import Definitions.Def_IncentiveFinNet_Stable
import Definitions.Def_IncentiveFinNet_matC
import Definitions.Def_IncentiveFinNet_Q
import Definitions.Def_IncentiveFinNet_ZF

open Matrix
Formal statement
namespace IncentiveFinNet

/-- **Theorem 1 (Existence and Uniqueness of Stable Point)**, Expanded Version, Jalan,
Chakrabarti, Sarkar, *Incentive-Aware Models of Financial Networks*, arXiv:2212.06808v3,
pp.11–12; Expanded Version, A.1, p.33.

With `A_ij = e_iᵀ Q_j M e_j`, `B_{(i,j)} = e_i e_jᵀ Q_i`,
`C_{(i,j)} = (B_{(i,j)} − B_{(j,i)}) − (B_{(i,j)} − B_{(j,i)})ᵀ`, and `Z_F` the `|F| × |F|` matrix
with rows `uvec(C_{(i,j)})_F`, `(i, j) ∈ F`:
1. a stable point `(W, P)` exists iff `uvec(A − Aᵀ)_F` lies in the column space of `Z_F`;
2. every stable point satisfies `Z_F uvec(P)_F = uvec(A − Aᵀ)_F`;
3. if `Z_F` has full rank, a stable point exists and is unique.

**Formalization Note** The column space of `Z_F` is `LinearMap.range Z_F.mulVecLin`; "full rank"
for the square matrix `Z_F` is `rank Z_F = |F|`; uniqueness is of the pair `(W, P)`. -/
theorem theorem_1 {n : ℕ} (S : NetworkSetting n) : ((∃ W P : Matrix (Fin n) (Fin n) ℝ, Stable S W P) ↔ uvecF S (matA S - (matA S)ᵀ) ∈ LinearMap.range (ZF S).mulVecLin) ∧ (∀ W P : Matrix (Fin n) (Fin n) ℝ, Stable S W P → ZF S *ᵥ uvecF S P = uvecF S (matA S - (matA S)ᵀ)) ∧ ((ZF S).rank = Fintype.card (PermittedPairs S) → ∃! WP : Matrix (Fin n) (Fin n) ℝ × Matrix (Fin n) (Fin n) ℝ, Stable S WP.1 WP.2) := by sorry

end IncentiveFinNet
Source
Jalan, Chakrabarti, Sarkar, Incentive-Aware Models of Financial Networks, arXiv:2212.06808v3, Theorem 1 (Existence and Uniqueness of Stable Point), pp.11–12; Expanded Version of Theorem 1, A.1, p.33; Definitions 1–3, p.10
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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