Theorem 5.1 — the set of potential games equals
ProvedHarmonicGames.Projection.theorem_5_1Throughout, is a finite set of players and each player has a nonempty finite strategy set with strategies; a game is given by utilities on the profiles . Write for the space of games, and , for the potential and nonstrategic subspaces of Definition 4.2, (28).
Theorem 5.1. The set of potential games is equal to the subspace : for every game ,
Here a potential game is one admitting with for all , , . The theorem identifies the set over which the closest potential game of Section 6 is taken as a linear subspace, which is what makes the projection well defined.
Formalization Note Potential games are the published MondererShapley.ClosedPath.IsPotentialGame. The sum is the submodule sup potentialSubspace E ⊔ nonstrategicSubspace E (that the sum is direct is part of Theorem 4.1, not of this statement). Strategy sets are assumed nonempty, as the paper's are.
import Mathlib import Definitions.Def_HarmonicGames_Projection_Closest
namespace HarmonicGames.Projection
/-- **Theorem 5.1** (p. 22). The set of potential games (Definition 2.1) is equal to the
subspace `P ⊕ N`: a game `u` is a potential game if and only if, as an element of `C0^M`, it lies
in the sum of the potential subspace `P` and the nonstrategic subspace `N` of (28). -/
theorem theorem_5_1 {ι : Type} [Fintype ι] [DecidableEq ι] (E : ι → Type)
[∀ m, Fintype (E m)] [∀ m, DecidableEq (E m)] [∀ m, Nonempty (E m)]
(u : ι → (∀ m, E m) → ℝ) :
MondererShapley.ClosedPath.IsPotentialGame u ↔
toGames E u ∈ HarmonicGames.Decomposition.potentialSubspace E ⊔ HarmonicGames.Decomposition.nonstrategicSubspace E := by sorry
end HarmonicGames.Projection
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.