Theorem 2.8, proof (4) ⇒ (2): four-cycles control all closed paths
ProvedMondererShapley.ClosedPath.closed_paths_of_fourgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games
Let be the payoff vector of a game with finitely many players. If for every simple closed path of length four, then
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.