AFTD Auto-Formalizing Theoretical Domains

Loomis.xB_pos

theoremverifiedformalizationimported Lean

Positivity of the row aggregate when B is entrywise positive.

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.xB_pos {B : I → J → ℝ} (hB : IsPositive B)
    (x : stdSimplex ℝ I) (j : J) : 0 < xB B x j
Formalizes
EconCSLib, `Loomis.xB_pos`
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 4
  • wsum_posWeighted sum of strictly-positive values is strictly positive. Some coordinate a of any simplex point is strictly positive (since…
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • Loomis.xBRow-vector product (xB)_j = ∑ᵢ xᵢ Bᵢⱼ.
  • 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 5

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
/-- Positivity of the row aggregate when `B` is entrywise positive. -/
theorem Loomis.xB_pos {B : I → J → ℝ} (hB : IsPositive B)
    (x : stdSimplex ℝ I) (j : J) : 0 < xB B x j :=
  wsum_pos x (fun i => hB i j)
See it in the graphDiscuss this resultChallenge it