AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.rowEval_def

theoremverifiedformalizationimported Lean

EconCSLib.LinearAlgebra.rowEval_def

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.rowEval_def {I : Type*} {n : β„•} [Fintype I]
    (A : I β†’ Fin n β†’ π•œ) (i : I) (x : Fin n β†’ π•œ) :
    rowEval A i x = βˆ‘ j, A i j * x j
Formalizes
EconCSLib, `EconCSLib.LinearAlgebra.rowEval_def`
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 1
Used by 15

Lean source view module on GitHub

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.rowEval_def {I : Type*} {n : β„•} [Fintype I]
    (A : I β†’ Fin n β†’ π•œ) (i : I) (x : Fin n β†’ π•œ) :
    rowEval A i x = βˆ‘ j, A i j * x j := rfl
See it in the graphDiscuss this resultChallenge it