EconCSLib.LinearAlgebra.theorem_of_alternative_aux
theoremverifiedformalizationimported Lean
EconCSLib.LinearAlgebra.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_aux : β (n : β) {I : Type*} [Fintype I] [DecidableEq I] (A : I β Fin n β π) (b : I β π), Β¬ IsFeasible A b β HasCertificate A b
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.theorem_of_alternative_aux`
- 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_aux← EconCSLib.LinearAlgebra.theorem_of_alternative_aux (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:574): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 19
- EconCSLib.LinearAlgebra.HasCertificateExistence of a Farkas certificate.
- EconCSLib.LinearAlgebra.NegRowsRows where the last-column coefficient is strictly negative.
- EconCSLib.LinearAlgebra.PosRowsRows where the last-column coefficient is strictly positive.
- EconCSLib.LinearAlgebra.fmB_inlEconCSLib.LinearAlgebra.fmB_inl
- EconCSLib.LinearAlgebra.fmA_inrEconCSLib.LinearAlgebra.fmA_inr
- EconCSLib.LinearAlgebra.liftCoeff_weighted_inlInner sum at
Sum.inl kcollapses to the picked-out row:β i, L (inl k) i * g i = g k.val. - EconCSLib.LinearAlgebra.IsFeasiblePrimal feasibility of the system
A x β₯ b. - EconCSLib.LinearAlgebra.fmA_inlEconCSLib.LinearAlgebra.fmA_inl
- EconCSLib.LinearAlgebra.feasible_of_fm_feasibleEconCSLib.LinearAlgebra.feasible_of_fm_feasible
- EconCSLib.LinearAlgebra.fmAReduced matrix coefficient.
- EconCSLib.LinearAlgebra.rowEval_defEconCSLib.LinearAlgebra.rowEval_def
- EconCSLib.LinearAlgebra.ZeroRowsRows where the last-column coefficient is zero.
- 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.fmBReduced right-hand side.
- EconCSLib.LinearAlgebra.theorem_of_alternative_baseEconCSLib.LinearAlgebra.theorem_of_alternative_base
- EconCSLib.LinearAlgebra.fmB_inrEconCSLib.LinearAlgebra.fmB_inr
- EconCSLib.LinearAlgebra.FMRowIndexReduced row index after Fourier-Motzkin elimination of the last column.
- EconCSLib.LinearAlgebra.liftCoeff_weighted_inrInner sum at
Sum.inr (p, q)collapses to the combined row contributions.
- Used by 1
- 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_alternativeTheorem of the Alternative [MFoGT, Section 2.8, Exercise 7]: for a finite system of weak linear inequalities
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {π : Type*} [Field π] [LinearOrder π] [IsStrictOrderedRing π] invariable {I : Type*} [Fintype I] [DecidableEq I] {n : β} intheorem EconCSLib.LinearAlgebra.theorem_of_alternative_aux : β (n : β) {I : Type*} [Fintype I] [DecidableEq I] (A : I β Fin n β π) (b : I β π), Β¬ IsFeasible A b β HasCertificate A b := by intro n induction n with | zero => intro I _ _ A b exact theorem_of_alternative_base A b | succ n ih => intro I _ _ A b refine β¨?_, fun hcert hfeas => feas_cert_disjoint A b hfeas hcertβ© intro hinf have h_red_inf : Β¬ IsFeasible (fmA A) (fmB A b) := fun h => hinf (feasible_of_fm_feasible A b h) have h_red_cert : HasCertificate (fmA A) (fmB A b) := (ih (fmA A) (fmB A b)).mp h_red_inf exact fm_cert_lift A b h_red_cert