Proof of Proposition 6.8, p. 20 — δ_k ≤ δ_k' for k ≤ k' (so δ_3k ≤ δ_4k)
ProvedIRLSM.RIP.ripConst_monolow-rank-recoveryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1restricted-isometry-property
Let be linear and . Then the rank restricted isometry constants satisfy
The proof of Proposition 6.8 uses the case to conclude that .
Formalization Note. is the squared-form constant of Definition 1.1, defined for every .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.