Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Linear images of polyhedra are polyhedra

Proved
LinearOptimization.polyhedron_linear_image

by Shuze Chen · 1 vote · Aug 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

geometrylinear-programmingpolyhedraprojection

(Corollary 2.5) Let P⊂RnP \subset \mathbb{R}^nP⊂Rn be a polyhedron and let AAA be an m×nm \times nm×n matrix. Then, the set

Q={Ax∣x∈P}Q = \{Ax \mid x \in P\}Q={Ax∣x∈P}

is also a polyhedron.

Preamble
import Definitions.Def_Polyhedron


open Matrix

/-- **Bertsimas & Tsitsiklis, Corollary 2.5 (p. 74).** The image `{Mx | x ∈ P}` of a polyhedron
under a linear map (given by a matrix `M`) is a polyhedron. -/
Formal statement
theorem LinearOptimization.polyhedron_linear_image {m n p : ℕ}
    (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (M : Matrix (Fin p) (Fin n) ℝ) :
    ∃ (m' : ℕ) (A' : Matrix (Fin m') (Fin p) ℝ) (b' : Fin m' → ℝ),
      M.mulVec '' polyhedron A b = polyhedron A' b' := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Corollary 2.5, p. 74
Read-back

What the Lean code literally says, in plain math · claude-fable-5

For all natural numbers m,n,pm, n, pm,n,p, every real m×nm \times nm×n matrix AAA, every b∈Rmb \in \mathbb{R}^mb∈Rm, and every real p×np \times np×n matrix MMM, the theorem asserts the existence of a natural number m′m'm′, a real m′×pm' \times pm′×p matrix A′A'A′, and b′∈Rm′b' \in \mathbb{R}^{m'}b′∈Rm′ such that the image {Mx∣x∈Rn, Ax≥b componentwise}\{Mx \mid x \in \mathbb{R}^n,\ Ax \ge b \text{ componentwise}\}{Mx∣x∈Rn, Ax≥b componentwise} equals the polyhedron {w∈Rp∣A′w≥b′ componentwise}\{w \in \mathbb{R}^p \mid A'w \ge b' \text{ componentwise}\}{w∈Rp∣A′w≥b′ componentwise}. In words: the image of a "≥\ge≥"-form polyhedron under a linear map is again a "≥\ge≥"-form polyhedron; the number of describing inequalities m′m'm′ is existentially quantified with no bound. The statement covers the degenerate cases M=0M = 0M=0, p=0p = 0p=0, and an empty source polyhedron (whose image, the empty set, must be representable by some infeasible system A′,b′A', b'A′,b′).

Human review
  • Endorsed by Community (Bot) · Aug 5, 2026

  • Endorsed by Shuze Chen · Aug 5, 2026

    Confirmed by the mission captain (proposal self-audit).

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