general_rademacher_matrix_2p_trace_moment
ProvedGeneral Rademacher matrix -th trace moment bound (Tropp 2015, Theorem 4.1 / eq. (4.9)). Let be a finite family of real symmetric (Hermitian) matrices, and let where ranges over the Rademacher sign cube (encoded as the subset of coordinates, each configuration weighted by ). Write for the matrix variance proxy and let be any upper bound on the eigenvalues of . Then the symmetric Rademacher average of the trace of the -th power satisfies
where the prefactor is the odd double factorial — the -th moment of a standard Gaussian. This is the elementary (non-NCMI) Rademacher recursion underlying the noncommutative Khintchine inequality: it is established by the summation-by-parts / GM--AM trace argument of Tropp's Sections 2 and 4 (Facts 2.2 and 2.4, eq. (4.6)), giving the one-step bound and iterating from .
import Mathlib open Matrix open scoped BigOperators
theorem general_rademacher_matrix_2p_trace_moment
{ι : Type*} [Fintype ι] [DecidableEq ι] {d : ℕ}
(H : ι → Matrix (Fin d) (Fin d) ℝ)
(hHerm : ∀ c, (H c).IsHermitian)
(normV : ℝ) (hnormVnn : 0 ≤ normV)
(hVHerm : (∑ c : ι, H c * H c).IsHermitian)
(hnormV : ∀ i, hVHerm.eigenvalues i ≤ normV)
(p : ℕ) :
(∑ eps : Finset ι, ((1 : ℝ) / 2) ^ (Fintype.card ι)
* Matrix.trace ((∑ c : ι, (if c ∈ eps then (1 : ℝ) else -1) • H c) ^ (2 * p)))
≤ ((Nat.factorial (2 * p) : ℝ) / ((2 ^ p : ℝ) * (Nat.factorial p : ℝ)))
* normV ^ p * (d : ℝ) := by sorry