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.Loomis.muB0_one← Loomis.muB0_one (EconCSLib/Math/Minimax/Loomis.lean:886): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- MinimaxLoomis.mu0Player II's minmax value (the column player's best cap).
- Loomis.muB0Minmax Loomis scalar
μ₀ = inf_y μ_aux(y). - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.muB.aux_oneLoomis.muB.aux_one
- MinimaxLoomis.mu.auxPlayer II's maximum loss against mixed strategy
y: the maximum over pure rows of the expected payoff. - Loomis.muB.auxPlayer II's Loomis-ratio cap under mixed strategy
y: supremum over pure rows.
- 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…
- Loomis.minmax_from_generalSimplified Loomis as a corollary of the general theorem: the finite von Neumann minimax
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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)