On the Square Root of Wishart Matrices: Exact Distributions and Asymptotic Gaussian Behavior
Fengcheng Liu
TL;DR
This paper studies the symmetric square root $V=W^{1/2}$ of the standard Wishart matrix $W_p(m)$. It derives the exact density of $V$ via the matrix-square-root Jacobian and spectral decomposition, including explicit forms for the general case and the standard Wishart case $\Sigma=I_p$. It then shows that, as $m\to\infty$ with fixed $p$, the upper-triangular entries of $V$ become asymptotically normal and that $W_p(m)^{1/2}-\sqrt{m}I_p \xrightarrow{d} \tfrac{1}{2}G$, where $G$ is a Gaussian Wigner matrix; this is established using Bartlett decomposition and Slutsky's lemma. A key contribution is a concrete 1-Wasserstein convergence-rate bound of order $O(p^{5/2}/\sqrt{m})$ for the upper-triangular entries, together with supporting Monte Carlo simulations showing rapid convergence even for modest $m$. The results deepen the understanding of high-dimensional matrix functionals and open avenues for analyzing other transformations of Wishart matrices.
Abstract
Random matrix theory has become a cornerstone in modern statistics and data science, providing fundamental tools for understanding high-dimensional covariance structures. Within this framework, the Wishart matrix plays a central role in multivariate analysis and related applications. This paper investigates both the exact and asymptotic distributions of the square root of a standard Wishart matrix. We first derive the exact distribution of the square root matrix. Then, by leveraging the Bartlett decomposition, we establish the joint asymptotic normality of the upper-triangular entries of the square root matrix. The resulting limiting distribution resembles that of a scaled Gaussian Wigner ensemble. Additionally, we quantify the rate of convergence using the 1-Wasserstein distance. To validate our theoretical findings, we conduct extensive Monte Carlo simulations, which demonstrate rapid convergence even with relatively low degrees of freedom. These results offer refined insights into the asymptotic behavior of random matrix functionals.
