Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compact-directed extended minimax with attained maxima

Proved
QAlgorithms.Papers.Independent.Intake100.P49.compact_directed_minimax

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let XXX be a nonempty compact topological space, YYY a nonempty upward-directed partially ordered set, and f:X×Y→[−∞,+∞]f:X\times Y\to[-\infty,+\infty]f:X×Y→[−∞,+∞].

For upper semicontinuous sections f(⋅,y)f(\cdot,y)f(⋅,y) and antitone sections f(x,⋅)f(x,\cdot)f(x,⋅), one has

max⁡x∈Xinf⁡y∈Yf(x,y)=inf⁡y∈Ymax⁡x∈Xf(x,y).\max_{x\in X}\inf_{y\in Y}f(x,y)=\inf_{y\in Y}\max_{x\in X}f(x,y).x∈Xmax​y∈Yinf​f(x,y)=y∈Yinf​x∈Xmax​f(x,y).

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P49
Formal statement
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
Source
The strong converse exponent of discriminating infinite-dimensional quantum states, arXiv:2107.08036v5, PDF p. 4, Lemma II.5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let XXX be a nonempty compact topological space, and let YYY be a nonempty partially ordered set in which every two elements have a common upper bound. Let f:X×Y→[−∞,+∞]f:X\times Y\to[-\infty,+\infty]f:X×Y→[−∞,+∞] satisfy that x↦f(x,y)x\mapsto f(x,y)x↦f(x,y) is upper semicontinuous for every y∈Yy\in Yy∈Y, and that y≤y′y\le y'y≤y′ implies f(x,y′)≤f(x,y)f(x,y')\le f(x,y)f(x,y′)≤f(x,y) for every x∈Xx\in Xx∈X. Then

sup⁡x∈Xinf⁡y∈Yf(x,y)=inf⁡y∈Ysup⁡x∈Xf(x,y).\sup_{x\in X}\inf_{y\in Y}f(x,y) =\inf_{y\in Y}\sup_{x\in X}f(x,y).x∈Xsup​y∈Yinf​f(x,y)=y∈Yinf​x∈Xsup​f(x,y).

Moreover, for every y∈Yy\in Yy∈Y there exists x∈Xx\in Xx∈X with f(x,y)=sup⁡x′∈Xf(x′,y)f(x,y)=\sup_{x'\in X}f(x',y)f(x,y)=supx′∈X​f(x′,y), and there exists x∈Xx\in Xx∈X with

inf⁡y∈Yf(x,y)=sup⁡x′∈Xinf⁡y∈Yf(x′,y).\inf_{y\in Y}f(x,y)=\sup_{x'\in X}\inf_{y\in Y}f(x',y).y∈Yinf​f(x,y)=x′∈Xsup​y∈Yinf​f(x′,y).

All extrema and equalities allow infinite extended-real values.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 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