Skip to content
Linear Algebra, Optimisation and Numerical Methods / Inner Product Spaces and Orthogonality

Orthogonal Projections and Minimization Problems

This closing note of Topic 1 answers a question every earlier result in the topic has been building toward: given a subspace UU and a vector v\mathbf{v} not in it, what is the closest point of UU to v\mathbf{v}? The answer — the orthogonal projection PUvP_U\mathbf{v} — is constructed directly from an orthonormal basis of UU (Corollary 1 of the previous note guarantees one always exists), and the closest-point property is not a side benefit — it is the reason orthogonal projection is the universal mechanism behind least-squares regression, developed fully in the next topic.
Learning objectives. By the end of this note you should be able to:
  • construct the orthogonal projection onto a subspace given an orthonormal basis for it;
  • prove that the projection is the unique closest point in the subspace;
  • decompose any vector into its projection plus an orthogonal remainder;
  • state the projection formula as a matrix and recognise it as idempotent.

In this lesson

  1. Orthogonal complement and projection
  2. The minimisation property

Before you start

The full lesson, with worked examples and exercise solutions, is for members.

Read the full lesson

New to SelfMadeQuant.com? See membership options or browse the Linear Algebra, Optimisation and Numerical Methods syllabus.