AFTD Auto-Formalizing Theoretical Domains

Loomis.lamB.aux

defimported Lean

Player I's guaranteed Loomis ratio under mixed strategy x: infimum over pure columns.

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
noncomputable def Loomis.lamB.aux (A B : I → J → ℝ) (x : stdSimplex ℝ I) : ℝ
Defined in
EconCSLib, `Loomis.lamB.aux`
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
Built on 2
Used by 11

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
/-- Player I's guaranteed Loomis ratio under mixed strategy `x`: infimum over pure columns. -/
noncomputable def Loomis.lamB.aux (A B : I → J → ℝ) (x : stdSimplex ℝ I) : ℝ :=
  Finset.inf' Finset.univ Finset.univ_nonempty (fun j => colRatio A B x j)
See it in the graphDiscuss this resultChallenge it