AFTD Auto-Formalizing Theoretical Domains

Loomis.minmax_from_general

theoremverifiedformalizationimported Lean

Simplified Loomis as a corollary of the general theorem: the finite von Neumann minimax MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A follows by instantiating loomis_value_eq at the all-ones matrix B = 𝟙. This is the canonical "B = 𝟙 specialisation" route recorded by the [[minimax_from_loomis]] blueprint node, and the sole route to the finite von Neumann minimax: MinimaxLoomis keeps only the shared foundational layer (aggregates, attainment, weak duality, drop/extend infra), and its scalar equality is exported here rather than re-proved by a standalone induction.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Loomis 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.minmax_from_general (A : I → J → ℝ) :
    MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A
Formalizes
EconCSLib, `Loomis.minmax_from_general`
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
Used by 2
  • MatrixGame.minimax_optimal_strategiesExistence of optimal mixed strategies: there exist mixed strategies xx for Player I and yy for Player II and a value v such that: -…
  • MatrixGame.minimax_theoremVon Neumann's Minimax Theorem: For any finite matrix game, maximin = minimax. [MSZ 5.11, von Neumann 1928] Proof: the general…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Loomis inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- **Simplified Loomis as a corollary** of the general theorem: the finite von Neumann minimax `MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A` follows by instantiating `loomis_value_eq` at the all-ones matrix `B = 𝟙`. This is the canonical "B = 𝟙 specialisation" route recorded by the [[minimax_from_loomis]] blueprint node, and the **sole** route to the finite von Neumann minimax: `MinimaxLoomis` keeps only the shared foundational layer (aggregates, attainment, weak duality, drop/extend infra), and its scalar equality is exported here rather than re-proved by a standalone induction. -/theorem Loomis.minmax_from_general (A : I → J → ℝ) :    MinimaxLoomis.lam0 A = MinimaxLoomis.mu0 A := by  have h := loomis_value_eq A (fun _ _ => 1) IsPositive.one  rw [lamB0_one, muB0_one] at h  exact h
See it in the graphDiscuss this resultChallenge it