Minimax.symMat
defimported Lean
The skew-symmetric symmetrisation of a game A on I ⊕ J ⊕ Unit.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] in def Minimax.symMat (A : I → J → 𝕜) : (I ⊕ J ⊕ Unit) → (I ⊕ J ⊕ Unit) → 𝕜
- Defined in
- EconCSLib, `Minimax.symMat`
- 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.Minimax.symMat← Minimax.symMat (EconCSLib/Math/Minimax/Minimax.lean:52): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 2
- Minimax.minimax_posMinimax for a strictly positive game.
- Minimax.symMat_skewMinimax.symMat_skew
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] in /-- The skew-symmetric symmetrisation of a game `A` on `I ⊕ J ⊕ Unit`. -/ def Minimax.symMat (A : I → J → 𝕜) : (I ⊕ J ⊕ Unit) → (I ⊕ J ⊕ Unit) → 𝕜 | Sum.inl _, Sum.inl _ => 0 | Sum.inl i, Sum.inr (Sum.inl j) => A i j | Sum.inl _, Sum.inr (Sum.inr _) => -1 | Sum.inr (Sum.inl j), Sum.inl i => -A i j | Sum.inr (Sum.inl _), Sum.inr (Sum.inl _) => 0 | Sum.inr (Sum.inl _), Sum.inr (Sum.inr _) => 1 | Sum.inr (Sum.inr _), Sum.inl _ => 1 | Sum.inr (Sum.inr _), Sum.inr (Sum.inl _) => -1 | Sum.inr (Sum.inr _), Sum.inr (Sum.inr _) => 0