Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6.8, p. 20 — δ_k ≤ δ_k' for k ≤ k' (so δ_3k ≤ δ_4k)

Proved
IRLSM.RIP.ripConst_mono

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

low-rank-recoveryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1restricted-isometry-property

Let S:Rn×p→Rm\mathcal S : \mathbb R^{n\times p}\to\mathbb R^mS:Rn×p→Rm be linear and k≤k′k \le k'k≤k′. Then the rank restricted isometry constants satisfy

δk(S)≤δk′(S).\delta_k(\mathcal S) \le \delta_{k'}(\mathcal S) .δk​(S)≤δk′​(S).

The proof of Proposition 6.8 uses the case δ3k≤δ4k\delta_{3k} \le \delta_{4k}δ3k​≤δ4k​ to conclude that η<1\eta < 1η<1.

Formalization Note. δk\delta_kδk​ is the squared-form constant of Definition 1.1, defined for every k∈Nk \in \mathbb Nk∈N.

Preamble
import Mathlib
import Definitions.Def_IRLSM_Convergence_Basic

open HighDimStat.MatrixRank Matrix
Formal statement
namespace IRLSM.RIP

/-- The restricted isometry constants are nondecreasing in the rank bound:
`k ≤ k'` implies `δ_k ≤ δ_{k'}` (used as `δ_{3k} ≤ δ_{4k}`).

Fornasier–Rauhut–Ward, arXiv:1010.2471v4, proof of Proposition 6.8, p. 20 ("Since δ_3k ≤ δ_4k").

Formalization Note: `ripConst` is the squared-form constant of Definition 1.1, defined for
every `k : ℕ`. -/
theorem ripConst_mono {n p m : ℕ} (A : Fin m → Matrix (Fin n) (Fin p) ℝ) {k k' : ℕ}
    (h : k ≤ k') : IRLSM.Convergence.ripConst A k ≤ IRLSM.Convergence.ripConst A k' := 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. 20 ("Since δ3k ≤ δ4k")
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