Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.5 — FIP iff generalized ordinal potential

Proved
MondererShapley.Improvement.lemma_2_5

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 finite strategic-form game with payoff functions uiu^iui. The game has the finite improvement property if and only if it admits a generalized ordinal potential:

Γ has the FIP⟺∃P:Y→R  ∀i,y−i,x,z, ui(y−i,x)>ui(y−i,z)⟹P(y−i,x)>P(y−i,z).\Gamma\text{ has the FIP}\quad\Longleftrightarrow\quad \exists P:Y\to\mathbb R\;\forall i,y^{-i},x,z,\ u^i(y^{-i},x)>u^i(y^{-i},z)\Longrightarrow P(y^{-i},x)>P(y^{-i},z).Γ has the FIP⟺∃P:Y→R∀i,y−i,x,z, ui(y−i,x)>ui(y−i,z)⟹P(y−i,x)>P(y−i,z).

This characterizes termination of all strict unilateral improvement paths by a real-valued function that rises along every such step.

Formalization Note The player set and each strategy set are finite. The FIP is expressed as the absence of an infinite improvement path; a path step changes exactly one strategy to a different one.

Preamble
import Mathlib
import Definitions.Def_MondererShapley_Improvement_HasFIP
import Definitions.Def_MondererShapley_Improvement_IsGenOrdinalPotential
Formal statement
namespace MondererShapley.Improvement

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

/-- Lemma 2.5 (p. 129): the FIP characterizes generalized ordinal potentials in finite games. -/
theorem lemma_2_5 [Fintype ι] [∀ i, Fintype (Y i)]
    (u : ι → (∀ i, Y i) → ℝ) :
    HasFIP u ↔ ∃ P : (∀ i, Y i) → ℝ, IsGenOrdinalPotential u P := by sorry

end MondererShapley.Improvement
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 129 (PDF p. 6), Lemma 2.5
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