Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 25 — a finite Borel partition of Sⁱ on whose pieces hⁱ varies by less than ε

Proved
HartSchmeidler.Compact.exists_uniform_partition

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

compact-spacesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1uniform-continuity

Let each SiS^iSi be a nonempty compact Hausdorff space with its Borel σ-algebra, let S=∏jSjS=\prod_jS^jS=∏j​Sj carry the product topology, and let hi:S→Rh^i:S\to\mathbb Rhi:S→R be continuous. Fix a player iii and ε>0\varepsilon>0ε>0. Then there is a finite partition of SiS^iSi into pairwise disjoint nonempty Borel sets A1,…,AKA_1,\dots,A_KA1​,…,AK​ such that

∣hi(s−i,a)−hi(s−i,b)∣<εwhenever a,b∈Ak for some k, for every s−i∈S−i.\bigl|h^i(s^{-i},a)-h^i(s^{-i},b)\bigr|<\varepsilon\qquad\text{whenever } a,b\in A_k \text{ for some } k,\ \text{for every } s^{-i}\in S^{-i}.​hi(s−i,a)−hi(s−i,b)​<εwhenever a,b∈Ak​ for some k, for every s−i∈S−i.

The partition discretizes player iii's strategy space uniformly in the opponents' profile; it is the device that reduces a general measurable deviation to finitely many deviations of the special form.

Formalization Note The pieces are required to be nonempty, because the proof next fixes a point tki∈Akt_k^i\in A_ktki​∈Ak​; empty pieces of a partition can be discarded, so this costs nothing. (s−i,a)(s^{-i},a)(s−i,a) is the profile sss with its iii-th coordinate replaced by aaa, and the bound is required for every profile sss. If SiS^iSi were empty the partition would have K=0K=0K=0 pieces, but SiS^iSi is nonempty here.

Preamble
import Definitions.Def_HartSchmeidler_Compact_Game
Formal statement
namespace HartSchmeidler.Compact

open MeasureTheory

/-- Proof of Theorem 3, p. 25, the general case: for continuous `hⁱ` on the compact `S` and
`ε > 0`, `Sⁱ` has a finite partition into nonempty Borel sets `A₁, …, A_K` such that
`|hⁱ(s⁻ⁱ, a) − hⁱ(s⁻ⁱ, b)| < ε` whenever `a, b` lie in the same `A_k`, for every `s⁻ⁱ`. -/
theorem exists_uniform_partition {ι : Type*} [Nonempty ι] [DecidableEq ι] {S : ι → Type*}
    [∀ i, TopologicalSpace (S i)] [∀ i, CompactSpace (S i)] [∀ i, T2Space (S i)]
    [∀ i, Nonempty (S i)] [∀ i, MeasurableSpace (S i)] [∀ i, BorelSpace (S i)]
    (h : ι → Profile S → ℝ) (hcont : ∀ i, Continuous (h i))
    (i : ι) (ε : ℝ) (hε : 0 < ε) :
    ∃ (K : ℕ) (A : Fin K → Set (S i)),
      (∀ k, MeasurableSet (A k)) ∧ (∀ k, (A k).Nonempty) ∧ Pairwise (Function.onFun Disjoint A) ∧
        (⋃ k, A k) = Set.univ ∧
        ∀ k, ∀ a ∈ A k, ∀ b ∈ A k, ∀ s : Profile S,
          |h i (Function.update s i a) - h i (Function.update s i b)| < ε := by sorry

end HartSchmeidler.Compact
Source
Hart and Schmeidler, Existence of Correlated Equilibria, Math. Oper. Res. 14 (1989), p. 25, proof of Theorem 3, "The general case" ("it is straightforward to obtain a finite partition of S^i"); https://doi.org/10.1287/moor.14.1.18
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