EconCSLib.LinearAlgebra.fm_cert_lift
theoremverifiedformalizationimported Lean
Farkas certificate lift: if u' certifies the reduced system, liftCert A u' certifies the original.
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.fm_cert_lift (A : I β Fin (n+1) β π) (b : I β π) (hred : HasCertificate (fmA A) (fmB A b)) : HasCertificate A b
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.fm_cert_lift`
- 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.fm_cert_lift← EconCSLib.LinearAlgebra.fm_cert_lift (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:518): 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.liftCertThe lifted certificate
u i = β idx, L idx i * u'(idx). - 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.fmA_inlEconCSLib.LinearAlgebra.fmA_inl
- EconCSLib.LinearAlgebra.fmAReduced matrix coefficient.
- EconCSLib.LinearAlgebra.liftCert_rhsLifted RHS-positivity: matches
β idx, u' idx * fmB idx > 0. - EconCSLib.LinearAlgebra.ZeroRowsRows where the last-column coefficient is zero.
- EconCSLib.LinearAlgebra.fmBReduced right-hand side.
- EconCSLib.LinearAlgebra.IsCertificate
u : I β πis a Farkas certificate of infeasibility ofA x β₯ b. - EconCSLib.LinearAlgebra.liftCert_nonnegPointwise nonneg lift.
- EconCSLib.LinearAlgebra.fmB_inrEconCSLib.LinearAlgebra.fmB_inr
- EconCSLib.LinearAlgebra.FMRowIndexReduced row index after Fourier-Motzkin elimination of the last column.
- EconCSLib.LinearAlgebra.liftCert_column_zero_castSuccLifted column-zero condition for
j β Fin n: matchesfmA A Β· j = 0. - EconCSLib.LinearAlgebra.liftCert_column_zero_lastLifted column-zero condition for
j = Fin.last n: holds because the last column ofL Β· Ais zero by FM design. - EconCSLib.LinearAlgebra.liftCoeff_weighted_inrInner sum at
Sum.inr (p, q)collapses to the combined row contributions.
- Used by 1
- EconCSLib.LinearAlgebra.theorem_of_alternative_auxEconCSLib.LinearAlgebra.theorem_of_alternative_aux
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 : β} in/-- **Farkas certificate lift**: if `u'` certifies the reduced system, `liftCert A u'` certifies the original. -/theorem EconCSLib.LinearAlgebra.fm_cert_lift (A : I β Fin (n+1) β π) (b : I β π) (hred : HasCertificate (fmA A) (fmB A b)) : HasCertificate A b := by obtain β¨u', hu'_nn, hu'_zero, hu'_posβ© := hred refine β¨liftCert A u', liftCert_nonneg A hu'_nn, ?_, ?_β© Β· -- β j : Fin (n+1), β i, u i * A i j = 0 intro j refine Fin.lastCases ?_ ?_ j Β· exact liftCert_column_zero_last A u' Β· intro j' exact liftCert_column_zero_castSucc A b hu'_zero j' Β· rw [liftCert_rhs] exact hu'_pos