Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

neumann_certificate_remainder_bound_from_scaled_tangent_concentration

Proved

by Shuze Chen · Jun 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

candes-rechtconvex-optimizationdual-certificatelean4matrix-completionneumann-seriesprobabilityscale-absorptiontangent-space

Role. 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 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 certificate nodes, TTT is the tangent space at MMM, PTP_TPT​ and PT⊥P_{T^\perp}PT⊥​ are the tangent and normal projections, and PΩP_\OmegaPΩ​ 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 k=3k = 3k=3, after the scale is known to be at most 1/2.

Lecture-note formulation:

∥PT−p−1PTPΩPT∥T→T≤12⟹∥∑k≥3(PT−p−1PTPΩPT)k(UV⊤)∥≤geometric-series bound.\left\|P_T-p^{-1}P_TP_\Omega P_T\right\|_{T\to T}\le \frac12 \quad\Longrightarrow\quad \left\|\sum_{k\ge3}(P_T-p^{-1}P_TP_\Omega P_T)^k(UV^\top)\right\| \le \text{geometric-series bound}.​PT​−p−1PT​PΩ​PT​​T→T​≤21​⟹​k≥3∑​(PT​−p−1PT​PΩ​PT​)k(UV⊤)​≤geometric-series bound.

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.

Preamble
import Definitions.Def_matrix_completion_neumann
open MatrixCompletion
Formal statement
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
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