Proof of Theorem 4, p. 11 — the alternating-sum identity over subgraphs containing a link
ProvedCooperationGraphs.FairRule.alt_sum_identitycooperation-graphscooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be any function from graphs to payoff vectors, let be a graph and let be a link of . Write for the number of links of a graph and for a strict subgraph. Then
This identity rewrites the equity condition (10), summed with alternating signs over the subgraphs of that contain the link, as a condition on alone; it is the first step of the proof of Theorem 4.
Formalization Note. The paper assumes a nonempty player set, stated as . Graphs are SimpleGraph (Fin n), is h ≤ g, is h < g, and the last sum is the defined quantity (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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.