Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6.8, p. 19 — shelling bound ‖σ^(j+1)‖₂ ≤ ℓ^(−1/2)‖σ^(j)‖₁ for a nonincreasing sequence

Proved
IRLSM.RIP.shelling_bound

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

compressed-sensinglow-rank-recoveryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let s0≥s1≥s2≥⋯≥0s_0 \ge s_1 \ge s_2 \ge \cdots \ge 0s0​≥s1​≥s2​≥⋯≥0 be a nonincreasing sequence of nonnegative reals and let ℓ≥1\ell \ge 1ℓ≥1 be an integer. Cut the indices into consecutive blocks of length ℓ\ellℓ. Each block has Euclidean norm at most ℓ−1/2\ell^{-1/2}ℓ−1/2 times the ℓ1\ell_1ℓ1​ norm of the block before it: for every j≥0j \ge 0j≥0,

(∑i=(j+1)ℓ(j+2)ℓ−1si2)1/2≤1ℓ∑i=jℓ(j+1)ℓ−1si.\Bigl(\sum_{i=(j+1)\ell}^{(j+2)\ell-1} s_i^2\Bigr)^{1/2} \le \frac{1}{\sqrt\ell}\sum_{i=j\ell}^{(j+1)\ell-1} s_i .(i=(j+1)ℓ∑(j+2)ℓ−1​si2​)1/2≤ℓ​1​i=jℓ∑(j+1)ℓ−1​si​.

In the proof of Proposition 6.8 the sequence is the vector σ~\tilde\sigmaσ~ of singular values of H^22\hat H_{22}H^22​, the blocks are the vectors σ(j)\sigma^{(j)}σ(j), and the bound reads ∥Hj+1∥F≤ℓ−1/2∥Hj∥∗\|H_{j+1}\|_F \le \ell^{-1/2}\|H_j\|_*∥Hj+1​∥F​≤ℓ−1/2∥Hj​∥∗​. Summed over jjj, it controls the tail of HcH_cHc​ in display (6.7).

Formalization Note. Indices are 0-based, so the block {jℓ,…,(j+1)ℓ−1}\{j\ell,\dots,(j+1)\ell-1\}{jℓ,…,(j+1)ℓ−1} is the paper's σ(j+1)\sigma^{(j+1)}σ(j+1). The paper states the bound "for j≥2j \ge 2j≥2"; (6.7) uses it for every block, and it holds for every block for the same reason, so it is stated for all jjj.

Preamble
import Mathlib
import Definitions.Def_IRLSM_Convergence_Basic

open HighDimStat.MatrixRank Matrix
Formal statement
namespace IRLSM.RIP

/-- The shelling bound: if `s` is a nonincreasing nonnegative sequence and the indices are
split into consecutive blocks of length `ℓ > 0`, the Euclidean norm of each block is at most
`ℓ^{-1/2}` times the `ℓ₁` norm of the block before it:
`(∑_{i=(j+1)ℓ}^{(j+2)ℓ-1} s_i²)^{1/2} ≤ ℓ^{-1/2} ∑_{i=jℓ}^{(j+1)ℓ-1} s_i`.

Fornasier–Rauhut–Ward, arXiv:1010.2471v4, proof of Proposition 6.8, p. 19 (the bound
`‖H_{j+1}‖_F ≤ ℓ^{-1/2}‖H_j‖_*`, in its vector form: the singular values of `H_j` are the entries
of `σ^{(j)}`).

Formalization Notes: 0-based indices, so the block `Ico (jℓ) ((j+1)ℓ)` is the vector `σ^{(j+1)}`
of the page. The page says "for j ≥ 2"; the same argument holds, and display (6.7) uses it, for
every block, so it is stated for every `j : ℕ`. -/
theorem shelling_bound (s : ℕ → ℝ) (hs : Antitone s) (h0 : ∀ i, 0 ≤ s i) (ℓ : ℕ) (hℓ : 0 < ℓ)
    (j : ℕ) :
    Real.sqrt (∑ i ∈ Finset.Ico ((j + 1) * ℓ) ((j + 2) * ℓ), s i ^ 2) ≤
      (1 / Real.sqrt ℓ) * ∑ i ∈ Finset.Ico (j * ℓ) ((j + 1) * ℓ), s i := by sorry

end IRLSM.RIP
Source
Fornasier, Rauhut, Ward, Low-rank matrix recovery via iteratively reweighted least squares minimization, arXiv:1010.2471v4 (2011), proof of Proposition 6.8, p. 19, last display
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