# Cholesky Factorization

* positive definite matrices
* computation and definition
* connection to Newton Method
* connection to Least-Squares

## Positive Definite Matrices

An $$n\times n$$ matrix $$A$$ (assume symmetric) is positive definite if (SPD)

$$x^TAx \gt 0, \forall x\in \mathbb{R}^n \ne 0$$

positive semi definite if (PSD)

$$x^TAx \ge 0, \forall x\in \mathbb{R}^n$$

negative definite matrix

$$x^TAx \lt 0, \forall x \ne 0$$

### Properties

1. for any full rank $$n\times k$$ matrix $$X$$, $$X^TAX\gt 0$$ if $$A \gt 0$$         ①

   for all $$y\in \mathbb{R}^k$$ nonzero, $$0 \ne Xy$$ ⇒ $$y^T(X^TAX)y=\underbrace{(Xy)^T}*{\equiv Z^T}A(\underbrace{Xy}*{\equiv Z \ne 0})\gt 0$$

① ⇒ every principle sub-matrix of $$A$$ is also positive definite

<figure><img src="https://596692103-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FuVC1Ieh2j1XfxqLWFoSa%2Fuploads%2F6TvmrJwc6kp4awAznZDb%2Fimage.png?alt=media&#x26;token=3a3848ee-7789-4a02-a05d-93a5c6d188b6" alt=""><figcaption></figcaption></figure>

$$X^T\_1AX\_1=\begin{matrix}& P\_1 & P\_2 & P\_3& \ \[& I & 0& 0&]\end{matrix}\begin{bmatrix}A\_1 &&\\\&A\_2&\\&\&A\_3\end{bmatrix}\begin{bmatrix}I\0\0\end{bmatrix}=A\_1$$

$$X\_2^TAX\_2=\begin{bmatrix}1 & 0 & \ldots &0 \end{bmatrix}A\begin{bmatrix}1\0\ \vdots \0\end{bmatrix}=a\_{11}$$

⇒ every diagonal element $$a\_{ii} \gt 0$$

2. A is positive definite ↔ eigenvalues are positive

$$(x,\lambda)\in \mathbb{R}^n\times \mathbb{R}$$ is an eigen-pair of the matrix $$A$$ if

$$Ax=\lambda x$$

without loss of generality, $$\lVert x\rVert =1$$

⇒ $$0 \le x^TAx=x^T(\lambda x)=\lambda x^Tx=\lambda \lVert x\rVert^2=\lambda$$

> ➡️ If $$X\in \mathbb{C}^{n \times k}$$ (conjugate transpose)&#x20;
>
> If $$A$$ non symmetric: $$\frac{1}{2}(A+A^T)$$ is “symmetric part” of $$A$$

3. A is positive definite ↔ A has a Cholesky Decomposition

Make simplifying assumption that

![](https://596692103-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FuVC1Ieh2j1XfxqLWFoSa%2Fuploads%2FBts2QDFHSxyySQhMwobl%2Fimage.png?alt=media\&token=512dff7a-f6bd-4965-a592-893240b9aa24)

**“Block” Gaussian Elimination:**

$$A=\begin{bmatrix}1\&w^T\ w\&K\end{bmatrix}=\underbrace{\begin{bmatrix}1&0\ w\&I\end{bmatrix}}\_{\equiv L}\begin{bmatrix}1\&w^T\ 0\&K-w^T\end{bmatrix}$$

$$\begin{bmatrix}1\&w^T\0\&K-ww^T\end{bmatrix}=\begin{bmatrix}1&0\ 0\&K-ww^T\end{bmatrix}\begin{bmatrix}1\&w^T\ 0\&I\end{bmatrix}$$

$$\begin{aligned}A & = \begin{bmatrix}1&0\ w\&I\end{bmatrix}\begin{bmatrix}1&\ \&K-ww^T\end{bmatrix} \begin{bmatrix}1\&w^T\ 0\&I\end{bmatrix} \ &= L D L^T\end{aligned}$$

($$L^{-1}AL^{-T}=D$$) $$\overset{\text{By Property ①}}{⇒} K-ww^T \gt 0$$

Now, allow $$a\_{11}$$ arbitrary (positive) $$\alpha := \sqrt{a\_{11}}$$

$$A=\underbrace{\begin{bmatrix}\alpha&0\ \frac{w}{\alpha}\&I\end{bmatrix}}*{R\_1^T}\underbrace{\begin{bmatrix}1&0\0\&K-\frac{ww^T}{\alpha}\end{bmatrix}}*{A\_1}\underbrace{\begin{bmatrix}\alpha&\frac{w^T}{\alpha}\ 0\&I\end{bmatrix}}\_{R\_1}$$,

where <img src="https://596692103-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FuVC1Ieh2j1XfxqLWFoSa%2Fuploads%2FqdcIACc4fdIabpgJD21g%2Fimage.png?alt=media&#x26;token=bbe255cd-1fdf-4f96-a1f7-31843eba3062" alt="" data-size="original">

Because $$K-ww^T/\alpha^2$$ is positive definite, it also has the factorization

$$\underbrace{k-ww^T/\alpha^2}\_{(n-1)\times (n-1)}=\bar{R}^T\_2\bar{A}\_2\bar{R}\_2$$

where ![](https://596692103-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FuVC1Ieh2j1XfxqLWFoSa%2Fuploads%2Fb31WQcMhAaMxeRAEqHDO%2Fimage.png?alt=media\&token=3c143460-263c-414f-a6c4-3d341a8f19ac)

Cholesky Decomposition of $$A \gt 0$$

$$A=R^TR$$, $$R$$ is upper triangle

$$\begin{aligned}A =R^T\_1A\_1R\_1 &= R^T\_1\begin{bmatrix}1&0 \ 0&\bar{R}^T\_2\bar{A}*2\bar{R}*2\end{bmatrix}R\_1 \ &=R^T\_1\begin{bmatrix}1&0 \ 0&\bar{R}^T\_2\end{bmatrix}\begin{bmatrix}1& \ &\bar{A}*2\end{bmatrix}\begin{bmatrix}1&0 \ 0&\bar{R}2\end{bmatrix}R\_1 \ &= R^T\_1R^T\_2A\_2R\_2R\_1\ (n-1) & \vdots \ & = \underbrace{R^T\_1R^T\_2\ldots R^T\_n}*{\text{lower triangle}}(I)\underbrace{R\_nR*{n-1}\ldots R\_1}*{\text{upper triangle}}\end{aligned}$$
