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
ProvedSionMinimax.KKM.lemma_3_3Let be a real topological vector space, a nonempty convex set, a finite set, a real number, and a real-valued function on such that, for each ,
- is quasi-concave on : every superlevel set is convex;
- is upper semicontinuous on , with respect to the topology inherits from .
Suppose that has the property for each there is a with , and is minimal with this property: no proper subset of has it. Then a single point of works for every at once: there is with
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 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 and is a Finset of the index type ; every hypothesis refers only to points of and indices in , so the values of elsewhere are irrelevant. Minimality is encoded as: no strict sub-Finset has the property. The hypothesis is added: for the property and its minimality hold vacuously while no exists, so the printed statement fails in that corner. For nonempty the property already forces .
import Mathlib
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.