logo

Uniqueness Proof of Cholesky Decomposition 📂Matrix Algebra

Uniqueness Proof of Cholesky Decomposition

Theorem

A>0A>0 has a unique Cholesky decomposition.

Explanation

Eigenvalue diagonalization, Singular value decomposition, Schur decomposition, LU decomposition, LDU decomposition all share the commonality of not being unique. This is because these methods either utilize the relationship between eigenvalues and eigenvectors, or because 1=a1a1 = a \dfrac{1}{a} thus LL or UU can be divided into parts.

However, Cholesky decomposition doesn’t use the concept of eigenvalues and is expressed as A=LLTA=LL^{T}, so 11 can’t be split into two. Elaborating on this intuitive argument in a slightly meticulous and complicated manner immediately completes the proof.

Proof

AA is positive definite, hence an invertible matrix, and there exist a lower triangular matrix LL and diagonal matrix DD satisfying A:=LDLTA:=LDL^{T}.

Multiplying A=LDLTA=LDL^{T} by xT0\mathbf{x}^{T} \ne \mathbb{0} on the left and x\mathbf{x} on the right gives

xTAx=xTLDLTx=(LTx)TD(LTx)>0 \mathbf{x}^{T} A \mathbf{x} = \mathbf{x}^{T} LDL^{T} \mathbf{x} = (L^{T} \mathbf{x})^{T} D (L^{T} \mathbf{x}) >0

Therefore, DD is a positive definite matrix, and since the eigenvalues are all positive, the diagonal elements are all positive.

Thus,

D1/2:=diag(d11,d22,,dnn) D^{ 1/2 } := \text{diag} (\sqrt{d_{11}} , \sqrt{d_{22}} , \cdots , \sqrt{d_{nn}} )

can be defined, and it will be D=D1/2D1/2D = D^{ 1/2 } D^{ 1/2 }.

From A=LDLT=LD1/2D1/2LT A = L D L^{T} = L D^{ 1/2 } D^{ 1/2 } L^{T} ,

defining L:=LD1/2\overline{L} := LD^{ 1/2 } gives

A=LLT A = \overline{L} \overline{L}^{T}

Such a L\overline{L} is unique, thus the Cholesky decomposition is also unique.