Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 — in a harmonic game, ∑p−mum(rm,p−m)−um(qm,p−m)=0\sum_{p^{-m}} u^m(r^m,p^{-m}) - u^m(q^m,p^{-m}) = 0∑p−m​um(rm,p−m)−um(qm,p−m)=0

Proved
HarmonicGames.UniformMixed.lemma_5_2

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

game-theoryharmonic-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite game with players M\mathcal MM, nonempty finite strategy sets EmE^mEm and utilities u=(um)mu = (u^m)_mu=(um)m​, and suppose GGG is a harmonic game, i.e. u∈H⊕Nu \in \mathcal H \oplus \mathcal Nu∈H⊕N, the sum of the harmonic and nonstrategic subspaces of Definition 4.2. Then for every player m∈Mm \in \mathcal Mm∈M and all strategies qm,rm∈Emq^m, r^m \in E^mqm,rm∈Em,

∑p−m∈E−m(um(rm,p−m)−um(qm,p−m))=0,\sum_{p^{-m} \in E^{-m}} \big( u^m(r^m, p^{-m}) - u^m(q^m, p^{-m}) \big) = 0 ,p−m∈E−m∑​(um(rm,p−m)−um(qm,p−m))=0,

where E−m=∏k≠mEkE^{-m} = \prod_{k \ne m} E^kE−m=∏k=m​Ek is the set of strategy profiles of the players other than mmm.

In words: against an opponent profile drawn uniformly at random, every player of a harmonic game is indifferent between any two of its pure strategies. This is the identity behind Theorem 5.4.

Formalization Note The sum over p−m∈E−mp^{-m} \in E^{-m}p−m∈E−m is written as the sum over the profiles ppp with pm=rmp^m = r^mpm=rm (one profile per p−mp^{-m}p−m), and (qm,p−m)(q^m, p^{-m})(qm,p−m) is Function.update p m q. Harmonic game means membership in the submodule sum H⊔N\mathcal H \sqcup \mathcal NH⊔N.

Preamble
import Mathlib
import Definitions.Def_HarmonicGames_Decomposition_Games
import Definitions.Def_HarmonicGames_GenericPure_Games
Formal statement
namespace HarmonicGames.UniformMixed

/-- **Lemma 5.2** (p. 27): in a harmonic game `u ∈ H ⊕ N`, for every player `m` and all
`q^m, r^m ∈ E^m`, `∑_{p^{-m} ∈ E^{-m}} (u^m(r^m, p^{-m}) - u^m(q^m, p^{-m})) = 0`.
The sum over `p^{-m}` is the sum over the profiles `p` with `p^m = r^m`, each
`p^{-m}` counted once. -/
theorem lemma_5_2 {ι : Type} [Fintype ι] [DecidableEq ι] (E : ι → Type) [∀ m, Fintype (E m)]
    [∀ m, DecidableEq (E m)] [∀ m, Nonempty (E m)]
    (u : HarmonicGames.Decomposition.Games E) (hu : u ∈ HarmonicGames.GenericPure.harmonicGames E) (m : ι) (q r : E m) :
    ∑ p ∈ Finset.univ.filter (fun p : ∀ k, E k => p m = r),
      (HarmonicGames.GenericPure.payoff E u m p - HarmonicGames.GenericPure.payoff E u m (Function.update p m q)) = 0 := by sorry

end HarmonicGames.UniformMixed
Source
Candogan, Menache, Ozdaglar, Parrilo, Flows and Decompositions of Games: Harmonic and Potential Games, arXiv:1005.2405v2, p. 27, Lemma 5.2 (proof in Appendix A, pp. 42–43)
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