AFTD Auto-Formalizing Theoretical Domains

OnlineLearning.ConvexCompactMinimaxStatement

defimported Lean

For sets $X, Y \subseteq \bbr$ and a payoff function $f : \bbr \to \bbr \to \bbr$, OnlineLearning.ConvexCompactMinimaxStatement is the proposition \[ \inf_{x \in X}\,\sup_{y \in Y}\,f(x,y) \;=\; \sup_{y \in Y}\,\inf_{x \in X}\,f(x,y). \] It is packaged as a named Prop so that intermediate lemmas can refer to it while the proof is built up incrementally.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Real Finset BigOperators in
def OnlineLearning.ConvexCompactMinimaxStatement (X Y : Set ℝ) (f : ℝ → ℝ → ℝ) : Prop
Defined in
TCSlib, `OnlineLearning.ConvexCompactMinimaxStatement`
Lean proof
By Karim Abdel Sadek, Mark Bedaywi, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Karim Abdel Sadek and Mark Bedaywi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Used by 3

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Real Finset BigOperators in
/-- The conclusion of the convex-compact minimax theorem for a payoff `f` on `X × Y`: the upper value `inf_{x ∈ X} sup_{y ∈ Y} f x y` equals the lower value `sup_{y ∈ Y} inf_{x ∈ X} f x y`. [CBL06, Thm 7.1]. Deviation: specialized to subsets `X, Y ⊆ ℝ` (the source allows convex subsets of general topological vector spaces). This is packaged as a `Prop` so that the target can be referenced while the proof is developed in smaller lemmas. -/
def OnlineLearning.ConvexCompactMinimaxStatement (X Y : Set ℝ) (f : ℝ → ℝ → ℝ) : Prop :=
  (⨅ x : X, ⨆ y : Y, f x y) = (⨆ y : Y, ⨅ x : X, f x y)
See it in the graphDiscuss this resultChallenge it