Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2, p. 6 — under strict activity each inequality in (6b) is facet-defining

Proved
ReluMIP.Facet.proposition_2

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

facetmixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-combinatoricsrelu

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, over the input box [L,U][L,U][L,U] with Li<UiL_i<U_iLi​<Ui​ for every iii, and assume strict activity, M−(f)<0<M+(f)M^-(f)<0<M^+(f)M−(f)<0<M+(f). Let PPP be the convex hull of the points (x,y,z)(x,y,z)(x,y,z) feasible with respect to formulation (6):

y≥w⋅x+b,y≤∑i∈I′wi(xi−L˘i(1−z))+(b+∑i∉I′wiU˘i)z  ∀I′⊆supp⁡(w),(x,y,z)∈[L,U]×R≥0×{0,1}.y\ge w\cdot x+b,\qquad y\le\sum_{i\in I'}w_i\bigl(x_i-\breve L_i(1-z)\bigr)+\Bigl(b+\sum_{i\notin I'}w_i\breve U_i\Bigr)z\ \ \forall I'\subseteq\operatorname{supp}(w),\qquad (x,y,z)\in[L,U]\times\mathbb R_{\ge0}\times\{0,1\}.y≥w⋅x+b,y≤i∈I′∑​wi​(xi​−L˘i​(1−z))+(b+i∈/I′∑​wi​U˘i​)z  ∀I′⊆supp(w),(x,y,z)∈[L,U]×R≥0​×{0,1}.

Then for every I⊆supp⁡(w)I\subseteq\operatorname{supp}(w)I⊆supp(w) the inequality (6b) for III,

y≤∑i∈Iwi(xi−L˘i(1−z))+(b+∑i∉IwiU˘i)z,y\le\sum_{i\in I}w_i\bigl(x_i-\breve L_i(1-z)\bigr)+\Bigl(b+\sum_{i\notin I}w_i\breve U_i\Bigr)z ,y≤i∈I∑​wi​(xi​−L˘i​(1−z))+(b+i∈/I∑​wi​U˘i​)z,

is facet-defining for PPP: it is valid on PPP, the face FFF of PPP on which it holds with equality is nonempty, and dim⁡F=dim⁡P−1\dim F=\dim P-1dimF=dimP−1.

Together with Proposition 1 (formulation (6) is ideal), this says that none of the exponentially many inequalities (6b) can be dropped: formulation (6) is minimal modulo variable bounds. The paper notes that strict activity is required for this result.

Formalization Note "Facet-defining" is not defined in the paper; the standard notion is used, with dimensions as finrank of the vectorSpan and dim⁡F=dim⁡P−1\dim F=\dim P-1dimF=dimP−1 written dim⁡F+1=dim⁡P\dim F+1=\dim PdimF+1=dimP. The polyhedron is the convex hull of the points of (6) (with z∈{0,1}z\in\{0,1\}z∈{0,1}), which by Proposition 1 equals the LP relaxation of (6); the hull is used so that the statement does not depend on Proposition 1. The bounds L<UL<UL<U and strict activity are the paper's standing assumptions of §1.3. Indices are 0-based (Fin η).

Preamble
import Mathlib
import Definitions.Def_ReluMIP_Facet_Setting
Formal statement
namespace ReluMIP.Facet

/-- Proposition 2, p. 6 (arXiv:1811.08359v2): under the standing assumptions of §1.3
(`L < U` componentwise and strict activity `M⁻(f) < 0 < M⁺(f)`), each inequality (6b),
`y ≤ ∑_{i∈I} wᵢ(xᵢ − L̆ᵢ(1 − z)) + (b + ∑_{i∉I} wᵢŬᵢ) z` for `I ⊆ ReluMIP.Ideal.supp(w)`, is facet-defining for
the convex hull of the points feasible with respect to formulation (6). -/
theorem proposition_2 {η : ℕ} (w : Fin η → ℝ) (b : ℝ) (L U : Fin η → ℝ)
    (hLU : ∀ i, L i < U i) (hSA : ReluMIP.Ideal.StrictActivity w b L U) :
    ∀ I : Finset (Fin η), I ⊆ ReluMIP.Ideal.supp w →
      IsFacetDefining (convexHull ℝ (form6 w b L U))
        (fun p => p.2.1 - ReluMIP.Ideal.rhs6b w b L U I p.1 p.2.2) := by sorry

end ReluMIP.Facet
Source
arXiv:1811.08359v2, Proposition 2, p. 6 (proof App. A.2, p. 15)
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