AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearProgramming.dualAugA

defimported Lean

Augmented matrix combining A rows with x ≥ 0 unit rows.

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.LinearProgramming.dualAugA (A : I → Fin n → 𝕜) : DualAugRow I n → Fin n → 𝕜
Defined in
EconCSLib, `EconCSLib.LinearProgramming.dualAugA`
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 4

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 combining `A` rows with `x ≥ 0` unit rows. -/
def EconCSLib.LinearProgramming.dualAugA (A : I → Fin n → 𝕜) : DualAugRow I n → Fin n → 𝕜
  | Sum.inl i, j => A i j
  | Sum.inr j', j => if j = j' then 1 else 0
See it in the graphDiscuss this resultChallenge it