Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fourier–Motzkin elimination computes the projection

Proved
LinearOptimization.fourier_motzkin_projection

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

fourier-motzkingeometrylinear-programmingpolyhedraprojection

(Theorem 2.10, GOAL) The polyhedron QQQ constructed by the elimination algorithm is equal to the projection Πn−1(P)\Pi_{n-1}(P)Πn−1​(P) of PPP, where for S⊂RnS \subset \mathbb{R}^nS⊂Rn,

Πk(S)={πk(x)∣x∈S}andπk(x1,…,xn)=(x1,…,xk).\Pi_k(S) = \{\pi_k(x) \mid x \in S\} \quad \text{and} \quad \pi_k(x_1, \dots, x_n) = (x_1, \dots, x_k).Πk​(S)={πk​(x)∣x∈S}andπk​(x1​,…,xn​)=(x1​,…,xk​).
Preamble
import Definitions.Def_FourierMotzkinStep


/-- **Bertsimas & Tsitsiklis, Theorem 2.10 (p. 73).** One Fourier–Motzkin elimination step
computes exactly the projection of the polyhedron onto its first `n`
coordinates. -/
Formal statement
theorem LinearOptimization.fourier_motzkin_projection {m n : ℕ}
    (A : Matrix (Fin m) (Fin (n + 1)) ℝ) (b : Fin m → ℝ) :
    fourierMotzkinEliminate A b =
      (fun x : Fin (n + 1) → ℝ => fun l : Fin n => x l.castSucc) ''
        polyhedron A b := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 2.10, p. 73

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me