LINEAR-ALGEBRA · Interactive Practice | Unit 28 · Video 2
| Formula | Meaning |
|---|---|
| The SVD decomposition | |
| Symmetric eigendecomposition; columns of are eigenvectors | |
| Symmetric eigendecomposition; columns of are eigenvectors | |
| Recover from to lock signs |
The singular values satisfy , where are the eigenvalues of .
Forming from collapses it to — every trace of disappears.
and have different sizes, yet share every nonzero eigenvalue — each one equals a .
Eigenvectors carry a sign ambiguity; deriving locks 's signs to .
Test your understanding of the shortcut.
Question 1
When we form starting from , which property of causes it to "disappear" from the expression?
✅ Correct! Orthogonality of collapses the inner product to the identity.
❌ Not quite. The cancellation requires , which holds because is orthogonal.
Solution:
The middle factor is . Because is orthogonal, , and the expression collapses to:
vanishes entirely. The fact that is square or that has a particular shape is not what makes the cancellation work — orthogonality is.
Question 2
Suppose has eigenvalues . What are the singular values of ?
✅ Correct! .
❌ Not quite. Singular values are the square roots of the eigenvalues of , and zero is included.
Solution:
The singular values are the square roots of the eigenvalues of :
So , , and .
Zero is a valid singular value — it indicates that has a non-trivial null space. A common mistake is to forget the square root and report the eigenvalues themselves.
Question 3
Let be a matrix. Which of the following is true about the eigenvalues of and ?
✅ Correct! The larger matrix carries the extra zeros.
❌ Not quite. Nonzero eigenvalues are shared. The bigger matrix ( here) carries the extra zeros.
Solution:
is and is . The general fact and share their nonzero eigenvalues tells us both matrices have the same nonzero eigenvalues — these are (at most of them).
The larger matrix, (), simply carries extra zeros. It has additional zero eigenvalues compared to .
Question 4
True or False: After computing from the eigendecomposition of , the safest way to obtain is to independently compute the eigendecomposition of .
✅ Correct! Independent computation risks sign disagreements; instead use .
❌ Not quite. Independent computation can break the sign convention. The safe recovery is .
Solution: False.
Eigenvectors are only defined up to a sign. Computing and independently can produce sign mismatches: and might end up "pointing the wrong way" relative to each other, breaking .
The fix is to compute first, then derive from using:
This locks the sign of to the choice made for , guaranteeing the reconstruction equals exactly.
Solved: 0 / 4