Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3, p. 21 — Σ_j x_{i,j} g_{i,j}(x) = 0

Proved
FixpNash.WeakApprox.sum_mul_gain_eq_zero

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

game-theorynash-equilibriump2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Γ\GammaΓ be a finite game and xxx a mixed profile. For every player iii, the gains gi,j(x)=ui((i:j);x−i)−ui(x)g_{i,j}(x)=u_i((i{:}j);x_{-i})-u_i(x)gi,j​(x)=ui​((i:j);x−i​)−ui​(x) average to zero under xix_ixi​:

∑j∈Sixi,j gi,j(x)=0.\sum_{j\in S_i}x_{i,j}\,g_{i,j}(x)=0.j∈Si​∑​xi,j​gi,j​(x)=0.

Splitting the sum by the sign of gi,j(x)g_{i,j}(x)gi,j​(x), with φi,j=max⁡{0,gi,j}\varphi_{i,j}=\max\{0,g_{i,j}\}φi,j​=max{0,gi,j​} and ψi,j=−gi,j\psi_{i,j}=-g_{i,j}ψi,j​=−gi,j​ where gi,j≤0g_{i,j}\le0gi,j​≤0, gives ∑xi,jφi,j(x)=∑xi,jψi,j(x)\sum x_{i,j}\varphi_{i,j}(x)=\sum x_{i,j}\psi_{i,j}(x)∑xi,j​φi,j​(x)=∑xi,j​ψi,j​(x), the identity on which the second direction of the proof of Proposition 3 is built.

Formalization Note The page writes the sum as ∑j=1mi\sum_{j=1}^{m_i}∑j=1mi​​; it runs over all of SiS_iSi​. xxx is a mixed profile in the sense of agt_games.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_FixpNash_WeakApprox_NashFunction
Formal statement
namespace FixpNash.WeakApprox

/-- Proof of Proposition 3, p. 21: for a mixed profile `x` and every player `i`,
`Σ_j x_{i,j} g_{i,j}(x) = 0`. -/
theorem sum_mul_gain_eq_zero {ι : Type*} [Fintype ι] [DecidableEq ι]
    {S : ι → Type*} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
    (u : ι → (∀ i, S i) → ℝ) (x : ∀ i, S i → ℝ) (hx : AGT.IsMixedProfile x) (i : ι) :
    ∑ j : S i, x i j * gain u x i j = 0 := by sorry

end FixpNash.WeakApprox
Source
Etessami & Yannakakis, On the complexity of Nash equilibria and other fixed points, author manuscript (SIAM J. Comput. 39 (2010)), proof of Proposition 3, second direction, p. 21
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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