EconCSLib.LinearProgramming.DualFeasible
defimported Lean
Dual feasibility of u: u ≥ 0 ∧ uᵀA ≤ c.
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.DualFeasible (A : I → Fin n → 𝕜) (c : Fin n → 𝕜) (u : I → 𝕜) : Prop
- Defined in
- EconCSLib, `EconCSLib.LinearProgramming.DualFeasible`
- 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.DualFeasible← EconCSLib.LinearProgramming.DualFeasible (EconCSLib/Math/LinearProgramming/StrongDuality.lean:55): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 7
- EconCSLib.LinearProgramming.lp_weak_complementarity_colWeak complementary slackness, column form.
- 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.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.lp_weak_dualityEconCSLib.LinearProgramming.lp_weak_duality
- EconCSLib.LinearProgramming.exists_strong_complementary_pairLP Strong Complementarity [MFoGT, Section 2.8, Exercise 11]: given an optimal primal-dual pair
(x₀, u₀)with common valuev, there… - EconCSLib.LinearProgramming.lp_weak_complementarity_rowWeak complementary slackness, row form.
- 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 /-- Dual feasibility of `u`: `u ≥ 0 ∧ uᵀA ≤ c`. -/ def EconCSLib.LinearProgramming.DualFeasible (A : I → Fin n → 𝕜) (c : Fin n → 𝕜) (u : I → 𝕜) : Prop := (∀ i, 0 ≤ u i) ∧ (∀ j, ∑ i, u i * A i j ≤ c j)