neumann_certificate_remainder_bound_from_scaled_tangent_concentration
ProvedRole. It belongs to the golfing/Neumann-series certificate branch, where the certificate is decomposed into linear and quadratic sampling terms.
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 certificate nodes, is the tangent space at , and are the tangent and normal projections, and keeps only observed entries. The Neumann-series estimates control the dual certificate used to prove uniqueness of nuclear-norm recovery. 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. Deterministic Lemma 4.8 reduction: formula-scale tangent concentration controls the whole Neumann certificate tail from , after the scale is known to be at most 1/2.
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. A corresponding proof sketch reduces this node to smaller mathematical subclaims. The checked reduction uses 4 subclaims: tangent sampling concentration implies Neumann error operator contraction; tangent sampling concentration implies sampled tangent operator Frobenius bound; sign matrix Frobenius norm le sqrt rank; Neumann scaled contraction and sampled Frobenius imply remainder formula bound.
import Definitions.Def_matrix_completion_neumann open MatrixCompletion
theorem neumann_certificate_remainder_bound_from_scaled_tangent_concentration
(Cdev : ℝ) :
∃ Ctail : ℝ, 0 < Ctail ∧
∀ (β : ℝ), 2 < β →
∀ (n₁ n₂ r m : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
(μ₀ μ₁ : ℝ) (S : SVD M r)
(Omega : Finset (Fin n₁ × Fin n₂)),
0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
1 ≤ μ₀ → 1 ≤ μ₁ →
A0 S μ₀ → A1 S μ₁ →
tangentSamplingDeviationScale Cdev β μ₀ (max n₁ n₂) r m ≤ (1 : ℝ) / 2 →
TangentSamplingConcentration Omega S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(tangentSamplingDeviationScale Cdev β μ₀ (max n₁ n₂) r m) →
NeumannCertificateTailSpectralBound Omega S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) 3
(neumannRemainderFormulaBound Ctail β μ₀ (max n₁ n₂) r m) := by
sorry