Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 13 — for superadditive vvv, (v/g)S≥(v/g∖n:m)S(v/g)_S\ge(v/g\setminus n{:}m)_S(v/g)S​≥(v/g∖n:m)S​, with equality if n∉Sn\notin Sn∈/S

Proved
CooperationGraphs.FairRule.restrict_removeLink_le

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

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

Let v∈RCLv\in\mathbb R^{CL}v∈RCL be superadditive, i.e. vS∪T≥vS+vTv_{S\cup T}\ge v_S+v_TvS∪T​≥vS​+vT​ for all disjoint nonempty S,TS,TS,T. Let ggg be a graph on NNN and n:mn{:}mn:m a link of ggg. Then for every coalition SSS,

(v/g)S=∑T∈S/gvT  ≥  ∑T∈S/(g∖n:m)vT=(v/g∖n:m)S,(v/g)_S=\sum_{T\in S/g}v_T\;\ge\;\sum_{T\in S/(g\setminus n{:}m)}v_T=(v/g\setminus n{:}m)_S,(v/g)S​=T∈S/g∑​vT​≥T∈S/(g∖n:m)∑​vT​=(v/g∖n:m)S​,

and the inequality is an equality if n∉Sn\notin Sn∈/S.

Breaking a link can only lower the worth of every coalition in the graph-restricted game, and leaves unchanged the worth of coalitions not containing the endpoint nnn.

Formalization Note. The paper assumes a nonempty player set, stated as 0<n0<n0<n. The link and nonempty-coalition conditions come from the paper's context.

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

open Finset
open scoped Classical

/-- Proof of Theorem 3, p. 13: if `v` is superadditive then `(v/g)_S ≥ (v/(g \ a,b))_S` for every
coalition `S`, with equality if `a ∉ S`. -/
theorem restrict_removeLink_le {n : ℕ} (hn : 0 < n) (v : Game n) (hv : IsSuperadditive v)
    (g : SimpleGraph (Fin n)) (a b : Fin n) (hab : g.Adj a b)
    (S : Finset (Fin n)) (hS : S.Nonempty) :
    restrict v (removeLink g a b) S ≤ restrict v g S ∧
      (a ∉ S → restrict v (removeLink g a b) S = restrict v g S) := by sorry

end CooperationGraphs.FairRule
Source
Myerson, Graphs and Cooperation in Games, Discussion Paper No. 246 (Sept. 1976), proof of Theorem 3 (headed "PROOF OF THEOREM 4." in the typescript), 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