Theorem 3.2, p. 173 — n + 1 points in a space of dimension k < n: the hulls of the n-point subsets meet
ProvedSionMinimax.KKM.theorem_3_2Let be a finite-dimensional real vector space of dimension , let be a natural number with , and let be a set of distinct points of . For each , write for the convex hull of the points other than . Then these convex hulls have a common point:
In Sion's argument this Helly-type fact is used in contrapositive form: if the hulls of the -point subfamilies of points have empty intersection, the points are affinely independent and span an -dimensional simplex. This is what allows the open-cover KKM theorem (Theorem 3.1) to be applied inside the convex set of Lemma 3.3.
Formalization Note The points are an injective family , which encodes " consists of points", and is the set difference . The dimension is the linear dimension , as printed. The paper writes for the empty set.
import Mathlib
namespace SionMinimax.KKM
theorem theorem_3_2 {V : Type*} [AddCommGroup V] [Module ℝ V] [FiniteDimensional ℝ V]
(n : ℕ) (hdim : Module.finrank ℝ V < n)
(a : Fin (n + 1) → V) (ha : Function.Injective a) :
(⋂ i : Fin (n + 1), convexHull ℝ (Set.range a \ {a i})).Nonempty := by sorry
end SionMinimax.KKM
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.