AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.fmA_inr

theoremverifiedformalizationimported Lean

EconCSLib.LinearAlgebra.fmA_inr

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.fmA_inr (A : I โ†’ Fin (n+1) โ†’ ๐•œ)
    (p : PosRows A) (q : NegRows A) (j : Fin n) :
    fmA A (Sum.inr (p, q)) j
      = (-A q.val (Fin.last n)) * A p.val j.castSucc
        + A p.val (Fin.last n) * A q.val j.castSucc
Formalizes
EconCSLib, `EconCSLib.LinearAlgebra.fmA_inr`
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 5
Used by 18

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.fmA_inr (A : I โ†’ Fin (n+1) โ†’ ๐•œ)
    (p : PosRows A) (q : NegRows A) (j : Fin n) :
    fmA A (Sum.inr (p, q)) j
      = (-A q.val (Fin.last n)) * A p.val j.castSucc
        + A p.val (Fin.last n) * A q.val j.castSucc := rfl
See it in the graphDiscuss this resultChallenge it