Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 11 — the alternating-sum identity over subgraphs containing a link

Proved
CooperationGraphs.FairRule.alt_sum_identity

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

cooperation-graphscooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Y:GR→RNY:GR\to\mathbb R^NY:GR→RN be any function from graphs to payoff vectors, let ggg be a graph and let n:m∈gn{:}m\in gn:m∈g be a link of ggg. Write ∣h∣|h|∣h∣ for the number of links of a graph hhh and h⊂gh\subset gh⊂g for a strict subgraph. Then

∑h⊆gn:m∈h(−1)∣g∣+∣h∣(Yn(h)−Yn(h∖n:m))=∑h⊆g(−1)∣g∣+∣h∣Yn(h)=Yn(g)−∑h⊂g(−1)∣g∣+∣h∣+1Yn(h).\sum_{\substack{h\subseteq g\\ n{:}m\in h}}(-1)^{|g|+|h|}\big(Y_n(h)-Y_n(h\setminus n{:}m)\big)=\sum_{h\subseteq g}(-1)^{|g|+|h|}Y_n(h)=Y_n(g)-\sum_{h\subset g}(-1)^{|g|+|h|+1}Y_n(h).h⊆gn:m∈h​∑​(−1)∣g∣+∣h∣(Yn​(h)−Yn​(h∖n:m))=h⊆g∑​(−1)∣g∣+∣h∣Yn​(h)=Yn​(g)−h⊂g∑​(−1)∣g∣+∣h∣+1Yn​(h).

This identity rewrites the equity condition (10), summed with alternating signs over the subgraphs of ggg that contain the link, as a condition on Yn(g)Y_n(g)Yn​(g) alone; it is the first step of the proof of Theorem 4.

Formalization Note. The paper assumes a nonempty player set, stated as 0<n0<n0<n. Graphs are SimpleGraph (Fin n), h⊆gh\subseteq gh⊆g is h ≤ g, h⊂gh\subset gh⊂g is h < g, and the last sum is the defined quantity tn(g)t_n(g)tn​(g) (altSum). Both equalities are stated, as a conjunction.

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

open Finset
open scoped Classical

/-- Proof of Theorem 4, p. 11, display before (15): for any `Y`, any graph `g` and any link
`a,b ∈ g`, the alternating sum over the subgraphs `h ⊆ g` containing `a,b` of `Y_a(h) − Y_a(h \ a,b)`
equals the alternating sum over all `h ⊆ g` of `Y_a(h)`, which equals `Y_a(g) − t_a(g)`. -/
theorem alt_sum_identity {n : ℕ} (hn : 0 < n) (Y : Rule n) (g : SimpleGraph (Fin n)) (a b : Fin n)
    (hab : g.Adj a b) :
    (∑ h ∈ univ.filter (fun h : SimpleGraph (Fin n) => h ≤ g ∧ h.Adj a b),
        (-1 : ℝ) ^ (numLinks g + numLinks h) * (Y h a - Y (removeLink h a b) a)) =
      ∑ h ∈ univ.filter (fun h : SimpleGraph (Fin n) => h ≤ g),
        (-1 : ℝ) ^ (numLinks g + numLinks h) * Y h a ∧
    (∑ h ∈ univ.filter (fun h : SimpleGraph (Fin n) => h ≤ g),
        (-1 : ℝ) ^ (numLinks g + numLinks h) * Y h a) =
      Y g a - altSum Y g a := by sorry

end CooperationGraphs.FairRule
Source
Myerson, Graphs and Cooperation in Games, Discussion Paper No. 246 (Sept. 1976), proof of Theorem 4, p. 11, display before (15)
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