Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — reduction of the coordinate problem ω to the one-variable problem (36)

Proved
L0BnB.Reduced.reduction_36

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perspective-relaxationsparse-regression

Fix λ0,λ2,M>0\lambda_0,\lambda_2,M>0λ0​,λ2​,M>0 and b∈Rb\in\mathbb Rb∈R with ∣b∣≤M|b|\le M∣b∣≤M. Consider the one-coordinate constraints of the interval relaxation of the perspective formulation,

b2≤sz,−Mz≤b≤Mz,0≤z≤1,s≥0,b^2\le sz,\qquad -Mz\le b\le Mz,\qquad 0\le z\le 1,\qquad s\ge 0,b2≤sz,−Mz≤b≤Mz,0≤z≤1,s≥0,

and let z^=max⁡{b2/s, ∣b∣/M}\hat z=\max\{b^2/s,\,|b|/M\}z^=max{b2/s,∣b∣/M}, with b2/s:=0b^2/s:=0b2/s:=0 when b=s=0b=s=0b=s=0. Then:

  1. every feasible pair (z,s)(z,s)(z,s) satisfies s≥b2s\ge b^2s≥b2 and z≥z^z\ge\hat zz≥z^;
  2. for every s≥b2s\ge b^2s≥b2, the pair (z^,s)(\hat z,s)(z^,s) is feasible;
  3. consequently, a real number vvv is the minimum of λ0z+λ2s\lambda_0 z+\lambda_2 sλ0​z+λ2​s over the feasible pairs if and only if it is the minimum of problem (36),
ω(b;λ0,λ2,M)=min⁡s max⁡{λ0b2s+λ2s, λ0∣b∣M+λ2s}s.t.s≥b2.\omega(b;\lambda_0,\lambda_2,M)=\min_{s}\ \max\Big\{\lambda_0\frac{b^2}{s}+\lambda_2 s,\ \lambda_0\frac{|b|}{M}+\lambda_2 s\Big\}\quad\text{s.t.}\quad s\ge b^2 .ω(b;λ0​,λ2​,M)=smin​ max{λ0​sb2​+λ2​s, λ0​M∣b∣​+λ2​s}s.t.s≥b2.

This eliminates the indicator variable zzz and turns the computation of ω\omegaω into a one-dimensional minimization over sss, which the two cases of the proof of Theorem 1 then solve.

Formalization Note "Is the minimum" is IsLeast: the value belongs to the set and bounds it from below. The paper's side condition ∣βi∣≤M|\beta_i|\le M∣βi​∣≤M of (36) is the hypothesis on bbb.

Preamble
import Mathlib
import Definitions.Def_L0BnB_Reduced_ReverseHuber
import Definitions.Def_L0BnB_Reduced_Setup
Formal statement
namespace L0BnB.Reduced

/-- Proof of Theorem 1, p. 28: for one coordinate `b` with `|b| ≤ M`, every feasible `(z, s)` of
(35b)–(35d) has `s ≥ b²` and `z ≥ ẑ = max{b²/s, |b|/M}`; for every `s ≥ b²` the pair `(ẑ, s)` is
feasible; hence `ω(b; λ₀, λ₂, M)` is the minimum of (36). -/
theorem reduction_36 (lam0 lam2 M b : ℝ) (h0 : 0 < lam0) (h2 : 0 < lam2) (hM : 0 < M)
    (hb : |b| ≤ M) :
    (∀ z s : ℝ, CoordFeas M b z s → b ^ 2 ≤ s ∧ zhat M b s ≤ z) ∧
    (∀ s : ℝ, b ^ 2 ≤ s → CoordFeas M b (zhat M b s) s) ∧
    (∀ v : ℝ, IsLeast (omegaValues lam0 lam2 M b) v ↔ IsLeast (values36 lam0 lam2 M b) v) := by sorry

end L0BnB.Reduced
Source
Hazimeh, Mazumder, Saab, Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization, arXiv:2004.06152v2, p. 28, App. A, Proof of Theorem 1, reduction to (36)
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