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.
Gaussian mixture lower bound for weakly sparse covariance
Statement
Assume AC. Fix , , and . There are and , depending only on these fixed parameters, such that the following holds. Let , , and Put , , and If , then For , . The proof gives all Gaussian mixture and conditional remainder estimates locally; no external mixture-affinity lemma is assumed.
Facts & Assumptions
Given: The class, fixed constants, scales and nontrivial sparse-row regime in the statement.
Under AC, a positive-definite covariance defines a Gaussian law with the specified covariance and normal unit-direction projections. Multivariate normal law, including singular covariance.
Strong off-diagonal sums imply the weak- condition; for the condition counts nonzero entries. Weak-lq covariance class with directional sub-Gaussian tails.
Minimax risk is the infimum of maximal expected squared operator loss over measurable estimators. Minimax squared operator risk.
A real symmetric matrix has an orthonormal eigenbasis. Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis.
Finite-sum Cauchy–Schwarz applies to Euclidean vectors and finite weighted sums, and the operator norm is the maximum Euclidean output norm over unit inputs. Euclidean spheres and closed balls as subspaces of The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| The Cauchy-Schwarz inequality for finite sums.
The independent standard-normal coordinates in the Gaussian construction have their product joint law; their scalar density is , product Lebesgue measure agrees with Euclidean Lebesgue measure on Borel sets, and positive operators have nonnegative square roots. Multivariate normal law, including singular covariance Standard normal and normal laws Independent random elements have product joint law On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n} A non-negative operator has a unique non-negative square root.
Under Countable Choice, an invertible linear change of variables satisfies the Borel Lebesgue substitution formula; the stated AC assumption supplies Countable Choice. Borel change of variables from the compact-support formula and Radon uniqueness AC supplies countable selections and prescribed serial paths.
Tonelli's theorem factors the nonnegative cross-moment integrand across the finite product sample space. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.
Total variation distance is for probability laws on a common measurable space. Total variation distance for probability laws.
Cauchy–Schwarz for square-integrable random variables controls the density-ratio integral under a probability law. Cauchy-Schwarz for random variables.
Proof
Choose and put . Write , so and and . The radius condition gives , hence , , and . Also , uniformly over admitted . All constants depend only on fixed parameters. Increase so , , and the small bounds below hold. Let be all zero-one matrices with every row sum and every column sum at most ; cyclic shifts of a -set show it is nonempty. For , embed as the upper-right block of a symmetric off-diagonal matrix , using two disjoint -coordinate blocks and an extra zero coordinate if is odd, and put . Every absolute row sum of is at most . For any , ; applying this to unit eigenvectors and using [F4] bounds the eigenvalues of in . Thus is positive definite with eigenvalues in . Each column has at most off-diagonal entries of magnitude . If , its weak- quantity is at most ; if , its nonzero count is at most . Hence [F2] puts every covariance in the radius- class. The standard-normal density gives , so [F1] verifies the directional-tail condition. For any rectangular matrix and vector , [F5] gives . Summing over rows yields , hence . Therefore each cross-block matrix below has .
Give the uniform prior on . Fix bit , say by row symmetry, and condition on the remaining bit vector and nuisance rows . The number of possible first-row supports is , where counts columns whose nuisance sum is less than . Since there are nuisance ones, . The marginal prior of is , independent of ; conditional on , a support is uniform among its available -sets. For each fixed , when let be the Gaussian n-sample law, which does not depend on ; when , let be the n-sample law and its uniform support mixture. In the chi-square expansion draw two independent available supports given . Their joint mass with is proportional to , so given the nuisance rows are not asserted uniform.
Fix and let be the cross-block matrix with first row zero and remaining rows . Under , after canceling , the covariance is , with an extra identity coordinate if is odd. Put ; it is positive definite because . The block matrix satisfies . Whiten by , extended by the identity on any extra coordinate. If is the first coordinate in the left block and is the right-block support vector, then and . Thus the alternative covariances become and , where , , , , and . With , . The operator norms of equal , respectively. Since , these norms are at most for large ; here . For positive-definite , [F1], [F6] and [F7] give the Lebesgue density : the independent standard-normal coordinates have product density, and the invertible linear map changes variables with determinant . For the one-observation laws, write for the positive densities of the two alternatives and the whitened baseline. Put . Each inverse has smallest eigenvalue at least , hence . The product density has exponent matrix and normalizing factor . Diagonalizing by [F4], applying an orthogonal change of variables and scaling each one-dimensional standard-normal density [F6, F7] gives The identity and determinant multiplicativity For same-sized finite square matrices over a commutative ring, reduce it to . Since , . On , contributes determinant . On , if the rank-one determinant is ; otherwise choose an orthonormal basis whose first vector is , so has only its first row changed and determinant . The full determinant is , and the one-observation cross integral is . The n-sample laws have product densities by the product joint-law supplier in [F6]; repeated Tonelli [F8] therefore makes their cross integral the nth power, .
Write , and . The identity follows from and . The Neumann series converges because ; since has nonnegative entries, is entrywise nonnegative and . The eigenvalues of lie in , so [F4] gives . Also and . Cauchy--Schwarz [F5] and yield Since and , [F5] also gives . Since and , , so . The derivative of is at most for ; since , the preceding bound gives
Fix and all nuisance rows except row , and let be the sum in column over those fixed rows. A support for row is feasible exactly when , for every column, and for every (so both first-row supports remain available). Thus before prior weighting row is uniform over the -subsets of the fixed set At most columns outside have , so deleting these and leaves at least available columns; hence . The first-row availability count is ; as varies, only columns outside with can change this count, so its range has width at most . Since and , the ratio of any two weights is at most after increasing . Thus the actual conditional density of the row support is at most twice the uniform-subset density on . If , singleton and ordered-pair inclusion probabilities give and . Hence ; the same bound holds for and under the weighted law with twice the constant. Since , for yields
Put and . Every factor except is measurable when all rows except are fixed. Thus for any subset containing , conditional expectation gives Iterating over the finitely many nuisance rows yields uniformly in . No row independence is used.
Given , are independent uniform -subsets of a set of size . Expanding and using gives . Since and , . Define . Finite expansion of the mixture density gives The posterior of given has weights proportional to ; step 6.1 bounds the conditional remainder factor by uniformly in . Since , the overlap generating-function bound is uniform in and yields using step 1.1. For each fixed , if , then , so the positive and negative parts of have equal integrals, and the event attains the supremum in [F9]; hence ; [F10] bounds this by . Finite Cauchy--Schwarz [F5] over the common prior weights on bounds the average conditional total variation by , at most after increasing . The same mixing weights are used under bit and bit , so the full sample-law mixtures have total variation at most by the triangle inequality for the density integral. Their density affinity satisfies
For parameters with different bits, apply their covariance difference to the vector that is one on the right block and zero elsewhere. Each changed bit contributes a distinct left-block coordinate of magnitude , independently of support choices, so the squared output norm is at least while the input squared norm is . Hence . Given any measurable matrix estimator, choose a nearest finite covariance target with a fixed tie order. The finite distance comparisons are measurable: [F5] bounds the operator norm by the Frobenius norm, and its triangle inequality follows by applying the Euclidean triangle inequality to every unit vector, so distance to each fixed target is continuous. A wrong target decision forces squared estimation loss at least one quarter of the squared target separation. For each bit, the sum of its two conditional testing errors is at least the density affinity, since pointwise the test contributes at least the minimum of the two densities. By step 7.1, under the uniform prior each bit error probability is at least , so the average number of bit errors is at least . The maximal risk is at least the average risk and therefore at least . Finally, implies this is at least for a positive constant depending only on the fixed parameters.
Depends on
- Cauchy-Schwarz for random variables
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Multivariate normal law, including singular covariance
- Standard normal and normal laws
- Total variation distance for probability laws
- Weak-lq covariance class with directional sub-Gaussian tails
- Minimax squared operator risk
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- AC supplies countable selections and prescribed serial paths
- Borel change of variables from the compact-support formula and Radon uniqueness
- The Cauchy-Schwarz inequality for finite sums
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- Independent random elements have product joint law
- On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}
- A non-negative operator has a unique non-negative square root
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Dependency tree · two levels
96 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, Sections 2-3 and 7.3 (standard reference, not scraped)