Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — valid inequalities of a polyhedron with a bounded nonconstant direction are nonnegative combinations

Proved
ExtensionComplexity.TSP.valid_inequality_nonneg_combination

by mikedeng1 · 1 vote · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

farkas-lemmalinear-inequalitiesp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedra

Let A∈Rm×dA\in\mathbb R^{m\times d}A∈Rm×d, b∈Rmb\in\mathbb R^mb∈Rm and P={x∈Rd:Ax≤b}P=\{x\in\mathbb R^d : Ax\le b\}P={x∈Rd:Ax≤b}, a possibly unbounded polyhedron. Suppose some direction u∈Rdu\in\mathbb R^du∈Rd satisfies

−∞<min⁡{u⊤x:x∈P}<max⁡{u⊤x:x∈P}<+∞,-\infty<\min\{u^\top x : x\in P\}<\max\{u^\top x : x\in P\}<+\infty,−∞<min{u⊤x:x∈P}<max{u⊤x:x∈P}<+∞,

and let c⊤x≤δc^\top x\le\deltac⊤x≤δ be valid for PPP (satisfied by every point of PPP). Lemma 2: there are nonnegative multipliers λ∈Rm\lambda\in\mathbb R^mλ∈Rm with

λ⊤A=c⊤andλ⊤b=δ,\lambda^\top A=c^\top\qquad\text{and}\qquad\lambda^\top b=\delta,λ⊤A=c⊤andλ⊤b=δ,

that is, c⊤x≤δc^\top x\le\deltac⊤x≤δ is a nonnegative combination of the rows of Ax≤bAx\le bAx≤b, with equality in the right-hand side.

Ordinary Farkas gives λ⊤b≤δ\lambda^\top b\le\deltaλ⊤b≤δ; the hypothesis on uuu is what upgrades it to equality, and this is what the proof of Theorem 3 needs to show that rows of a slack matrix for redundant inequalities are nonnegative combinations of the others.

Formalization Note The page prints "λ∈Rd\lambda\in\mathbb R^dλ∈Rd"; since AAA has mmm rows, λ∈Rm\lambda\in\mathbb R^mλ∈Rm, which is what is stated. The minimum and maximum are required to exist (IsLeast/IsGreatest of {u⊤x:x∈P}\{u^\top x : x\in P\}{u⊤x:x∈P}), which is the meaning of the finite min⁡\minmin/max⁡\maxmax. The lemma's "In particular" sentence (polytopes of dimension at least 111, and unbounded polyhedra projecting onto them) is not part of this statement.

Preamble
import Mathlib

open Matrix
Formal statement
namespace ExtensionComplexity.TSP

/-- **Lemma 2** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, pp. 17:9–17:10): let
`P = {x ∈ ℝ^d | Ax ≤ b}` be a (possibly unbounded) polyhedron admitting a direction `u` such that
`min{uᵀx | x ∈ P}` and `max{uᵀx | x ∈ P}` are finite (attained) and the minimum is strictly less
than the maximum, and let `cᵀx ≤ δ` be valid for `P`. Then there are nonnegative multipliers
`λ ∈ ℝ^m` (the page prints `ℝ^d`; `A` has `m` rows) with `λᵀA = cᵀ` and `λᵀb = δ`. -/
theorem valid_inequality_nonneg_combination {m d : ℕ} (A : Matrix (Fin m) (Fin d) ℝ)
    (b : Fin m → ℝ) (P : Set (Fin d → ℝ)) (hP : P = {x | A *ᵥ x ≤ b})
    (u : Fin d → ℝ) (lo hi : ℝ) (hlo : IsLeast ((fun x => u ⬝ᵥ x) '' P) lo)
    (hhi : IsGreatest ((fun x => u ⬝ᵥ x) '' P) hi) (hlohi : lo < hi)
    (c : Fin d → ℝ) (δ : ℝ) (hvalid : ∀ x ∈ P, c ⬝ᵥ x ≤ δ) :
    ∃ lam : Fin m → ℝ, 0 ≤ lam ∧ lam ᵥ* A = c ∧ lam ⬝ᵥ b = δ := by sorry

end ExtensionComplexity.TSP
Source
Fiorini, Massar, Pokutta, Tiwary, de Wolf, Exponential lower bounds for polytopes in combinatorial optimization, J. ACM 62(2) (2015), Art. 17, pp. 17:9-17:10, Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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