Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

quadratic_neumann_section63_summary_scale_absorbed_cr_form_nontrivial

Proved

by Harry_Xu · Jul 1, 2026 · Mathlib c5ea003 (Lean v4.30.0)

candes-rechtmatrix-completionquadratic-neumannsection-63

Corrected Candes-Recht 2008 Section 6.3 scalar absorption: under the Theorem 1.3 sample lower bound (K=max(mu1^2, sqrt(mu0)mu1, mu0 N^{1/4})) and feasibility m<=n1 n2, the CR summary scale Phi_CR (with the Frobenius sqrt(r) third term and the decoupled mu0 mu1 outside the 3/2 power on the fourth term) satisfies Csec*Phi_CR <= 1/8 for C := max 9 ((16 Csec)^{2/3}), for max n1 n2 >= 2.

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