Theorem 4.1′, p. 175 — a finite Y ⊂ N beating every c > sup inf f gives sup inf f = inf sup f
ProvedSionMinimax.KneserFan.theorem_4_1_primeLet and be arbitrary sets, not both empty, and let be concave-convexlike (concavelike in , convexlike in , in the sense of Fan). Suppose that for every real number there is a finite set such that for every there is a with . Then
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 is a Finset N chosen after and before , as on the page; ranges over the reals and is compared with the extended real through the coercion. The hypothesis " or is nonempty" is added: if the finite-set condition holds with , while and , so the printed statement fails in that corner only. When exactly one of is empty both sides coincide ( if , if ), so those cases are kept.
import Mathlib import Definitions.Def_SionMinimax_KneserFan_Concavelike
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.