Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

bernoulli_sampled_row_column_energy_controlled_log_moment_bound_2pN

Proved

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

concentrationkhintchinematrix-completion

Strengthened one-sample controlled row/column sampled-energy log-moment estimate (_2pN window). Under the Candes-Recht one-sample lower bound m≥βNlog⁡Nm \ge \beta N \log Nm≥βNlogN (N=max⁡(n1,n2)N=\max(n_1,n_2)N=max(n1​,n2​), β>2\beta>2β>2, N≥2N\ge 2N≥2), there is a universal constant C>0C>0C>0 and an exponent q∈Nq\in\mathbb{N}q∈N with 1≤q1\le q1≤q, q≥βlog⁡Nq\ge\beta\log Nq≥βlogN, AND the two re-exported window bounds q≤2βlog⁡Nq\le 2\beta\log Nq≤2βlogN and q≤2pNq\le 2pNq≤2pN (where p=m/(n1n2)p=m/(n_1 n_2)p=m/(n1​n2​)), such that the Bernoulli expectation of the qqq-th power of the maximum sampled row/column energy is at most (C p N ∥X∥∞2)q(C\,p\,N\,\lVert X\rVert_\infty^2)^q(CpN∥X∥∞2​)q. This is the strengthening of node 4337294c that re-exports the exponent window the noncommutative-Khintchine conversion consumes.

Preamble
import Definitions.Def_matrix_completion_neumann
import Definitions.Def_matrix_completion_tangent
import Definitions.Def_matrix_completion_sampled_counts
open MatrixCompletion
Formal statement
theorem bernoulli_sampled_row_column_energy_controlled_log_moment_bound_2pN :
    ∃ C : ℝ, 0 < C ∧
      ∀ (β : ℝ), 2 < β →
      ∀ (n₁ n₂ m : ℕ) (X : Matrix (Fin n₁) (Fin n₂) ℝ),
        0 < n₁ → 0 < n₂ → m ≤ n₁ * n₂ →
        (m : ℝ) ≥ β * (↑(max n₁ n₂)) *
          Real.log (↑(max n₁ n₂)) →
        2 ≤ max n₁ n₂ →
        ∃ q : ℕ, 1 ≤ q ∧
          (q : ℝ) ≥ β * Real.log (↑(max n₁ n₂)) ∧
          (q : ℝ) ≤ 2 * (β * Real.log (↑(max n₁ n₂))) ∧
          (q : ℝ) ≤ 2 * (((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) *
              (↑(max n₁ n₂))) ∧
          bernoulliExpectation ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
              (fun Omega =>
                (max (sampledRowEnergyMax Omega X)
                  (sampledColumnEnergyMax Omega X)) ^ q) ≤
            (C * ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) *
              (↑(max n₁ n₂)) * entrySupNorm X ^ 2) ^ q := by
  sorry
Source
Candes-Recht 2008 (arXiv:0805.4471) Section 6.1 Lemma 6.2

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