I recognize this problem as
Cholesky decomposition - Wikipedia
The proof of uniqueness is by construction, and this construction uses the Cholesky-Banachiewicz-Crout algorithm, as it might be called. One must find lower-triangular matrix L for matrix A such that they suffer ## \mathbf{A} = \mathbf{L} \mathbf{L}^T ##. It is easy to show that taking the transpose of both sides yields this equation again. Here is that algorithm, for A having size n*n:
For j = 1 to n do:
$$ L_{jj} = \sqrt{ A_{jj} - \sum_{k=1}^{j-1} L_{jk}^2 } $$
For i = (j+1) to n do:
$$ L_{ij} = \frac{1}{L_{jj}} \left( A_{ij} - \sum_{k=1}^{j-1} L_{ik} L_{jk} \right) $$
Next i
Next j
Each new L component depends only on an A component and on previously-calculated L components, so after one pass, the calculation is complete.
I must also calculate L for
$$ A = \begin{pmatrix} 4 & 2 & 4 & 4 \\ 2 & 10 & 17 & 11 \\ 4 & 17 & 33 & 29 \\ 4 & 11 & 29 & 39 \end{pmatrix} $$
I used Mathematica's CholeskyDecomposition[] function and took the result's transpose, since that function calculates an upper triangular matrix. I then verified that that result is correct. It is
$$ L = \begin{pmatrix} 2 & 0 & 0 & 0 \\ 1 & 3 & 0 & 0 \\ 2 & 5 & 2 & 0 \\ 2 & 3 & 5 & 1 \end{pmatrix} $$