Loomis.xBy_pos
theoremverifiedformalizationimported Lean
Positivity of the bilinear pairing xBy = ∑ᵢⱼ xᵢ Bᵢⱼ yⱼ.
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.xBy_pos {B : I → J → ℝ} (hB : IsPositive B) (x : stdSimplex ℝ I) (y : stdSimplex ℝ J) : 0 < wsum x (fun i => By B y i)
- Formalizes
- EconCSLib, `Loomis.xBy_pos`
- 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.xBy_pos← Loomis.xBy_pos (EconCSLib/Math/Minimax/Loomis.lean:97): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- Loomis.ByColumn-vector product
(By)_i = ∑ⱼ Bᵢⱼ yⱼ. - wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_posWeighted sum of strictly-positive values is strictly positive. Some coordinate
aof any simplex point is strictly positive (since… - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- 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.By_posPositivity of the column aggregate when
Bis entrywise positive.
- Loomis.ByColumn-vector product
- Used by 2
- 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.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 ≤ muB0.
- Loomis.loomis_value_eq_auxLoomis induction:
Lean source view module on GitHub
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 /-- Positivity of the bilinear pairing `xBy = ∑ᵢⱼ xᵢ Bᵢⱼ yⱼ`. -/ theorem Loomis.xBy_pos {B : I → J → ℝ} (hB : IsPositive B) (x : stdSimplex ℝ I) (y : stdSimplex ℝ J) : 0 < wsum x (fun i => By B y i) := wsum_pos x (fun i => By_pos hB y i)