tangent_sampling_talagrand_increment_bound_from_coordinate_bound
ProvedRole. 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. Appendix 9.1 bounded-increment estimate: the coordinate Frobenius bound controls each Talagrand coefficient by .
Lecture-note formulation:
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_talagrand open MatrixCompletion
theorem tangent_sampling_talagrand_increment_bound_from_coordinate_bound :
∀ (n₁ n₂ r m : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
(μ₀ : ℝ) (S : SVD M r),
0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
1 ≤ μ₀ →
TangentCoordinateFrobeniusBound S
(2 * μ₀ * (r : ℝ) / (max n₁ n₂ : ℝ)) →
TangentSamplingTalagrandIncrementBound S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(2 * μ₀ * (↑(max n₁ n₂)) * (r : ℝ) / (m : ℝ)) := by
sorry