Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 11 — max⁡{x∣(x+rn)n∈S∈w(S,g)}\max\{x \mid (x+r_n)_{n\in S}\in w(S,g)\}max{x∣(x+rn​)n∈S​∈w(S,g)} exists

Proved
CooperationGraphs.FairRule.exists_isGreatest_shift

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

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

Let www be a game in graph function form: for every embedded subgraph (S,g)(S,g)(S,g), i.e. every graph ggg and connected component S∈N/gS\in N/gS∈N/g, the set w(S,g)⊆RSw(S,g)\subseteq\mathbb R^Sw(S,g)⊆RS is closed, comprehensive and a proper subset of RS\mathbb R^SRS. Then for every embedded subgraph (S,g)(S,g)(S,g) and every vector r=(rn)n∈S∈RSr=(r_n)_{n\in S}\in\mathbb R^Sr=(rn​)n∈S​∈RS, the maximum

max⁡{x∈R∣(x+rn)n∈S∈w(S,g)}\max\{x\in\mathbb R \mid (x+r_n)_{n\in S}\in w(S,g)\}max{x∈R∣(x+rn​)n∈S​∈w(S,g)}

exists.

This is what makes the recursion (18) of the proof of Theorem 4 well defined: the constant d(S,g)d(S,g)d(S,g) is the largest uniform shift of t(g)t(g)t(g) that remains feasible.

Formalization Note. The paper assumes a nonempty player set, stated as 0<n0<n0<n. "The maximum exists" is stated as the existence of a greatest element (IsGreatest) of the set; a greatest element is unique, which is the paper's "uniquely defined".

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, sentence after (17): for a game `w` in graph function form, an
embedded subgraph `(S, g)` and any `r ∈ ℝ^S`, the maximum of `{x | (x + r_i)_{i ∈ S} ∈ w(S,g)}`
exists. -/
theorem exists_isGreatest_shift {n : ℕ} (hn : 0 < n) (G : GraphFunctionGame n) (g : SimpleGraph (Fin n))
    (S : Finset (Fin n)) (hS : S ∈ quot univ g) (r : ↥S → ℝ) :
    ∃ x : ℝ, IsGreatest {x : ℝ | (fun i : ↥S => x + r i) ∈ G.w g S} x := by sorry

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