Why Principal Directions Have Sampling Uncertainty
A sample principal direction is an estimate of a population direction, and its precision depends on more than the sample size. Even a small perturbation of a covariance matrix can substantially rotate an eigenvector when its eigenvalue is close to a neighboring eigenvalue. The asymptotic covariance makes this relationship precise: fluctuations in the covariance matrix are projected onto the directions perpendicular to each eigenvector and scaled by eigenvalue gaps.
We consider a fixed dimension \(p\) and a population covariance matrix with distinct eigenvalues. The eigenvectors are defined only up to sign, so each sample eigenvector will be signed to point in the same direction as its population counterpart. This convention gives a local, signed limit; it does not remove the underlying sign ambiguity of principal components.
For specificity, take \(S_n=n^{-1}\sum_{i=1}^n(X_i-\bar X)(X_i-\bar X)'\). Using the divisor \(n-1\) instead gives the same first-order limit. Let \(Y_i=X_i-\mu\), and express its coordinates in the population eigenbasis as \(Y_{ia}=u_a'Y_i\). The matrix fluctuation has a multivariate central limit theorem when the fourth moments are finite. Because the sample mean correction is negligible at this scale, estimating \(\mu\) does not change the limit. We use this covariance-matrix limit to derive the joint direction limit.
First-Order Change in an Eigenvector
Let \(E_n=S_n-\Sigma\). Under the stated conditions, \(E_n=O_p(n^{-1/2})\). For a simple eigenvalue, the first-order change in \(u_j\) has no component along \(u_j\): normalization fixes that component to first order. Its component along each other \(u_k\) is the covariance perturbation in that direction divided by the corresponding eigenvalue gap.
To see the expansion, write \(\hat u_j=a_j u_j+\sum_{k\ne j}b_{kj}u_k\), where \(a_j=\hat u_j'u_j\geq0\). The sample eigenvalue equation, projected onto \(u_k\), gives $$ (\lambda_k-\hat\lambda_j)b_{kj}+u_k'E_n\hat u_j=0, \qquad b_{kj}=\frac{u_k'E_n\hat u_j}{\hat\lambda_j-\lambda_k}. $$ The eigenvalue perturbation bound gives \(\hat\lambda_j-\lambda_j=O_p(\|E_n\|)\); the fixed positive gaps then keep every denominator bounded away from zero with probability tending to one. Thus \(b_{kj}=O_p(\|E_n\|)\), so \(\hat u_j-u_j=O_p(\|E_n\|)\). In the numerator, replacing \(\hat u_j\) by \(u_j\) therefore introduces an \(O_p(\|E_n\|^2)\) error. Replacing \(\hat\lambda_j-\lambda_k\) by \(\lambda_j-\lambda_k\) also introduces an \(O_p(\|E_n\|^2)\) error, since the numerator is \(O_p(\|E_n\|)\) and the denominator changes by \(O_p(\|E_n\|)\). Finally, unit length gives \(a_j=(1-\sum_{k\ne j}b_{kj}^2)^{1/2}=1+O_p(\|E_n\|^2)\). Combining these coordinate expansions proves the result. \(\square\)
The Joint Asymptotic Covariance
Define a centered Gaussian symmetric matrix \(Z\) by its entries in the population eigenbasis. For indices \(a,b,c,d\), let $$ \Gamma_{ab,cd} = \operatorname{Cov}(Y_{ia}Y_{ib},Y_{ic}Y_{id}) = E[Y_{ia}Y_{ib}Y_{ic}Y_{id}] -\lambda_a\lambda_c\,\mathbf{1}_{\{a=b\}}\mathbf{1}_{\{c=d\}}, $$ where \(\mathbf{1}_{A}\) is 1 when \(A\) holds and 0 otherwise. The covariance-matrix central limit theorem says that the entries of \(\sqrt n E_n\), expressed in this basis, converge jointly to the entries of \(Z\), with \(\operatorname{Cov}(Z_{ab},Z_{cd})=\Gamma_{ab,cd}\). Define the Gaussian limit for each direction by $$ V_j=\sum_{k\ne j}u_k\frac{Z_{kj}}{\lambda_j-\lambda_k}. $$