AFTD Auto-Formalizing Theoretical Domains

Loomis.muB.aux_one

theoremverifiedformalizationimported Lean

Loomis.muB.aux_one

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.muB.aux_one (A : I → J → ℝ) (y : stdSimplex ℝ J) :
    muB.aux A (fun _ _ => 1) y = MinimaxLoomis.mu.aux A y
Formalizes
EconCSLib, `Loomis.muB.aux_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 6
  • wsumWeighted sum of f with weights from a simplex element x. Thin abbrev over Mathlib's finite dot product ⬝ᵥ: definitionally equal,…
  • wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
  • MinimaxLoomis.mu.auxPlayer II's maximum loss against mixed strategy y: the maximum over pure rows of the expected payoff.
  • Loomis.rowRatio_oneLoomis.rowRatio_one
  • 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 1

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] intheorem Loomis.muB.aux_one (A : I → J → ℝ) (y : stdSimplex ℝ J) :    muB.aux A (fun _ _ => 1) y = MinimaxLoomis.mu.aux A y := by  unfold muB.aux MinimaxLoomis.mu.aux  congr 1; ext i  exact rowRatio_one A y i
See it in the graphDiscuss this resultChallenge it