Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

tangent_coordinate_kernel_diagonal_bound_from_a0

Disproved

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

candes-rechtcoherenceincoherencekernel-boundlean4matrix-completionneumann-seriestangent-space

This is the pointwise diagonal tangent-kernel estimate supplied by the A0 incoherence assumption.

For the tangent projection PTP_TPT​ at a rank-rrr matrix with SVD data SSS, define

Kij=⟨PT(eiej⊤),eiej⊤⟩.K_{ij}=\left\langle P_T(e_i e_j^\top), e_i e_j^\top\right\rangle.Kij​=⟨PT​(ei​ej⊤​),ei​ej⊤​⟩.

The theorem asserts that there is a universal constant Cker>0C_{\mathrm{ker}}>0Cker​>0 such that, whenever SSS satisfies the Candes-Recht A0 condition with parameter μ0\mu_0μ0​, every coordinate obeys

∣Kij∣≤Cker μ0 rmax⁡(n1,n2).|K_{ij}|\le C_{\mathrm{ker}}\,\mu_0\,{r\over \max(n_1,n_2)}.∣Kij​∣≤Cker​μ0​max(n1​,n2​)r​.

This is the real coherence estimate behind the diagonal part of Lemma 6.4. It is deliberately separated from the generic entry-sup multiplier lemma so later Neumann estimates can reuse the same kernel bound.

Preamble
import Definitions.Def_matrix_completion_neumann
open MatrixCompletion
Formal statement
theorem tangent_coordinate_kernel_diagonal_bound_from_a0 :
    ∃ Cker : ℝ, 0 < Cker ∧
      ∀ (n₁ n₂ r : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
        (μ₀ : ℝ) (S : SVD M r),
        0 < n₁ → 0 < n₂ → 0 < r → 1 ≤ μ₀ → A0 S μ₀ →
        ∀ i j,
          |tangentCoordinateKernel S i j i j| ≤
            Cker * μ₀ * ((r : ℝ) / (↑(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