AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Used by 24

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
See it in the graphDiscuss this resultChallenge it