Loomis.loomis_value_eq
theoremverifiedformalizationimported Lean
Loomis scalar equality: every finite positive-B matrix pair over ℝ has equal maxmin and minmax Loomis ratios.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Loomis 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.loomis_value_eq (A B : I → J → ℝ) (hB : IsPositive B) : lamB0 A B = muB0 A B
- Formalizes
- EconCSLib, `Loomis.loomis_value_eq`
- 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.loomis_value_eq← Loomis.loomis_value_eq (EconCSLib/Math/Minimax/Loomis.lean:806): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- Loomis.loomis_value_eq_auxLoomis induction:
lamB0 A B = muB0 A Bfor any finite positive-Bmatrix pair with2 ≤ |I| + |J|, by strong induction on the… - Loomis.IsPositiveA matrix
B : I → J → ℝis entrywise positive if every entry is> 0. This is the hypothesis driving the general Loomis theorem, and… - Loomis.lamB0Maxmin Loomis scalar
λ₀ = sup_x λ_aux(x). - Loomis.muB0Minmax Loomis scalar
μ₀ = inf_y μ_aux(y). - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.loomis_value_eq_auxLoomis induction:
- Used by 2
- Loomis.minmax_from_generalSimplified Loomis as a corollary of the general theorem: the finite von Neumann minimax
MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A… - Loomis.loomis_theoremLoomis Theorem [MFoGT, Theorem 2.5.1]. For any pair of matrices
A B : I → J → ℝwithBentrywise positive, there exist mixed…
- 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 Loomis inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- **Loomis scalar equality**: every finite positive-`B` matrix pair over `ℝ` has equal maxmin and minmax Loomis ratios. -/theorem Loomis.loomis_value_eq (A B : I → J → ℝ) (hB : IsPositive B) : lamB0 A B = muB0 A B := by let n := Fintype.card I + Fintype.card J have ngetwo : 2 ≤ n := by have p1 : 1 ≤ Fintype.card I := Fintype.card_pos have p2 : 1 ≤ Fintype.card J := Fintype.card_pos omega exact loomis_value_eq_aux n ngetwo rfl A B hB