Singular Value — Definition, Formula & Examples
A singular value of a matrix is a non-negative number that describes how much the matrix stretches input vectors along a particular direction. Every matrix has singular values, obtained through singular value decomposition (SVD).
The singular values of an matrix are the non-negative square roots of the eigenvalues of (or equivalently ). They are conventionally ordered as , where . In the SVD , these values appear on the diagonal of .
Key Formula
Where:
- = The $i$-th singular value of matrix $A$
- = The $i$-th eigenvalue of $A^T A$
- = An $m \times n$ real matrix
How It Works
To find the singular values of a matrix , you compute , find its eigenvalues, and take their non-negative square roots. The number of nonzero singular values equals the rank of . Larger singular values correspond to directions along which has the greatest stretching effect, while singular values near zero indicate directions that are nearly collapsed. This makes singular values central to understanding the "geometry" of a linear transformation.
Worked Example
Problem: Find the singular values of A = [[3, 0], [0, 2]].
Step 1: Compute the product .
Step 2: Find the eigenvalues of . Since the matrix is diagonal, the eigenvalues are the diagonal entries.
Step 3: Take the square roots to get the singular values.
Answer: The singular values of are and .
Why It Matters
Singular values are essential in data science and engineering. Principal component analysis (PCA) relies on them to reduce high-dimensional datasets, image compression uses low-rank SVD approximations to store images efficiently, and numerical analysts use the ratio (the condition number) to assess whether a linear system is numerically stable to solve.
Common Mistakes
Mistake: Confusing singular values with eigenvalues of itself.
Correction: Singular values are the square roots of the eigenvalues of , not of . Eigenvalues of can be negative or complex, but singular values are always non-negative real numbers.
