AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearAlgebra.farkasAugA

defimported Lean

Augmented matrix A_aug : FarkasAugRow I โ†’ Fin (n+1) โ†’ ๐•œ.

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
def EconCSLib.LinearAlgebra.farkasAugA (A : I โ†’ Fin n โ†’ ๐•œ) (b : I โ†’ ๐•œ) (c : Fin n โ†’ ๐•œ) (d : ๐•œ) :
    FarkasAugRow I โ†’ Fin (n+1) โ†’ ๐•œ
Defined in
EconCSLib, `EconCSLib.LinearAlgebra.farkasAugA`
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
none listed
Built on 1
Used by 10

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
/-- Augmented matrix `A_aug : FarkasAugRow I โ†’ Fin (n+1) โ†’ ๐•œ`. -/
def EconCSLib.LinearAlgebra.farkasAugA (A : I โ†’ Fin n โ†’ ๐•œ) (b : I โ†’ ๐•œ) (c : Fin n โ†’ ๐•œ) (d : ๐•œ) :
    FarkasAugRow I โ†’ Fin (n+1) โ†’ ๐•œ
  | Sum.inl i, j => Fin.lastCases (-b i) (fun j' => A i j') j
  | Sum.inr false, j => Fin.lastCases 1 (fun _ => (0 : ๐•œ)) j
  | Sum.inr true, j => Fin.lastCases d (fun j' => -c j') j
See it in the graphDiscuss this resultChallenge it