Length and Angle in Abstract Spaces
The dot product of Unit 3 gave its geometry — lengths and angles. An inner product generalizes this to any vector space, including spaces of functions. It must be symmetric, linear in each argument, and positive definite ( for ). From it come the norm (length) and the angle via . This closes the unit by returning geometry to abstract spaces.
Two vectors are orthogonal when — the generalized perpendicularity. A set of mutually orthogonal nonzero vectors is automatically linearly independent, so orthogonal sets make especially convenient bases. An orthonormal basis is orthogonal and each vector has length 1; in such a basis, coordinates are trivial to compute — the -th coordinate of is just (no system to solve).
Orthogonal projection finds the closest point in a subspace to a given vector. The projection of onto a subspace is the vector in nearest to , and the error is orthogonal to all of . This is the geometric heart of least-squares approximation: when a system has no exact solution, the least-squares solution projects onto the column space, giving the best approximate fit — the foundation of data fitting and regression.
The Gram–Schmidt process turns any basis into an orthonormal one, systematically subtracting off components along the vectors already chosen. Orthonormal bases and projections make computation clean and are central to Fourier analysis, least squares, and much of applied mathematics — a fitting close to the linear-algebra unit.
Common pitfall: assuming an orthogonal projection is just "drop the extra coordinates," or that any set of vectors gives easy coordinates. Projection onto a subspace finds the nearest vector in , with the residual orthogonal to — it is a specific geometric construction, not mere truncation. And coordinates are trivial () only in an orthonormal basis; in a general basis you must solve a linear system.