AFTD Auto-Formalizing Theoretical Domains

Loomis.dropCol.IsPositive

theoremverifiedformalizationimported Lean

Dropping a column 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.dropCol.IsPositive [DecidableEq J] {B : I → J → ℝ}
    (hB : IsPositive B) (j₀ : J) : IsPositive (dropCol B j₀)
Formalizes
EconCSLib, `Loomis.dropCol.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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • Loomis.dropColDrop the j₀-column of A and view as a matrix on I × {j // j ≠ 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…
Used by 1
  • Loomis.loomis_value_eq_auxLoomis induction: lamB0 A B = muB0 A B for any finite positive-B matrix pair with 2 ≤ |I| + |J|, by strong induction on the…

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 column preserves entrywise positivity. -/
theorem Loomis.dropCol.IsPositive [DecidableEq J] {B : I → J → ℝ}
    (hB : IsPositive B) (j₀ : J) : IsPositive (dropCol B j₀) :=
  fun i j' => hB i j'.val
See it in the graphDiscuss this resultChallenge it