Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. A.1, (7a)–(7d), p. 14 — Fourier–Motzkin elimination of (5) yields the system (7)

Proved
ReluMIP.Ideal.fm_projection_eq_system7

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

fourier-motzkinmixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1projectionrelu

Let f(x)=w⋅x+bf(x)=w\cdot x+bf(x)=w⋅x+b and L,U∈RηL,U\in\mathbb R^\etaL,U∈Rη with Li<UiL_i<U_iLi​<Ui​ for every iii. Write L˘,U˘\breve L,\breve UL˘,U˘ for the sign-adjusted bounds (L˘i=Li\breve L_i=L_iL˘i​=Li​, U˘i=Ui\breve U_i=U_iU˘i​=Ui​ if wi≥0w_i\ge0wi​≥0, swapped otherwise). The projection onto (x,y,z)(x,y,z)(x,y,z) of the LP relaxation of the multiple choice formulation (5) equals the set of (x,y,z)(x,y,z)(x,y,z) satisfying

y≥w⋅x+b,(7a)y≤∑i∈Iwixi−∑i∈IwiL˘i(1−z)+(b+∑i∉IwiU˘i)z∀I⊆supp⁡(w),(7b)y≥∑i∈Iwixi−∑i∈IwiU˘i(1−z)+(b+∑i∉IwiL˘i)z∀I⊆supp⁡(w),(7c)(x,y,z)∈[L,U]×R≥0×[0,1].(7d)\begin{aligned} &y\ge w\cdot x+b, &&(7a)\\ &y\le\sum_{i\in I}w_ix_i-\sum_{i\in I}w_i\breve L_i(1-z)+\Bigl(b+\sum_{i\notin I}w_i\breve U_i\Bigr)z\quad\forall I\subseteq\operatorname{supp}(w), &&(7b)\\ &y\ge\sum_{i\in I}w_ix_i-\sum_{i\in I}w_i\breve U_i(1-z)+\Bigl(b+\sum_{i\notin I}w_i\breve L_i\Bigr)z\quad\forall I\subseteq\operatorname{supp}(w), &&(7c)\\ &(x,y,z)\in[L,U]\times\mathbb R_{\ge0}\times[0,1]. &&(7d) \end{aligned}​y≥w⋅x+b,y≤i∈I∑​wi​xi​−i∈I∑​wi​L˘i​(1−z)+(b+i∈/I∑​wi​U˘i​)z∀I⊆supp(w),y≥i∈I∑​wi​xi​−i∈I∑​wi​U˘i​(1−z)+(b+i∈/I∑​wi​L˘i​)z∀I⊆supp(w),(x,y,z)∈[L,U]×R≥0​×[0,1].​​(7a)(7b)(7c)(7d)​

This is the outcome of eliminating the auxiliary variables x0,x1,y0,y1x^0,x^1,y^0,y^1x0,x1,y0,y1 of (5) by Fourier–Motzkin elimination.

Formalization Note The page writes (7b) and (7c) with L,UL,UL,U after replacing every negative weight by its absolute value through x~i=−xi\tilde x_i=-x_ix~i​=−xi​, so its display is the case w≥0w\ge0w≥0; undoing the substitution, as the last paragraph of A.1 does, turns L,UL,UL,U into L˘,U˘\breve L,\breve UL˘,U˘. The Lean states this general-sign form; (7b) is then literally (6b). Strict activity is not assumed (the identity holds without it).

Preamble
import Mathlib
import Definitions.Def_ReluMIP_Ideal_Setting
Formal statement
namespace ReluMIP.Ideal

/-- App. A.1, (7a)–(7d), p. 14 (arXiv:1811.08359v2): eliminating `x⁰, x¹, y⁰, y¹` from the LP
relaxation of (5) by Fourier–Motzkin yields the system (7), written here in general-sign form
(`L̆`, `Ŭ` in place of the page's `L`, `U` for `w > 0`). -/
theorem fm_projection_eq_system7 {η : ℕ} (w : Fin η → ℝ) (b : ℝ) (L U : Fin η → ℝ)
    (hLU : ∀ i, L i < U i) :
    relax5 w b L U = system7 w b L U := by sorry

end ReluMIP.Ideal
Source
arXiv:1811.08359v2, App. A.1, display (7a)–(7d), p. 14
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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