Loomis.lamB0_le_muB0
theoremverifiedformalizationimported Lean
Weak duality for the Loomis scalars: lamB0 ≤ muB0.
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_le_muB0 (A B : I → J → ℝ) (hB : IsPositive B) : lamB0 A B ≤ muB0 A B
- Formalizes
- EconCSLib, `Loomis.lamB0_le_muB0`
- 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_le_muB0← Loomis.lamB0_le_muB0 (EconCSLib/Math/Minimax/Loomis.lean:264): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 16
- Loomis.exists_xx_lamB0Attainment of
lamB0: there exists a mixed strategyxxwith(xA xx)_j ≥ lamB0 · (xB xx)_jfor every column. - Loomis.ByColumn-vector product
(By)_i = ∑ⱼ Bᵢⱼ yⱼ. - Loomis.AyColumn-vector product
(Ay)_i = ∑ⱼ Aᵢⱼ yⱼ. - wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_le_wsumWeighted sum is monotone: pointwise
≤implieswsum ≤. - Loomis.wsum_const_mulWeight a constant multiple under
wsum:wsum z (c · f) = c · wsum z f. A direct unfold ofwsum_smul, restated here so chained… - Loomis.muB0Minmax Loomis scalar
μ₀ = inf_y μ_aux(y). - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- Loomis.xBy_posPositivity of the bilinear pairing
xBy = ∑ᵢⱼ xᵢ Bᵢⱼ yⱼ. - Loomis.xBRow-vector product
(xB)_j = ∑ᵢ xᵢ Bᵢⱼ. - wsum_wsum_commExchange order of double weighted sums.
- Loomis.xARow-vector product
(xA)_j = ∑ᵢ xᵢ Aᵢⱼ. - 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.exists_yy_muB0Attainment of
muB0: there exists a mixed strategyyywith(Ay yy)_i ≤ muB0 · (By yy)_ifor every row. - Loomis.xBy_swapThe bilinear pairing
xByand its symmetric variants. - Loomis.lamB0Maxmin Loomis scalar
λ₀ = sup_x λ_aux(x).
- Loomis.exists_xx_lamB0Attainment of
- Used by 1
- 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.loomis_value_eq_auxLoomis induction:
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] in/-- **Weak duality** for the Loomis scalars: `lamB0 ≤ muB0`. -/theorem Loomis.lamB0_le_muB0 (A B : I → J → ℝ) (hB : IsPositive B) : lamB0 A B ≤ muB0 A B := by obtain ⟨xx, Hxx⟩ := exists_xx_lamB0 A B hB obtain ⟨yy, Hyy⟩ := exists_yy_muB0 A B hB set xxByy : ℝ := wsum xx (fun i => By B yy i) with hxxByy_def have hxxByy_pos : 0 < xxByy := xBy_pos hB xx yy -- The pairing `xx A · yy`, written both ways. set pairing : ℝ := wsum xx (fun i => Ay A yy i) with hpairing_def have hswap : pairing = wsum yy (fun j => xA A xx j) := by rw [hpairing_def] unfold Ay xA exact wsum_wsum_comm xx yy A -- lamB0 · xxByy ≤ pairing have h_lam : lamB0 A B * xxByy ≤ pairing := by rw [hswap] calc lamB0 A B * xxByy = lamB0 A B * wsum yy (fun j => xB B xx j) := by rw [hxxByy_def, xBy_swap] _ = wsum yy (fun j => lamB0 A B * xB B xx j) := by rw [wsum_const_mul] _ ≤ wsum yy (fun j => xA A xx j) := wsum_le_wsum yy (fun j => Hxx j) -- pairing ≤ muB0 · xxByy have h_mu : pairing ≤ muB0 A B * xxByy := by rw [hpairing_def] calc wsum xx (fun i => Ay A yy i) ≤ wsum xx (fun i => muB0 A B * By B yy i) := wsum_le_wsum xx (fun i => Hyy i) _ = muB0 A B * wsum xx (fun i => By B yy i) := by rw [wsum_const_mul] _ = muB0 A B * xxByy := by rw [hxxByy_def] -- Combine and divide by the positive xxByy. have hcombo : lamB0 A B * xxByy ≤ muB0 A B * xxByy := h_lam.trans h_mu exact le_of_mul_le_mul_right hcombo hxxByy_pos