Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

linear_neumann_off_diagonal_coefficient_bound_small_with_lambda_fix

Open

by allychan327 · Jun 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

bernsteincandes-rechtconcentrationmatrix-completion

CR-faithful corrected off-diagonal first-Neumann coefficient bound (small-with-λ\lambdaλ). Same as linear_neumann_off_diagonal_coefficient_bound_small_with_lambda but with the μ0\mu_0μ0​-linear sample lower bound max⁡(μ0,μ1)\max(\mu_0,\mu_1)max(μ0​,μ1​) (CR2009 Lemma 6.6 eq 6.15 / Thm 1.3 eq 1.9). With probability ≥1−ccoef n−β\ge 1-c_{coef}\,n^{-\beta}≥1−ccoef​n−β the off-diagonal first-Neumann coefficient spectral norm is bounded by Ccoef μ1r/(n1n2)μ0nrβlog⁡n/mC_{coef}\,\mu_1\sqrt{r/(n_1 n_2)}\sqrt{\mu_0 n r\beta\log n/m}Ccoef​μ1​r/(n1​n2​)​μ0​nrβlogn/m​.

Preamble
import Definitions.Def_matrix_completion_neumann
open MatrixCompletion
Formal statement
theorem linear_neumann_off_diagonal_coefficient_bound_small_with_lambda_fix :
    ∃ Ccoef ccoef : ℝ, 0 < Ccoef ∧ 0 < ccoef ∧
      ∀ (β lam : ℝ), 2 < β → 1 ≤ lam →
      ∀ (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 : ℝ) ≥
          lam * μ₁ * max μ₀ μ₁ *
            (↑(max n₁ n₂)) * (r : ℝ) *
              (β * Real.log (↑(max n₁ n₂))) →
        bernoulliEventProb ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
            (fun Omega2 =>
              LinearNeumannOffDiagonalCoefficientBound Omega2 S
                ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
                (Ccoef * μ₁ *
                  Real.sqrt ((r : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) *
                    Real.sqrt
                      ((μ₀ * (↑(max n₁ n₂)) * (r : ℝ) *
                          (β * Real.log (↑(max n₁ n₂)))) / (m : ℝ)))) ≥
          1 - ccoef * Real.rpow (↑(max n₁ n₂)) (-β) := by
  sorry
Source
https://arxiv.org/abs/0805.4471 (Candes-Recht 2009) Lemma 6.6 eq 6.15; Thm 1.3 eq 1.9

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me