Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(57) — |µ̂i| ≤ ϵ + |µ∗i| on the support of β̂

Proved
L0BnB.DualGap.ineq_57

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

dual-boundsdualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-regression

Assume λ0/λ2>M\sqrt{\lambda_0/\lambda_2}>Mλ0​/λ2​​>M (with λ0,λ2,M>0\lambda_0,\lambda_2,M>0λ0​,λ2​,M>0) and that every column of X∈Rn×pX\in\mathbb R^{n\times p}X∈Rn×p has unit ℓ2\ell_2ℓ2​ norm; let y∈Rny\in\mathbb R^ny∈Rn. Let β∗\beta^*β∗ be an optimal solution of (5), ρ∗=−(y−Xβ∗)\rho^*=-(y-X\beta^*)ρ∗=−(y−Xβ∗) and μ∗\mu^*μ∗ as in (24). Let β^∈Rp\hat\beta\in\mathbb R^pβ^​∈Rp, ρ^=−(y−Xβ^)\hat\rho=-(y-X\hat\beta)ρ^​=−(y−Xβ^​), μ^\hat\muμ^​ a maximizer of (27), and ϵ=∥X(β∗−β^)∥2\epsilon=\|X(\beta^*-\hat\beta)\|_2ϵ=∥X(β∗−β^​)∥2​. Then for every i∈Supp⁡(β^)i\in\operatorname{Supp}(\hat\beta)i∈Supp(β^​)

∣μ^i∣≤ϵ+∣μi∗∣.(57)|\hat\mu_i|\le\epsilon+|\mu^*_i| .\qquad(57)∣μ^​i​∣≤ϵ+∣μi∗​∣.(57)

This is the per-coordinate step of the bound (30): the loss on the support is at most ϵ\epsilonϵ per coordinate.

Formalization Note μ∗\mu^*μ∗ is the formula (24); its optimality (Theorem 2) is not assumed. The unit norm of yyy is not needed and is not assumed.

Preamble
import Mathlib
import Definitions.Def_L0BnB_DualGap_Setup
import Definitions.Def_L0BnB_DualGap_Duals
Formal statement
namespace L0BnB.DualGap

/-- (57), Proof of Theorem 3, p. 33: for `√(λ₀/λ₂) > M`, unit-norm columns of `X`, `β*` optimal for
(5), `µ̂` as in (27) and `i ∈ Supp(β̂)`: `|µ̂ᵢ| ≤ ϵ + |µ*ᵢ|`, with `ϵ = ‖X(β* − β̂)‖₂`. -/
theorem ineq_57 {n p : ℕ} (X : Matrix (Fin n) (Fin p) ℝ) (y : Fin n → ℝ)
    (lam0 lam2 M : ℝ) (hlam0 : 0 < lam0) (hlam2 : 0 < lam2) (hM : 0 < M)
    (hreg : M < Real.sqrt (lam0 / lam2)) (hX : ∀ i, ∑ r, X r i ^ 2 = 1)
    (βs : Fin p → ℝ) (hβs : IsOptimal X y lam0 lam2 M βs)
    (βhat μhat : Fin p → ℝ) (hμ : IsMuHat X y lam0 lam2 M βhat μhat)
    (i : Fin p) (hi : βhat i ≠ 0) :
    |μhat i| ≤ primalGap X βs βhat + |L0BnB.Duality.muStar X y lam0 lam2 M βs i| := by sorry

end L0BnB.DualGap
Source
Hazimeh, Mazumder, Saab, Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization, arXiv:2004.06152v2, p. 33, Proof of Theorem 3, (57)
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