Loomis.IsPositive
defimported Lean
A matrix B : I → J → ℝ is entrywise positive if every entry is > 0. This is the hypothesis driving the general Loomis theorem, and the only property of B the proof needs.
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 def Loomis.IsPositive (B : I → J → ℝ) : Prop
- Defined in
- EconCSLib, `Loomis.IsPositive`
- 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.IsPositive← Loomis.IsPositive (EconCSLib/Math/Minimax/Loomis.lean:55): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 24
- Loomis.exists_xx_lamB0Attainment of
lamB0: there exists a mixed strategyxxwith(xA xx)_j ≥ lamB0 · (xB xx)_jfor every column. - Loomis.dropCol.IsPositiveDropping a column preserves entrywise positivity.
- Loomis.lamB.aux.continuous
lamB.aux A Bis continuous on the simplex. - Loomis.rowRatio.continuousEach row ratio
(Ay)_i / (By)_iis continuous onΔ(J). - Loomis.dropRow.IsPositiveDropping a row preserves entrywise positivity.
- Loomis.lamB.aux.le_lamB0Every
lamB.auxvalue is bounded by the supremumlamB0. - Loomis.muB.aux_lt_of_rowOffset_pos
muB.aux A B yis strictly belowmuiff every offsetrowOffsetis strictly positive aty. - EconCSLib.LinearAlgebra.perron_frobeniusPerron-Frobenius for positive matrices [MFoGT, Section 2.8, Exercise 1(2)]. A square matrix with strictly positive entries has a…
- Loomis.IsPositive.oneThe all-ones matrix is positive; the simplified-Loomis specialisation plugs
B := fun _ _ => 1into the general theorem. - 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.muB.aux.ge_muB0Every
muB.auxvalue dominates the infimummuB0. - Loomis.lamB0_le_muB0Weak duality for the Loomis scalars:
lamB0 ≤ muB0. - Loomis.lamB.aux_gt_of_colOffset_pos
lamB.aux A B xstrictly exceedslamiff every offsetcolOffsetis strictly positive atx. - Loomis.xBy_posPositivity of the bilinear pairing
xBy = ∑ᵢⱼ xᵢ Bᵢⱼ yⱼ. - Loomis.muB.aux.continuous
muB.aux A Bis continuous on the simplex. - Loomis.muB.aux.bddBelow
muB.aux A Bis bounded below on the simplex. - Loomis.loomis_value_IJ_2Base case of the Loomis induction: a 1×1 matrix pair has the single ratio
A i₀ j₀ / B i₀ j₀as the common Loomis value. - Loomis.loomis_value_eqLoomis scalar equality: every finite positive-
Bmatrix pair overℝhas equal maxmin and minmax Loomis ratios. - Loomis.loomis_theoremLoomis Theorem [MFoGT, Theorem 2.5.1]. For any pair of matrices
A B : I → J → ℝwithBentrywise positive, there exist mixed… - Loomis.By_posPositivity of the column aggregate when
Bis entrywise positive. - Loomis.xB_posPositivity of the row aggregate when
Bis entrywise positive. - Loomis.exists_yy_muB0Attainment of
muB0: there exists a mixed strategyyywith(Ay yy)_i ≤ muB0 · (By yy)_ifor every row. - Loomis.lamB.aux.bddAbove
lamB.aux A Bis bounded above on the simplex (continuous function on a compact set). - Loomis.colRatio.continuousEach column ratio
(xA)_j / (xB)_jis continuous onΔ(I).
- Loomis.exists_xx_lamB0Attainment of
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 /-- A matrix `B : I → J → ℝ` is **entrywise positive** if every entry is `> 0`. This is the hypothesis driving the general Loomis theorem, and the only property of `B` the proof needs. -/ def Loomis.IsPositive (B : I → J → ℝ) : Prop := ∀ i j, 0 < B i j