AFTD Auto-Formalizing Theoretical Domains

Loomis.lamB.aux_gt_of_colOffset_pos

theoremverifiedformalizationimported Lean

lamB.aux A B x strictly exceeds lam iff every offset colOffset is strictly positive at x.

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.lamB.aux_gt_of_colOffset_pos {A B : I → J → ℝ}
    (hB : IsPositive B) {lam : ℝ} {x : stdSimplex ℝ I}
    (H : ∀ j, 0 < colOffset A B lam x j) :
    lam < lamB.aux A B x
Formalizes
EconCSLib, `Loomis.lamB.aux_gt_of_colOffset_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 9
  • Loomis.colRatioRow player's per-column Loomis ratio (xA)_j / (xB)_j.
  • Loomis.lamB.auxPlayer I's guaranteed Loomis ratio under mixed strategy x: infimum over pure columns.
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • Loomis.colOffsetLinearised column constraint: colOffset A B λ x j = (xA)_j - λ · (xB)_j. Note that…
  • Loomis.xBRow-vector product (xB)_j = ∑ᵢ xᵢ Bᵢⱼ.
  • Loomis.lamB.aux_gt_iff_gtCharacterisation: lamB.aux A B x > c iff every column ratio exceeds c.
  • Loomis.xARow-vector product (xA)_j = ∑ᵢ xᵢ Aᵢⱼ.
  • 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.xB_posPositivity of the row aggregate when B is entrywise positive.
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 inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- `lamB.aux A B x` strictly exceeds `lam` iff every offset `colOffset` is strictly positive at `x`. -/theorem Loomis.lamB.aux_gt_of_colOffset_pos {A B : I → J → ℝ}    (hB : IsPositive B) {lam : ℝ} {x : stdSimplex ℝ I}    (H : ∀ j, 0 < colOffset A B lam x j) :    lam < lamB.aux A B x := by  rw [lamB.aux_gt_iff_gt]  intro j  unfold colRatio  rw [lt_div_iff₀ (xB_pos hB x j)]  -- Goal: lam * xB B x j < xA A x j  have := H j  unfold colOffset at this  linarith
See it in the graphDiscuss this resultChallenge it