Theorem 4.1, p. 175 — a finite X ⊂ M beating every c < inf sup f gives sup inf f = inf sup f
ProvedSionMinimax.KneserFan.theorem_4_1game-theoryminimaxp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and be arbitrary sets, not both empty, and let be concave-convexlike. Suppose that for every real number there is a finite subset such that for every there is an with . Then
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 , lower semicontinuity in ) in the same way as 4.1′ yields 4.2.
Formalization Note The finite set is a Finset M chosen after and before ; is real and compared with the extended real through the coercion. The hypothesis " or is nonempty" is added: if the finite-set condition holds with while .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.