AFTD Auto-Formalizing Theoretical Domains

Loomis.IsPositive.one

theoremverifiedformalizationimported Lean

The all-ones matrix is positive; the simplified-Loomis specialisation plugs B := fun _ _ => 1 into the general theorem.

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.IsPositive.one : IsPositive (fun (_ : I) (_ : J) => (1 : ℝ))
Formalizes
EconCSLib, `Loomis.IsPositive.one`
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 1
  • 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.minmax_from_generalSimplified Loomis as a corollary of the general theorem: the finite von Neumann minimax MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A…

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
/-- The all-ones matrix is positive; the simplified-Loomis specialisation plugs `B := fun _ _ => 1` into the general theorem. -/
theorem Loomis.IsPositive.one : IsPositive (fun (_ : I) (_ : J) => (1 : ℝ)) := fun _ _ => one_pos
See it in the graphDiscuss this resultChallenge it