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.
Dense sample covariance concentration for sub-Gaussian vectors
Statement
Let be iid centered random vectors in with covariance and finite second moments. Suppose each is sub-Gaussian with vector proxy , as in Sub-Gaussian variables and vectors, and sub-exponential variables. For put For both the known-mean estimator and the sample-centered estimator , where , for a universal constant (the proof permits ). Since , this is equivalent up to a universal factor to the displayed dense rate with . If , both estimators equal almost surely.
Facts & Assumptions
Given: Iid centered with covariance , sub-Gaussian proxy , integers , and .
The known-mean and sample-centered covariance estimators are as defined in Sample covariance estimators and squared operator loss.
Each unit-direction projection of is centered sub-Gaussian with proxy (Sub-Gaussian variables and vectors, and sub-exponential variables).
The centered product of two such projections is sub-exponential with parameters (Products of sub-Gaussian coordinates are sub-exponential).
For independent centered sub-exponential variables with variance proxies summing to and maximum scale , the two-sided sum tail is (Sub-exponential concentration for independent sums).
A -net of the sphere has at most points (Finite epsilon nets of the Euclidean sphere), and its quadratic forms control a symmetric operator norm by a factor (A sphere net controls the operator norm of a symmetric matrix).
The finite-vector sub-Gaussian net bound controls from the sub-Gaussian projections of (Finite sub-Gaussian maxima and epsilon-net reduction).
For independent real random variables, expectations of products of nonnegative measurable functions factor (Expectations factor over finite products of independent random variables).
Probability is countably subadditive (Basic identities for a probability measure).
The covariance matrix is , hence symmetric, and (Sample covariance estimators and squared operator loss).
The sample vectors are iid and hence mutually independent; applying the common Borel projection and square-minus-mean map preserves independence and identical distribution, so the centered products are iid (Identical distribution and IID families, Independent random elements, Measurable coordinatewise functions preserve independence).
The operator norm is the maximum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
The Euclidean inner product satisfies (The Cauchy-Schwarz inequality for finite sums).
Proof
If , [F2] and [F6] imply for each and positive integer . By [F8], the countable union over shows that every almost surely; then [F9] gives , and both estimators are exact. Assume . Fix a unit vector and set . By [F2]–[F3], each is centered sub-exponential with parameters ; [F10] gives that these variables are iid across .
By [F10] the sample vectors are independent, and [F7] gives, for every and , Thus is centered sub-Gaussian with proxy . Applying the vector clause of [F6] with a -net at gives since and .
Applying [F4] to gives, for every , This is uniform over unit .
Take a -net with at most points and put , so . With and , the exponent in step 2.1 is at least . A union bound gives probability at least that every net quadratic form is at most in absolute value.
By [F9], is symmetric. On the event in step 3.1, [F5] gives . This proves the first estimate.
Expanding [F1] gives . For and unit , [F12] gives , with equality at ; if , both sides vanish. Thus [F11] gives . For vectors , [F12] and give ; applying this inside the maximum in [F11] gives . Combining the probability- events from steps 1.2 and 3.1, their intersection has probability at least by [F8], and the resulting error is at most .
Depends on
- Identical distribution and IID families
- Independent random elements
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Sample covariance estimators and squared operator loss
- Sub-Gaussian variables and vectors, and sub-exponential variables
- The Cauchy-Schwarz inequality for finite sums
- A sphere net controls the operator norm of a symmetric matrix
- Finite epsilon nets of the Euclidean sphere
- Products of sub-Gaussian coordinates are sub-exponential
- Basic identities for a probability measure
- Measurable coordinatewise functions preserve independence
- Expectations factor over finite products of independent random variables
- Finite sub-Gaussian maxima and epsilon-net reduction
- Sub-exponential concentration for independent sums
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
77 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
- Philippe Rigollet, 18.S997 High-Dimensional Statistics, Chapter 4, Theorem 4.6 (standard reference, not scraped)
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 4 (standard reference, not scraped)