Remark 3.6, p. 174 — a quasi-concave-convex f on [0,1]² with f(·, 1) not u.s.c. has sup inf f = 0 and inf sup f = 1
ProvedSionMinimax.KKM.remark_3_6Let and define by
Then:
- for each , is quasi-concave on ;
- for each , is quasi-convex on ;
- for each , is lower semicontinuous on ;
- is not upper semicontinuous on ;
- and .
The example shows that in Sion's minimax theorem (Theorem 3.4) the upper semicontinuity in the first variable cannot simply be dropped, even for compact convex subsets of the real line: all other hypotheses hold and the minimax equality fails.
Formalization Note The page's condition " and or and " is read with "and" binding tighter than "or". The suprema and infima are taken over the subtype and computed in the extended reals EReal through the coercion of the real values. Only the checkable claims about the example are formalized; the informal assertion that the semicontinuity condition "cannot be removed nor appreciably weakened" is not a mathematical statement and is left out.
import Mathlib
namespace SionMinimax.KKM
theorem remark_3_6 :
let f : ℝ → ℝ → ℝ := fun μ ν =>
if (0 ≤ μ ∧ μ < 1 / 2 ∧ ν = 0) ∨ (1 / 2 ≤ μ ∧ μ ≤ 1 ∧ ν = 1) then 0 else 1
(∀ ν ∈ Set.Icc (0 : ℝ) 1, QuasiconcaveOn ℝ (Set.Icc (0 : ℝ) 1) (fun μ => f μ ν)) ∧
(∀ μ ∈ Set.Icc (0 : ℝ) 1, QuasiconvexOn ℝ (Set.Icc (0 : ℝ) 1) (fun ν => f μ ν)) ∧
(∀ μ ∈ Set.Icc (0 : ℝ) 1, LowerSemicontinuousOn (fun ν => f μ ν) (Set.Icc (0 : ℝ) 1)) ∧
¬ UpperSemicontinuousOn (fun μ => f μ 1) (Set.Icc (0 : ℝ) 1) ∧
(⨆ μ : Set.Icc (0 : ℝ) 1, ⨅ ν : Set.Icc (0 : ℝ) 1, ((f μ ν : ℝ) : EReal)) = 0 ∧
(⨅ ν : Set.Icc (0 : ℝ) 1, ⨆ μ : Set.Icc (0 : ℝ) 1, ((f μ ν : ℝ) : EReal)) = 1 := by sorry
end SionMinimax.KKM
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.