Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.8, proof (4) ⇒ (2): four-cycles control all closed paths

Proved
MondererShapley.ClosedPath.closed_paths_of_four

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

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

Let uuu be the payoff vector of a game with finitely many players. If I(γ,u)=0I(\gamma,u)=0I(γ,u)=0 for every simple closed path γ\gammaγ of length four, then

I(μ,u)=0for every finite closed path μ.I(\mu,u)=0\qquad\text{for every finite closed path }\mu.I(μ,u)=0for every finite closed path μ.

This is the substantial implication of Theorem 2.8: checking the elementary four-corner cycles suffices for all closed paths.

Formalization Note Length counts genuine one-player steps. The hypothesis is restricted to simple closed four-step paths, not all four-step walks.

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

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

/-- Theorem 2.8, proof of (4) implies (2), pp. 138--139. -/
theorem closed_paths_of_four [Fintype ι]
    (u : ι → (∀ i, Y i) → ℝ)
    (hfour : ∀ γ : FinPath Y, γ.IsSimpleClosed → γ.len = 4 → γ.I u = 0) :
    ∀ γ : FinPath Y, γ.IsClosed → γ.I u = 0 := by sorry

end MondererShapley.ClosedPath
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), pp. 138–139 (PDF pp. 15–16), Theorem 2.8, proof (4) ⇒ (2); 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