Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2 (Kneser, Fan), p. 175 — M compact, f concave-convexlike and u.s.c. in μ: sup inf f = inf sup f

Proved
SionMinimax.KneserFan.theorem_4_2

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

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

Kneser–Fan minimax theorem. Let MMM be a compact topological space and NNN an arbitrary set, not both empty, and let f:M×N→Rf:M\times N\to\mathbb Rf:M×N→R be concave-convexlike: concavelike in MMM and convexlike in NNN in the sense of Fan. If for each ν∈N\nu\in Nν∈N the function μ↦f(μ,ν)\mu\mapsto f(\mu,\nu)μ↦f(μ,ν) is upper semicontinuous on MMM, 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 Fan's generalization of Kneser's minimax theorem from concave-convex functions on convex sets to concave-convexlike functions on spaces without linear structure. It is not a special case of Sion's quasi-concave-convex minimax theorem, since the two classes of functions are independent.

Formalization Note MMM carries an arbitrary topology with CompactSpace M (no Hausdorff assumption); NNN has no structure. Upper semicontinuity is Mathlib's UpperSemicontinuous on MMM. The values sup⁡inf⁡f\sup\inf fsupinff and inf⁡sup⁡f\inf\sup finfsupf are computed in EReal. 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; when exactly one of them is empty both sides agree.

Preamble
import Mathlib
import Definitions.Def_SionMinimax_KneserFan_Concavelike
Formal statement
namespace SionMinimax.KneserFan
theorem theorem_4_2 {M N : Type*} [TopologicalSpace M] [CompactSpace M]
    (f : M → N → ℝ) (hf : ConcaveConvexlike f)
    (hne : Nonempty M ∨ Nonempty N)
    (husc : ∀ ν : N, UpperSemicontinuous (fun μ : M => 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 (Kneser, Fan)
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