Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13, p. 56 — a universal weight system ω* with f^{W,T}_GWSV[ω^{W,T}] = f^T_GWSV[ω*] for every W ∈ 𝕎 and T ∈ 𝒯^W

Proved
CostSharingPNE.Char.lemma_13

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

cost-sharingnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1shapley-valueweight-system

Let W\mathbb WW be a set of local welfare functions on N={1,…,n}N=\{1,\dots,n\}N={1,…,n}, n>1n>1n>1, and let fWf^{\mathbb W}fW be budget-balanced distribution rules that guarantee equilibrium existence in all games G∈G(N,fW,W)G\in\mathcal G(N,f^{\mathbb W},\mathbb W)G∈G(N,fW,W), where for each W∈WW\in\mathbb WW∈W

fW=∑T∈TWqTW fGWSVW,T[ωW,T].f^W=\sum_{T\in\mathcal T^W} q^W_T\, f^{W,T}_{GWSV}[\omega^{W,T}] .fW=T∈TW∑​qTW​fGWSVW,T​[ωW,T].

Then there exists a weight system ω∗\omega^*ω∗ such that

(∀W∈W) (∀T∈TW)fGWSVW,T[ωW,T]=fGWSVT[ω∗].(78)(\forall W\in\mathbb W)\ (\forall T\in\mathcal T^W)\qquad f^{W,T}_{GWSV}[\omega^{W,T}]=f^T_{GWSV}[\omega^*]. \tag{78}(∀W∈W) (∀T∈TW)fGWSVW,T​[ωW,T]=fGWSVT​[ω∗].(78)

One weight system replaces all the coalition-wise weight systems, which with Lemmas 7 and 8 gives fW=fGWSVW[ω∗]f^W=f^W_{GWSV}[\omega^*]fW=fGWSVW​[ω∗] for every W∈WW\in\mathbb WW∈W — the necessity half of Theorem 1 for budget-balanced rules.

Formalization Note The representation of fWf^WfW is required at i∈Si\in Si∈S (the shares that matter); (78) is an equality of the basis rules as functions of every iii and SSS.

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_13 (n : ℕ) (hn : 1 < n) (𝕎 : Set (Welfare n)) (f : Welfare n → Rule n)
    (hbb : ∀ W ∈ 𝕎, IsBudgetBalanced (f W) W) (hpne : GuaranteesPNE 𝕎 f)
    (Ω : Welfare n → Finset (Fin n) → WeightSystem n)
    (hΩ : ∀ W ∈ 𝕎, ∀ S : Finset (Fin n), ∀ i ∈ S,
      f W i S = ∑ T ∈ coalitions W, mobius W T * gwsvBasis (Ω W T) T i S) :
    ∃ ωstar : WeightSystem n, ∀ W ∈ 𝕎, ∀ T ∈ coalitions W,
      ∀ (i : Fin n) (S : Finset (Fin n)), gwsvBasis (Ω W T) T i S = gwsvBasis ωstar T i S := by sorry

end CostSharingPNE.Char
Source
Gopalakrishnan, Marden, Wierman, arXiv:1402.3610v1, Lemma 13, (78), p. 56
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