Theorem 3.1, p. 173 — open-cover KKM theorem: open A_i covering a simplex, S − A_i convex, a_i ∉ A_j (i ≠ j) ⇒ ⋂ A_i ≠ ∅
ProvedSionMinimax.KKM.theorem_3_1Let be a real topological vector space and let be an -dimensional simplex with vertices , that is, is the convex hull of affinely independent points. Let be sets such that
- each is open in ;
- ;
- is convex for every ;
- whenever .
Then the sets have a common point:
This is an open-set version of the theorem of Knaster, Kuratowski and Mazurkiewicz. In the proof of Sion's Lemma 3.3 it is applied to the strict sublevel sets , which are open relative to the convex set , on a simplex spanned inside .
Formalization Note Openness is ambient openness in , and the conclusion is the nonempty intersection printed on the page. The strict sublevel sets used in Lemma 3.3 are open relative to ; applying this theorem there requires an open ambient representative when restricting to the simplex. No Hausdorff or finite-dimensionality assumption is placed on .
import Mathlib
namespace SionMinimax.KKM
theorem theorem_3_1 {E : Type*} [AddCommGroup E] [Module ℝ E] [TopologicalSpace E]
[IsTopologicalAddGroup E] [ContinuousSMul ℝ E]
(n : ℕ) (a : Fin (n + 1) → E) (haff : AffineIndependent ℝ a)
(A : Fin (n + 1) → Set E)
(hA : ∀ i, IsOpen (A i))
(hcov : convexHull ℝ (Set.range a) ⊆ ⋃ i, A i)
(hconv : ∀ i, Convex ℝ (convexHull ℝ (Set.range a) \ A i))
(hv : ∀ i j, i ≠ j → a i ∉ A j) :
(⋂ i, A i).Nonempty := by sorry
end SionMinimax.KKM
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.