Replace ambient matrix dimension by intrinsic dimension, the ratio of trace to spectral norm. The goal is intrinsic Matrix Bernstein (Theorem 7.3.1). Intrinsic Matrix Chernoff (Theorem 7.2.1) is a second major target within the mission.
Supporting milestones include the generalized Laplace bound, intrinsic-dimension trace estimate, block-diagonal identities, Hermitian Bernstein, and the expected-norm corollary. The statements retain the source’s constants, threshold restrictions, and matrix-valued mean or variance bounds. Nonzero proxies keep intrinsic dimension well-defined; the expectation constant is universal.
Source: Tropp, January 2015 version, Chapter 7. Lean statements compile; proofs remain open.
Shared definitions: Chapter 3; submit that draft first.
namespace TroppMatrixConcentration
theorem ch7_intrinsic_bernstein {Ω : Type*} [MeasurableSpace Ω]
(μ : Measure Ω) [IsProbabilityMeasure μ] {m n N : ℕ} [NeZero m] [NeZero n]
(S : Fin N → Ω → Matrix (Fin m) (Fin n) ℂ) (L : ℝ) (hL : 0 ≤ L)
(V₁ : Matrix (Fin m) (Fin m) ℂ) (V₂ : Matrix (Fin n) (Fin n) ℂ)
(hV : V₁ ≠ 0 ∨ V₂ ≠ 0)
(hMeas : ∀ k, Measurable (S k)) (hIndep : iIndepFun S μ)
(hMean : ∀ k, (∫ ω, S k ω ∂μ) = 0)
(hBound : ∀ k, ∀ᵐ ω ∂μ, spectralNorm (S k ω) ≤ L)
(hVariance₁ : loewnerLE
(∫ ω, (∑ k, S k ω) * (∑ k, S k ω).conjTranspose ∂μ) V₁)
(hVariance₂ : loewnerLE
(∫ ω, (∑ k, S k ω).conjTranspose * (∑ k, S k ω) ∂μ) V₂) :
let Z := fun ω => ∑ k, S k ω
let r := intrinsicDimension (Matrix.fromBlocks V₁ 0 0 V₂)
let v := max (spectralNorm V₁) (spectralNorm V₂)
(∫ ω, Z ω * (Z ω).conjTranspose ∂μ) =
∑ k, ∫ ω, S k ω * (S k ω).conjTranspose ∂μ ∧
(∫ ω, (Z ω).conjTranspose * Z ω ∂μ) =
∑ k, ∫ ω, (S k ω).conjTranspose * S k ω ∂μ ∧
∀ t : ℝ, Real.sqrt v + L / 3 ≤ t →
(μ {ω | t ≤ spectralNorm (Z ω)}).toReal ≤
4 * r * Real.exp (-(t ^ 2 / 2) / (v + L * t / 3)) := by sorry
end TroppMatrixConcentration
Let be a finite independent family of measurable complex random matrices on a probability space, , with and almost surely, . Set . Let and , with at least one nonzero, and put , . Then
The variance bounds are matrices, not merely scalar norm bounds. The nonzero block proxy keeps intrinsic dimension in the source's meaningful domain. The finite family may be empty, and deterministic zero summands remain permitted. All required moments follow from boundedness. This is the designated goal; Theorem 7.2.1 is the other main theorem in this chapter proposal.
No open leaves. Every sub-goal is proved or awaiting decomposition.