neumann_scaled_contraction_and_sampled_frobenius_imply_remainder_formula_bound
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.
Claim. Deterministic geometric-series part of Lemma 4.8: a scaled contraction bound for the Neumann error operator, the sampled-tangent Frobenius estimate, and the sign-matrix Frobenius estimate imply the explicit tail formula.
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 neumann_scaled_contraction_and_sampled_frobenius_imply_remainder_formula_bound
(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 →
NeumannErrorOperatorFrobeniusContraction Omega S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
(tangentSamplingDeviationScale Cdev β μ₀ (max n₁ n₂) r m) →
SampledTangentOperatorFrobeniusBound Omega S
(Real.sqrt (((3 : ℝ) *
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))) / 2)) →
frobeniusNorm (signMatrix S) ≤ Real.sqrt (r : ℝ) →
NeumannCertificateTailSpectralBound Omega S
((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) 3
(neumannRemainderFormulaBound Ctail β μ₀ (max n₁ n₂) r m) := by
sorry