Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, (5), pp. 5–6 — the multiple choice formulation is an ideal extended formulation of the ReLU graph

Proved
ReluMIP.Ideal.multiple_choice_ideal

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

convex-hullextended-formulationideal-formulationmixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relu

Let f(x)=w⋅x+bf(x)=w\cdot x+bf(x)=w⋅x+b with w∈Rηw\in\mathbb R^\etaw∈Rη, b∈Rb\in\mathbb Rb∈R, and let L,U∈RηL,U\in\mathbb R^\etaL,U∈Rη with Li<UiL_i<U_iLi​<Ui​ for every iii. Let R~5\widetilde R_5R5​ be the lifted LP relaxation of (5) in (x,y,z,x0,x1,y0,y1)(x,y,z,x^0,x^1,y^0,y^1)(x,y,z,x0,x1,y0,y1), and R5R_5R5​ its projection onto (x,y,z)(x,y,z)(x,y,z): the points (x,y,z)(x,y,z)(x,y,z) with 0≤z≤10\le z\le10≤z≤1 for which there are x0,x1,y0,y1x^0,x^1,y^0,y^1x0,x1,y0,y1 with

(x,y)=(x0,y0)+(x1,y1),y0=0≥w⋅x0+b(1−z),y1=w⋅x1+bz≥0,L(1−z)≤x0≤U(1−z),Lz≤x1≤Uz.(x,y)=(x^0,y^0)+(x^1,y^1),\quad y^0=0\ge w\cdot x^0+b(1-z),\quad y^1=w\cdot x^1+bz\ge0,\quad L(1-z)\le x^0\le U(1-z),\quad Lz\le x^1\le Uz .(x,y)=(x0,y0)+(x1,y1),y0=0≥w⋅x0+b(1−z),y1=w⋅x1+bz≥0,L(1−z)≤x0≤U(1−z),Lz≤x1≤Uz.

Then:

  1. Every extreme point of R~5\widetilde R_5R5​ has z∈{0,1}z\in\{0,1\}z∈{0,1}, so (5) is ideal in its lifted space;
  2. R5R_5R5​ with z∈{0,1}z\in\{0,1\}z∈{0,1} is a formulation of gr⁡(ReLU∘f;[L,U])\operatorname{gr}(\mathrm{ReLU}\circ f;[L,U])gr(ReLU∘f;[L,U]): (x,y)(x,y)(x,y) lies on the graph if and only if (x,y,z)∈R5(x,y,z)\in R_5(x,y,z)∈R5​ for some z∈{0,1}z\in\{0,1\}z∈{0,1};
  3. R5R_5R5​ is the convex hull of its points with z∈{0,1}z\in\{0,1\}z∈{0,1}:
R5=conv⁡{(x,y,z)∈R5:z∈{0,1}}.R_5=\operatorname{conv}\{(x,y,z)\in R_5 : z\in\{0,1\}\}.R5​=conv{(x,y,z)∈R5​:z∈{0,1}}.

The paper cites this fact from the literature on piecewise linear functions and from Balas's disjunctive programming; it is the starting point of the proof of Proposition 1.

Formalization Note The projected hull identity is the consequence of lifted ideality used in Appendix A.1. Strict activity is not assumed; the statement also holds without it.

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

/-- §2.2, display (5), pp. 5–6 (arXiv:1811.08359v2): the multiple-choice formulation (5) is an
ideal extended formulation of `gr(ReLU ∘ f; [L, U])`. Its lifted LP relaxation has binary
extreme points in `z`; with `z ∈ {0,1}` it formulates the graph; and its projection to
`(x,y,z)` is the convex hull of its points with `z ∈ {0,1}`. -/
theorem multiple_choice_ideal {η : ℕ} (w : Fin η → ℝ) (b : ℝ) (L U : Fin η → ℝ)
    (hLU : ∀ i, L i < U i) :
    (∀ p ∈ Set.extremePoints ℝ (relax5Lift w b L U), p.1.2.2 = 0 ∨ p.1.2.2 = 1) ∧
      IsFormulationFor (relax5 w b L U) (reluGraph w b L U) ∧
      relax5 w b L U = convexHull ℝ {p | p ∈ relax5 w b L U ∧ (p.2.2 = 0 ∨ p.2.2 = 1)} := by sorry

end ReluMIP.Ideal
Source
arXiv:1811.08359v2, §2.2, display (5a)–(5f), pp. 5–6
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