EconCSLib.LinearAlgebra.liftCoeff_weighted_inl
theoremverifiedformalizationimported Lean
Inner sum at Sum.inl k collapses to the picked-out row: ∑ i, L (inl k) i * g i = g k.val.
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 @[simp] theorem EconCSLib.LinearAlgebra.liftCoeff_weighted_inl (A : I → Fin (n+1) → 𝕜) (k : ZeroRows A) (g : I → 𝕜) : ∑ i, liftCoeff A (Sum.inl k) i * g i = g k.val
- Formalizes
- EconCSLib, `EconCSLib.LinearAlgebra.liftCoeff_weighted_inl`
- 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.liftCoeff_weighted_inl← EconCSLib.LinearAlgebra.liftCoeff_weighted_inl (EconCSLib/Math/LinearAlgebra/FourierMotzkin.lean:461): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- EconCSLib.LinearAlgebra.NegRowsRows where the last-column coefficient is strictly negative.
- EconCSLib.LinearAlgebra.PosRowsRows where the last-column coefficient is strictly positive.
- 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.fmA_inlEconCSLib.LinearAlgebra.fmA_inl
- EconCSLib.LinearAlgebra.ZeroRowsRows where the last-column coefficient is zero.
- EconCSLib.LinearAlgebra.fmB_inrEconCSLib.LinearAlgebra.fmB_inr
- EconCSLib.LinearAlgebra.liftCoeff_inlEconCSLib.LinearAlgebra.liftCoeff_inl
- Used by 6
- EconCSLib.LinearAlgebra.liftCert_rhsLifted RHS-positivity: matches
∑ idx, u' idx * fmB idx > 0. - EconCSLib.LinearAlgebra.fm_cert_liftFarkas certificate lift: if
u'certifies the reduced system,liftCert A u'certifies the original. - EconCSLib.LinearAlgebra.theorem_of_alternative_auxEconCSLib.LinearAlgebra.theorem_of_alternative_aux
- 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.
- EconCSLib.LinearAlgebra.liftCert_rhsLifted RHS-positivity: matches
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/-- Inner sum at `Sum.inl k` collapses to the picked-out row: `∑ i, L (inl k) i * g i = g k.val`. -/@[simp] theorem EconCSLib.LinearAlgebra.liftCoeff_weighted_inl (A : I → Fin (n+1) → 𝕜) (k : ZeroRows A) (g : I → 𝕜) : ∑ i, liftCoeff A (Sum.inl k) i * g i = g k.val := by classical simp only [liftCoeff_inl, ite_mul, one_mul, zero_mul, Fintype.sum_ite_eq]