Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

positive_bernoulli_least_squares_certificate_existence_from_tangent_concentration

Proved

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

candes-rechtlean4least-squares-certificatematrix-completionprobabilitytangent-space

This is the corrected positive-rate Bernoulli event transfer for least-squares certificate existence. Let ppp be the Bernoulli sampling probability. If 0<ple10<ple10<ple1 and the tangent-concentration event

T(Omega):quadPTPOmegaPTextiswithin1/2extofitsmeanonTT(Omega):quad P_TP_Omega P_T ext{ is within }1/2 ext{ of its mean on }TT(Omega):quadPT​PO​megaPT​extiswithin1/2extofitsmeanonT

has probability at least 1-c,n^{-eta}, then the event

existsYquadYextissupportedonOmega,quadPTY=operatornamesgn(M),quadYextminimizestheFrobeniusnormexists Yquad Y ext{ is supported on }Omega,quad P_TY=operatorname{sgn}(M),quad Y ext{ minimizes the Frobenius norm}existsYquadYextissupportedonOmega,quadPT​Y=operatornamesgn(M),quadYextminimizestheFrobeniusnorm

also has probability at least 1-c,n^{-eta}. The assumption p>0p>0p>0 is essential: the zero-rate version has been disproved by the one-entry empty-sampling counterexample.

Preamble
import Definitions.Def_matrix_completion_tangent
open MatrixCompletion
Formal statement
theorem positive_bernoulli_least_squares_certificate_existence_from_tangent_concentration
    {n₁ n₂ r : ℕ} {M : Matrix (Fin n₁) (Fin n₂) ℝ} (S : SVD M r)
    (p c β : ℝ) :
    0 < p → p ≤ 1 →
    bernoulliEventProb p
        (fun Omega => TangentSamplingConcentration Omega S p ((1 : ℝ) / 2)) ≥
        1 - c * Real.rpow (↑(max n₁ n₂)) (-β) →
    bernoulliEventProb p
        (fun Omega => ∃ Y : Matrix (Fin n₁) (Fin n₂) ℝ,
          LeastSquaresDualCertificate Omega S Y) ≥
        1 - c * Real.rpow (↑(max n₁ n₂)) (-β) := 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