Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, proof of THEOREM A, p. 1137 — an invariant q_λ satisfies (3.3) as an equality: λ·v(q_λ, s⁻ⁱ) = 0

Proved
RegretMatching.Approach.blackwell_condition_negOrthant

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 and let 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}. Let λ∈R+L\lambda\in\mathbb R^L_+λ∈R+L​ (all coordinates nonnegative), and let qλ∈Δ(Si)q_\lambda\in\Delta(S^i)qλ​∈Δ(Si) satisfy (3.5) for the matrix Λλ\Lambda_\lambdaΛλ​ with entries λ(j,k)\lambda(j,k)λ(j,k) off the diagonal and 000 on it:

∑k∈Siqλ(k)Λλ(k,j)=qλ(j)∑k∈SiΛλ(j,k)for every j.\sum_{k\in S^i}q_\lambda(k)\Lambda_\lambda(k,j)=q_\lambda(j)\sum_{k\in S^i}\Lambda_\lambda(j,k)\qquad\text{for every }j .k∈Si∑​qλ​(k)Λλ​(k,j)=qλ​(j)k∈Si∑​Λλ​(j,k)for every j.

Then for every s−is^{-i}s−i the expected vector payoff v(qλ,s−i)=∑si∈Siqλ(si)v(si,s−i)v(q_\lambda,s^{-i})=\sum_{s^i\in S^i}q_\lambda(s^i)v(s^i,s^{-i})v(qλ​,s−i)=∑si∈Si​qλ​(si)v(si,s−i) is orthogonal to λ\lambdaλ:

λ⋅v(qλ,s−i)=0.\lambda\cdot v(q_\lambda,s^{-i})=0 .λ⋅v(qλ​,s−i)=0.

Here v(si,s−i)∈RLv(s^i,s^{-i})\in\mathbb R^Lv(si,s−i)∈RL has (j,k)(j,k)(j,k)-coordinate ui(k,s−i)−ui(j,s−i)u^i(k,s^{-i})-u^i(j,s^{-i})ui(k,s−i)−ui(j,s−i) if si=js^i=jsi=j and 000 otherwise.

This is inequality (3.3) "as an equality", and hence Blackwell's condition (3.2) for the nonpositive orthant R−L\mathbb R^L_-R−L​, whose support function is 000 on R+L\mathbb R^L_+R+L​.

Formalization Note. The conclusion is stated as the equality the paper asserts, not the weaker ≤0\le 0≤0. RL\mathbb R^LRL is EuclideanSpace ℝ L and λ⋅x\lambda\cdot xλ⋅x is its inner product. The profile s stands for s−is^{-i}s−i; its iii-th coordinate is ignored by vvv.

Preamble
import Mathlib
import Definitions.Def_RegretMatching_Approach_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RegretMatching.Approach

theorem blackwell_condition_negOrthant
    {ι : Type} [Fintype ι] [DecidableEq ι]
    {S : ι → Type} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)] [∀ i, Nonempty (S i)]
    (u : ι → (∀ i, S i) → ℝ) (i : ι)
    (lam : EuclideanSpace ℝ (OffDiag (S i))) (hlam : ∀ l, 0 ≤ lam l)
    (q : S i → ℝ) (hq : q ∈ stdSimplex ℝ (S i))
    (h35 : ∀ j : S i, ∑ k : S i, q k * lamMat (fun l => lam l) k j
      = q j * ∑ k : S i, lamMat (fun l => lam l) j k) :
    ∀ s : ∀ i, S i, inner ℝ lam (∑ a : S i, q a • vecPay u i a s) = 0 := 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) and (3.5), footnote 17
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