Orthogonality
When vectors are perpendicular — dot product zero — and orthogonal projections, the foundation of least squares and QR decomposition.
Two vectors and are orthogonal if their dot product is zero: .
This generalizes the notion of "perpendicular" from geometry to any dimension.
An orthogonal set is a set of vectors where every pair is orthogonal. If each vector also has unit length, the set is orthonormal: (1 if , 0 otherwise).
Orthogonal matrices: a square matrix with orthonormal columns. This implies , so .
- The zero vector is orthogonal to every vector (vacuously, )
- An orthogonal set of nonzero vectors is automatically linearly independent
- Orthogonal matrices have determinant (rotations: , reflections: )
- The inverse of an orthogonal matrix is just its transpose — no computation needed
- Confusing orthogonal with orthonormal: orthogonal only requires zero dot products; orthonormal additionally requires unit length — specifically needs orthonormal columns, not merely orthogonal ones
- Assuming any matrix with is orthogonal: determinant is necessary but not sufficient — shears can also have determinant 1 without being orthogonal
The standard basis vectors , , form an orthonormal set: .
The identity matrix has these as columns — it's trivially orthogonal.
Verify that is an orthogonal matrix.
Solution
. ✓
Columns and have unit length and are perpendicular. This matrix represents a 45° rotation.