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.
Diagonal covariance lower bound with bounded-risk saturation
Statement
Assume AC, as inherited through Fano’s packing bound with a reference-distribution KL bound. For every , , , and , the minimax squared operator risk of Minimax squared operator risk over of Weak-lq covariance class with directional sub-Gaussian tails satisfies for an absolute constant . In particular, the lower bound applies when and when an effective sparse-row count rounds to zero.
Facts & Assumptions
Given: The class, dimensions and tail constant in the statement; all constructed laws are centered independent-coordinate Gaussian laws.
A centered multivariate normal vector is a linear image of a standard normal vector. Multivariate normal law, including singular covariance.
Diagonal covariance matrices satisfy every stated off-diagonal weak-sparsity radius, including zero. Weak-lq covariance class with directional sub-Gaussian tails.
For separated targets and reference-law average KL at most , Fano bounds squared metric minimax risk below by . Fano’s packing bound with a reference-distribution KL bound.
The operator norm is the attained maximum of over unit vectors; the Frobenius norm is the Euclidean norm of the entry list. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector, The Frobenius norm on real or complex matrices.
Euclidean Cauchy–Schwarz and the Euclidean norm triangle inequality hold in every finite dimension. A metric requires separation, symmetry and the triangle inequality; its Borel sigma-algebra is generated by its open sets. Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The Borel sigma-algebra of a topological space.
Every measurable statistic induces the point-mass probability kernel . A statistic induces a deterministic probability kernel.
The positive-definite Gaussian covariance KL formula and finite independent-product KL additivity hold under the stated AC assumption. Kullback–Leibler divergence between nondegenerate centered Gaussian laws, Additivity of KL divergence for finite product laws.
Proof
Put and . Use Gaussian laws and , . Each covariance has operator norm at most . If is standard normal, . Hence every unit-direction projection of these laws obeys the required tail with parameter . Their covariance matrices are diagonal, so [F2] puts every law in every class in the statement.
For , the Gaussian covariance KL formula with and gives where . By finite-product KL additivity, The divergence is zero, so the reference-law average KL has the same bound.
Use the full matrix action space and set . For a unit vector , rowwise Cauchy–Schwarz [F5] gives , so [F4] gives . Conversely each coordinate unit vector has norm one, so . Thus . The maximum definition also gives homogeneity, symmetry under , and by the Euclidean triangle inequality on each unit vector. If , all columns vanish, so . Hence is a finite metric by [F5]. The two norm inequalities imply each ball for either metric contains a ball for the other about the same center, so their open sets and therefore their Borel sigma-algebras coincide. Under the entry-list identification this is exactly the Euclidean Borel action space in the minimax-risk definition. In particular the diagonal embedding is continuous: its Frobenius difference norm is , and its operator difference norm is at most that. All targets in step 1.1 are thus legitimate Borel metric-space points, and every estimator in the minimax definition is measurable into this metric Borel space and induces an admissible deterministic kernel by [F6]. No new choice axiom is used.
For a diagonal matrix and a unit vector , ; equality holds at a coordinate unit vector attaining the finite maximum. Hence . A target difference from the base has one diagonal entry ; a difference between two nonbase targets has two entries . Every distinct pair therefore has metric separation exactly .
Apply [F3] to these targets, with the base sample law as reference. Its bracket is at least . Thus the risk is at least . These finite experiments are subsets of the full class, so the full minimax risk is no smaller.
Depends on
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector
- The Frobenius norm $\lVert A\rVert_F=(\sum_{i,j}|a_{ij}|^2)^{1/2}$ on real or complex matrices
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- The Borel sigma-algebra of a topological space
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- A statistic induces a deterministic probability kernel
- The Axiom of Choice
- Multivariate normal law, including singular covariance
- Standard normal and normal laws
- Weak-lq covariance class with directional sub-Gaussian tails
- Minimax squared operator risk
- Kullback–Leibler divergence between nondegenerate centered Gaussian laws
- Fano’s packing bound with a reference-distribution KL bound
- Additivity of KL divergence for finite product laws
Used by
Dependency tree · two levels
100 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
- Cai and Zhou, Optimal Rates of Convergence for Sparse Covariance Matrix Estimation (standard reference, not scraped)