Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
SionMinimax.KKM.lemma_3_3_prime

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

game-theoryminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quasi-convexsemicontinuity

Let EEE be a real topological vector space, N⊆EN \subseteq EN⊆E a nonempty convex set, XXX a finite set, ccc a real number, and fff a real-valued function on X×NX \times NX×N such that, for each x∈Xx \in Xx∈X,

  1. f(x,⋅)f(x, \cdot)f(x,⋅) is quasi-convex on NNN: every sublevel set {ν∈N:f(x,ν)≤r}\{\nu \in N : f(x, \nu) \le r\}{ν∈N:f(x,ν)≤r} is convex;
  2. f(x,⋅)f(x, \cdot)f(x,⋅) is lower semicontinuous on NNN, with respect to the topology NNN inherits from EEE.

Suppose that XXX has the property for each ν∈N\nu \in Nν∈N there is an x∈Xx \in Xx∈X with f(x,ν)>cf(x, \nu) > cf(x,ν)>c, and is minimal with this property: no proper subset of XXX has it. Then there is ν0∈N\nu_0 \in Nν0​∈N with

f(x,ν0)>cfor all x∈X.f(x, \nu_0) > c \quad \text{for all } x \in X.f(x,ν0​)>cfor all x∈X.

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: EEE is a real topological vector space without further assumptions, f:ι→E→Rf : \iota \to E \to \mathbb Rf:ι→E→R, XXX is a Finset of ι\iotaι, minimality means no strict sub-Finset has the property. The hypothesis N≠∅N \neq \emptysetN=∅ is added, since for N=X=∅N = X = \emptysetN=X=∅ the hypotheses hold vacuously and the conclusion fails.

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