Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, proof of THEOREM A, p. 1137, (3.4a)–(3.4b) — the left side of (3.3) equals Σ_j α(j)uⁱ(j, s⁻ⁱ)

Proved
RegretMatching.Approach.eq_34

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

blackwell-approachabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regret-matching

Fix a player iii, a vector qqq on SiS^iSi, a vector λ∈RL\lambda\in\mathbb R^Lλ∈RL with L={(j,k)∈Si×Si:j≠k}L=\{(j,k)\in S^i\times S^i: j\ne k\}L={(j,k)∈Si×Si:j=k}, and a strategy profile sss (only s−is^{-i}s−i matters). Let Λλ\Lambda_\lambdaΛλ​ be the matrix with entries λ(j,k)\lambda(j,k)λ(j,k) for j≠kj\ne kj=k and 000 on the diagonal, and set

α(j):=∑k∈Siq(k)Λλ(k,j)−q(j)∑k∈SiΛλ(j,k)(3.4b).\alpha(j):=\sum_{k\in S^i}q(k)\Lambda_\lambda(k,j)-q(j)\sum_{k\in S^i}\Lambda_\lambda(j,k)\qquad(3.4b).α(j):=k∈Si∑​q(k)Λλ​(k,j)−q(j)k∈Si∑​Λλ​(j,k)(3.4b).

Then the left-hand side of (3.3) can be written as (3.4a):

∑(j,k)∈Lλ(j,k) q(j) [ui(k,s−i)−ui(j,s−i)]=∑j∈Siα(j) ui(j,s−i).\sum_{(j,k)\in L}\lambda(j,k)\,q(j)\,\big[u^i(k,s^{-i})-u^i(j,s^{-i})\big]=\sum_{j\in S^i}\alpha(j)\,u^i(j,s^{-i}).(j,k)∈L∑​λ(j,k)q(j)[ui(k,s−i)−ui(j,s−i)]=j∈Si∑​α(j)ui(j,s−i).

This identity reduces Blackwell's condition for the nonpositive orthant to the invariance equations (3.5): if α≡0\alpha\equiv0α≡0 the left side vanishes for every s−is^{-i}s−i.

Formalization Note. It is an algebraic identity: no hypothesis on qqq or λ\lambdaλ is needed. ui(k,s−i)u^i(k,s^{-i})ui(k,s−i) is u i (Function.update s i k), so the iii-th coordinate of s is ignored.

Preamble
import Mathlib
import Definitions.Def_RegretMatching_Approach_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RegretMatching.Approach

theorem eq_34
    {ι : Type} [Fintype ι] [DecidableEq ι]
    {S : ι → Type} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)] [∀ i, Nonempty (S i)]
    (u : ι → (∀ i, S i) → ℝ) (i : ι)
    (q : S i → ℝ) (lam : OffDiag (S i) → ℝ) (s : ∀ i, S i) :
    ∑ l : OffDiag (S i), lam l * q l.1.1 *
        (u i (Function.update s i l.1.2) - u i (Function.update s i l.1.1)) =
      ∑ j : S i, (∑ k : S i, q k * lamMat lam k j - q j * ∑ k : S i, lamMat lam j k) *
        u i (Function.update s i j) := by sorry

end RegretMatching.Approach
Source
Hart and Mas-Colell, A simple adaptive procedure leading to correlated equilibrium, Econometrica 68 (2000), p. 1137, proof of THEOREM A, (3.3), (3.4a), (3.4b)
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