Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

tropp_even_schatten_variance_scale

Proved

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

concentrationkhintchinematrix-completionschatten

Tropp-route even-Schatten variance-scale moment bound (noncommutative Khintchine via the Tropp/Buchholz matrix moment recursion, bypassing Lust-Picquard duality). For a Rademacher-symmetrized sampled matrix and even exponent 2n2n2n (n≥1n\ge1n≥1), the Rademacher expectation of ∥⋅∥S2n2n\lVert\cdot\rVert_{S_{2n}}^{2n}∥⋅∥S2n​2n​ is at most (2n)!2nn! (varianceScale)2n(n1+n2)\frac{(2n)!}{2^n n!}\,(\text{varianceScale})^{2n}(n_1+n_2)2nn!(2n)!​(varianceScale)2n(n1​+n2​), where (2n)!2nn!=(2n−1)!!\frac{(2n)!}{2^n n!}=(2n-1)!!2nn!(2n)!​=(2n−1)!! is the Buchholz pairing-count (double-factorial) constant. This is the trace-moment self-bounding recursion giving the q\sqrt qq​ Khintchine factor at even integer order.

Preamble
import Definitions.Def_matrix_completion_schatten
import Definitions.Def_matrix_completion_rademacher
open MatrixCompletion
Formal statement
theorem tropp_even_schatten_variance_scale {n1 n2 : ℕ}
    (n : ℕ) (hn : 1 ≤ n)
    (Omega : Finset (Fin n1 × Fin n2)) (p : ℝ) (hp : 0 < p)
    (X : RealMatrix n1 n2) :
    rademacherExpectation
        (fun eps => schattenNorm (2 * n : ℝ) (rademacherSampledMatrix Omega eps p X) ^ (2 * n))
      ≤ ((Nat.factorial (2 * n) : ℝ) / ((2 ^ n : ℝ) * (Nat.factorial n : ℝ)))
          * (rademacherSampledVarianceScale Omega p X) ^ (2 * n)
          * ((n1 : ℝ) + (n2 : ℝ)) := by
  sorry
Source
Tropp, User-friendly tail bounds for matrix sums; CR2008 Section 6.1; Buchholz Math. Ann. 2001

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