Lemma 3.3′, p. 173 — dual: for a minimal finite X with each f(x, ·) quasi-convex and l.s.c. on convex N, some ν₀ ∈ N has f(x, ν₀) > c for all x ∈ X
ProvedSionMinimax.KKM.lemma_3_3_primeLet 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-convex on : every sublevel set is convex;
- is lower semicontinuous on , with respect to the topology inherits from .
Suppose that has the property for each there is an with , and is minimal with this property: no proper subset of has it. Then there is with
This is the dual of Lemma 3.3 (exchange the roles of the two variables and of and ); Sion's proof of Theorem 3.4 uses both lemmas, one for each player.
Formalization Note Same conventions as Lemma 3.3: is a real topological vector space without further assumptions, , is a Finset of , minimality means no strict sub-Finset has the property. The hypothesis is added, since for the hypotheses hold vacuously and the conclusion fails.
import Mathlib
namespace SionMinimax.KKM
theorem lemma_3_3_prime {E ι : Type*} [AddCommGroup E] [Module ℝ E] [TopologicalSpace E]
[IsTopologicalAddGroup E] [ContinuousSMul ℝ E]
(N : Set E) (hN : Convex ℝ N) (hne : N.Nonempty)
(X : Finset ι) (f : ι → E → ℝ) (c : ℝ)
(hq : ∀ x ∈ X, QuasiconvexOn ℝ N (fun ν => f x ν))
(hl : ∀ x ∈ X, LowerSemicontinuousOn (fun ν => f x ν) N)
(hP : ∀ ν ∈ N, ∃ x ∈ X, c < f x ν)
(hmin : ∀ X' : Finset ι, X' ⊂ X → ¬ ∀ ν ∈ N, ∃ x ∈ X', c < f x ν) :
∃ ν₀ ∈ N, ∀ x ∈ X, c < f x ν₀ := by sorry
end SionMinimax.KKM
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.