Loomis.dropRow.IsPositive
theoremverifiedformalizationimported Lean
Dropping a row preserves entrywise positivity.
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.dropRow.IsPositive [DecidableEq I] {B : I → J → ℝ} (hB : IsPositive B) (i₀ : I) : IsPositive (dropRow B i₀)
- Formalizes
- EconCSLib, `Loomis.dropRow.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.dropRow.IsPositive← Loomis.dropRow.IsPositive (EconCSLib/Math/Minimax/Loomis.lean:467): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Loomis.dropRowDrop the
i₀-row ofAand view as a matrix on{i // i ≠ i₀} × J. - 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.dropRowDrop the
- 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
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 /-- Dropping a row preserves entrywise positivity. -/ theorem Loomis.dropRow.IsPositive [DecidableEq I] {B : I → J → ℝ} (hB : IsPositive B) (i₀ : I) : IsPositive (dropRow B i₀) := fun i' j => hB i'.val j