Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 2 — no countably additive correlated equilibrium

Proved
HartSchmeidler.FinStrat.example2_no_countably_additive_ce

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

correlated-equilibriuminfinite-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1peleg-example

In the modified Peleg game, players are the positive integers and choose 000 or 111. If only finitely many players choose 111, player iii receives si/i2s^i/i^2si/i2; otherwise the payoff is −si-s^i−si. There is no countably additive probability measure on the product σ-algebra satisfying the correlated-equilibrium inequalities:

∄p countably additive on Σ0 such that p satisfies (3).\nexists p\text{ countably additive on }\Sigma_0\text{ such that }p\text{ satisfies (3).}∄p countably additive on Σ0​ such that p satisfies (3).

Example 2 establishes that the continuity assumption in Theorem 2(ii) cannot simply be removed.

Formalization Note. The player type is the positive naturals, so i2i^2i2 is never zero. Case 1 means finitely many 111 coordinates. The impossibility on Σ0\Sigma_0Σ0​ also rules out a countably additive equilibrium on any larger σ-algebra whose restriction to Σ0\Sigma_0Σ0​ satisfies (3).

Preamble
import Definitions.Def_HartSchmeidler_FinStrat_Peleg
Formal statement
namespace HartSchmeidler.FinStrat

open MeasureTheory

/-- Example 2, p. 22: the modified Peleg game has no countably additive
correlated equilibrium on the product σ-algebra. -/
theorem example2_no_countably_additive_ce :
    ¬ ∃ μ : Measure (PNat → Fin 2), IsCorrelatedEq peleg2Payoff μ := by sorry

end HartSchmeidler.FinStrat
Source
Hart and Schmeidler, Existence of Correlated Equilibria, Math. Oper. Res. 14 (1989), p. 22, Example 2 ('Next, we prove ...')
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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