Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. A.2, p. 15 — for small ε > 0 the η + 2 points p⁰, p¹, p̃ⁱ are feasible for (6) and tight on (6b)

Proved
ReluMIP.Facet.facet_points_feasible_tight

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

facetmixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relu

Let w∈Rηw\in\mathbb R^\etaw∈Rη, b∈Rb\in\mathbb Rb∈R and L,U∈RηL,U\in\mathbb R^\etaL,U∈Rη 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) for f(x)=w⋅x+bf(x)=w\cdot x+bf(x)=w⋅x+b. Fix I⊆supp⁡(w)I\subseteq\operatorname{supp}(w)I⊆supp(w).

Then there is ε>0\varepsilon>0ε>0 such that each of the η+2\eta+2η+2 points

p0=(L˘,0,0),p1=(U˘,f(U˘),1),p~i=(L˘+εσiei,0,0) (i∉I),p~i=(U˘−εσiei,f(U˘−εσiei),1) (i∈I)p^0=(\breve L,0,0),\quad p^1=(\breve U,f(\breve U),1),\quad \tilde p^i=(\breve L+\varepsilon\sigma_ie^i,0,0)\ (i\notin I),\quad \tilde p^i=(\breve U-\varepsilon\sigma_ie^i,f(\breve U-\varepsilon\sigma_ie^i),1)\ (i\in I)p0=(L˘,0,0),p1=(U˘,f(U˘),1),p~​i=(L˘+εσi​ei,0,0) (i∈/I),p~​i=(U˘−εσi​ei,f(U˘−εσi​ei),1) (i∈I)

is feasible with respect to formulation (6) — it satisfies (6a), every inequality (6b), x∈[L,U]x\in[L,U]x∈[L,U], y≥0y\ge0y≥0 and z∈{0,1}z\in\{0,1\}z∈{0,1} — and satisfies the inequality (6b) for the subset III at equality. Here σi=1\sigma_i=1σi​=1 if wi≥0w_i\ge0wi​≥0 and σi=−1\sigma_i=-1σi​=−1 if wi<0w_i<0wi​<0, and eie^iei is the iii-th unit vector.

This is the first half of the proof of Proposition 2: it supplies η+2\eta+2η+2 points on the face of (6b).

Formalization Note The page assumes w≥0w\ge 0w≥0 without loss of generality, so that L˘=L\breve L=LL˘=L, U˘=U\breve U=UU˘=U and every step is +εei+\varepsilon e^i+εei from LLL or −εei-\varepsilon e^i−εei from UUU; the statement is the general-sign version, with σi\sigma_iσi​ the sign by which the step points into the box. Indices are 0-based (Fin η).

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

/-- App. A.2, p. 15 (arXiv:1811.08359v2): for every `I ⊆ ReluMIP.Ideal.supp(w)` there is a step `ε > 0` such that
each of the `η + 2` points `p⁰, p¹, p̃ⁱ` of `facetPts` is feasible with respect to formulation (6)
and satisfies the inequality (6b) for `I` at equality. -/
theorem facet_points_feasible_tight {η : ℕ} (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 → ∃ ε : ℝ, 0 < ε ∧ ∀ j,
      facetPts w b L U I ε j ∈ form6 w b L U ∧
      (facetPts w b L U I ε j).2.1 =
        ReluMIP.Ideal.rhs6b w b L U I (facetPts w b L U I ε j).1 (facetPts w b L U I ε j).2.2 := by sorry

end ReluMIP.Facet
Source
arXiv:1811.08359v2, App. A.2 (Proof of Proposition 2), second paragraph, 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