Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1, p. 175 — a finite X ⊂ M beating every c < inf sup f gives sup inf f = inf sup f

Proved
SionMinimax.KneserFan.theorem_4_1

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

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

Let MMM and NNN be arbitrary sets, not both empty, and let f:M×N→Rf:M\times N\to\mathbb Rf:M×N→R be concave-convexlike. Suppose that for every real number c<inf⁡sup⁡fc<\inf\sup fc<infsupf there is a finite subset X⊂MX\subset MX⊂M such that for every ν∈N\nu\in Nν∈N there is an x∈Xx\in Xx∈X with f(x,ν)>cf(x,\nu)>cf(x,ν)>c. 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 dual of Theorem 4.1′, with the finite reduction made on the maximizing side; it yields Theorem 4.2′ (compact NNN, lower semicontinuity in ν\nuν) in the same way as 4.1′ yields 4.2.

Formalization Note The finite set XXX is a Finset M chosen after ccc and before ν\nuν; ccc is real and compared with the extended real inf⁡sup⁡f\inf\sup finfsupf through the coercion. The hypothesis "MMM or NNN is nonempty" is added: if M=N=∅M=N=\varnothingM=N=∅ the finite-set condition holds with X=∅X=\varnothingX=∅ 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_1 {M N : Type*} (f : M → N → ℝ) (hf : ConcaveConvexlike f)
    (hne : Nonempty M ∨ Nonempty N)
    (hfin : ∀ c : ℝ, (c : EReal) < infSup f →
      ∃ X : Finset M, ∀ ν : N, ∃ x ∈ X, c < f x ν) :
    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.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