(2.15) and
ProvedKLTNuclear.Oracle.lambda_boundlow-ranknuclear-normp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a singular value decomposition of a real matrix with support , let be any matrix, and let and . Then
- (2.15) ;
- ;
- ;
- for every , .
Together: with , which is the bound on used to pass from (2.17) to (2.5).
Formalization Note is written as (rightSingularProjection S M - twoSidedSingularProjection S M). The paper states the chain for the random matrix ; it holds for every 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.