Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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 ≠ ∅

Proved
SionMinimax.KKM.theorem_3_1

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

convexitykkmminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1topology

Let EEE be a real topological vector space and let S⊆ES \subseteq ES⊆E be an nnn-dimensional simplex with vertices a0,…,ana_0, \dots, a_na0​,…,an​, that is, SSS is the convex hull of n+1n+1n+1 affinely independent points. Let A0,…,An⊆EA_0, \dots, A_n \subseteq EA0​,…,An​⊆E be sets such that

  1. each AiA_iAi​ is open in EEE;
  2. S⊆⋃i=0nAiS \subseteq \bigcup_{i=0}^n A_iS⊆⋃i=0n​Ai​;
  3. S−AiS - A_iS−Ai​ is convex for every iii;
  4. ai∉Aja_i \notin A_jai​∈/Aj​ whenever i≠ji \neq ji=j.

Then the sets have a common point:

⋂i=0nAi≠∅.\bigcap_{i=0}^{n} A_i \neq \emptyset.i=0⋂n​Ai​=∅.

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 Ai={μ:f(μ,yi)<c}A_i = \{\mu : f(\mu, y_i) < c\}Ai​={μ:f(μ,yi​)<c}, which are open relative to the convex set MMM, on a simplex spanned inside MMM.

Formalization Note Openness is ambient openness in EEE, and the conclusion is the nonempty intersection printed on the page. The strict sublevel sets used in Lemma 3.3 are open relative to MMM; applying this theorem there requires an open ambient representative when restricting to the simplex. No Hausdorff or finite-dimensionality assumption is placed on EEE.

Preamble
import Mathlib
Formal statement
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
Source
Sion, On general minimax theorems, Pacific J. Math. 8(1) (1958) 171–176, p. 173 (PDF p. 4), Theorem 3.1
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