AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 9
Used by 6

Lean source view module on GitHub

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]
See it in the graphDiscuss this resultChallenge it