AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.liftCert_rhs

theoremverifiedformalizationimported Lean

Lifted RHS-positivity: matches ∑ idx, u' idx * fmB idx > 0.

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_rhs (A : I → Fin (n+1) → 𝕜) (b : I → 𝕜)
    (u' : FMRowIndex A → 𝕜) :
    ∑ i, liftCert A u' i * b i = ∑ idx, u' idx * fmB A b idx
Formalizes
EconCSLib, `EconCSLib.LinearAlgebra.liftCert_rhs`
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 14
Used by 1

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/-- Lifted RHS-positivity: matches `∑ idx, u' idx * fmB idx > 0`. -/theorem EconCSLib.LinearAlgebra.liftCert_rhs (A : I → Fin (n+1) → 𝕜) (b : I → 𝕜)    (u' : FMRowIndex A → 𝕜) :    ∑ i, liftCert A u' i * b i = ∑ idx, u' idx * fmB A b idx := by  rw [liftCert_weighted_sum_swap]  refine Finset.sum_congr rfl ?_  intro idx _  rcases idx with k | ⟨p, q⟩  · simp [liftCoeff_weighted_inl]  · simp [liftCoeff_weighted_inr]
See it in the graphDiscuss this resultChallenge it