Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(8) — for λ0/λ2>M\sqrt{\lambda_0/\lambda_2}>Mλ0​/λ2​​>M, VPR(M)≥VPR(∞)+h(λ0,λ2,M)∥β∗∥1V_{PR(M)} \ge V_{PR(\infty)} + h(\lambda_0,\lambda_2,M)\|\beta^*\|_1VPR(M)​≥VPR(∞)​+h(λ0​,λ2​,M)∥β∗∥1​

Proved
L0BnB.Strength.ineq_8

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

mixed-integer-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perspective-relaxationrelaxation-strengthsparse-regression

Let X∈Rn×pX\in\mathbb R^{n\times p}X∈Rn×p, y∈Rny\in\mathbb R^ny∈Rn, λ0,λ2>0\lambda_0,\lambda_2>0λ0​,λ2​>0 and M>0M>0M>0 with λ0/λ2>M\sqrt{\lambda_0/\lambda_2} > Mλ0​/λ2​​>M. Let VPR(M)V_{PR(M)}VPR(M)​ be the optimal value of the reduced perspective relaxation (5), VPR(∞)=inf⁡β∈RpG(β)V_{PR(\infty)} = \inf_{\beta\in\mathbb R^p} G(\beta)VPR(∞)​=infβ∈Rp​G(β) the value (6), and β∗\beta^*β∗ an optimal solution of (5). With h(λ0,λ2,M)=λ0/M+λ2M−2λ0λ2h(\lambda_0,\lambda_2,M) = \lambda_0/M + \lambda_2M - 2\sqrt{\lambda_0\lambda_2}h(λ0​,λ2​,M)=λ0​/M+λ2​M−2λ0​λ2​​,

VPR(M)≥VPR(∞)+h(λ0,λ2,M) ∥β∗∥1.V_{PR(M)} \ge V_{PR(\infty)} + h(\lambda_0,\lambda_2,M)\,\|\beta^*\|_1.VPR(M)​≥VPR(∞)​+h(λ0​,λ2​,M)∥β∗∥1​.

For λ0/λ2>M\sqrt{\lambda_0/\lambda_2} > Mλ0​/λ2​​>M the factor hhh is strictly positive, so the perspective relaxation with a finite bound MMM is strictly stronger than PR(∞)\mathrm{PR}(\infty)PR(∞) whenever β∗≠0\beta^*\ne 0β∗=0.

Formalization Note VPR(∞)V_{PR(\infty)}VPR(∞)​ is (6) as printed (the infimum of GGG over Rp\mathbb R^pRp); see the definition item.

Preamble
import Mathlib
import Definitions.Def_L0BnB_Strength_Penalties
import Definitions.Def_L0BnB_Strength_Relaxations
Formal statement
namespace L0BnB.Strength

/-- (8), Proposition 1, p. 7 (proof (38), p. 29): for `√(λ₀/λ₂) > M` and `β*` an optimal solution
of (5), `V_{PR(M)} ≥ V_{PR(∞)} + h(λ₀, λ₂, M) ‖β*‖₁`. -/
theorem ineq_8 {n p : ℕ} (X : Matrix (Fin n) (Fin p) ℝ) (y : Fin n → ℝ) (lam0 lam2 M : ℝ)
    (hlam0 : 0 < lam0) (hlam2 : 0 < lam2) (hM : 0 < M)
    (hregime : M < Real.sqrt (lam0 / lam2))
    (βs : Fin p → ℝ) (hβs_feas : ∀ i, |βs i| ≤ M)
    (hβs_opt : ∀ β : Fin p → ℝ, (∀ i, |β i| ≤ M) → L0BnB.Reduced.F X y lam0 lam2 M βs ≤ L0BnB.Reduced.F X y lam0 lam2 M β) :
    L0BnB.Reduced.VPR X y lam0 lam2 M ≥ VPRinf X y lam0 lam2 + hGap lam0 lam2 M * ∑ i, |βs i| := by sorry

end L0BnB.Strength
Source
Hazimeh, Mazumder, Saab, Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization, arXiv:2004.06152v2, p. 7, Proposition 1, (8); proof p. 29, (38)
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