Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(58) — correlation conditions at an optimal β∗ when √(λ0/λ2) > M

Proved
L0BnB.DualGap.eq_58

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

dualityoptimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-regression

Let X∈Rn×pX\in\mathbb R^{n\times p}X∈Rn×p, y∈Rny\in\mathbb R^ny∈Rn, λ0,λ2,M>0\lambda_0,\lambda_2,M>0λ0​,λ2​,M>0 with λ0/λ2>M\sqrt{\lambda_0/\lambda_2}>Mλ0​/λ2​​>M, and let β∗\beta^*β∗ be an optimal solution of (5), r∗=y−Xβ∗r^*=y-X\beta^*r∗=y−Xβ∗ and ρ∗=−r∗\rho^*=-r^*ρ∗=−r∗. Then for every i∈[p]i\in[p]i∈[p]

∣ρ∗⊤Xi∣≤λ0/M+λ2M  if ∣βi∗∣<Mand∣ρ∗⊤Xi∣≥λ0/M+λ2M  if ∣βi∗∣=M.(58)|\rho^{*\top}X_i|\le\lambda_0/M+\lambda_2M\ \text{ if } |\beta^*_i|<M\qquad\text{and}\qquad |\rho^{*\top}X_i|\ge\lambda_0/M+\lambda_2M\ \text{ if } |\beta^*_i|=M.\qquad(58)∣ρ∗⊤Xi​∣≤λ0​/M+λ2​M  if ∣βi∗​∣<Mand∣ρ∗⊤Xi​∣≥λ0​/M+λ2​M  if ∣βi∗​∣=M.(58)

These conditions identify ∣μi∗∣|\mu^*_i|∣μi∗​∣ with [∣ρ∗⊤Xi∣−λ0/M−λ2M]+[|\rho^{*\top}X_i|-\lambda_0/M-\lambda_2M]_+[∣ρ∗⊤Xi​∣−λ0​/M−λ2​M]+​, which is the step from (57) to the dual bound (30).

Formalization Note The paper derives (58) from the optimality of (ρ∗,μ∗)(\rho^*,\mu^*)(ρ∗,μ∗) for the dual (22) (Theorem 2). Here the hypothesis is the optimality of β∗\beta^*β∗ for the primal (5); Theorem 2 is not assumed. No normalization of XXX or yyy is needed.

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

/-- (58), p. 34: for `√(λ₀/λ₂) > M` and `β*` optimal for (5), with `ρ* = −r*`:
`|ρ*ᵀXᵢ| ≤ λ₀/M + λ₂M` if `|β*ᵢ| < M` and `|ρ*ᵀXᵢ| ≥ λ₀/M + λ₂M` if `|β*ᵢ| = M`. -/
theorem eq_58 {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))
    (βs : Fin p → ℝ) (hβs : IsOptimal X y lam0 lam2 M βs) :
    ∀ i, (|βs i| < M → |colInner X (L0BnB.Duality.rhoStar X y βs) i| ≤ lam0 / M + lam2 * M) ∧
      (|βs i| = M → lam0 / M + lam2 * M ≤ |colInner X (L0BnB.Duality.rhoStar X y β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. 34, (58), Proof of Theorem 3
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