EconCSLib.LinearProgramming.optAugA
defimported Lean
Optimality-augmented matrix.
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.optAugA (A : I โ Fin n โ ๐) (c : Fin n โ ๐) : OptAugRow I n โ Fin n โ ๐
- Defined in
- EconCSLib, `EconCSLib.LinearProgramming.optAugA`
- 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.EconCSLib.LinearProgramming.optAugA← EconCSLib.LinearProgramming.optAugA (EconCSLib/Math/LinearProgramming/StrongComplementarity.lean:180): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- EconCSLib.LinearProgramming.OptAugRowOptimality-augmented row index.
- Used by 6
- EconCSLib.LinearProgramming.optAugA_inrEconCSLib.LinearProgramming.optAugA_inr
- EconCSLib.LinearProgramming.optAugA_inl_inlEconCSLib.LinearProgramming.optAugA_inl_inl
- EconCSLib.LinearProgramming.exists_row_strict_pairPer-row strict-CS witness: for each row
iโ, there exists an optimal primal-dual pair with(Ax - b)_{iโ} + u_{iโ} > 0. Hypotheses:โฆ - EconCSLib.LinearProgramming.optAug_feasible_iffAn
xsatisfiesoptAugA ยท x โฅ optAugBiffxis primal-feasible and has objective at mostv. - EconCSLib.LinearProgramming.optAugA_inl_inrEconCSLib.LinearProgramming.optAugA_inl_inr
- EconCSLib.LinearProgramming.exists_col_strict_pairPer-column strict-CS witness: for each column
jโ, there exists an optimal primal-dual pair withx_{jโ} + (c - uแตA)_{jโ} > 0.
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 /-- Optimality-augmented matrix. -/ def EconCSLib.LinearProgramming.optAugA (A : I โ Fin n โ ๐) (c : Fin n โ ๐) : OptAugRow I n โ Fin n โ ๐ | Sum.inl (Sum.inl i), j => A i j | Sum.inl (Sum.inr j'), j => if j = j' then 1 else 0 | Sum.inr (), j => -c j