AFTD Auto-Formalizing Theoretical Domains

EconCSLib.LinearProgramming.PrimalFeasible

defimported Lean

Primal feasibility: ∃ x, A x ≥ b ∧ x ≥ 0.

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.PrimalFeasible (A : I → Fin n → 𝕜) (b : I → 𝕜) : Prop
Defined in
EconCSLib, `EconCSLib.LinearProgramming.PrimalFeasible`
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
Used by 2

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
/-- Primal feasibility: `∃ x, A x ≥ b ∧ x ≥ 0`. -/
def EconCSLib.LinearProgramming.PrimalFeasible (A : I → Fin n → 𝕜) (b : I → 𝕜) : Prop :=
  ∃ x : Fin n → 𝕜, (∀ i, b i ≤ ∑ j, A i j * x j) ∧ (∀ j, 0 ≤ x j)
See it in the graphDiscuss this resultChallenge it