Control the spectral norm of a matrix series with independent standard Gaussian or Rademacher coefficients. The goal is Theorem 4.1.1, including its variance identity, expected-norm estimate, and tail bound for rectangular complex matrices.
Milestones are the Gaussian and Rademacher matrix mgf/cgf estimates (Lemmas 4.6.2–3) and the Hermitian series bound (Theorem 4.6.1). The formulation keeps the source’s constants, both coefficient laws, and the zero-variance case. The shared Chapter 3 tools connect these transform estimates to concentration.
Source: Tropp, January 2015 version, Chapter 4. Lean statements compile; proofs remain open.
Shared definitions: Chapter 3; submit that draft first.
namespace TroppMatrixConcentration
theorem ch4_matrix_series {Ω : Type*} [MeasurableSpace Ω]
(μ : Measure Ω) [IsProbabilityMeasure μ] {m n N : ℕ} [NeZero m] [NeZero n]
(B : Fin N → Matrix (Fin m) (Fin n) ℂ)
(g : Fin N → Ω → ℝ) (hMeas : ∀ k, Measurable (g k))
(hIndep : iIndepFun g μ)
(hLaw : (∀ k, standardGaussianLaw μ (g k)) ∨ (∀ k, rademacherLaw μ (g k))) :
let Z := fun ω => ∑ k, g k ω • B k
let v := rectSecondMoment μ Z
v = max (spectralNorm (∑ k, B k * (B k).conjTranspose))
(spectralNorm (∑ k, (B k).conjTranspose * B k)) ∧
(∫ ω, spectralNorm (Z ω) ∂μ) ≤ Real.sqrt (2 * v * Real.log (m + n)) ∧
∀ t : ℝ, 0 ≤ t → (μ {ω | t ≤ spectralNorm (Z ω)}).toReal ≤
gaussianSeriesTail (m + n) v t := by sorry
end TroppMatrixConcentration
Let be a finite family of fixed complex matrices, with . On an arbitrary probability space let be independent measurable real random variables, either all standard normal or all Rademacher. Put and define the actual second-moment statistic . Then
All norms are Euclidean operator norms. At the tail right side is for and zero for . The finite family may be empty. Both scalar distributions are included in the same theorem via a disjunction on the whole family's laws.
No open leaves. Every sub-goal is proved or awaiting decomposition.