Compact-directed extended minimax with attained maxima
ProvedQAlgorithms.Papers.Independent.Intake100.P49.compact_directed_minimaxLet be a nonempty compact topological space, a nonempty upward-directed partially ordered set, and .
For upper semicontinuous sections and antitone sections , one has
Each maximum on the right, as well as the maximum on the left, is attained. This permits an exchange of a directed infimum with a compact maximum.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P49
noncomputable section
open Filter
open scoped ENNReal NNReal BigOperators
namespace QAlgorithms.Papers.Independent.Intake100.P49
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P13
(IsPositive IsTraceClass TraceClass traceNormTopology)
open QAlgorithms.Papers.Independent.Bridge50.P48 (hilbertPositiveTrace)
variable {H K : Type*}
[NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
[NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]
/-- Lemma II.5, PDF p.4, (II.6): extended minimax and attainment of both suprema.
Nonempty X,Y are the source's implicit conventions for maxima and directedness. -/
theorem compact_directed_minimax {X Y : Type*} [TopologicalSpace X]
[CompactSpace X] [Nonempty X] [PartialOrder Y] [Nonempty Y] [IsDirectedOrder Y]
(f : X → Y → EReal)
(husc : ∀ y, UpperSemicontinuous (fun x => f x y)) (hanti : ∀ x, Antitone (f x)) :
(⨆ x, ⨅ y, f x y) = (⨅ y, ⨆ x, f x y) ∧
(∀ y, ∃ x, f x y = ⨆ x, f x y) ∧
(∃ x, (⨅ y, f x y) = ⨆ x, ⨅ y, f x y) := by sorry
end QAlgorithms.Papers.Independent.Intake100.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty compact topological space, and let be a nonempty partially ordered set in which every two elements have a common upper bound. Let satisfy that is upper semicontinuous for every , and that implies for every . Then
Moreover, for every there exists with , and there exists with
All extrema and equalities allow infinite extended-real values.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.