AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearProgramming.isFeasible_dualAug_iff

theoremverifiedformalizationimported Lean

Augmented feasibility is the primal feasibility (with x ≥ 0).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators EconCSLib.LinearAlgebra in
set_option linter.unusedSectionVars false in
variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in
variable {I : Type*} [Fintype I] [DecidableEq I] {n : ℕ} in
theorem EconCSLib.LinearProgramming.isFeasible_dualAug_iff (A : I → Fin n → 𝕜) (b : I → 𝕜) :
    IsFeasible (dualAugA A) (dualAugB b) ↔ PrimalFeasible A b
Formalizes
EconCSLib, `EconCSLib.LinearProgramming.isFeasible_dualAug_iff`
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
Classical.choiceQuot.soundpropext
Built on 11
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators EconCSLib.LinearAlgebra inset_option linter.unusedSectionVars false invariable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] invariable {I : Type*} [Fintype I] [DecidableEq I] {n : ℕ} in/-- Augmented feasibility is the primal feasibility (with `x ≥ 0`). -/theorem EconCSLib.LinearProgramming.isFeasible_dualAug_iff (A : I → Fin n → 𝕜) (b : I → 𝕜) :    IsFeasible (dualAugA A) (dualAugB b) ↔ PrimalFeasible A b := by  unfold IsFeasible PrimalFeasible  constructor  · rintro ⟨x, hx⟩    refine ⟨x, ?_, ?_⟩    · intro i      have h := hx (Sum.inl i)      simpa [rowEval] using h    · intro j'      have h := hx (Sum.inr j')      -- h : 0 ≤ ∑ j, (if j = j' then 1 else 0) * x j = x j'      simp only [rowEval, dualAugB_inr, dualAugA_inr, ite_mul, one_mul, zero_mul,                 Fintype.sum_ite_eq'] at h      exact h  · rintro ⟨x, hxA, hxnn⟩    refine ⟨x, ?_⟩    intro idx    rcases idx with i | j'    · simp only [rowEval, dualAugB_inl, dualAugA_inl]      exact hxA i    · simp only [rowEval, dualAugB_inr, dualAugA_inr, ite_mul, one_mul, zero_mul,                 Fintype.sum_ite_eq']      exact hxnn j'
See it in the graphDiscuss this resultChallenge it