Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 β€” if Ξ΄_2r < 1, Xβ‚€ is the only matrix of rank at most r with π’œ(X) = π’œ(Xβ‚€)

Proved
MinRankRecovery.Recovery.theorem_3_2

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

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

Let A:RmΓ—nβ†’Rp\mathcal A:\mathbb R^{m\times n}\to\mathbb R^pA:RmΓ—nβ†’Rp be a linear map with restricted isometry constants Ξ΄r=Ξ΄r(A)\delta_r=\delta_r(\mathcal A)Ξ΄r​=Ξ΄r​(A), let rβ‰₯1r\ge1rβ‰₯1 be an integer, and let X0∈RmΓ—nX_0\in\mathbb R^{m\times n}X0β€‹βˆˆRmΓ—n have rank at most rrr. Set b=A(X0)b=\mathcal A(X_0)b=A(X0​). If

Ξ΄2r<1,\delta_{2r}<1,Ξ΄2r​<1,

then X0X_0X0​ is the only matrix of rank at most rrr satisfying A(X)=b\mathcal A(X)=bA(X)=b.

This is the uniqueness half of the theory: under the restricted isometry condition the linear measurements determine a low-rank matrix among all matrices of the same rank bound. It does not by itself give an efficient recovery procedure; Theorem 3.3 does.

Formalization Note The paper's section assumes rank⁑X0=r\operatorname{rank}X_0=rrankX0​=r; the statement here assumes rank⁑X0≀r\operatorname{rank}X_0\le rrankX0​≀r, a mild generalization: the paper's proof uses only that X0βˆ’XX_0-XX0β€‹βˆ’X has rank at most 2r2r2r, which holds whenever both matrices have rank at most rrr. The map is represented by measurement matrices as in Definition 3.1.

Preamble
import Mathlib
import Definitions.Def_HighDimStat_MatrixRank_Core
import Definitions.Def_MinRankRecovery_Recovery_ripConst

open HighDimStat.MatrixRank Matrix
Formal statement
namespace MinRankRecovery.Recovery

/-- Theorem 3.2, p. 12: if `Ξ΄_2r < 1` for some `r β‰₯ 1`, then `X0` (of rank at most `r`) is the
only matrix of rank at most `r` with `π’œ(X) = π’œ(X0)`. -/
theorem theorem_3_2 {m n p : β„•} (Xs : Fin p β†’ Matrix (Fin m) (Fin n) ℝ) (r : β„•) (hr : 1 ≀ r)
    (hΞ΄ : ripConst Xs (2 * r) < 1) (X0 : Matrix (Fin m) (Fin n) ℝ) (hX0 : X0.rank ≀ r) :
    βˆ€ X : Matrix (Fin m) (Fin n) ℝ, X.rank ≀ r β†’
      observationOp Xs X = observationOp Xs X0 β†’ X = X0 := by sorry

end MinRankRecovery.Recovery
Source
Recht, Fazel & Parrilo, arXiv:0706.4138v1, Theorem 3.2, p. 12 (setting of (3.1), p. 11)
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