EconCSLib.LinearAlgebra.liftCert_column_zero_last
theoremverifiedformalizationimported Lean
Lifted column-zero condition for j = Fin.last n: holds because the last column of L · A is zero by FM design.
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.liftCert_column_zero_last (A : I → Fin (n+1) → 𝕜) (u' : FMRowIndex A → 𝕜) : ∑ i, liftCert A u' i * A i (Fin.last n) = 0
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.liftCert_column_zero_last`
- 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.liftCert_column_zero_last← EconCSLib.LinearAlgebra.liftCert_column_zero_last (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:493): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 13
- 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.liftCoeffThe FM lift coefficient
L idx i: the weight with which original rowienters the reduced rowidx. - 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.liftCert_weighted_sum_swapInner-product-of-lift:
∑ i, liftCert u' i * g i = ∑ idx, u'(idx) * fmRow_at idx g, where thefmRow_atvalue depends ongandidx.… - EconCSLib.LinearAlgebra.ZeroRowsRows where the last-column coefficient is zero.
- 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.fm_cert_liftFarkas certificate lift: if
u'certifies the reduced system,liftCert A u'certifies the original.
- EconCSLib.LinearAlgebra.fm_cert_liftFarkas certificate lift: if
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/-- Lifted column-zero condition for `j = Fin.last n`: holds because the last column of `L · A` is zero by FM design. -/theorem EconCSLib.LinearAlgebra.liftCert_column_zero_last (A : I → Fin (n+1) → 𝕜) (u' : FMRowIndex A → 𝕜) : ∑ i, liftCert A u' i * A i (Fin.last n) = 0 := by rw [liftCert_weighted_sum_swap] apply Finset.sum_eq_zero intro idx _ rcases idx with k | ⟨p, q⟩ · simp only [liftCoeff_weighted_inl, k.property, mul_zero] · simp only [liftCoeff_weighted_inr] -- (-A q last) * A p last + A p last * A q last = 0 ring