MatrixGame.normMax
defimported Lean
‖A‖ := max_{i,j} |A_{i,j}|, the entrywise sup norm of the payoff matrix. Field-generic in the abstract, but the Robinson analysis is stated over ℝ (needed for the asymptotic o(t) formulation).
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 MatrixGame.normMax (A : MatrixGame I J ℝ) : ℝ
- Defined in
- EconCSLib, `MatrixGame.normMax`
- 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.MatrixGame.normMax← MatrixGame.normMax (EconCSLib/GameTheory/StrategicGame/ZeroSum/Learning/Robinson.lean:38): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- MatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGameMatrixGame.instDecidableEqStrategyFinOfNatNatToStrategicGame
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
i : I, Player II chooses columnj : J. Payoff to Player I isg i j… - MatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGameMatrixGame.instNonemptyStrategyFinOfNatNatToStrategicGame
- MatrixGame.instFintypeStrategyFinOfNatNatToStrategicGameMatrixGame.instFintypeStrategyFinOfNatNatToStrategicGame
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 /-- `‖A‖ := max_{i,j} |A_{i,j}|`, the entrywise sup norm of the payoff matrix. Field-generic in the abstract, but the Robinson analysis is stated over `ℝ` (needed for the asymptotic `o(t)` formulation). -/ noncomputable def MatrixGame.normMax (A : MatrixGame I J ℝ) : ℝ := Finset.univ.sup' Finset.univ_nonempty (fun i : I => Finset.univ.sup' Finset.univ_nonempty (fun j : J => |A.g i j|))