Elementary concentration of random matrices from entrywise second moments #
Let μ be any measure, S : Ω → Matrix m n E a matrix-valued function and A a fixed matrix.
Suppose every squared entrywise deviation is integrable with
∫ ω, ‖S ω k l - A k l‖² ∂μ ≤ v. For η > 0, Chebyshev's inequality for each of the
card m * card n entries, followed by a union bound, bounds the measure of the deviation event:
μ {ω | ∃ k l, η < ‖S ω k l - A k l‖} ≤ ENNReal.ofReal (card m * card n * v / η²).
On a probability space, every deterministic consequence of entrywise η-closeness therefore holds
with probability at least 1 - card m * card n * v / η². For square matrices over ℝ or ℂ the
entrywise-to-spectral comparison of TauCeti.Analysis.Matrix.Eigenvalues.Basic turns this into
simultaneous high-probability control of every sorted eigenvalue, up to the dimension factor
card n. For rectangular matrices over ℝ or ℂ the entrywise-to-operator comparison of
TauCeti.Analysis.Matrix.EntrywiseOpNorm bounds the operator norm of the Euclidean action of
S - A by √(card m) * η * √(card n), which is card n * η for square matrices.
The entrywise measure bound needs no measurability assumption on the entries: Chebyshev's
inequality uses the integrability of the squared deviations. For the probability conclusions,
1 - μ sᶜ ≤ μ s holds for every set on a probability space. Measurability of the deviation event
is recorded separately.
Finally, for real samples V i, every entry of the empirical second-moment matrix
TauCeti.sampleSecondMoment is the sample mean of the products V i k * V i l. When those products
are pairwise independent with common mean M k l and second moments about it at most v, the
entry has mean-square error at most v / r for r samples. Feeding this into the eigenvalue bound
with η = c / (2 d), where d is the dimension, shows that, with probability at least
1 - 4 d⁴ v / (r c²), every eigenvalue of the population matrix M that is at least c stays at
least c / 2 for the empirical matrix.
Main statements #
TauCeti.measure_exists_lt_norm_sub_le: the entrywise Chebyshev union bound.TauCeti.measurableSet_exists_lt_norm_sub: the entrywise deviation event is measurable when the entries are.TauCeti.one_sub_le_measure_of_entry_le: with probability at least1 - card m * card n * v / η², every consequence of entrywiseη-closeness holds.TauCeti.one_sub_le_measure_forall_abs_eigenvalues₀_sub_le: eigenvalue concentration.TauCeti.one_sub_le_measure_forall_eigenvalues₀_sub_le: the one-sided eigenvalue floor.TauCeti.one_sub_le_measure_forall_norm_toEuclideanLin_sub_le: rectangular operator concentration.TauCeti.one_sub_le_measure_forall_norm_toEuclideanLin_sub_le_square: square operator concentration.TauCeti.integral_sampleSecondMoment_apply_sub_sq_le: the mean-square error of an entry of the empirical second-moment matrix.TauCeti.one_sub_le_measure_forall_half_le_eigenvalues₀_sampleSecondMoment: the empirical second-moment matrix keeps every population eigenvalue abovecabovec / 2.
References #
- R. Vershynin, High-Dimensional Probability (2018), §1.2 (Chebyshev's inequality) and §4.7 (covariance estimation).
- R. A. Horn, C. R. Johnson, Matrix Analysis, 2nd ed. (2013), Theorem 4.3.1 (Weyl's inequality).
Entrywise Chebyshev union bound. For any measure μ, if every squared entrywise deviation
of a matrix-valued function S from a fixed matrix A is integrable with integral at most v,
then the measure of the event where some entry deviates by more than η > 0 is at most
ENNReal.ofReal (card m * card n * v / η²).
For countable row and column index types, the event that some entry of a random matrix deviates
from a fixed matrix by more than η is measurable when every entry is measurable.
High-probability entrywise closeness. On a probability space, if every entrywise deviation
of a random matrix S from a fixed matrix A has second moment at most v, then any set s
containing every outcome at which all entries of S are within η > 0 of those of A has
probability at least 1 - card m * card n * v / η².
Eigenvalue concentration. If every entrywise deviation of a random Hermitian matrix S
from a fixed Hermitian matrix A has second moment at most v, then with probability at least
1 - (card n)² v / η² every sorted eigenvalue of S is within card n * η of the corresponding
eigenvalue of A.
One-sided eigenvalue floor. Under the hypotheses of
TauCeti.one_sub_le_measure_forall_abs_eigenvalues₀_sub_le, with probability at least
1 - (card n)² v / η² every sorted eigenvalue of S is at least the corresponding eigenvalue of
A minus card n * η.
Operator concentration for rectangular matrices. If every entrywise deviation of a
random m × n matrix S from a fixed matrix A has second moment at most v, then with
probability at least 1 - card m * card n * v / η² the Euclidean action of S - A has operator
norm at most √(card m) * η * √(card n), that is, ‖(S - A) x‖ ≤ √(card m) * η * √(card n) * ‖x‖
for every x.
Operator concentration for square matrices. If every entrywise deviation of a random
square matrix S from a fixed matrix A has second moment at most v, then with probability at
least 1 - (card n)² v / η² the Euclidean action of S - A has operator norm at most
card n * η.
Mean-square error of an empirical second moment. For real random vectors V i, if the
products V i k * V i l of two fixed coordinates are square-integrable, pairwise independent and
have a common mean M k l, and each has second moment about M k l at most v, then the
(k, l) entry of the empirical second-moment matrix has mean-square error at most v / r, where
r is the number of samples.
Eigenvalue floor for the empirical second-moment matrix. Let V i be r real random
vectors of dimension d. Suppose that for every pair of coordinates k, l the products
V i k * V i l are square-integrable, pairwise independent and have a common mean M k l, with
second moments about it at most v, and that M is symmetric. Then for every c > 0, with
probability at least 1 - 4 d⁴ v / (r c²), every sorted eigenvalue of M that is at least c
has the corresponding eigenvalue of the empirical second-moment matrix at least c / 2.