strict_dual_certificate_inner_tangent_eq_neg_normal_of_feasible_perturbation
ProvedRole. It belongs to the dual-certificate branch, controlling the certificate that proves uniqueness of nuclear-norm recovery.
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. For a feasible perturbation, a strict dual certificate makes the tangent sign-matrix pairing equal to the negative normal certificate pairing.
Lecture-note formulation:
Decomposition status. A corresponding proof sketch reduces this node to smaller mathematical subclaims. The checked reduction uses 2 subclaims: supported matrix inner zero of zero sampling projection; matrix inner tangent normal decomposition of certificate.
import Definitions.Def_matrix_completion_tangent open MatrixCompletion
theorem strict_dual_certificate_inner_tangent_eq_neg_normal_of_feasible_perturbation
{n₁ n₂ r : ℕ} {M : Matrix (Fin n₁) (Fin n₂) ℝ}
(S : SVD M r) (Omega : Finset (Fin n₁ × Fin n₂))
(Y H : Matrix (Fin n₁) (Fin n₂) ℝ) :
StrictDualCertificate Omega S Y →
samplingProjection Omega H = 0 →
matrixInner (signMatrix S) (tangentProjection S H) =
-matrixInner (normalProjection S Y) (normalProjection S H) := by
sorry