AFTD Auto-Formalizing Theoretical Domains

Loomis.muB0_one

theoremverifiedformalizationimported Lean

Loomis.muB0_one

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
theorem Loomis.muB0_one (A : I → J → ℝ) :
    muB0 A (fun _ _ => 1) = MinimaxLoomis.mu0 A
Formalizes
EconCSLib, `Loomis.muB0_one`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
Used by 1
  • Loomis.minmax_from_generalSimplified Loomis as a corollary of the general theorem: the finite von Neumann minimax MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] intheorem Loomis.muB0_one (A : I → J → ℝ) :    muB0 A (fun _ _ => 1) = MinimaxLoomis.mu0 A := by  unfold muB0 MinimaxLoomis.mu0  exact iInf_congr (muB.aux_one A)
See it in the graphDiscuss this resultChallenge it