Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3, p. 173 — for a minimal finite Y with each f(·, y) quasi-concave and u.s.c. on convex M, some μ₀ ∈ M has f(μ₀, y) < c for all y ∈ Y

Proved
SionMinimax.KKM.lemma_3_3

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

game-theoryminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-concavesemicontinuity

Let EEE be a real topological vector space, M⊆EM \subseteq EM⊆E a nonempty convex set, YYY a finite set, ccc a real number, and fff a real-valued function on M×YM \times YM×Y such that, for each y∈Yy \in Yy∈Y,

  1. f(⋅,y)f(\cdot, y)f(⋅,y) is quasi-concave on MMM: every superlevel set {μ∈M:f(μ,y)≥r}\{\mu \in M : f(\mu, y) \ge r\}{μ∈M:f(μ,y)≥r} is convex;
  2. f(⋅,y)f(\cdot, y)f(⋅,y) is upper semicontinuous on MMM, with respect to the topology MMM inherits from EEE.

Suppose that YYY has the property for each μ∈M\mu \in Mμ∈M there is a y∈Yy \in Yy∈Y with f(μ,y)<cf(\mu, y) < cf(μ,y)<c, and is minimal with this property: no proper subset of YYY has it. Then a single point of MMM works for every yyy at once: there is μ0∈M\mu_0 \in Mμ0​∈M with

f(μ0,y)<cfor all y∈Y.f(\mu_0, y) < c \quad \text{for all } y \in Y.f(μ0​,y)<cfor all y∈Y.

This lemma, together with its dual Lemma 3.3′, is the core of Sion's own proof of his minimax theorem (Theorem 3.4): after reducing to finite covers, a minimal finite set of strategies of one player can be beaten simultaneously by one strategy of the other.

Formalization Note EEE carries the standard real topological vector space structure (topological additive group with continuous scalar multiplication), with no Hausdorff or finite-dimensionality assumption; "convex set" in the paper is read as a convex subset of such a space. The function is typed as f:E→ι→Rf : E \to \iota \to \mathbb Rf:E→ι→R and YYY is a Finset of the index type ι\iotaι; every hypothesis refers only to points of MMM and indices in YYY, so the values of fff elsewhere are irrelevant. Minimality is encoded as: no strict sub-Finset Y′⊂YY' \subset YY′⊂Y has the property. The hypothesis M≠∅M \neq \emptysetM=∅ is added: for M=Y=∅M = Y = \emptysetM=Y=∅ the property and its minimality hold vacuously while no μ0∈M\mu_0 \in Mμ0​∈M exists, so the printed statement fails in that corner. For nonempty MMM the property already forces Y≠∅Y \neq \emptysetY=∅.

Preamble
import Mathlib
Formal statement
namespace SionMinimax.KKM
theorem lemma_3_3 {E ι : Type*} [AddCommGroup E] [Module ℝ E] [TopologicalSpace E]
    [IsTopologicalAddGroup E] [ContinuousSMul ℝ E]
    (M : Set E) (hM : Convex ℝ M) (hne : M.Nonempty)
    (Y : Finset ι) (f : E → ι → ℝ) (c : ℝ)
    (hq : ∀ y ∈ Y, QuasiconcaveOn ℝ M (fun μ => f μ y))
    (hu : ∀ y ∈ Y, UpperSemicontinuousOn (fun μ => f μ y) M)
    (hP : ∀ μ ∈ M, ∃ y ∈ Y, f μ y < c)
    (hmin : ∀ Y' : Finset ι, Y' ⊂ Y → ¬ ∀ μ ∈ M, ∃ y ∈ Y', f μ y < c) :
    ∃ μ₀ ∈ M, ∀ y ∈ Y, f μ₀ y < c := by sorry
end SionMinimax.KKM
Source
Sion, On general minimax theorems, Pacific J. Math. 8(1) (1958) 171–176, p. 173 (PDF p. 4), Lemma 3.3
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