EconCSLib.LinearAlgebra.IsFeasible
defimported Lean
Primal feasibility of the system A x ≥ b.
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.IsFeasible {I : Type*} {n : ℕ} [Fintype I] (A : I → Fin n → 𝕜) (b : I → 𝕜) : Prop
- Defined in
- EconCSLib, `EconCSLib.LinearAlgebra.IsFeasible`
- 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.IsFeasible← EconCSLib.LinearAlgebra.IsFeasible (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:62): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- 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 12
- SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.
- EconCSLib.LinearProgramming.isFeasible_dualAug_iffAugmented feasibility is the primal feasibility (with
x ≥ 0). - 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.feas_cert_disjointEconCSLib.LinearAlgebra.feas_cert_disjoint
- 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 /-- Primal feasibility of the system `A x ≥ b`. -/ def EconCSLib.LinearAlgebra.IsFeasible {I : Type*} {n : ℕ} [Fintype I] (A : I → Fin n → 𝕜) (b : I → 𝕜) : Prop := ∃ x : Fin n → 𝕜, ∀ i, b i ≤ rowEval A i x