Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.6, PDF p. 15 — a minimal welfare-improving set of trades is a chain and, with suitable prices, blocks no trade

Proved
TradingNetFlow.ChainStable.corollary_5_6

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

blocking-chainchain-stabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trading-networks

Let G=(N,E)G=(N,E)G=(N,E) be a trading network in which every trade has distinct seller and buyer and every valuation wiw_iwi​ is M♮^\natural♮-concave in the signed representation, and assume the no-trade outcome is inefficient. Let T⊆ET\subseteq ET⊆E be a minimal set of trades that improves welfare, that is,

∑iwi(∅)<∑iwi(T∩δ(i))and∑iwi(T′∩δ(i))≤∑iwi(∅)  for every T′⊊T.\sum_{i}w_i(\emptyset)<\sum_{i}w_i(T\cap\delta(i))\quad\text{and}\quad\sum_{i}w_i(T'\cap\delta(i))\le\sum_{i}w_i(\emptyset)\ \text{ for every } T'\subsetneq T.i∑​wi​(∅)<i∑​wi​(T∩δ(i))andi∑​wi​(T′∩δ(i))≤i∑​wi​(∅)  for every T′⊊T.

Then

  1. TTT is a chain, and
  2. there are prices pTp^TpT such that (T,pT)(T,p^T)(T,pT) is a blocking chain of the no-trade outcome. For every agent iii involved in TTT, every set in iii's demand restricted to the trades in TTT at prices pTp^TpT contains T∩δ(i)T\cap\delta(i)T∩δ(i).

In the proof of Theorem 5.8 this corollary, applied to the contraction, produces the blocking chain that contradicts chain stability.

Formalization Note. The hypothesis that the no-trade outcome is inefficient is kept as on the page, although it follows from the existence of TTT. The blocking chain is stated for the outcome X=∅X=\emptysetX=∅, where the combined prices pT∪∅p^{T\cup\emptyset}pT∪∅ are just pTp^TpT.

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 corollary_5_6 (G : Economy N E) (hG : G.Standing) (h : ¬ G.IsEfficient ∅)
    (T : Finset E) (hT : G.welfare ∅ < G.welfare T)
    (hmin : ∀ T' ⊂ T, ¬ G.welfare ∅ < G.welfare T') :
    G.IsChain T ∧ ∃ pT : E → ℝ, G.IsBlockingChain ∅ pT T pT := 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. 15, Corollary 5.6 (i), (ii) and the minimality notion in the text before it
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