AFTD Auto-Formalizing Theoretical Domains

Minimax.symMat_skew

theoremverifiedformalizationimported Lean

Minimax.symMat_skew

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
theorem Minimax.symMat_skew (A : I โ†’ J โ†’ ๐•œ) : โˆ€ k l, symMat A k l = - symMat A l k
Formalizes
EconCSLib, `Minimax.symMat_skew`
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 1
  • Minimax.symMatThe skew-symmetric symmetrisation of a game A on I โŠ• J โŠ• Unit.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators invariable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] invariable {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J]  [Nonempty I] [Nonempty J] intheorem Minimax.symMat_skew (A : I โ†’ J โ†’ ๐•œ) : โˆ€ k l, symMat A k l = - symMat A l k := by  rintro (i | (j | _)) (i' | (j' | _)) <;> simp [symMat]
See it in the graphDiscuss this resultChallenge it