Linear Algebra & Optimization
Intermediate
7 min

Orthogonality & Projections

Projecting a vector onto a subspace finds the closest point in that subspace — the geometric heart of least squares and hedging.

1. The idea

The projection of onto the line spanned by is , the point on that line closest to in Euclidean distance. The residual is orthogonal to .

This generalizes to projecting onto any subspace, e.g. the column space of a matrix : the least-squares fit is exactly the projection of onto that column space, with .

Projection matrices satisfy (idempotent) and (symmetric, for orthogonal projections), which is a quick way to recognize or verify one.

2. Why it matters

Regression, hedge-ratio computation and best linear approximations are all orthogonal projections, making this one of the most frequently reused ideas in quant interviews.

3. Core mathematics

Projection onto a vector

Projection onto column space

Idempotent property

Orthogonal residual

4. How to recognize it

Think of this when…

  • Least squares regression or 'best linear approximation'
  • Finding the minimum-variance hedge or closest point in a subspace
  • Decomposing a vector into parallel and orthogonal components

5. Worked example

Worked example

Project onto , then find the residual.

  1. 1

    Apply the projection formula.

  2. 2

    Compute the residual.

  3. 3

    Check orthogonality: .

  4. Answer: Projection = (4,0), residual = (0,2), orthogonal to a

6. Common mistakes

  • Dividing by instead of in the projection formula
  • Forgetting that projection matrices are idempotent, not their own inverse
  • Projecting onto the wrong subspace (row space vs. column space)

7. Quick check

A projection matrix always satisfies:

The residual is:

8. Practice

4 QuantSolve questions use this concept.

Practice this concept

9. Related methods

This lesson is conceptual; see the topic hub for methods.