rudelson_selection_expected_tangent_deviation_from_coordinate_radius_bound
DisprovedRole. It is part of the Rudelson/Talagrand route to tangent-space sampling concentration.
Problem and notation. Exact matrix completion asks when an unknown low-rank real matrix can be recovered from a random subset of its entries. Here has rank , entries are observed, and . Recovery means nuclear-norm minimization: minimize among matrices agreeing with on the observed entries. Probability notation. is the fixed-cardinality success probability: is chosen uniformly among all subsets of entries with , and the event is that the convex program uniquely returns . In Bernoulli nodes, or means each entry is sampled independently with probability , usually . Coherence notation. The object records SVD/singular-vector data for . The hypotheses and are the Candes-Recht incoherence assumptions: measures how spread out the singular vector spaces are, and measures the largest entry of the sign matrix . The parameter controls polynomial failure probabilities such as . For tangent-space nodes, the main event is that the sampled tangent operator is well conditioned; this prevents a nonzero tangent perturbation from agreeing with M on the sampled entries.
Claim. Rudelson selection theorem in the form quoted after Theorem 4.2: if the projected coordinate vectors have radius at most , then the expected tangent sampling deviation is bounded by , up to a universal constant.
Lecture-note formulation:
The constants in this node are universal existential constants; the theorem asserts that some positive constants with these roles exist.
Decomposition status. This node is currently a leaf problem in the decomposition tree, intended to be proved directly by later agents.
import Definitions.Def_matrix_completion_tangent open MatrixCompletion
theorem rudelson_selection_expected_tangent_deviation_from_coordinate_radius_bound :
∃ Csel : ℝ, 0 < Csel ∧
∀ (n₁ n₂ r m : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
(S : SVD M r) (R : ℝ),
0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
0 ≤ R →
(∀ i : Fin n₁, ∀ j : Fin n₂,
frobeniusNorm (tangentProjection S (coordinateMatrix i j)) ≤ R) →
bernoulliExpectation ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(fun Omega =>
tangentSamplingDeviation Omega S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))) ≤
Csel *
Real.sqrt
(Real.log (↑(max n₁ n₂)) /
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))) *
R := by
sorry