Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(28) — closed form of the dual feasible µ̂ of (27)

Proved
L0BnB.DualGap.eq_28

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

dual-boundsdualityp2o-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, β^∈Rp\hat\beta\in\mathbb R^pβ^​∈Rp and ρ^=−(y−Xβ^)\hat\rho=-(y-X\hat\beta)ρ^​=−(y−Xβ^​). If μ^\hat\muμ^​ maximizes h2(ρ^,μ)=−12∥ρ^∥22−ρ^⊤y−M∥μ∥1h_2(\hat\rho,\mu)=-\tfrac12\|\hat\rho\|_2^2-\hat\rho^\top y-M\|\mu\|_1h2​(ρ^​,μ)=−21​∥ρ^​∥22​−ρ^​⊤y−M∥μ∥1​ over the μ∈Rp\mu\in\mathbb R^pμ∈Rp with ∣ρ^⊤Xi∣−μi≤λ0/M+λ2M|\hat\rho^\top X_i|-\mu_i\le\lambda_0/M+\lambda_2M∣ρ^​⊤Xi​∣−μi​≤λ0​/M+λ2​M for all iii (problem (27)), then for every i∈[p]i\in[p]i∈[p]

μ^i=[ ∣ρ^⊤Xi∣−λ0/M−λ2M ]+.(28)\hat\mu_i=\big[\,|\hat\rho^\top X_i|-\lambda_0/M-\lambda_2M\,\big]_+ .\qquad(28)μ^​i​=[∣ρ^​⊤Xi​∣−λ0​/M−λ2​M]+​.(28)

So the dual feasible solution of the ℓ1\ell_1ℓ1​ regime is computable in closed form from the residual.

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

/-- (28), p. 14: the maximizer `µ̂` of (27) is given in closed form by
`µ̂ᵢ = [|ρ̂ᵀXᵢ| − λ₀/M − λ₂M]₊`. -/
theorem eq_28 {n p : ℕ} (X : Matrix (Fin n) (Fin p) ℝ) (y : Fin n → ℝ)
    (lam0 lam2 M : ℝ) (hlam0 : 0 < lam0) (hlam2 : 0 < lam2) (hM : 0 < M)
    (βhat μhat : Fin p → ℝ) (hμ : IsMuHat X y lam0 lam2 M βhat μhat) :
    ∀ i, μhat i = max (|colInner X (rhoHat X y βhat) i| - lam0 / M - lam2 * M) 0 := 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. 14, (27), (28)
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