Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, pp. 12–13 — ∑n∈Sφn(uT)\sum_{n\in S}\varphi_n(u^T)∑n∈S​φn​(uT) is uNTu^T_NuNT​ if S=TS=TS=T and 000 if S∩T=∅S\cap T=\emptysetS∩T=∅

Proved
CooperationGraphs.FairRule.carrier_identity

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

cooperation-graphscooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1shapley-value

Let v∈RCLv\in\mathbb R^{CL}v∈RCL and let ggg be a graph on NNN. For a component T∈N/gT\in N/gT∈N/g define the game uT∈RCLu^T\in\mathbb R^{CL}uT∈RCL by

uT′T=∑R∈(T′∩T)/gvR(T′∈CL).u^T_{T'}=\sum_{R\in(T'\cap T)/g}v_R\qquad(T'\in CL).uT′T​=R∈(T′∩T)/g∑​vR​(T′∈CL).

Let φ\varphiφ be the Shapley value. Then for any components S,T∈N/gS,T\in N/gS,T∈N/g,

∑n∈Sφn(uT)={uNT,S=T,0,S∩T=∅.\sum_{n\in S}\varphi_n(u^T)=\begin{cases}u^T_N,& S=T,\\ 0,& S\cap T=\emptyset.\end{cases}n∈S∑​φn​(uT)={uNT​,0,​S=T,S∩T=∅.​

The set TTT is a carrier of uTu^TuT; this identity is the carrier axiom of Shapley (1953) applied to uTu^TuT, and with v/g=∑T∈N/guTv/g=\sum_{T\in N/g}u^Tv/g=∑T∈N/g​uT it gives the efficiency of φ(v/g)\varphi(v/g)φ(v/g) on components.

Formalization Note. The paper assumes a nonempty player set, stated as 0<n0<n0<n. Two components of ggg are either equal or disjoint, so the two cases are stated as if S = T then u^T_N else 0. φ\varphiφ is the platform's Supermodularity.Cooperative.ShapleyValue applied to uTu^TuT with its value at ∅\emptyset∅ set to 000 (u∅T=0u^T_\emptyset=0u∅T​=0 in any case).

Preamble
import Mathlib
import Definitions.Def_CooperationGraphs_FairRule_Basic
Formal statement
namespace CooperationGraphs.FairRule

open Finset
open scoped Classical

/-- Proof of Theorem 2, pp. 12–13 (carrier axiom): for `S, T ∈ N/g`,
`∑_{i ∈ S} φ_i(u^T) = u^T_N` if `S = T`, and `= 0` if `S ∩ T = ∅` (distinct components are
disjoint). -/
theorem carrier_identity {n : ℕ} (hn : 0 < n) (v : Game n) (g : SimpleGraph (Fin n))
    (S T : Finset (Fin n)) (hS : S ∈ quot univ g) (hT : T ∈ quot univ g) :
    ∑ i ∈ S, shapley (uGame v g T) i = if S = T then uGame v g T univ else 0 := by sorry

end CooperationGraphs.FairRule
Source
Myerson, Graphs and Cooperation in Games, Discussion Paper No. 246 (Sept. 1976), proof of Theorem 2, pp. 12–13, display at the top of p. 13
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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