Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.8, PDF p. 17 — every chain stable outcome (X, p^X) extends to a competitive equilibrium (X, p) with p = p^X on X

Proved
TradingNetFlow.ChainStable.theorem_5_8

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

chain-stabilitycompetitive-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stable-outcomestrading-networks

Let G=(N,E)G=(N,E)G=(N,E) be a trading network with finitely many agents and trades, in which every trade has distinct seller and buyer and every valuation wiw_iwi​ is M♮^\natural♮-concave in the signed representation (equivalently, every agent's preferences are fully substitutable). Suppose the outcome X⊆EX\subseteq EX⊆E with prices pXp^XpX is chain stable:

  1. it is individually rational, X∩δ(i)∈arg max⁡Y⊆X∩δ(i)ui(Y,pX)X\cap\delta(i)\in\operatorname{arg\,max}_{Y\subseteq X\cap\delta(i)}u_i(Y,p^X)X∩δ(i)∈argmaxY⊆X∩δ(i)​ui​(Y,pX) for every agent iii, and
  2. no nonempty chain ZZZ with Z∩X=∅Z\cap X=\emptysetZ∩X=∅ and prices pZp^ZpZ blocks it, meaning that for every agent iii involved in ZZZ every Yi∈Di(pZ∪X)Y^i\in D_i(p^{Z\cup X})Yi∈Di​(pZ∪X) contains Z∩δ(i)Z\cap\delta(i)Z∩δ(i).

Then there is a price vector p∈REp\in\mathbb R^Ep∈RE such that (X,p)(X,p)(X,p) is a competitive equilibrium and

pe=peXfor all e∈X.p_e=p^X_e\qquad\text{for all } e\in X.pe​=peX​for all e∈X.

Together with Theorem 5.7 (a competitive equilibrium is stable, hence chain stable), this shows that in trading networks with fully substitutable preferences all the stability notions of Hatfield et al. (2013) coincide with competitive equilibrium: the weakest one, chain stability, already implies the strongest.

Preamble
import Mathlib
import Definitions.Def_TradingNetFlow_ChainStable_Model
Formal statement
namespace TradingNetFlow.ChainStable

open Finset

variable {N E : Type*} [Fintype N] [DecidableEq N] [Fintype E] [DecidableEq E]

theorem theorem_5_8 (G : Economy N E) (hG : G.Standing) (X : Finset E) (pX : E → ℝ)
    (hX : G.IsChainStable X pX) :
    ∃ p : E → ℝ, G.IsCompetitiveEquilibrium X p ∧ ∀ e ∈ X, p e = pX e := by sorry

end TradingNetFlow.ChainStable
Source
Candogan, Epitropou & Vohra, Competitive Equilibrium and Trading Networks: A Network Flow Approach, IHS Economics Series Working Paper 323 (Aug. 2016), PDF p. 17, Theorem 5.8
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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