Courses / Mathematics I
Linear Algebra

Inner Product Spaces and Orthogonality

The dot product of Unit 3 gave R^n its geometry — lengths and angles.

Mathematics I 365 words Free to read

Length and Angle in Abstract Spaces

The dot product of Unit 3 gave Rn\mathbb{R}^n its geometry — lengths and angles. An inner product u,v\langle u, v \rangle generalizes this to any vector space, including spaces of functions. It must be symmetric, linear in each argument, and positive definite (v,v>0\langle v, v \rangle > 0 for v0v \neq \mathbf{0}). From it come the norm v=v,v\|v\| = \sqrt{\langle v, v \rangle} (length) and the angle via cosθ=u,vuv\cos\theta = \frac{\langle u, v \rangle}{\|u\|\,\|v\|}. This closes the unit by returning geometry to abstract spaces.

Two vectors are orthogonal when u,v=0\langle u, v \rangle = 0 — 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 ii-th coordinate of vv is just v,ei\langle v, e_i \rangle (no system to solve).

Orthogonal projection finds the closest point in a subspace to a given vector. The projection of vv onto a subspace WW is the vector in WW nearest to vv, and the error vprojWvv - \operatorname{proj}_W v is orthogonal to all of WW. This is the geometric heart of least-squares approximation: when a system Ax=bA\mathbf{x} = \mathbf{b} has no exact solution, the least-squares solution projects b\mathbf{b} 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 WW finds the nearest vector in WW, with the residual vprojWvv - \operatorname{proj}_W v orthogonal to WW — it is a specific geometric construction, not mere truncation. And coordinates are trivial (v,ei\langle v, e_i \rangle) only in an orthonormal basis; in a general basis you must solve a linear system.

Practise this lesson

The explanation above is free to read. The graded practice for this lesson lives in the Tryals app.

11practice questions
2interactive scenes
Start Mathematics I free

Linear Algebra