Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 12 — T/g=⋃S∈N/g(T∩S)/gT/g=\bigcup_{S\in N/g}(T\cap S)/gT/g=⋃S∈N/g​(T∩S)/g

Proved
CooperationGraphs.FairRule.quot_eq_biUnion

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

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

Let ggg be a graph on NNN and TTT a coalition. Any two players connected in TTT by ggg are also connected in NNN by ggg, so the partition of TTT into ggg-connected pieces is obtained by cutting each component of ggg down to TTT:

T/g=⋃S∈N/g(T∩S)/g.T/g=\bigcup_{S\in N/g}(T\cap S)/g .T/g=S∈N/g⋃​(T∩S)/g.

Consequently v/g=∑S∈N/guSv/g=\sum_{S\in N/g}u^Sv/g=∑S∈N/g​uS, the decomposition of the graph-restricted game used in the proof of Theorem 2.

Formalization Note. The paper assumes a nonempty player set, stated as 0<n0<n0<n. Partitions are Finset (Finset (Fin n)) and the union is Finset.biUnion. The paper takes T∈CLT\in CLT∈CL, so TTT is required to be nonempty.

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

open Finset
open scoped Classical

/-- Proof of Theorem 2, p. 12: for every graph `g` and coalition `T`,
`T/g = ⋃_{S ∈ N/g} (T ∩ S)/g`. -/
theorem quot_eq_biUnion {n : ℕ} (hn : 0 < n) (g : SimpleGraph (Fin n))
    (T : Finset (Fin n)) (hT : T.Nonempty) :
    quot T g = (quot univ g).biUnion (fun S => quot (T ∩ S) g) := by sorry

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