Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

quadratic_neumann_section63_first_index_distinct_centered_case_bound_under_general_sample_bound

Proved

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

candes-rechtequation-620first-index-distinctlemma-67matrix-completionsection-63source-faithful

This is the centered S1S_1S1​ part of the ω1≠ω2=ω3\omega_1\ne\omega_2=\omega_3ω1​=ω2​=ω3​ case in Candes-Recht Section 6.3.

Source location: Candes-Recht 2008, Section 6.3, PDF pp. 31--32. The paper expands

(ξω2)2=(1−2p)ξω2+p(1−p)(\xi_{\omega_2})^2=(1-2p)\xi_{\omega_2}+p(1-p)(ξω2​​)2=(1−2p)ξω2​​+p(1−p)

and calls the first resulting sum S1S_1S1​. It is bounded by Lemma 6.7 with Xω=p−1EωPωωX_\omega=p^{-1}E_\omega P_{\omega\omega}Xω​=p−1Eω​Pωω​. This node states that bound at the final PDF p. 34 summary scale.

The bound is stated at the Section 6.3 summary scale

Φ=(μ02μ1)nr βlog⁡nm(nrm)2+μ02(nrm)2+βlog⁡n(nrm)3/2μ02r+(μ0μ1nr βlog⁡nm)3/2.\Phi=(\mu_0^2\mu_1)\sqrt{\frac{nr\,\beta\log n}{m}}\left(\frac{nr}{m}\right)^2 +\mu_0^2\left(\frac{nr}{m}\right)^2 +\sqrt{\beta\log n}\left(\frac{nr}{m}\right)^{3/2}\mu_0^2r +\left(\frac{\mu_0\mu_1nr\,\beta\log n}{m}\right)^{3/2}.Φ=(μ02​μ1​)mnrβlogn​​(mnr​)2+μ02​(mnr​)2+βlogn​(mnr​)3/2μ02​r+(mμ0​μ1​nrβlogn​)3/2.

The theorem asserts that the centered contribution is at most CΦC\PhiCΦ with probability at least 1−cn−β1-cn^{-\beta}1−cn−β under the full Theorem 1.3 sample lower bound.

Preamble
import Definitions.Def_matrix_completion_neumann
open MatrixCompletion
Formal statement
theorem quadratic_neumann_section63_first_index_distinct_centered_case_bound_under_general_sample_bound :
    ∃ C c : ℝ, 0 < C ∧ 0 < c ∧
      ∀ C' : ℝ, C ≤ C' →
      ∀ (β : ℝ), 2 < β →
      ∀ (n₁ n₂ r m : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
        (μ₀ μ₁ : ℝ) (S : SVD M r),
        0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
        1 ≤ μ₀ → 1 ≤ μ₁ →
        A0 S μ₀ → A1 S μ₁ →
        (m : ℝ) ≥
          C' * max (max (μ₁ ^ 2) (Real.sqrt μ₀ * μ₁))
                  (μ₀ * Real.rpow (↑(max n₁ n₂)) ((1 : ℝ) / 4))
            * (↑(max n₁ n₂)) * (r : ℝ) * (β * Real.log (↑(max n₁ n₂))) →
        bernoulliEventProb ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
            (fun Omega =>
              spectralNorm
                (quadraticNeumannFirstIndexDistinctCenteredContribution Omega S
                  ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))) ≤
                (let N : ℝ := ↑(max n₁ n₂)
                 let R : ℝ := (r : ℝ)
                 let Mobs : ℝ := (m : ℝ)
                 let logN : ℝ := Real.log N
                 C *
                   ((μ₀ ^ 2 * μ₁) *
                      Real.sqrt ((N * R * (β * logN)) / Mobs) *
                        ((N * R) / Mobs) ^ 2 +
                    μ₀ ^ 2 * ((N * R) / Mobs) ^ 2 +
                    Real.sqrt (β * logN) *
                        Real.rpow ((N * R) / Mobs) ((3 : ℝ) / 2) *
                          (μ₀ ^ 2 * R) +
                    Real.rpow
                      ((μ₀ * μ₁ * N * R * (β * logN)) / Mobs)
                      ((3 : ℝ) / 2)))) ≥
          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