Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

(2.15) and Λ≤2rank⁡(PA(M))∥M∥∞≤22rank⁡(A)∥M∥∞≤2rank⁡(A)λ\Lambda\le2\sqrt{\operatorname{rank}(\mathcal P_A(M))}\|M\|_\infty\le2\sqrt{2\operatorname{rank}(A)}\|M\|_\infty\le\sqrt{2\operatorname{rank}(A)}\lambdaΛ≤2rank(PA​(M))​∥M∥∞​≤22rank(A)​∥M∥∞​≤2rank(A)​λ

Proved
KLTNuclear.Oracle.lambda_bound

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

low-ranknuclear-normp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A=∑j=1rσjujvj⊤A=\sum_{j=1}^r\sigma_ju_jv_j^\topA=∑j=1r​σj​uj​vj⊤​ be a singular value decomposition of a real m1×m2m_1\times m_2m1​×m2​ matrix with support (S1,S2)(S_1,S_2)(S1​,S2​), let MMM be any m1×m2m_1\times m_2m1​×m2​ matrix, and let PA(M)=M−PS1⊥MPS2⊥\mathcal P_A(M)=M-P_{S_1^\perp}MP_{S_2^\perp}PA​(M)=M−PS1⊥​​MPS2⊥​​ and Λ=2∥PA(M)∥2\Lambda=2\|\mathcal P_A(M)\|_2Λ=2∥PA​(M)∥2​. Then

  1. (2.15) PA(M)=PS1⊥MPS2+PS1M\mathcal P_A(M)=P_{S_1^\perp}MP_{S_2}+P_{S_1}MPA​(M)=PS1⊥​​MPS2​​+PS1​​M;
  2. Λ≤2rank⁡(PA(M)) ∥M∥∞\Lambda\le2\sqrt{\operatorname{rank}(\mathcal P_A(M))}\,\|M\|_\inftyΛ≤2rank(PA​(M))​∥M∥∞​;
  3. 2rank⁡(PA(M)) ∥M∥∞≤22rank⁡(A) ∥M∥∞2\sqrt{\operatorname{rank}(\mathcal P_A(M))}\,\|M\|_\infty\le2\sqrt{2\operatorname{rank}(A)}\,\|M\|_\infty2rank(PA​(M))​∥M∥∞​≤22rank(A)​∥M∥∞​;
  4. for every λ≥2∥M∥∞\lambda\ge2\|M\|_\inftyλ≥2∥M∥∞​, 22rank⁡(A) ∥M∥∞≤2rank⁡(A) λ2\sqrt{2\operatorname{rank}(A)}\,\|M\|_\infty\le\sqrt{2\operatorname{rank}(A)}\,\lambda22rank(A)​∥M∥∞​≤2rank(A)​λ.

Together: Λ≤2rank⁡(PA(M))∥M∥∞≤22rank⁡(A)Δ≤2rank⁡(A)λ\Lambda\le2\sqrt{\operatorname{rank}(\mathcal P_A(M))}\|M\|_\infty\le2\sqrt{2\operatorname{rank}(A)}\Delta\le\sqrt{2\operatorname{rank}(A)}\lambdaΛ≤2rank(PA​(M))​∥M∥∞​≤22rank(A)​Δ≤2rank(A)​λ with Δ=∥M∥∞\Delta=\|M\|_\inftyΔ=∥M∥∞​, which is the bound on Λ\LambdaΛ used to pass from (2.17) to (2.5).

Formalization Note PS1⊥MPS2P_{S_1^\perp}MP_{S_2}PS1⊥​​MPS2​​ is written as MPS2−PS1MPS2MP_{S_2}-P_{S_1}MP_{S_2}MPS2​​−PS1​​MPS2​​ (rightSingularProjection S M - twoSidedSingularProjection S M). The paper states the chain for the random matrix M\mathbf MM; it holds for every MMM and is stated so. Rank is Mathlib's Matrix.rank.

Preamble
import Mathlib
import Definitions.Def_KLTNuclear_Oracle_Model

open MeasureTheory MatrixCompletion
Formal statement
namespace KLTNuclear.Oracle

/-- (2.15) and the bound on Λ = 2‖𝒫_A(N)‖₂ (p. 9), for an arbitrary matrix N in place of 𝐌:
𝒫_A(N) = P_{S₁⊥} N P_{S₂} + P_{S₁} N, and
Λ ≤ 2√(rank 𝒫_A(N)) ‖N‖∞ ≤ 2√(2 rank A) ‖N‖∞ ≤ √(2 rank A) λ when λ ≥ 2‖N‖∞. -/
theorem lambda_bound {m₁ m₂ r : ℕ} {A : RealMatrix m₁ m₂} (S : SVD A r) (N : RealMatrix m₁ m₂) :
    -- (2.15)
    tangentProjection S N =
        (rightSingularProjection S N - twoSidedSingularProjection S N) + leftSingularProjection S N ∧
      2 * frobeniusNorm (tangentProjection S N) ≤
        2 * Real.sqrt ((tangentProjection S N).rank : ℝ) * spectralNorm N ∧
      2 * Real.sqrt ((tangentProjection S N).rank : ℝ) * spectralNorm N ≤
        2 * Real.sqrt (2 * (A.rank : ℝ)) * spectralNorm N ∧
      ∀ lam : ℝ, 2 * spectralNorm N ≤ lam →
        2 * Real.sqrt (2 * (A.rank : ℝ)) * spectralNorm N ≤ Real.sqrt (2 * (A.rank : ℝ)) * lam := by sorry

end KLTNuclear.Oracle
Source
Koltchinskii, Lounici, Tsybakov, Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion, arXiv:1011.6256v4, p. 9, (2.15) and the display following it
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me