EconCSLib.LinearAlgebra.theorem_of_alternative
theoremverifiedformalizationimported Lean
Theorem of the Alternative [MFoGT, Section 2.8, Exercise 7]: for a finite system of weak linear inequalities A x ≥ b over a linearly ordered field, exactly one of the primal S = {x | Ax ≥ b} and the Farkas certificate set T = {u ≥ 0 | uᵀA = 0, ⟨u, b⟩ > 0} is nonempty. Combines feas_cert_disjoint (disjointness) with the existence direction proved by Fourier-Motzkin elimination + induction on the number of variables (theorem_of_alternative_aux).
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 theorem EconCSLib.LinearAlgebra.theorem_of_alternative {I : Type*} [Fintype I] [DecidableEq I] {n : ℕ} (A : I → Fin n → 𝕜) (b : I → 𝕜) : ¬ IsFeasible A b ↔ HasCertificate A b
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.theorem_of_alternative`
- 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.theorem_of_alternative← EconCSLib.LinearAlgebra.theorem_of_alternative (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:603): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- EconCSLib.LinearAlgebra.HasCertificateExistence of a Farkas certificate.
- EconCSLib.LinearAlgebra.IsFeasiblePrimal feasibility of the system
A x ≥ b. - EconCSLib.LinearAlgebra.rowEval_defEconCSLib.LinearAlgebra.rowEval_def
- EconCSLib.LinearAlgebra.theorem_of_alternative_auxEconCSLib.LinearAlgebra.theorem_of_alternative_aux
- Used by 2
- SkewSymmetric.optimalSkew-symmetric optimal strategy. Every skew-symmetric game has a value-0 optimal mixed strategy.
- EconCSLib.LinearAlgebra.farkas_lemmaFarkas' Lemma (objective-bound form). For a finite linear system
A x ≥ bwithS = {x | A x ≥ b}nonempty, the primal bound "…
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 /-- **Theorem of the Alternative** [MFoGT, Section 2.8, Exercise 7]: for a finite system of weak linear inequalities `A x ≥ b` over a linearly ordered field, exactly one of the primal `S = {x | Ax ≥ b}` and the Farkas certificate set `T = {u ≥ 0 | uᵀA = 0, ⟨u, b⟩ > 0}` is nonempty. Combines `feas_cert_disjoint` (disjointness) with the existence direction proved by Fourier-Motzkin elimination + induction on the number of variables (`theorem_of_alternative_aux`). -/ theorem EconCSLib.LinearAlgebra.theorem_of_alternative {I : Type*} [Fintype I] [DecidableEq I] {n : ℕ} (A : I → Fin n → 𝕜) (b : I → 𝕜) : ¬ IsFeasible A b ↔ HasCertificate A b := theorem_of_alternative_aux n A b