The claim that (the spectral decomposition used in eigenportfolio construction) rests on three non-obvious facts: that a symmetric matrix always has real eigenvalues, that its eigenvectors can be chosen orthonormal, and that there is a finite such that the first eigenportfolios capture any desired fraction of total variance. Without these facts the eigenportfolio framework has no foundation — why would eigenvectors, which are defined algebraically, also be variance-maximising portfolios?
This derivation note proves the spectral theorem for symmetric matrices, derives the equivalence of PCA directions with variance maximisers (via Lagrangian optimisation), and constructs the eigenportfolio returns from the eigenvector weights. It is the algebraic supplement to PCA eigenportfolios as statistical risk factors.
In this lesson
-
- The eigenvalue problem
-
- Variance maximisation: the PCA motivation
-
- Eigenportfolio construction algorithm
Before you start
The full lesson, with worked examples and exercise solutions, is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or browse the Statistical Arbitrage syllabus.