EconCSLib.LinearProgramming.dualAugA_inl
theoremverifiedformalizationimported Lean
EconCSLib.LinearProgramming.dualAugA_inl
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.LinearProgramming.dualAugA_inl (A : I โ Fin n โ ๐) (i : I) (j : Fin n) : dualAugA A (Sum.inl i) j = A i j
- Formalizes
- EconCSLib, `EconCSLib.LinearProgramming.dualAugA_inl`
- 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.dualAugA_inl← EconCSLib.LinearProgramming.dualAugA_inl (EconCSLib/Math/LinearProgramming/StrongDuality.lean:111): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- EconCSLib.LinearProgramming.dualAugAAugmented matrix combining
Arows withx โฅ 0unit rows.
- EconCSLib.LinearProgramming.dualAugAAugmented matrix combining
- Used by 3
- EconCSLib.LinearProgramming.isFeasible_dualAug_iffAugmented feasibility is the primal feasibility (with
x โฅ 0). - EconCSLib.LinearProgramming.lp_strong_dualityLP Strong Duality [MFoGT, Section 2.8, Exercise 9]: if the primal LP
min โจc, xโฉ s.t. A x โฅ b, x โฅ 0is feasible and bounded below byโฆ - EconCSLib.LinearProgramming.dualAugA_inrEconCSLib.LinearProgramming.dualAugA_inr
- EconCSLib.LinearProgramming.isFeasible_dualAug_iffAugmented feasibility is the primal feasibility (with
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.LinearProgramming.dualAugA_inl (A : I โ Fin n โ ๐) (i : I) (j : Fin n) : dualAugA A (Sum.inl i) j = A i j := rfl