Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.8, proof (2) ⇒ (1): vanishing closed-path sums give a potential

Proved
MondererShapley.ClosedPath.isPotentialGame_of_closed_paths

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

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

Let Γ\GammaΓ be a strategic-form game with payoff vector uuu. If every finite closed path γ\gammaγ satisfies I(γ,u)=0I(\gamma,u)=0I(γ,u)=0, then Γ\GammaΓ admits an exact potential PPP:

(∀γ closed, I(γ,u)=0) ⟹ ∃P  IsPotential⁡(u,P).\bigl(\forall\gamma\text{ closed},\ I(\gamma,u)=0\bigr)\ \Longrightarrow\ \exists P\;\operatorname{IsPotential}(u,P).(∀γ closed, I(γ,u)=0) ⟹ ∃PIsPotential(u,P).

This is the converse to the telescoping implication in Theorem 2.8 and turns path independence into a game-wide function.

Formalization Note The empty profile space is permitted; in that case a potential exists as a function on the empty type. Players are finite, but their strategy sets need not be finite.

Preamble
import Mathlib
import Definitions.Def_MondererShapley_ClosedPath_IsPotentialGame
import Definitions.Def_MondererShapley_ClosedPath_FinPath
Formal statement
namespace MondererShapley.ClosedPath

variable {ι : Type*} [DecidableEq ι] {Y : ι → Type*}

/-- Theorem 2.8, proof of (2) implies (1), p. 138. -/
theorem isPotentialGame_of_closed_paths [Fintype ι]
    (u : ι → (∀ i, Y i) → ℝ)
    (hclosed : ∀ γ : FinPath Y, γ.IsClosed → γ.I u = 0) :
    IsPotentialGame u := by sorry

end MondererShapley.ClosedPath
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 138 (PDF p. 15), Theorem 2.8, proof (2) ⇒ (1); https://doi.org/10.1006/game.1996.0044
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