EconCSLib.LinearAlgebra.IsCertificate
defimported Lean
u : I โ ๐ is a Farkas certificate of infeasibility of 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.IsCertificate {I : Type*} {n : โ} [Fintype I] (A : I โ Fin n โ ๐) (b : I โ ๐) (u : I โ ๐) : Prop
- Defined in
- EconCSLib, `EconCSLib.LinearAlgebra.IsCertificate`
- 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.IsCertificate← EconCSLib.LinearAlgebra.IsCertificate (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:67): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 6
- SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.
- EconCSLib.LinearAlgebra.HasCertificateExistence of a Farkas certificate.
- 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_cert_liftFarkas certificate lift: if
u'certifies the reduced system,liftCert A u'certifies the original. - EconCSLib.LinearAlgebra.feas_cert_disjointEconCSLib.LinearAlgebra.feas_cert_disjoint
- EconCSLib.LinearAlgebra.theorem_of_alternative_baseEconCSLib.LinearAlgebra.theorem_of_alternative_base
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 /-- `u : I โ ๐` is a Farkas certificate of infeasibility of `A x โฅ b`. -/ def EconCSLib.LinearAlgebra.IsCertificate {I : Type*} {n : โ} [Fintype I] (A : I โ Fin n โ ๐) (b : I โ ๐) (u : I โ ๐) : Prop := (โ i, 0 โค u i) โง (โ j : Fin n, โ i, u i * A i j = 0) โง (0 < โ i, u i * b i)