EconCSLib.LinearAlgebra.rowEval_def
theoremverifiedformalizationimported Lean
EconCSLib.LinearAlgebra.rowEval_def
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 variable {I : Type*} [Fintype I] [DecidableEq I] {n : β} in @[simp] theorem EconCSLib.LinearAlgebra.rowEval_def {I : Type*} {n : β} [Fintype I] (A : I β Fin n β π) (i : I) (x : Fin n β π) : rowEval A i x = β j, A i j * x j
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.rowEval_def`
- 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_def← EconCSLib.LinearAlgebra.rowEval_def (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:185): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- EconCSLib.LinearAlgebra.rowEvalEvaluate the LHS of row
iof the matrixA : I β Fin n β πat the pointx : Fin n β π.
- EconCSLib.LinearAlgebra.rowEvalEvaluate the LHS of row
- 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.lp_strong_dualityLP Strong Duality [MFoGT, Section 2.8, Exercise 9]: if the primal LP
min β¨c, xβ© s.t. A x β₯ b, x β₯ 0is feasible and bounded below byβ¦ - 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.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.augRowEval_inr_falseEconCSLib.LinearAlgebra.augRowEval_inr_false
- EconCSLib.LinearAlgebra.theorem_of_alternativeTheorem of the Alternative [MFoGT, Section 2.8, Exercise 7]: for a finite system of weak linear inequalities
A x β₯ bover a linearlyβ¦ - EconCSLib.LinearAlgebra.theorem_of_alternative_auxEconCSLib.LinearAlgebra.theorem_of_alternative_aux
- 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 variable {I : Type*} [Fintype I] [DecidableEq I] {n : β} in @[simp] theorem EconCSLib.LinearAlgebra.rowEval_def {I : Type*} {n : β} [Fintype I] (A : I β Fin n β π) (i : I) (x : Fin n β π) : rowEval A i x = β j, A i j * x j := rfl