Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 3 — a closed convex set is approachable iff it meets every T(q); otherwise it is excludable with gₙ ≡ q₀

Proved
VectorPayoffs.Convex.convex_approachable_iff

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

approachabilityexcludabilityminimaxp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1vector-payoffs

Let MMM be an r×sr\times sr×s matrix (r,s≥1r,s\ge1r,s≥1) of probability distributions on a closed bounded convex X⊆RNX\subseteq\mathbb R^NX⊆RN, and for q∈Qq\in Qq∈Q let T(q)T(q)T(q) be the convex hull of the rrr points ∑j=1sqjmˉ(i,j)\sum_{j=1}^s q_j\bar m(i,j)∑j=1s​qj​mˉ(i,j). Let S⊆RNS\subseteq\mathbb R^NS⊆RN be closed and convex. Then

  1. SSS is approachable in MMM if and only if S∩T(q)≠∅S\cap T(q)\neq\emptysetS∩T(q)=∅ for every q∈Qq\in Qq∈Q;
  2. if S∩T(q0)=∅S\cap T(q_0)=\emptysetS∩T(q0​)=∅ for some q0∈Qq_0\in Qq0​∈Q, then SSS is excludable in MMM with the stationary strategy gn≡q0g_n\equiv q_0gn​≡q0​.

In particular every closed convex set is either approachable or excludable. This is the paper's vector analogue of von Neumann's minimax theorem.

Formalization Note SSS may be unbounded or empty (the empty set meets no T(q)T(q)T(q), is not approachable because its distance is +∞+\infty+∞, and is excludable). r,s≥1r,s\ge1r,s≥1 is added so that both players have strategies; the approachability notion quantifies over all plays of the strategies, on every probability space in Type.

Preamble
import Mathlib
import Definitions.Def_VectorPayoffs_Convex_Game

open MeasureTheory
Formal statement
namespace VectorPayoffs.Convex

/-- Blackwell (1956), §3, p. 6, THEOREM 3: a closed convex set `S` is approachable if and only
if it intersects every set `T(q)`; if it fails to intersect `T(q₀)`, it is excludable with
`gₙ ≡ q₀`. -/
theorem convex_approachable_iff {N r s : ℕ} (G : Game N r s) (hr : 1 ≤ r) (hs : 1 ≤ s)
    (S : Set (E N)) (hS : IsClosed S) (hSc : Convex ℝ S) :
    (G.ApproachableIn S ↔ ∀ q ∈ stdSimplex ℝ (Fin s), (S ∩ G.T q).Nonempty) ∧
      ∀ (q₀ : Fin s → ℝ) (hq₀ : q₀ ∈ stdSimplex ℝ (Fin s)), S ∩ G.T q₀ = ∅ →
        G.ExcludableWith S (Strategy.const q₀ hq₀) := by sorry

end VectorPayoffs.Convex
Source
Blackwell, An analog of the minimax theorem for vector payoffs, Pacific J. Math. 6(1), 1956, p. 6, THEOREM 3
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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