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.
Oracle-truncated covariance and vector concentration under finite matrix variance
Statement
Let be independent copies of a centered random vector , , with nonzero covariance and finite fourth moment. Write For , , and , set Then there are events such that and on the respective events The same also has the sharper-radius, larger-failure alternative No independence between these events and a statistic formed from the same sample is asserted or needed.
Facts & Assumptions
Given: The independent vectors and finite-moment assumptions in the statement. Covariance and matrix variance have the meanings in Covariance matrix of a finite-dimensional random vector and Matrix variance for covariance estimation. The fourth moment makes every matrix and scalar expectation used below finite.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis supplies spectral calculus for real symmetric matrices. For , , and the sole possibly nonzero eigenvalue of is . Semidefinite order is tested on quadratic forms and is preserved by expectation.
Bounded independent matrix Bernstein bound from the trace exponential: for independent centered Hermitian matrices with and , one has for . It also proves the associated fixed-parameter one-sided Chernoff bound and the explicit one-sided radius with failure ; the two-sided failure is .
Cauchy–Schwarz in Cauchy–Schwarz: , with equality exactly for dependent pairs, applied to square-integrable scalar random variables with inner product , gives . This expectation inner product may be read on the quotient by almost-sure equality. Independence is as in Independent random elements and is preserved under deterministic measurable transformations, by taking preimages of the defining independent events.
Proof
Put and . The weight is a Borel function, including its declared value at zero, so all transformations used here preserve the independence of the samples by [F3]. The rank-one spectral calculus gives and . For a scalar , : the inequality is immediate for , and for it is equivalent to . Applying it to the eigenvalues of proves . Therefore and . Nonzero covariance also implies : a positive variance in some unit direction forces . Thus the displayed thresholds are well-defined.
Put . Its norm is at most : for use , and otherwise use . Since , . For a unit vector , apply [F3] to and , assigning at zero. Then by matrix variance, and pointwise: it vanishes on , and elsewhere is at most . Thus . Taking the Euclidean dual supremum proves .
Set . Since both matrices subtracted lie between and , , whence . Expanding the square and taking expectations, without any commutativity requirement, gives . The left side is positive semidefinite; hence its norm is at most . The matrices are independent and centered.
For a vector define its symmetric dilation of size . Its square is ; its nonzero eigenvalues when are and , as is checked on the span of and . It vanishes on the orthogonal complement, so , also at zero. For , step 1.2 gives . The square identity gives . Its norm is at most ; for the lower block, test a unit vector and bound its squared scalar projection by the squared norm. The are independent centered symmetric matrices.
Let and use [F2] with the fixed Chernoff parameter ; it is admissible since . Its exponent bound is . Consequently, for , the one-sided failure is at most ; apply the same statement to and take a union to obtain . Adding the bias from step 1.1 and using yields . Define by this bound. Finally since the first four nonnegative terms of sum to ; since , the claimed strict bound by follows.
For the alternative radius, apply the two-sided explicit form in [F2] to the same , now with confidence parameter . After division by its radius is . Adding the bias and substituting , , and , gives the displayed radius with failure at most .
Apply the one-sided explicit Bernstein bound [F2] to with dimension , bound , variance bound and confidence . Since , division by gives outside probability . Because , one has , and the radius is at most . Adding step 1.2 proves the stated vector bound and defines . The two events were obtained from the original independent observations without conditioning on any other statistic. Together with steps 3.1 and 3.2 this proves every asserted conclusion.
Depends on
- Bounded independent matrix Bernstein bound from the trace exponential
- Covariance matrix of a finite-dimensional random vector
- Matrix variance for covariance estimation
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Independent random elements
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
- Stanislav Minsker and Xiaohan Wei, Estimation of the Covariance Structure of Heavy-Tailed Distributions, §§5.3–5.5 (standard reference, not scraped)
- Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, §§6.6–6.7 (standard reference, not scraped)