Eigen Value Decomposition

Solution of the below equation gives the eigenvalues and eigenvectors.

Ax=λxAx = \lambda x

Eigenvectors are basically the vectors which only scale under the transformation AAwhere the scale is given by λ\lambda.

Let AAbe matrix of dimension n×nn \times n. And let it have all the real eigenvalues and eigenvectors i.e nneigenvalues and eigenvectors. Then we will following equations.

Axi=λixi∀iAx_i = \lambda_i x_i \forall i

Basically we get nn equations with xix_ibeing eigenvectors, now we should we able to represent all the nnindividual equations using one matrix equation. You can see that all the equations can be combined as

A[x1,x2,...,xn]=[λ1x1,λ2x2,....λnxn]=[x1,x2,...,xn]diag(λ1,λ2,...,λn)A[x_1, x_2, ..., x_n] = [\lambda_1 x_1, \lambda_2 x_2, .... \lambda_n x_n] \\ = [x_1, x_2, ..., x_n] \text{diag}(\lambda_1, \lambda_2, ..., \lambda_n)

where [x1,x2,...,xn][x_1, x_2, ..., x_n]is essentially a matrix with vector x1,x2,...,xnx_1, x_2, ..., x_nas its columns.

Let's represent [x1,x2,...,xn][x_1, x_2, ..., x_n]as VVi.e V=[x1,x2,...,xn]V = [x_1, x_2, ..., x_n]. Then we can write

AV=Vdiag(λ1,λ2,λn)A=Vdiag(λ1,λ2,...,λn)V−1AV = V\text{diag}(\lambda_1, \lambda_2, \lambda_n) \\ A = V\text{diag}(\lambda_1, \lambda_2, ..., \lambda_n)V^{-1}

Where VVis the matrix made by eigenvectors as columns of VVand diag(λ1,λ2,...,λn){diag}(\lambda_1, \lambda_2, ..., \lambda_n)is the diagonal matrix with eigenvalues as diagonal elements.

This is eigenvalue decomposition.

Real-Symmetric Matrix

Now if the matrix AAis real-symmetric matrix, the eigenvectors are actually orthogonal. Then we represent the decomposition as

A=QΛQTA = Q\Lambda Q^T

Where QQis an orthogonal matrix formed by orthogonal eigenvectors.

Use of Eigenvalues

  • Matrix is singular if and only if any of it's eigenvalues are zero.

  • If AAis real-symmetrix then solution of f(x)=xTAxf(x)= x^T Ax subject to ∣∣x∣∣2=1||x||_2 = 1. Here is xxis an eigenvector then f(x)f(x)is corresponding eigenvalue. The minimum and maximum value of f(x)f(x)is simply minimum and maximum eigenvalue.

  • If all eigenvalues are positive then the matrix is positive-definite. Similary about positive-semidefinite, etc.

  • A2=AA=XΛX−1XΛX−1=XΛ2X−1A^2 = AA=X\Lambda X^{-1}X\Lambda X^{-1} = X\Lambda^2 X^{-1}

Last updated