Control the spectral norm of a sum of independent, centered, bounded rectangular random matrices. The goal is Matrix Bernstein (Theorem 6.1.1), including the variance identity and both expected-norm and tail estimates.
Milestones cover Hermitian dilation, variance additivity, the bounded-summand mgf/cgf estimate (Lemma 6.6.2), and Hermitian Bernstein (Theorem 6.6.1). Chapter 3 supplies the general Laplace-transform machinery. The formulation uses the Euclidean operator norm, preserves the one-sided eigenvalue assumption in the Hermitian result, and includes deterministic zero sums.
Source: Tropp, January 2015 version, Chapter 6. Lean statements compile; proofs remain open.
Shared definitions: Chapter 3; submit that draft first.
namespace TroppMatrixConcentration
theorem matrix_bernstein {Ω : Type*} [MeasurableSpace Ω]
(μ : Measure Ω) [IsProbabilityMeasure μ] {m n N : ℕ} [NeZero m] [NeZero n]
(S : Fin N → Ω → Matrix (Fin m) (Fin n) ℂ) (L : ℝ) (hL : 0 ≤ L)
(hMeas : ∀ k, Measurable (S k)) (hIndep : iIndepFun S μ)
(hMean : ∀ k, (∫ ω, S k ω ∂μ) = 0)
(hBound : ∀ k, ∀ᵐ ω ∂μ, spectralNorm (S k ω) ≤ L) :
let Z := fun ω => ∑ k, S k ω
let v := rectSecondMoment μ Z
v = max (spectralNorm (∑ k, ∫ ω, S k ω * (S k ω).conjTranspose ∂μ))
(spectralNorm (∑ k, ∫ ω, (S k ω).conjTranspose * S k ω ∂μ)) ∧
(∫ ω, spectralNorm (Z ω) ∂μ) ≤
Real.sqrt (2 * v * Real.log (m + n)) + L * Real.log (m + n) / 3 ∧
∀ t : ℝ, 0 ≤ t → (μ {ω | t ≤ spectralNorm (Z ω)}).toReal ≤
bernsteinTail (m + n) v L t := by sorry
end TroppMatrixConcentration
Let be independent measurable complex random matrices on a probability space, with . Assume and almost surely, where and the norm is the spectral norm. Set . Then
At a zero denominator the tail right-hand side is for and zero for . The finite family may be empty. All moments needed in this statement exist by boundedness. This is the mission's goal, retaining both the expectation and tail conclusions.
No open leaves. Every sub-goal is proved or awaiting decomposition.