TOPICS
Search

Eigen Decomposition


An eigen decomposition is a matrix decomposition of a square matrix A in terms of its eigenvalues and eigenvectors. It is also called "matrix diagonalization." However, this moniker is less than optimal, since the process being described is really the decomposition of a matrix into a product of three other matrices, only one of which is diagonal, and also because all other standard types of matrix decomposition use the term "decomposition" in their names, e.g., Cholesky decomposition, Hessenberg decomposition, and so on. As a result, the decomposition of a matrix into matrices composed of its eigenvectors and eigenvalues is called eigen decomposition in this work.

Assume A is a k×k matrix over a field F and has a vector basis of eigenvectors X_1, X_2, ..., X_k, with corresponding eigenvalues lambda_1, lambda_2, ..., lambda_k. The eigenvalues need not be distinct. The existence of such a vector basis, rather than merely knowing the eigenvalues, is the condition for A to be a diagonalizable matrix over F (Axler 2024, p. 165). The eigenvectors can be denoted

 [x_(11); x_(12); |; x_(1k)],[x_(21); x_(22); |; x_(2k)],...[x_(k1); x_(k2); |; x_(kk)].
(1)

Define the matrices composed of eigenvectors

P=[X_1 X_2 ... X_k]
(2)
=[x_(11) x_(21) ... x_(k1); x_(12) x_(22) ... x_(k2); | | ... |; x_(1k) x_(2k) ... x_(kk)]
(3)

and eigenvalues

 D=[lambda_1 0 ... 0; 0 lambda_2 ... 0; | | ... |; 0 0 ... lambda_k],
(4)

where D is a diagonal matrix. Then

AP=A[X_1 X_2 ... X_k]
(5)
=[AX_1 AX_2 ... AX_k]
(6)
=[lambda_1X_1 lambda_2X_2 ... lambda_kX_k]
(7)
=[lambda_1x_(11) lambda_2x_(21) ... lambda_kx_(k1); lambda_1x_(12) lambda_2x_(22) ... lambda_kx_(k2); | | ... |; lambda_1x_(1k) lambda_2x_(2k) ... lambda_kx_(kk)]
(8)
=[x_(11) x_(21) ... x_(k1); x_(12) x_(22) ... x_(k2); | | ... |; x_(1k) x_(2k) ... x_(kk)][lambda_1 0 ... 0; 0 lambda_2 ... 0; | | ... |; 0 0 ... lambda_k]
(9)
=PD,
(10)

giving the amazing decomposition of A into a similarity transformation involving P and D,

 A=PDP^(-1).
(11)

The fact that this decomposition is possible for a square matrix A whenever P is nonsingular is known in this work as the eigen decomposition theorem.

Furthermore, squaring both sides of equation (11) gives

A^2=(PDP^(-1))(PDP^(-1))
(12)
=PD(P^(-1)P)DP^(-1)
(13)
=PD^2P^(-1).
(14)

By induction, it follows that for general positive integer powers,

 A^n=PD^nP^(-1).
(15)

If A is a nonsingular matrix, its inverse is

A^(-1)=(PDP^(-1))^(-1)
(16)
=PD^(-1)P^(-1),
(17)

where the inverse of the diagonal matrix D is trivially given by

 D^(-1)=[lambda_1^(-1) 0 ... 0; 0 lambda_2^(-1) ... 0; | | ... |; 0 0 ... lambda_k^(-1)].
(18)

Under this nonsingular matrix hypothesis, equation (15) also holds for negative n.

For real matrices or complex matrices, a further result follows from the definition of the matrix exponential

e^(A)=sum_(n=0)^(infty)(A^n)/(n!)
(19)
=sum_(n=0)^(infty)(PD^nP^(-1))/(n!)
(20)
=P(sum_(n=0)^(infty)(D^n)/(n!))P^(-1)
(21)
=Pe^(D)P^(-1).
(22)

This is true since D is a diagonal matrix and

e^(D)=sum_(n=0)^(infty)(D^n)/(n!)
(23)
=sum_(n=0)^(infty)1/(n!)[lambda_1^n 0 ... 0; 0 lambda_2^n ... 0; | | ... |; 0 0 ... lambda_k^n]
(24)
=[sum_(n=0)^(infty)(lambda_1^n)/(n!) 0 ... 0; 0 sum_(n=0)^(infty)(lambda_2^n)/(n!) ... 0; | | ... |; 0 0 ... sum_(n=0)^(infty)(lambda_k^n)/(n!)]
(25)
=[e^(lambda_1) 0 ... 0; 0 e^(lambda_2) ... 0; | | ... |; 0 0 ... e^(lambda_k)],
(26)

so e^(A) can be found using D.


See also

Diagonalizable Matrix, Eigen Decomposition Theorem, Eigenvalue, Eigenvector, Matrix Decomposition, Singular Value Decomposition

Explore with Wolfram|Alpha

References

Arfken, G. "Diagonalization of Matrices." §4.6 in Mathematical Methods for Physicists, 3rd ed. Orlando, FL: Academic Press, pp. 217-229, 1985.Axler, S. Linear Algebra Done Right, 4th ed. Cham, Switzerland: Springer, 2024. https://doi.org/10.1007/978-3-031-41026-0. https://linear.axler.net/LADR4e.pdf.

Referenced on Wolfram|Alpha

Eigen Decomposition

Cite this as:

Weisstein, Eric W. "Eigen Decomposition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EigenDecomposition.html

Subject classifications