Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (4) — under any admissible disturbance, ‖b − (A + ΔA)x‖₂ ≤ ‖b − Ax‖₂ + Σ |xᵢ|cᵢ

Proved
RobustRegLasso.FeatureWise.eq_4_upper_bound

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regressionrobust-optimization

Let A∈Rn×mA\in\mathbb R^{n\times m}A∈Rn×m have columns a1,…,ama_1,\dots,a_ma1​,…,am​, let b∈Rnb\in\mathbb R^nb∈Rn, let c1,…,cm≥0c_1,\dots,c_m\ge 0c1​,…,cm​≥0, and let U\mathcal UU be the feature-wise uncoupled uncertainty set {(δ1,…,δm):∥δi∥2≤ci}\{(\delta_1,\dots,\delta_m) : \|\delta_i\|_2\le c_i\}{(δ1​,…,δm​):∥δi​∥2​≤ci​} of (2). For every coefficient vector x∈Rmx\in\mathbb R^mx∈Rm and every disturbance ΔA=(δ1,…,δm)∈U\Delta A=(\delta_1,\dots,\delta_m)\in\mathcal UΔA=(δ1​,…,δm​)∈U,

∥b−(A+ΔA)x∥2  ≤  ∥b−Ax∥2+∑i=1m∣xi∣ ci.\|b-(A+\Delta A)x\|_2 \;\le\; \|b-Ax\|_2 + \sum_{i=1}^m |x_i|\,c_i .∥b−(A+ΔA)x∥2​≤∥b−Ax∥2​+i=1∑m​∣xi​∣ci​.

Taking the supremum over ΔA∈U\Delta A\in\mathcal UΔA∈U, this is the upper half of the identity behind Theorem 1: the worst-case residual never exceeds the ℓ¹-regularized objective.

Formalization Note The paper's display (4) bounds the maximum over U\mathcal UU; the Lean statement gives the equivalent pointwise bound for each admissible disturbance, which avoids any supremum. The hypothesis ci≥0c_i\ge 0ci​≥0 is the paper's standing assumption on (2).

Preamble
import Mathlib
import Definitions.Def_RobustRegLasso_FeatureWise_Basic
Formal statement
namespace RobustRegLasso.FeatureWise

theorem eq_4_upper_bound {n m : ℕ} (a : Fin m → EuclideanSpace ℝ (Fin n))
    (b : EuclideanSpace ℝ (Fin n)) (c : Fin m → ℝ) (hc : ∀ i, 0 ≤ c i) (x : Fin m → ℝ)
    (δ : Fin m → EuclideanSpace ℝ (Fin n)) (hδ : δ ∈ uncertaintySet c) :
    perturbedResidual a δ b x ≤ ‖b - matVec a x‖ + ∑ i, |x i| * c i := by sorry

end RobustRegLasso.FeatureWise
Source
Xu, Caramanis, Mannor, Robust Regression and Lasso, arXiv:0811.1790v1, p. 4, Eq. (4), proof of Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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