Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

talagrand_tangent_sampling_deviation_around_mean_raw_tail

Disproved

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

candes-rechtconcentrationmatrix-completiontalagrandtangent-spacetheorem-42

This is the raw Talagrand concentration input for the tangent-sampling deviation in the Bernoulli model.

Let

Z(Ω)=tangentSamplingDeviation⁡(Ω,S,p)Z(\Omega)=\operatorname{tangentSamplingDeviation}(\Omega,S,p)Z(Ω)=tangentSamplingDeviation(Ω,S,p)

be the operator norm of the centered tangent sampling fluctuation. Assume the two Talagrand hypotheses used in Candes--Recht Appendix 9.1 hold at a common scale BBB: every coordinate increment in the supremum representation is bounded by BBB, and the corresponding variance proxy is also bounded by BBB.

Then there are universal constants K,c>0K,c>0K,c>0 such that, for every β>2\beta>2β>2 and n=max⁡(n1,n2)n=\max(n_1,n_2)n=max(n1​,n2​),

Pp ⁣(Z(Ω)≤EpZ+KB βlog⁡n)≥1−cn−β.\mathbb P_p\!\left( Z(\Omega)\le \mathbb E_p Z+K\sqrt{B\,\beta\log n} \right) \ge 1-c n^{-\beta}.Pp​(Z(Ω)≤Ep​Z+KBβlogn​)≥1−cn−β.

This node is the source theorem behind the later Candes--Recht scale substitution. Source location: Candes--Recht, PDF p. 19, equation (4.10), with the bounded-increment and variance hypotheses described in Appendix 9.1.

Preamble
import Definitions.Def_matrix_completion_talagrand
open MatrixCompletion
Formal statement
theorem talagrand_tangent_sampling_deviation_around_mean_raw_tail :
    ∃ K c : ℝ, 0 < K ∧ 0 < c ∧
      ∀ (β : ℝ), 2 < β →
      ∀ (n₁ n₂ r m : ℕ) (M : Matrix (Fin n₁) (Fin n₂) ℝ)
        (μ₀ μ₁ : ℝ) (S : SVD M r) (B : ℝ),
        0 < n₁ → 0 < n₂ → 0 < r → m ≤ n₁ * n₂ →
        1 ≤ μ₀ → 1 ≤ μ₁ →
        A0 S μ₀ → A1 S μ₁ →
        TangentSamplingTalagrandIncrementBound S
          ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) B →
        TangentSamplingTalagrandVarianceBound S
          ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ))) B →
        bernoulliEventProb ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
            (fun Omega =>
              TangentSamplingDeviationBound Omega S
                ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
                (bernoulliExpectation
                    ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))
                    (fun Omega' =>
                      tangentSamplingDeviation Omega' S
                        ((m : ℝ) / ((n₁ : ℝ) * (n₂ : ℝ)))) +
                  K * Real.sqrt (B * (β * Real.log (↑(max n₁ n₂)))))) ≥
          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