Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1′, p. 175 — a finite Y ⊂ N beating every c > sup inf f gives sup inf f = inf sup f

Proved
SionMinimax.KneserFan.theorem_4_1_prime

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 (concavelike in MMM, convexlike in NNN, in the sense of Fan). Suppose that for every real number c>sup⁡inf⁡fc>\sup\inf fc>supinff there is a finite set Y⊂NY\subset NY⊂N such that for every μ∈M\mu\in Mμ∈M there is a y∈Yy\in Yy∈Y with f(μ,y)<cf(\mu,y)<cf(μ,y)<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(μ,ν),

the two sides being extended real numbers.

The hypothesis is a finite-reduction condition: it is exactly what a compactness argument supplies in the Kneser–Fan theorem (Theorem 4.2), which the paper derives from this statement. The paper notes that 4.1′ itself is an immediate consequence of the finite-dimensional minimax theorem (Theorem 3.4; von Neumann's theorem).

Formalization Note The finite set YYY is a Finset N chosen after ccc and before μ\muμ, as on the page; ccc ranges over the reals and is compared with the extended real sup⁡inf⁡f\sup\inf fsupinff 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 Y=∅Y=\varnothingY=∅, while sup⁡inf⁡f=sup⁡∅=−∞\sup\inf f=\sup\varnothing=-\inftysupinff=sup∅=−∞ and inf⁡sup⁡f=inf⁡∅=+∞\inf\sup f=\inf\varnothing=+\inftyinfsupf=inf∅=+∞, so the printed statement fails in that corner only. When exactly one of M,NM,NM,N is empty both sides coincide (−∞-\infty−∞ if M=∅M=\varnothingM=∅, +∞+\infty+∞ if N=∅N=\varnothingN=∅), so those cases are kept.

Preamble
import Mathlib
import Definitions.Def_SionMinimax_KneserFan_Concavelike
Formal statement
namespace SionMinimax.KneserFan
theorem theorem_4_1_prime {M N : Type*} (f : M → N → ℝ) (hf : ConcaveConvexlike f)
    (hne : Nonempty M ∨ Nonempty N)
    (hfin : ∀ c : ℝ, supInf f < (c : EReal) →
      ∃ Y : Finset N, ∀ μ : M, ∃ y ∈ Y, f μ y < c) :
    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