Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6.3) — with P(ε_S) = Q(ε_S) + Σ_{i∈S} cⁱ, Q satisfies (6.2) iff P(ε_S) − P(ε_{S∖{i}}) = ψ(v_{S∪{i}})(i)

Proved
MondererShapley.Participation.eq_6_3

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

game-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games

Let ψ\psiψ be a solution, c∈RNc \in \mathbb R^Nc∈RN, vvv a TU game and Q:{0,1}N→RQ : \{0,1\}^N \to \mathbb RQ:{0,1}N→R. Define PPP on coalitions by

P(εS)=Q(εS)+∑i∈Sci.P(\varepsilon_S) = Q(\varepsilon_S) + \sum_{i \in S} c^i .P(εS​)=Q(εS​)+i∈S∑​ci.

Then QQQ satisfies (6.2), i.e. Q(εS)−Q(εS∖{i})=ψ(vS∪{i})(i)−ciQ(\varepsilon_S) - Q(\varepsilon_{S\setminus\{i\}}) = \psi(v_{S\cup\{i\}})(i) - c^iQ(εS​)−Q(εS∖{i}​)=ψ(vS∪{i}​)(i)−ci for every S⊆NS \subseteq NS⊆N and i∈Si \in Si∈S, if and only if

P(εS)−P(εS∖{i})=ψ(vS∪{i})(i)for all S⊆N and every i∈S.P(\varepsilon_S) - P(\varepsilon_{S \setminus \{i\}}) = \psi(v_{S \cup \{i\}})(i) \qquad \text{for all } S \subseteq N \text{ and every } i \in S.P(εS​)−P(εS∖{i}​)=ψ(vS∪{i}​)(i)for all S⊆N and every i∈S.

The change of variables removes the outside options cic^ici from the condition, which is why Theorem 6.1 holds for every ccc.

Formalization Note PPP is a function on coalitions (Finset ι → ℝ), P(S)P(S)P(S) standing for the page's P(εS)P(\varepsilon_S)P(εS​); S↦εSS \mapsto \varepsilon_SS↦εS​ is a bijection onto {0,1}N\{0,1\}^N{0,1}N. The defining relation of PPP is the hypothesis hP.

Preamble
import Mathlib
import Definitions.Def_MondererShapley_Participation_Solution
import Definitions.Def_MondererShapley_Participation_profileOf
Formal statement
namespace MondererShapley.Participation

/-- (6.3): with `P(ε_S) = Q(ε_S) + ∑_{i∈S} cⁱ`, `Q` satisfies (6.2) iff `P` satisfies
`P(ε_S) − P(ε_{S∖{i}}) = ψ(v_{S∪{i}})(i)` for all `S ⊆ N` and every `i ∈ S`. -/
theorem eq_6_3 {ι : Type*} [DecidableEq ι] (ψ : Solution ι) (c : ι → ℝ)
    (v : Finset ι → ℝ) (Q : (ι → Bool) → ℝ) (P : Finset ι → ℝ)
    (hP : ∀ S : Finset ι, P S = Q (profileOf S) + ∑ i ∈ S, c i) :
    (∀ S : Finset ι, ∀ i ∈ S,
        Q (profileOf S) - Q (profileOf (S \ {i})) = ψ (S ∪ {i}) v i - c i) ↔
      ∀ S : Finset ι, ∀ i ∈ S, P S - P (S \ {i}) = ψ (S ∪ {i}) v i := by sorry

end MondererShapley.Participation
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 137 (PDF p. 14), proof of Theorem 6.1, (6.3)
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