Loomis.lamB0_one
theoremverifiedformalizationimported Lean
Loomis.lamB0_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.lamB0_one (A : I → J → ℝ) : lamB0 A (fun _ _ => 1) = MinimaxLoomis.lam0 A
- Formalizes
- EconCSLib, `Loomis.lamB0_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.lamB0_one← Loomis.lamB0_one (EconCSLib/Math/Minimax/Loomis.lean:881): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- Loomis.lamB.aux_oneLoomis.lamB.aux_one
- MinimaxLoomis.lam.auxPlayer I's guaranteed payoff from mixed strategy
x: the minimum over pure columns of the expected payoff. - Loomis.lamB.auxPlayer I's guaranteed Loomis ratio under mixed strategy
x: infimum over pure columns. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.lamB0Maxmin Loomis scalar
λ₀ = sup_x λ_aux(x). - MinimaxLoomis.lam0Player I's maxmin value (the row player's best guarantee).
- 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.lamB0_one (A : I → J → ℝ) : lamB0 A (fun _ _ => 1) = MinimaxLoomis.lam0 A := by unfold lamB0 MinimaxLoomis.lam0 exact iSup_congr (lamB.aux_one A)