Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

positive_tangent_sampling_concentration_implies_restricted_sampling_injective

Proved

by Shuze Chen · Jun 14, 2026 · Mathlib c5ea003 (Lean v4.30.0)

candes-rechtconvex-optimizationinjectivitylean4matrix-completionprobabilitytangent-space

Role. It belongs to the tangent-space injectivity branch, where concentration of the sampled tangent operator rules out nonzero feasible tangent perturbations.

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 M∈Rn1×n2M\in\mathbb R^{n_1\times n_2}M∈Rn1​×n2​ has rank rrr, mmm entries are observed, and n=max⁡(n1,n2)n=\max(n_1,n_2)n=max(n1​,n2​). Recovery means nuclear-norm minimization: minimize ∥X∥∗\|X\|_*∥X∥∗​ among matrices XXX agreeing with MMM on the observed entries. Probability notation. successProb⁡(m,M)\operatorname{successProb}(m,M)successProb(m,M) is the fixed-cardinality success probability: Ω\OmegaΩ is chosen uniformly among all subsets of n1n2n_1n_2n1​n2​ entries with ∣Ω∣=m|\Omega|=m∣Ω∣=m, and the event is that the convex program uniquely returns MMM. In Bernoulli nodes, Pp(E)\mathbb P_p(E)Pp​(E) or bernoulliEventProb⁡(p,E)\operatorname{bernoulliEventProb}(p,E)bernoulliEventProb(p,E) means each entry is sampled independently with probability ppp, usually p=m/(n1n2)p=m/(n_1n_2)p=m/(n1​n2​). Coherence notation. The object SSS records SVD/singular-vector data for MMM. The hypotheses A0(S,μ0)A0(S,\mu_0)A0(S,μ0​) and A1(S,μ1)A1(S,\mu_1)A1(S,μ1​) are the Candes-Recht incoherence assumptions: μ0\mu_0μ0​ measures how spread out the singular vector spaces are, and μ1\mu_1μ1​ measures the largest entry of the sign matrix UV⊤UV^\topUV⊤. The parameter β>2\beta>2β>2 controls polynomial failure probabilities such as n−βn^{-\beta}n−β. 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. Honest positive-rate form of the deterministic injectivity consequence of tangent sampling concentration.

Lecture-note formulation:

∥p−1PTPΩPT−PT∥T→T≤12⟹PΩ∣T is injective.\left\|p^{-1}P_TP_\Omega P_T-P_T\right\|_{T\to T}\le \frac12 \quad\Longrightarrow\quad P_\Omega|_{T}\text{ is injective}.​p−1PT​PΩ​PT​−PT​​T→T​≤21​⟹PΩ​∣T​ is injective.

Decomposition status. A corresponding proof sketch reduces this node to smaller mathematical subclaims. The checked reduction uses 2 subclaims: tangent sampling concentration controls unsampled tangent Frobenius norm; Frobenius norm zero implies matrix zero.

Preamble
import Definitions.Def_matrix_completion_tangent
open MatrixCompletion
Formal statement
theorem positive_tangent_sampling_concentration_implies_restricted_sampling_injective
    {n₁ n₂ r : ℕ} {M : Matrix (Fin n₁) (Fin n₂) ℝ}
    (Omega : Finset (Fin n₁ × Fin n₂)) (S : SVD M r) (p : ℝ) :
    0 < p →
    TangentSamplingConcentration Omega S p ((1 : ℝ) / 2) →
    SamplingOperatorInjectiveOnT Omega S := by
  sorry
Source
Candes, Emmanuel, and Benjamin Recht. "Exact matrix completion via convex optimization." Communications of the ACM 55.6 (2012): 111-119.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me