Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.8: exact potentials and closed paths of length four

Proved
MondererShapley.ClosedPath.theorem_2_8

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

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

For a strategic-form game Γ\GammaΓ with finitely many players, the following four claims are equivalent:

  1. Γ\GammaΓ admits an exact potential.
  2. I(γ,u)=0I(\gamma,u)=0I(γ,u)=0 for every finite closed path γ\gammaγ.
  3. I(γ,u)=0I(\gamma,u)=0I(γ,u)=0 for every finite simple closed path γ\gammaγ.
  4. I(γ,u)=0I(\gamma,u)=0I(γ,u)=0 for every finite simple closed path γ\gammaγ of length four.

In symbols, the final criterion uses

I(γ,u)=∑k=1N(uik(yk)−uik(yk−1))=0I(\gamma,u)=\sum_{k=1}^{N}\bigl(u^{i_k}(y_k)-u^{i_k}(y_{k-1})\bigr)=0I(γ,u)=k=1∑N​(uik​(yk​)−uik​(yk−1​))=0

on every simple closed γ=(y0,…,yN)\gamma=(y_0,\ldots,y_N)γ=(y0​,…,yN​) with N=4N=4N=4. This characterization reduces the global potential property to a local condition on four-corner cycles.

Formalization Note The statement retains all four equivalence clauses. Players form a finite type; their strategy sets are arbitrary. A step changes exactly one coordinate to a different value, a simple closed path repeats no vertex before its terminal return, and its length is its number of steps.

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*}

/-- The four equivalent conditions of Theorem 2.8, p. 131. -/
theorem theorem_2_8 [Fintype ι] (u : ι → (∀ i, Y i) → ℝ) :
    [IsPotentialGame u,
     ∀ γ : FinPath Y, γ.IsClosed → γ.I u = 0,
     ∀ γ : FinPath Y, γ.IsSimpleClosed → γ.I u = 0,
     ∀ γ : FinPath Y, γ.IsSimpleClosed → γ.len = 4 → γ.I u = 0].TFAE := by sorry

end MondererShapley.ClosedPath
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 131 (PDF p. 8), Theorem 2.8; 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