Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.8, path-independence claim (A.1)

Proved
MondererShapley.ClosedPath.I_eq_of_same_endpoints

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

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

Assume I(μ,u)=0I(\mu,u)=0I(μ,u)=0 for every finite closed path μ\muμ. If two finite paths γ1\gamma_1γ1​ and γ2\gamma_2γ2​ have the same initial vertex and the same terminal vertex, then

I(γ1,u)=I(γ2,u).I(\gamma_1,u)=I(\gamma_2,u).I(γ1​,u)=I(γ2​,u).

The path sum therefore depends only on its endpoints, making the potential constructed in equation (A.1) well defined.

Formalization Note The paths carry their unique deviators explicitly, and no finiteness condition is placed on players' strategy sets.

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

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

/-- Theorem 2.8, proof of (2) implies (1), path-independence claim (A.1), p. 138. -/
theorem I_eq_of_same_endpoints [Fintype ι]
    (u : ι → (∀ i, Y i) → ℝ)
    (hclosed : ∀ γ : FinPath Y, γ.IsClosed → γ.I u = 0)
    (γ₁ γ₂ : FinPath Y)
    (hstart : γ₁.pt 0 = γ₂.pt 0)
    (hend : γ₁.pt (Fin.last γ₁.len) = γ₂.pt (Fin.last γ₂.len)) :
    γ₁.I u = γ₂.I 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), claim preceding (A.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