Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.3, proof — player 1's condition (2.2) is equivalent to (2.4)

Proved
Aumann1987.TwoPerson.player1_iff_ineq_2_4

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

correlated-equilibriumgame-theoryp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (pjk)(p_{jk})(pjk​) be a distribution on S1×S2S^1\times S^2S1×S2 and h1h^1h1 player 1's payoff. Player 1's equilibrium condition (2.2) written on ppp — for every φ:S1→S1\varphi:S^1\to S^1φ:S1→S1, ∑j∑kpjkhφ(j)k1≤∑j∑kpjkhjk1\sum_j\sum_k p_{jk}h^1_{\varphi(j)k}\le\sum_j\sum_k p_{jk}h^1_{jk}∑j​∑k​pjk​hφ(j)k1​≤∑j​∑k​pjk​hjk1​ — holds if and only if

∑k(hjk1−hqk1)pjk ≥ 0for all j,q∈S1,\sum_k\big(h^1_{jk}-h^1_{qk}\big)p_{jk}\ \ge\ 0\qquad\text{for all }j,q\in S^1,k∑​(hjk1​−hqk1​)pjk​ ≥ 0for all j,q∈S1,

which is condition (2.4) of Proposition 2.3. For an impossible suggestion jjj (all pjk=0p_{jk}=0pjk​=0) the inequality reads 0≥00\ge00≥0.

Preamble
import Mathlib
import Definitions.Def_Aumann1987_TwoPerson_Model

open Finset
Formal statement
namespace Aumann1987.TwoPerson

/-- **Player 1 gives (2.4)** (Aumann 1987, Proposition 2.3, proof, p. 6, PDF p. 7). For a
distribution `p`, player 1's equilibrium condition (2.2) written on `p` holds iff
`∑_k (h¹_{jk} − h¹_{qk}) p_{jk} ≥ 0` for all `j, q ∈ S¹`, which is (2.4).

Formalization Note: the paper says "multiply through by `Σⱼ pⱼₖ`"; the factor is `Σₖ pⱼₖ`
(misprint). For an impossible `j` all `p_{jk} = 0` and (2.4) reads `0 ≥ 0`. -/
theorem player1_iff_ineq_2_4 {S₁ S₂ : Type*} [Fintype S₁] [Fintype S₂]
    (h₁ : S₁ → S₂ → ℝ) (p : S₁ → S₂ → ℝ) (hp : IsDistribution p) :
    DevCond₁ h₁ p ↔ ∀ j q : S₁, 0 ≤ ∑ k, (h₁ j k - h₁ q k) * p j k := by sorry

end Aumann1987.TwoPerson
Source
Aumann, Correlated Equilibrium as an Expression of Bayesian Rationality, Econometrica 55 (1987), DOI 10.2307/1911154, p. 6 (PDF p. 7), Proposition 2.3, proof (player 1 gives (2.4))
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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