linear_response_coefficient_entry_scale_rewritten_with_rectangular_sampling_rate
DisprovedRole. It is a reusable node in the Candes-Recht decomposition, phrased as a standalone theorem so that downstream sketches can import it directly.
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 .
Claim. Scalar rewrite of the first-order response coefficient scale from the sampling-rate form to the coefficient scale used in Lemma 4.5.
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_neumann open MatrixCompletion
theorem linear_response_coefficient_entry_scale_rewritten_with_rectangular_sampling_rate
(Cscale : ℝ) :
0 < Cscale →
∃ Cthreshold : ℝ, 0 < Cthreshold ∧
∀ (β : ℝ), 2 < β →
∀ (n₁ n₂ r m : ℕ) (μ₀ μ₁ : ℝ),
0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
1 ≤ μ₀ → 1 ≤ μ₁ →
∀ Y : Matrix (Fin n₁) (Fin n₂) ℝ,
entrySupNorm Y ≤
Cscale * μ₁ *
Real.sqrt ((r : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) *
Real.sqrt
((β * (↑(max n₁ n₂)) *
Real.log (↑(max n₁ n₂))) /
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))) →
entrySupNorm Y ≤
Cthreshold * μ₁ *
Real.sqrt ((r : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) *
Real.sqrt
((μ₀ * (↑(max n₁ n₂)) * (r : ℝ) *
(β * Real.log (↑(max n₁ n₂)))) / (m : ℝ)) := by
sorry