Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2′, p. 175 — N compact, f concave-convexlike and l.s.c. in ν: sup inf f = inf sup f

Proved
SionMinimax.KneserFan.theorem_4_2_prime

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

game-theoryminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1topology

Let MMM be an arbitrary set and NNN a compact topological space, not both empty, and let f:M×N→Rf:M\times N\to\mathbb Rf:M×N→R be concave-convexlike. If for each μ∈M\mu\in Mμ∈M the function ν↦f(μ,ν)\nu\mapsto f(\mu,\nu)ν↦f(μ,ν) is lower semicontinuous on NNN, then

sup⁡μ∈Minf⁡ν∈Nf(μ,ν)  =  inf⁡ν∈Nsup⁡μ∈Mf(μ,ν),\sup_{\mu\in M}\inf_{\nu\in N} f(\mu,\nu)\;=\;\inf_{\nu\in N}\sup_{\mu\in M} f(\mu,\nu),μ∈Msup​ν∈Ninf​f(μ,ν)=ν∈Ninf​μ∈Msup​f(μ,ν),

in the extended reals.

This is the companion of the Kneser–Fan theorem (Theorem 4.2) with the roles of the two players exchanged: compactness and semicontinuity are required on the minimizing side.

Formalization Note NNN carries an arbitrary topology with CompactSpace N; no Hausdorff or linear structure is assumed, and MMM has no structure at all. The hypothesis "MMM or NNN is nonempty" is added because with M=N=∅M=N=\varnothingM=N=∅ every other hypothesis holds while sup⁡inf⁡f=−∞≠+∞=inf⁡sup⁡f\sup\inf f=-\infty\neq+\infty=\inf\sup fsupinff=−∞=+∞=infsupf.

Preamble
import Mathlib
import Definitions.Def_SionMinimax_KneserFan_Concavelike
Formal statement
namespace SionMinimax.KneserFan
theorem theorem_4_2_prime {M N : Type*} [TopologicalSpace N] [CompactSpace N]
    (f : M → N → ℝ) (hf : ConcaveConvexlike f)
    (hne : Nonempty M ∨ Nonempty N)
    (hlsc : ∀ μ : M, LowerSemicontinuous (fun ν : N => f μ ν)) :
    supInf f = infSup f := by sorry
end SionMinimax.KneserFan
Source
Sion, On general minimax theorems, Pacific J. Math. 8(1) (1958) 171–176, p. 175 (PDF p. 6), Theorem 4.2′
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