Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.3, p. 32 — games differing only in their nonstrategic components have the same pure Nash equilibria

Proved
HarmonicGames.Pareto.same_components_same_pure_nash

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

game-theoryharmonic-gamesnash-equilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M\mathcal MM be a finite set of players with nonempty finite strategy sets EmE^mEm, and let u=(um)mu = (u^m)_mu=(um)m​ and v=(vm)mv = (v^m)_mv=(vm)m​ be two games on them. Suppose uuu and vvv have the same potential component and the same harmonic component (Theorem 4.1):

D†δ0δ0†Du=D†δ0δ0†Dv,D†(I−δ0δ0†)Du=D†(I−δ0δ0†)Dv.D^\dagger \delta_0 \delta_0^\dagger D u = D^\dagger \delta_0 \delta_0^\dagger D v, \qquad D^\dagger (I - \delta_0 \delta_0^\dagger) D u = D^\dagger (I - \delta_0 \delta_0^\dagger) D v .D†δ0​δ0†​Du=D†δ0​δ0†​Dv,D†(I−δ0​δ0†​)Du=D†(I−δ0​δ0†​)Dv.

Then a strategy profile ppp is a pure Nash equilibrium of uuu if and only if it is a pure Nash equilibrium of vvv, where ppp is a pure Nash equilibrium of uuu when um(qm,p−m)≤um(p)u^m(q^m, p^{-m}) \le u^m(p)um(qm,p−m)≤um(p) for every player mmm and every qm∈Emq^m \in E^mqm∈Em.

The paper states this in Section 5.3: games that differ only in their nonstrategic components have identical pairwise comparisons, hence the same Nash equilibria. It is the bridge between the language of components, in which Lemma 5.4 and Theorem 5.9 are stated, and the equilibrium sets they speak about.

Formalization Note Pure Nash equilibrium is AGT.IsPureNash of the published agt_games bundle, applied to payoff E u; it is condition (1) of the paper. "Differ only in their nonstrategic components" is rendered as equality of the two component maps, exactly as in Lemma 5.4 and Theorem 5.9.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_HarmonicGames_Pareto_Games
Formal statement
namespace HarmonicGames.Pareto

/-- **§5.3, p. 32** (proof of Theorem 5.9). Games that differ only in their nonstrategic
components have the same pure Nash equilibria: if `u` and `v` have the same potential component
and the same harmonic component (Theorem 4.1), then a strategy profile is a pure Nash equilibrium
of `u` iff it is one of `v`. -/
theorem same_components_same_pure_nash {ι : Type} [Fintype ι] [DecidableEq ι] (E : ι → Type)
    [∀ m, Fintype (E m)] [∀ m, DecidableEq (E m)] [∀ m, Nonempty (E m)]
    (u v : HarmonicGames.Decomposition.Games E) (hP : HarmonicGames.Decomposition.potentialComponent E u = HarmonicGames.Decomposition.potentialComponent E v)
    (hH : HarmonicGames.Decomposition.harmonicComponent E u = HarmonicGames.Decomposition.harmonicComponent E v) (p : ∀ m, E m) :
    AGT.IsPureNash (HarmonicGames.GenericPure.payoff E u) p ↔ AGT.IsPureNash (HarmonicGames.GenericPure.payoff E v) p := by sorry

end HarmonicGames.Pareto
Source
Candogan, Menache, Ozdaglar, Parrilo, Flows and Decompositions of Games: Harmonic and Potential Games, arXiv:1005.2405v2, p. 32, Section 5.3 (proof of Theorem 5.9: "Games that differ only in nonstrategic components have identical pairwise comparisons, hence the set of Nash equilibria (NE) is the same for such games"); also p. 32, paragraph after Lemma 5.4
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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