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.
Weak-lq covariance class with directional sub-Gaussian tails
Definition
Let be an integer, , , and . For a symmetric covariance matrix , write for the magnitudes of the off-diagonal entries in column , arranged in nonincreasing order. Define For , define to be the symmetric covariance matrices with at most nonzero off-diagonal entries in each column. The corresponding law class consists of iid laws of whose covariance lies in and which satisfy
for every unit vector and every . This is a clean sub-Gaussian model; it assumes neither coordinate independence nor robustness to contamination.
Depends on
Used by
- The stated sparse-covariance minimax rate is unbounded for super-exponential dimension Counterexample
- Diagonal covariance lower bound with bounded-risk saturation Lemma
- Expected squared operator error of thresholded sparse covariance Lemma
- Gaussian mixture lower bound for weakly sparse covariance Lemma
- Weak-lq thresholding error from an entrywise deviation event Lemma
- Capped thresholded minimax rate for weak-lq sparse covariance Theorem
- Entrywise deviation for sample-centered covariance under directional Gaussian tails Theorem
- High-probability operator error for thresholded weak-lq covariance Theorem
Dependency tree · two levels
5 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
- T. Tony Cai and Harrison H. Zhou, Optimal Rates of Convergence for Sparse Covariance Matrix Estimation, Definitions 1–2 (standard reference, not scraped)