Definiteness, Cholesky and generating correlated normals
LA · Chapter 512 min readAsked at Two Sigma, Citadel, Optiver, Akuna
Assumes Eigenvalues, diagonalisation and the spectral theorem.
After this lesson you should be able to
- Test a matrix for positive semi-definiteness three ways.
- Use a Cholesky factor to simulate correlated normals.
- Repair a correlation matrix that is not positive semi-definite.
Positive semi-definiteness is the condition that makes a matrix a legitimate covariance matrix, and the Cholesky factorisation is the practical consequence: it is how you turn independent random numbers into correlated ones, and how you solve a linear system in half the time.
| Test | Statement | Cost |
|---|---|---|
| Quadratic form | for all | A definition, not a procedure |
| Eigenvalues | All | , and gives the most information |
| Cholesky | A factorisation exists | , the fastest test in practice |
Equation 5.2
The Cholesky factorisation
A "square root" of a symmetric positive-definite matrix. Unique, cheap, and the workhorse of simulation and of solving normal equations.
- Lower triangular, so systems involving it solve by substitution in .
- Equals when has identity covariance.
Derivation 5.3
Generating correlated normals
The one-line application, and it is asked constantly.
Draw independent standard normals.
Apply the Cholesky factor.
Example 5.5
Give the Cholesky factor of the correlation matrix with , and the recipe for two correlated standard normals.
Show the worked solutionHide the worked solution
Worked solution
- Formula
- Substitute
- Solve
- Answer
Sanity check. Check the variance: , so is standard. And as required. The two-variable case is worth memorising because it comes up constantly and needs no matrix algebra.
The rest of this lesson is in Premium
You have read the opening. 9 more sections follow, including 3 worked examples and 3 quick checks.
Nothing is charged for 7 days, and you can cancel before then. Or read The law of large numbers and the central limit theorem in full, free.