Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 8.1, p. 50 — for an ε-optimal player and k > 1, the trimmed mass z^v is at most 1/k

Proved
RubinsteinNash.WeakNash.trimMass_le_inv

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

approximate-nash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-nash

Let xxx be a mixed-strategy profile of a finite game, let ϵ>0\epsilon>0ϵ>0 and k>1k>1k>1, and let vvv be a player whose mixed strategy xvx^vxv is an ϵ\epsilonϵ-best mixed response to x−vx^{-v}x−v. Let zvz^vzv be the total probability that xvx^vxv assigns to actions sss more than ϵk\epsilon kϵk away from the optimum, i.e. with Usv(x−v)<Umax⁡v(x−v)−ϵkU^v_s(x^{-v})<U^v_{\max}(x^{-v})-\epsilon kUsv​(x−v)<Umaxv​(x−v)−ϵk. Then

zv ≤ 1k < 1.z^v\ \le\ \frac1k\ <\ 1 .zv ≤ k1​ < 1.

This is what makes the normalisation xsv/(1−zv)x^v_s/(1-z^v)xsv​/(1−zv) in the trimmed profile x^\hat xx^ well defined for the ϵ\epsilonϵ-optimal players.

Formalization Note. The page says only that "zvz^vzv is bounded away from 1"; the formalization states the quantitative bound zv≤1/kz^v\le 1/kzv≤1/k, which for k>1k>1k>1 is the bound away from 1. The statement uses no polymatrix structure, so it is stated for an arbitrary finite game, which contains the bipartite polymatrix games of Lemma 8.1.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_DGPNash_NashMap_nashMap
import Definitions.Def_DGPNash_WellSupported_Equilibria
import Definitions.Def_RubinsteinNash_WeakNash_ApproxEquilibria
Formal statement
namespace RubinsteinNash.WeakNash

theorem trimMass_le_inv {ι : 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)
    (ε k : ℝ) (hε : 0 < ε) (hk : 1 < k) (v : ι) (hv : IsEpsBestResponse u x ε v) :
    DGPNash.WellSupported.trimMass u x ε k v ≤ 1 / k := by sorry

end RubinsteinNash.WeakNash
Source
Rubinstein, arXiv:1606.04550 (version dated August 26, 2016), proof of Lemma 8.1, §8.1, p. 50 (sentence after the definition of x̂: 'for k > 1 and v who plays ϵ-optimally, z^v is bounded away from 1')
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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