AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.augRowEval_inr_false

theoremverifiedformalizationimported Lean

EconCSLib.LinearAlgebra.augRowEval_inr_false

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.augRowEval_inr_false
    (A : I โ†’ Fin n โ†’ ๐•œ) (b : I โ†’ ๐•œ) (c : Fin n โ†’ ๐•œ) (d : ๐•œ)
    (xt : Fin (n+1) โ†’ ๐•œ) :
    rowEval (farkasAugA A b c d) (Sum.inr false) xt = xt (Fin.last n)
Formalizes
EconCSLib, `EconCSLib.LinearAlgebra.augRowEval_inr_false`
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 10
Used by 1
  • EconCSLib.LinearAlgebra.farkas_lemmaFarkas' Lemma (objective-bound form). For a finite linear system A x โ‰ฅ b with S = {x | A x โ‰ฅ b} nonempty, the primal bound "โ€ฆ

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 : โ„•} intheorem EconCSLib.LinearAlgebra.augRowEval_inr_false    (A : I โ†’ Fin n โ†’ ๐•œ) (b : I โ†’ ๐•œ) (c : Fin n โ†’ ๐•œ) (d : ๐•œ)    (xt : Fin (n+1) โ†’ ๐•œ) :    rowEval (farkasAugA A b c d) (Sum.inr false) xt = xt (Fin.last n) := by  rw [rowEval, Fin.sum_univ_castSucc]  simp only [farkasAugA_inr_false_castSucc, farkasAugA_inr_false_last, zero_mul,             Finset.sum_const_zero, zero_add, one_mul]
See it in the graphDiscuss this resultChallenge it