Weight Finding in an Orthonormal Basis
If is an orthonormal basis for a subspace , then any can be written uniquely as . Finding the coefficients (the coordinates of in this basis) normally requires solving a system of equations.
With an orthonormal basis, however, there is no solving needed. Taking the dot product of both sides with collapses all terms to zero except the -th one: . In matrix form, the whole coordinate vector is .
This is the key computational advantage of orthonormal bases: finding coordinates is just a matrix-vector multiplication with , not a linear system solve. The formula says: "multiply by to get coordinates, then multiply by to reconstruct ."
Formal View
Proof: let . Then .
Why This Matters
Coordinate extraction via the transpose is what makes orthonormal bases so computationally powerful.
- Fast Fourier Transform computes dot products with complex exponentials to find Fourier coefficients in
- MRI imaging uses orthonormal wavelets or sines as basis functions and extracts coefficients without solving any systems
- Principal component analysis projects data onto orthonormal principal components via the same formula
Quiz
If has orthonormal columns and , what is ?
For a vector in the column space of (orthonormal columns), the -th coordinate in the -basis is .
Common Mistakes
- Trying to find coordinates by solving as a linear system when an orthonormal basis is available — just compute .
- Applying the weight-finding formula to a vector not in and expecting — this only works if .