AFTD Auto-Formalizing Theoretical Domains

Loomis.exists_yy_muB0

theoremverifiedformalizationimported Lean

Attainment of muB0: there exists a mixed strategy yy with (Ay yy)_i ≤ muB0 · (By yy)_i for every row.

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.exists_yy_muB0 (A B : I → J → ℝ) (hB : IsPositive B) :
    ∃ yy : stdSimplex ℝ J, ∀ i, Ay A yy i ≤ muB0 A B * By B yy i
Formalizes
EconCSLib, `Loomis.exists_yy_muB0`
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.ByColumn-vector product (By)_i = ∑ⱼ Bᵢⱼ yⱼ.
  • Loomis.AyColumn-vector product (Ay)_i = ∑ⱼ Aᵢⱼ yⱼ.
  • Loomis.muB0Minmax Loomis scalar μ₀ = inf_y μ_aux(y).
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • Loomis.muB.aux.continuousmuB.aux A B is continuous on the simplex.
  • 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.By_posPositivity of the column aggregate when B is entrywise positive.
  • Loomis.rowRatioColumn player's per-row Loomis ratio (Ay)_i / (By)_i.
  • Loomis.muB.auxPlayer II's Loomis-ratio cap under mixed strategy y: supremum over pure rows.
Used by 3
  • 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…
  • Loomis.lamB0_le_muB0Weak duality for the Loomis scalars: lamB0 ≤ muB0.
  • Loomis.loomis_theoremLoomis Theorem [MFoGT, Theorem 2.5.1]. For any pair of matrices A B : I → J → ℝ with B entrywise positive, there exist mixed…

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/-- Attainment of `muB0`: there exists a mixed strategy `yy` with `(Ay yy)_i ≤ muB0 · (By yy)_i` for every row. -/theorem Loomis.exists_yy_muB0 (A B : I → J → ℝ) (hB : IsPositive B) :    ∃ yy : stdSimplex ℝ J, ∀ i, Ay A yy i ≤ muB0 A B * By B yy i := by  obtain ⟨yy, _, hyy⟩ :=    isCompact_univ.exists_isMinOn (α := ℝ) (β := stdSimplex ℝ J)      Set.univ_nonempty (muB.aux.continuous hB).continuousOn  rw [isMinOn_iff] at hyy  refine ⟨yy, fun i => ?_⟩  have h1 : muB.aux A B yy ≤ muB0 A B :=    le_ciInf fun z => hyy z (Set.mem_univ _)  have h2 : rowRatio A B yy i ≤ muB.aux A B yy :=    Finset.le_sup' (f := fun i => rowRatio A B yy i) (Finset.mem_univ i)  have hyyB : 0 < By B yy i := By_pos hB yy i  have hratio : rowRatio A B yy i ≤ muB0 A B := h2.trans h1  unfold rowRatio at hratio  exact (div_le_iff₀ hyyB).mp hratio
See it in the graphDiscuss this resultChallenge it