ZestCalc

Eigenvalue and Eigenvector Calculator

Find the directions a square matrix only stretches, and by how much, exactly wherever possible. Follow the algebra, then spin a vector until it lines up.

Matrix

Enter a square matrix up to 6×6, or start from an example.

Up to 6 rows and 6 columns.

Use integers, decimals, or fractions such as 1/3. Paste rows from a spreadsheet or a Python list into any cell.

Input

A=[4123]A = \begin{bmatrix} 4 & 1 \\ 2 & 3 \end{bmatrix}

Eigenvalues

Updates as you type.

det⁡(A−λI)=λ2−7λ+10\det(A - \lambda I) = \lambda^{2} - 7\lambda + 10
=(λ−5)(λ−2)= (\lambda - 5)(\lambda - 2)
  • λ1=5\lambda_{1} = 5

    Algebraic multiplicity 1, geometric multiplicity 1

    v=(1, 1)v = \left(1,\ 1\right)
  • λ2=2\lambda_{2} = 2

    Algebraic multiplicity 1, geometric multiplicity 1

    v=(−1, 2)v = \left(-1,\ 2\right)

Check

5+2=tr⁡(A)=75 + 2 = \operatorname{tr}(A) = 7
5⋅2=det⁡(A)=105 \cdot 2 = \det(A) = 10

From the determinant to the eigenvectors

A−λI=[4−λ123−λ]A - \lambda I = \begin{bmatrix} 4 - \lambda & 1 \\ 2 & 3 - \lambda \end{bmatrix}

An eigenvector is a nonzero v with Av=λvv \text{ with } Av = \lambda v, which means (A−λI)v=0(A - \lambda I)v = 0 has a nonzero solution. That only happens when A−λIA - \lambda I has determinant 0.

Step 0 of 5

What eigenvalues and eigenvectors are

A matrix usually turns a vector as well as stretching it. An eigenvector is a nonzero vector that stays on its own line, so the matrix only scales it. That scale is its eigenvalue:

Av=λvAv = \lambda v

A negative eigenvalue flips the vector, and an eigenvalue of 0 flattens it to the origin. Together they describe what a matrix does in the simplest terms it has, one direction at a time.

How to find them

Rewrite the equation as (A−λI)v=0(A - \lambda I)v = 0. A nonzero solution exists only when A−λIA - \lambda I has no inverse, which means its determinant is 0:

det⁡(A−λI)=0\det(A - \lambda I) = 0

Expanding that Determinant Calculator gives the characteristic polynomial, whose roots are the eigenvalues. For each root, solve (A−λI)v=0(A - \lambda I)v = 0 with row reduction to get the eigenvectors. Two checks catch most mistakes: the eigenvalues add up to the trace and multiply to the determinant.

A real matrix can have complex eigenvalues. A rotation is the plain example: it turns every direction, so none stays on its line. Polynomials of degree 5 or more have no general formula, so some eigenvalues can only be approximated. This calculator stays exact as far as it can, and marks anything else with ≈\approx.

Multiplicity and why it matters

An eigenvalue can repeat. Its algebraic multiplicity is how many times it's a root of the polynomial. Its geometric multiplicity is how many independent eigenvectors it has, and that's never more than the algebraic one.

When every eigenvalue has both counts equal, the eigenvectors form a basis, and you can use them as a new set of axes with the Change of Basis Calculator. The matrix is then diagonalizable, which the Matrix Diagonalization Calculator works out, and its Matrix Power Calculator is simple to find, because each direction just scales. A shear like

[2102]\begin{bmatrix} 2 & 1 \\ 0 & 2 \end{bmatrix}

has the eigenvalue 2 twice but only one eigen-direction, so it doesn't have enough eigenvectors for that.