EconCSLib.LinearAlgebra.rowEval
defimported Lean
Evaluate the LHS of row i of the matrix A : I โ Fin n โ ๐ at the point x : Fin n โ ๐.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in set_option linter.unusedSectionVars false in variable {๐ : Type*} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] in def EconCSLib.LinearAlgebra.rowEval {I : Type*} {n : โ} [Fintype I] (A : I โ Fin n โ ๐) (i : I) (x : Fin n โ ๐) : ๐
- Defined in
- EconCSLib, `EconCSLib.LinearAlgebra.rowEval`
- 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.EconCSLib.LinearAlgebra.rowEval← EconCSLib.LinearAlgebra.rowEval (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:57): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 15
- SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.
- EconCSLib.LinearAlgebra.augRowEval_inlEconCSLib.LinearAlgebra.augRowEval_inl
- EconCSLib.LinearProgramming.isFeasible_dualAug_iffAugmented feasibility is the primal feasibility (with
x โฅ 0). - EconCSLib.LinearAlgebra.augRowEval_inr_trueEconCSLib.LinearAlgebra.augRowEval_inr_true
- EconCSLib.LinearProgramming.exists_row_strict_pairPer-row strict-CS witness: for each row
iโ, there exists an optimal primal-dual pair with(Ax - b)_{iโ} + u_{iโ} > 0. Hypotheses:โฆ - EconCSLib.LinearAlgebra.IsFeasiblePrimal feasibility of the system
A x โฅ b. - EconCSLib.LinearAlgebra.farkas_lemmaFarkas' Lemma (objective-bound form). For a finite linear system
A x โฅ bwithS = {x | A x โฅ b}nonempty, the primal bound "โฆ - EconCSLib.LinearAlgebra.fm_feasible_of_feasibleEconCSLib.LinearAlgebra.fm_feasible_of_feasible
- EconCSLib.LinearAlgebra.feasible_of_fm_feasibleEconCSLib.LinearAlgebra.feasible_of_fm_feasible
- EconCSLib.LinearAlgebra.reduced_pair_ineqEconCSLib.LinearAlgebra.reduced_pair_ineq
- EconCSLib.LinearAlgebra.rowEval_defEconCSLib.LinearAlgebra.rowEval_def
- EconCSLib.LinearAlgebra.feas_cert_disjointEconCSLib.LinearAlgebra.feas_cert_disjoint
- EconCSLib.LinearAlgebra.augRowEval_inr_falseEconCSLib.LinearAlgebra.augRowEval_inr_false
- EconCSLib.LinearAlgebra.theorem_of_alternative_baseEconCSLib.LinearAlgebra.theorem_of_alternative_base
- EconCSLib.LinearProgramming.exists_col_strict_pairPer-column strict-CS witness: for each column
jโ, there exists an optimal primal-dual pair withx_{jโ} + (c - uแตA)_{jโ} > 0.
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 {๐ : Type*} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] in /-- Evaluate the LHS of row `i` of the matrix `A : I โ Fin n โ ๐` at the point `x : Fin n โ ๐`. -/ def EconCSLib.LinearAlgebra.rowEval {I : Type*} {n : โ} [Fintype I] (A : I โ Fin n โ ๐) (i : I) (x : Fin n โ ๐) : ๐ := โ j, A i j * x j