How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Bounded independent matrix Bernstein bound from the trace exponential
Statement
Let be independent centered random Hermitian matrices, . Suppose , , and Writing , for one has Consequently, for when , For every , the following convenient forms also hold: If , all and vanish almost surely, so the displayed positive-threshold conclusions remain valid.
Facts & Assumptions
Given: The matrices, constants and independent laws of the statement, with expectation as in Expectation of a nonnegative or integrable random variable. Matrix expectation is taken entrywise. The uniform bound makes all entries and all exponential series integrable.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies the Hermitian spectral calculus. The semidefinite order means for every vector . Expectation preserves this order, by taking the expectation of each quadratic form.
Finite-dimensional Golden–Thompson trace inequality gives for Hermitian matrices. Trace is as in The trace as the sum of the diagonal entries.
Independence is in the sense of Independent random elements. By Independent random elements have product joint law, integration of a bounded measurable function of these matrices can be performed successively over their product law.
The scalar Markov bound for a nonnegative random variable is Markov's inequality for random variables.
Proof
Fix . If and is an integer, then , including odd and negative . Applying the spectral calculus and taking expectations gives . Since for every (start at and multiply by ), the exponential series and yield , where . The first inequality is the sum of the convergent geometric majorant , and the second uses and the scalar inequality . Termwise expectation is justified by the uniform norm majorant .
Let , with . For each fixed value of , [F2] and integration over the independent give . The last implication follows because and imply : diagonalize and sum its nonnegative eigenvalues times the bounded diagonal quadratic forms of . Successive integration using [F3] and iteration from prove .
By [F1], . Markov's inequality [F4] and step 2.1 therefore give for every and . If , choose , which belongs to that interval. Substitution gives , proving the stated tail bound. The same fixed-parameter bound with in place of will also be used below.
For set . Expanding its square shows : with and , the two sides are respectively and . Thus step 3.1 bounds the one-sided failure by . Applying the same argument to and taking the union of the two failures bounds the norm failure by , since the norm of a Hermitian matrix is the larger of its maximum eigenvalue and the maximum eigenvalue of its negative.
Finally, if , then for each coordinate vector , . A nonnegative random variable with zero expectation vanishes almost surely: otherwise one of the events where it exceeds would have positive probability and positive contribution to the expectation. Intersecting the finitely many full-probability coordinate events gives almost surely; a further finite intersection covers all . The trace mgf is then and both strict positive-threshold events are empty. This covers the remaining case and completes all conclusions.
Depends on
- Finite-dimensional Golden–Thompson trace inequality
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Independent random elements
- Independent random elements have product joint law
- Expectation of a nonnegative or integrable random variable
- Markov's inequality for random variables
Used by
Dependency tree · two levels
28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §§3.2–3.3 and §§6.6–6.7, especially Lemma 6.6.2 (standard reference, not scraped)