Skip to content
Linear Algebra, Optimisation and Numerical Methods / Positive Definite Matrices, Quadratic Forms, and Quadrics

Positive (Semi-)Definite Matrices: Equivalent Characterisations

Every symmetric matrix diagonalises with real eigenvalues, unconditionally, by Corollary 1 of the spectral-theorem note. This note studies the refinement that matters most in practice: what if those real eigenvalues are further guaranteed non-negative, or strictly positive? This single sign condition — positive semi-definiteness or positive definiteness — turns out to have (at least) five equivalent faces, proved here, each the natural test to reach for in a different situation.
Learning objectives. By the end of this note you should be able to:
  • state the definition of a positive (semi-)definite operator/matrix;
  • prove the equivalence between the eigenvalue test and the quadratic-form test;
  • prove that S∗SS^*S is always positive semi-definite, for any SS;
  • recognise why a covariance matrix is always positive semi-definite.

In this lesson

  1. Definition and the equivalence theorem

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.