Sharp Berry-Esseen Bounds for the Log Determinant of a Gaussian Sample Correlation Matrix
For the Pearson sample correlation matrix from n Gaussian observations in p dimensions, one wants sharp normal-approximation error rates for its log determinant. Existing central limit theorems give only qualitative limits or non-sharp constants, and no single normalization covers all dimension/sample-size regimes.
Under the null R=I_p, an exact independent beta product representation reduces log det to a sum, yielding exact cumulants and a full Fourier-inversion Edgeworth expansion with a sharp Kolmogorov equivalent. For arbitrary positive definite R, a Wiener chaos decomposition separates a Wishart leading term from a nonlinear diagonal standardization remainder to obtain a finite-sample Berry-Esseen bound. All theoretical results are given exact or proved-equivalent Lean 4 formulations that are kernel-checked.
A uniform first Edgeworth expansion and sharp Kolmogorov equivalent are established across square, fixed-gap, growing-gap, proportional, and dilute regimes; the square regime has error of order (log p)^{-3/2} with an exact constant. A uniform finite-sample Berry-Esseen bound tracking population dependence is proved for every positive definite R.
| Constraint | Assumptions | Sharp Kolmogorov equivalent |
|---|---|---|
| m=p | square hard edge | C_*(log p)^{-3/2} |
| m-p=d_0 | fixed integer d_0>=0 | A_{d_0}/{24√π(log p)^{3/2}} |
| p/m→γ | γ∈(0,1) | C_0(γ)/p |
| p/m→0 | p→∞ | 2/{3√(2π)p} |
