Any covariance matrix is positive semi-definite: A proof

-
Let \(\mathbf{X} = (X_1, X_2, \cdots, X_n)^\top \in \mathbb{R}^n\) be a vector of random variables. The covariance matrix \(\Sigma\) of \(\mathbf{X}\) is a square (\(n\times n\)) matrix whose elements are covariances between the components of \(\mathbf{X}\). That is,

\[\Sigma_{ij} = \mathrm{Cov}(X_i,X_j)\]

where \(\mathrm{Cov}(X_i,X_j)\) is the covariance between \(X_i\) and \(X_j\), \(i,j = 1, 2, \cdots, n\): 

\[\mathrm{Cov}(X_i, X_j) = \mathbb{E}[(X_i - \mathbb{E}[X_i])(X_j - \mathbb{E}[X_j])].\]

Here, \(\mathbb{E}[\cdot]\) indicates the expectation value of a random variable. Any covariance matrix has the following properties:

  1. Symmetric. That is, \[\Sigma = \Sigma^\top.\]
  2. Positive semi-definite. That is,\[\forall \mathbf{v} \in \mathbb{R}^n, \mathbf{v}^\top\Sigma\mathbf{v} \geq 0.\]

See also: Positive definite matrix (Wolfram MathWorld)

The symmetry is obvious from the definition of the covariance matrix. 

Now, let us prove that the covariance matrix is positive semi-definite. First, note that the covariance matrix can be expressed as
\[\Sigma = \int_{\mathbb{R}^n}\rho(\mathbf{x})(\mathbf{x} - \boldsymbol{\mu})(\mathbf{x}-\boldsymbol{\mu})^\top \, d\mathbf{x}\]
where \(\rho(\mathbf{x})\) is the density of \(\mathbf{X}\), and
\[\boldsymbol{\mu} = \mathbb{E}[\mathbf{X}] = \int_{\mathbb{R}^n}\rho(\mathbf{x})\mathbf{x} \,d\mathbf{x} \in \mathbb{R}^n\]
is the expectation value of \(\mathbf{X}\). 

Let \(\mathbf{v}\in \mathbb{R}^n\) be an arbitrary vector. We have
\[ \begin{eqnarray}\mathbf{v}^{\top}\Sigma\mathbf{v} &=& \int_{\mathbb{R}^n}\rho(\mathbf{x})\mathbf{v}^{\top}(\mathbf{x}-\boldsymbol{\mu})(\mathbf{x} - \boldsymbol{\mu})^{\top}\mathbf{v}\,d\mathbf{x}\\ &=& \int_{\mathbb{R}^n}\rho(\mathbf{x})[(\mathbf{x}-\boldsymbol{\mu})^{\top}\mathbf{v}]^{\top}[(\mathbf{x}-\boldsymbol{\mu})^{\top}\mathbf{v}]\,d\mathbf{x}\\ &=& \int_{\mathbb{R}^n}\rho(\mathbf{x})[(\mathbf{x}-\boldsymbol{\mu})^{\top}\mathbf{v}]^2\,d\mathbf{x} \geq 0 \end{eqnarray}\]
because the integrand is non-negative.

Remark (2022-10-14): In the initial version of this post, I used the eigenvalue decomposition of the covariance matrix to prove the positive semi-definiteness. But that is not only unnecessary but overly complicated. The above proof is simpler and more direct.

Comments

Post a Comment

Popular posts from this blog

Open sets and closed sets in \(\mathbb{R}^n\)

-
Image
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an  open set  if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is  not  an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
Read more

Euclidean spaces

-
Image
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
Read more

Newton's method

-
Image
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.  Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,  \[\lim_{n\to\infty}c_n = \alpha,\] and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\). Theorem (Newton's method) Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions: \(f(a) < 0\) and \(f(b) > 0\); For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\). Let us define the sequence \(\{c_n\}\) by \[ \begin{eqnarray} c_1 &
Read more