SkewSymmetric.Row
abbrevimported Lean
Row 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; inr (inr false/true) = ∑ z ≥ 1 / ∑ (−z) ≥ −1.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {N : ℕ} in abbrev SkewSymmetric.Row (N : ℕ)
- Defined in
- EconCSLib, `SkewSymmetric.Row`
- 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.SkewSymmetric.Row← SkewSymmetric.Row (EconCSLib/Math/Minimax/SkewSymmetric.lean:34): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 3
- SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.
- SkewSymmetric.matSkewSymmetric.mat
- SkewSymmetric.rhsSkewSymmetric.rhs
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 /-- Row 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`; `inr (inr false/true)` = `∑ z ≥ 1` / `∑ (−z) ≥ −1`. -/ abbrev SkewSymmetric.Row (N : ℕ) := Fin N ⊕ Fin N ⊕ Bool