AFTD Auto-Formalizing Theoretical Domains

SkewSymmetric.mat

defimported Lean

SkewSymmetric.mat

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {๐•œ : Type*} [Field ๐•œ] [LinearOrder ๐•œ] [IsStrictOrderedRing ๐•œ] in
variable {N : โ„•} in
def SkewSymmetric.mat (S : Fin N โ†’ Fin N โ†’ ๐•œ) : Row N โ†’ Fin N โ†’ ๐•œ
Defined in
EconCSLib, `SkewSymmetric.mat`
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
none listed
Built on 1
  • SkewSymmetric.RowRow index of the feasibility system z S โ‰ฅ 0, z โ‰ฅ 0, โˆ‘ z = 1: inl l = the column constraint (zS)_l โ‰ฅ 0; inr (inl k) = z_k โ‰ฅ 0;โ€ฆ
Used by 1
  • SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.

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 {N : โ„•} in
def SkewSymmetric.mat (S : Fin N โ†’ Fin N โ†’ ๐•œ) : Row N โ†’ Fin N โ†’ ๐•œ
  | Sum.inl l, j => S j l
  | Sum.inr (Sum.inl k), j => if j = k then 1 else 0
  | Sum.inr (Sum.inr false), _ => 1
  | Sum.inr (Sum.inr true), _ => -1
See it in the graphDiscuss this resultChallenge it