Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, Case I — ω=2λ0B(βiλ2/λ0)\omega=2\lambda_0\mathcal B(\beta_i\sqrt{\lambda_2/\lambda_0})ω=2λ0​B(βi​λ2​/λ0​​) when λ0/λ2≤M\sqrt{\lambda_0/\lambda_2}\le Mλ0​/λ2​​≤M

Proved
L0BnB.Reduced.case_I

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perspective-relaxationreverse-hubersparse-regression

Fix λ0,λ2,M>0\lambda_0,\lambda_2,M>0λ0​,λ2​,M>0 with λ0/λ2≤M\sqrt{\lambda_0/\lambda_2}\le Mλ0​/λ2​​≤M, and b∈Rb\in\mathbb Rb∈R with ∣b∣≤M|b|\le M∣b∣≤M. Let ω(b;λ0,λ2,M)\omega(b;\lambda_0,\lambda_2,M)ω(b;λ0​,λ2​,M) be the minimum of λ0z+λ2s\lambda_0z+\lambda_2 sλ0​z+λ2​s over the pairs (z,s)(z,s)(z,s) with

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.

Then this minimum is attained and equals

ω(b;λ0,λ2,M)=2λ0 B(bλ2/λ0)=ψ1(b;λ0,λ2),\omega(b;\lambda_0,\lambda_2,M)=2\lambda_0\,\mathcal B\big(b\sqrt{\lambda_2/\lambda_0}\big)=\psi_1(b;\lambda_0,\lambda_2),ω(b;λ0​,λ2​,M)=2λ0​B(bλ2​/λ0​​)=ψ1​(b;λ0​,λ2​),

where B\mathcal BB is the reverse Huber penalty (4).

In this regime the Big-M bound does not bind the optimal sss, and the relaxation of the perspective term produces the reverse Huber penalty: an ℓ1\ell_1ℓ1​-type penalty 2λ0λ2∣b∣2\sqrt{\lambda_0\lambda_2}|b|2λ0​λ2​​∣b∣ for ∣b∣≤λ0/λ2|b|\le\sqrt{\lambda_0/\lambda_2}∣b∣≤λ0​/λ2​​ and λ0+λ2b2\lambda_0+\lambda_2b^2λ0​+λ2​b2 beyond.

Formalization Note The statement is IsLeast of the set of values λ0z+λ2s\lambda_0z+\lambda_2sλ0​z+λ2​s over the feasible pairs, so it asserts both attainment and the lower bound.

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

/-- Proof of Theorem 1, Case I, p. 28: if `√(λ₀/λ₂) ≤ M` and `|b| ≤ M`, then
`ω(b; λ₀, λ₂, M) = 2λ₀ B(b √(λ₂/λ₀)) = ψ₁(b; λ₀, λ₂)`. -/
theorem case_I (lam0 lam2 M b : ℝ) (h0 : 0 < lam0) (h2 : 0 < lam2) (hM : 0 < M)
    (hreg : Real.sqrt (lam0 / lam2) ≤ M) (hb : |b| ≤ M) :
    IsLeast (omegaValues lam0 lam2 M b) (psi1 lam0 lam2 b) := 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, Case I
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