AFTD Auto-Formalizing Theoretical Domains

OnlineLearning.finiteUpperImage_isOpen

theoremverifiedimported Lean

The finite upper image is open. Let $X, Y \subseteq \bbr$, let $f : \bbr \to \bbr \to \bbr$ be a payoff function, and let $u$ be a finite sample of columns from $Y$. Then the finite upper image \[ U(X,f,u) \;=\; \{\, z : u \to \bbr \;\mid\; \exists\, x \in X,\ \forall y \in u,\ f(x,y) < z_y \,\} \] is an open subset of the space $u \to \bbr$ of vectors indexed by $u$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Real Finset BigOperators in
lemma OnlineLearning.finiteUpperImage_isOpen {X Y : Set ℝ} {f : ℝ → ℝ → ℝ} (u : Finset Y) :
    IsOpen (finiteUpperImage X f u)
Source
TCSlib, `OnlineLearning.finiteUpperImage_isOpen`
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
Classical.choiceQuot.soundpropext
Built on 1
  • OnlineLearning.finiteUpperImageFor sets $X, Y \subseteq \bbr$, a payoff $f : \bbr \to \bbr \to \bbr$, and a finite sample $u$ of columns from $Y$, the finite upper image…
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen Real Finset BigOperators in/-- The upper image of a finite column sample is open in the product topology: for a fixed row `x`, membership is finitely many strict inequalities `f x y < z y`, each an open condition, and the upper image is the union of these open sets over `x ∈ X`. -/lemma OnlineLearning.finiteUpperImage_isOpen {X Y : Set ℝ} {f : ℝ → ℝ → ℝ} (u : Finset Y) :    IsOpen (finiteUpperImage X f u) := by  classical  have hrepr :      finiteUpperImage X f u =        ⋃ x : X,          ({z : u → ℝ | ∀ y : u, f (x : ℝ) (y : ℝ) < z y} : Set (u → ℝ)) := by    ext z    simp [finiteUpperImage]  rw [hrepr]  apply isOpen_iUnion  intro x  rw [show ({z : u → ℝ | ∀ y : u, f (x : ℝ) (y : ℝ) < z y} : Set (u → ℝ)) =      ⋂ y : u, (fun z : u → ℝ => z y) ⁻¹' Set.Ioi (f (x : ℝ) (y : ℝ)) by    ext z    simp]  exact isOpen_iInter_of_finite fun y : u =>    isOpen_Ioi.preimage (continuous_apply y)
See it in the graphDiscuss this resultChallenge it