12. Singular Value Decomposition#
If we have matrix \(A \in \mathbb{C}^{m\times n}\). Assume that \(\text{rank}(A) = r \le \min{(m, n)}\). The theorem of SVD states that:
Theorem: Singular Value Decomposition
There exists unitary matrices \(U \in \mathbb{C}^{m\times m}\), \(V \in \mathbb{C}^{n \times n}\) such that
With \(V^*\) the complex conjugate transpose of \(V\), \(\Sigma \in \mathbb{R}^{m \times n}\) is a diagonal matrix which has the following form:
With \(\Sigma_r\) a diagonal square matrix with the diagonal entries are the non-zero singular values of \(A\), denotes \(\text{diag}(\sigma_1, \sigma_2, \dots, \sigma_r)\)
From here, we can think more about the structure of \(U, V\). Let us have the following form of the matrices \(U, V\)
With this and the theorem, we can now break down further the decomposition into:
We also have \(U^*U = I_m\), \(V^*V = I_n\), \(U_1^*U_1 = I_r\), \(V_1^*V_1 = I_r\).
From here we have:
Look at the last equation, it has the form of eigenvalues and eigenvectors (\(Av = \lambda v\)). We call that the columns \(u_i\) of \(U_1\) is the left singular vectors of the matrix \(A\).
Similarly, using the same break down, we will have:
We call \(v_i\) the right singular vectors of matrix \(A\).