Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 1040 — the worst-case residual is the same for the largest-singular-value norm

Proved
RobustLS.Unstructured.worst_case_residual_spectral

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-normsp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-least-squaresworst-case-residual

Let n≥1n \ge 1n≥1, A∈Rn×mA \in \mathbb{R}^{n\times m}A∈Rn×m, b∈Rnb \in \mathbb{R}^nb∈Rn and x∈Rmx \in \mathbb{R}^mx∈Rm. If the perturbation bound in (1) is measured in the largest singular value norm ∥⋅∥\|\cdot\|∥⋅∥ instead of the Frobenius norm, the worst-case residual is unchanged:

max⁡∥[ΔA Δb]∥≤1∥(A+ΔA)x−(b+Δb)∥=∥Ax−b∥+∥x∥2+1.\max_{\|[\Delta A\ \Delta b]\| \le 1} \|(A+\Delta A)x - (b+\Delta b)\| = \|Ax-b\| + \sqrt{\|x\|^2+1}.∥[ΔA Δb]∥≤1max​∥(A+ΔA)x−(b+Δb)∥=∥Ax−b∥+∥x∥2+1​.

Since ∥Δ∥≤∥Δ∥F\|\Delta\| \le \|\Delta\|_F∥Δ∥≤∥Δ∥F​, the spectral ball contains the Frobenius ball; the statement says that the larger ball does not produce a larger worst case.

Formalization Note The maximum is encoded as the supremum of the attained residuals (nonempty and bounded above). The hypothesis n≥1n \ge 1n≥1 excludes the empty system, for which the only perturbation is the empty matrix and the worst case is 000. The paper normalizes ρ=1\rho = 1ρ=1.

Preamble
import Mathlib
import Definitions.Def_RobustLS_Unstructured_Core

open Matrix
Formal statement
namespace RobustLS.Unstructured

/-- El Ghaoui & Lebret (1997), p. 1040 (PDF p. 6): "the worst-case residual is the same when
the norm used is the largest singular value norm". With `ρ = 1` and `n ≥ 1`, the worst case
over `‖[ΔA Δb]‖ ≤ 1` (largest singular value) is `‖Ax − b‖ + √(‖x‖² + 1)`, the same value as
for the Frobenius ball (Theorem 3.1). The assumption `0 < n` excludes the empty system, where
the only perturbation is the empty matrix and the worst case is `0`. -/
theorem worst_case_residual_spectral {n m : ℕ} (hn : 0 < n) (A : Matrix (Fin n) (Fin m) ℝ)
    (b : Fin n → ℝ) (x : Fin m → ℝ) :
    worstCaseResidualSpec A b 1 x = eucNorm (A *ᵥ x - b) + Real.sqrt (eucNorm x ^ 2 + 1) := by sorry

end RobustLS.Unstructured
Source
El Ghaoui & Lebret, Robust Solutions to Least-Squares Problems with Uncertain Data, SIAM J. Matrix Anal. Appl. 18(4):1035–1064 (1997), p. 1040, §3 (remark before §3.1) and Theorem 3.1, proof
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me