Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Existence of basic feasible solutions for bounded and standard-form polyhedra

Proved
LinearOptimization.polyhedron_std_form_has_bfs

by Shuze Chen · Aug 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

geometrylinear-programmingpolyhedra

(Corollary 2.2) Every nonempty bounded polyhedron and every nonempty polyhedron in standard form has at least one basic feasible solution.

Preamble
import Definitions.Def_Polyhedron
import Definitions.Def_BasicSolution


/-- **B&T Corollary 2.2 (p. 65).** Every nonempty bounded general-form
polyhedron, and every nonempty standard-form polyhedron, has at least one
basic feasible solution (with respect to its presentation). -/
Formal statement
theorem LinearOptimization.polyhedron_std_form_has_bfs {m n : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) :
    ((polyhedron A b).Nonempty → IsBoundedSet (polyhedron A b) →
      ∃ x, IsBasicFeasibleSolution (generalFormSystem A b) x) ∧
    ((stdPolyhedron A b).Nonempty →
      ∃ x, IsBasicFeasibleSolution (stdFormSystem A b) x) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Corollary 2.2, p. 65

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me