Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 (cyclic consistency), p. 42 — around a cycle of minimal positive-share coalitions, ∏ f^{j,T_j}(i_j, T_j) = ∏ f^{j,T_j}(i_{j+1}, T_j)

Proved
CostSharingPNE.Char.lemma_10

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

basis-representationconsistencycost-sharingnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k≥3k\ge3k≥3 be an integer and W1,…,WkW_1,\dots,W_kW1​,…,Wk​ local welfare functions on N={1,…,n}N=\{1,\dots,n\}N={1,…,n}, n>1n>1n>1. Let fj=∑T∈TjqTjfj,Tf^j=\sum_{T\in\mathcal T^j}q^j_Tf^{j,T}fj=∑T∈Tj​qTj​fj,T (j=1,…,kj=1,\dots,kj=1,…,k) be corresponding budget-balanced distribution rules, vanishing off the sharing coalition, that guarantee equilibrium existence in all games G∈G(N,{f1,…,fk},{W1,…,Wk})G\in\mathcal G(N,\{f^1,\dots,f^k\},\{W_1,\dots,W_k\})G∈G(N,{f1,…,fk},{W1​,…,Wk​}), where fj,Tf^{j,T}fj,T are the basis rules (27). Let i1,…,ik∈Ni_1,\dots,i_k\in Ni1​,…,ik​∈N be players such that there are coalitions

T1∈(Ti1i21+)min⁡, T2∈(Ti2i32+)min⁡, …, Tk∈(Tiki1k+)min⁡,T_1\in\bigl(\mathcal T^{1+}_{i_1i_2}\bigr)^{\min},\ T_2\in\bigl(\mathcal T^{2+}_{i_2i_3}\bigr)^{\min},\ \dots,\ T_k\in\bigl(\mathcal T^{k+}_{i_ki_1}\bigr)^{\min},T1​∈(Ti1​i2​1+​)min, T2​∈(Ti2​i3​2+​)min, …, Tk​∈(Tik​i1​k+​)min,

where Txyj+\mathcal T^{j+}_{xy}Txyj+​ is the set of coalitions of Txyj\mathcal T^j_{xy}Txyj​ in which xxx or yyy gets a positive basis share (53). Then

f1,T1(i1,T1) f2,T2(i2,T2)⋯fk,Tk(ik,Tk)=f1,T1(i2,T1) f2,T2(i3,T2)⋯fk,Tk(i1,Tk).(65)f^{1,T_1}(i_1,T_1)\,f^{2,T_2}(i_2,T_2)\cdots f^{k,T_k}(i_k,T_k)=f^{1,T_1}(i_2,T_1)\,f^{2,T_2}(i_3,T_2)\cdots f^{k,T_k}(i_1,T_k). \tag{65}f1,T1​(i1​,T1​)f2,T2​(i2​,T2​)⋯fk,Tk​(ik​,Tk​)=f1,T1​(i2​,T1​)f2,T2​(i3​,T2​)⋯fk,Tk​(i1​,Tk​).(65)

Lemma 9 compares two coalitions; this lemma rules out inconsistent cycles of length three or more, which is what allows a single weight system to be assembled.

Formalization Note Indices are cyclic: player ij+1i_{j+1}ij+1​ is p (finRotate k l), so the last coalition pairs iki_kik​ with i1i_1i1​. The players need not be distinct and the welfare functions may repeat. The convention f(i,S)=0f(i,S)=0f(i,S)=0 off SSS is the hypothesis h0.

Preamble
import Mathlib
import Definitions.Def_CostSharingPNE_Char_Setting
import Definitions.Def_CostSharingPNE_Char_WeightSystem
import Definitions.Def_CostSharingPNE_Char_Basis
Formal statement
namespace CostSharingPNE.Char

theorem lemma_10 (n : ℕ) (hn : 1 < n) (k : ℕ) (hk : 3 ≤ k) (W : Fin k → Welfare n)
    (f : Welfare n → Rule n)
    (hbb : ∀ l, IsBudgetBalanced (f (W l)) (W l))
    (h0 : ∀ l i S, i ∉ S → f (W l) i S = 0)
    (hpne : GuaranteesPNE (Set.range W) f)
    (p : Fin k → Fin n) (T : Fin k → Finset (Fin n))
    (hT : ∀ l, T l ∈ minimals (plusPair (f (W l)) (W l) (p l) (p (finRotate k l)))) :
    ∏ l, basisRule (f (W l)) (W l) (T l) (p l) (T l) =
      ∏ l, basisRule (f (W l)) (W l) (T l) (p (finRotate k l)) (T l) := by sorry

end CostSharingPNE.Char
Source
Gopalakrishnan, Marden, Wierman, arXiv:1402.3610v1, Lemma 10, (65), p. 42; (53), p. 35
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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