9. Eigenvectors and Eigenvalues
2026-03-30
Eigenvectors and Eigenvalues (特征向量和特征值)
Definition
An eigenvector of an n×n matrix A is a nonzero vector x such that Ax=λx for some scalar λ. The scalar λ is called the eigenvalue corresponding to the eigenvector x.
Eigenvectors must be nonzero, while eigenvalues can be zero.
The set of all eigenvectors corresponding to the eigenvalue λ is the eigenspace of A corresponding to λ.
Finding Eigenvectors corresponding to an Eigenvalue
Let λ be an eigenvalue of an n×n matrix A. Then Ax=λx is equivalent to (A−λIn)x=0. As a result, the eigenvectors corresponding to λ are nontrivial solutions to the equation (A−λIn)x=0.
A scalar λ is an eigenvalue of an n×n matrix A if and only if det(A−λIn)=0, which is called the characteristic equation (特征方程) of A.
Similarity (相似)
If A and B are n×n matrices, then A is similar to B if there exists an invertible matrix P such that A=P−1BP.
If A is similar to B, then A and B have the same characteristic polynomial, and thus the same eigenvalues with the same multiplicities. However, they may have different eigenvectors.
Diagonalization (对角化)
An n×n matrix A is diagonal (对角矩阵) if all of its entries outside the main diagonal are zero.
A square matrix A is diagonalizable (可对角化) if A is similar to a diagonal matrix, i.e., if A=PDP−1 for some diagonal matrix D and some invertible matrix P.
It can be proved that (and maybe I will prove it here in the future):
P=[v1v2⋯vn]D=λ10⋮00λ2⋮0⋯⋯⋱⋯00⋮λn
where v1,v2,…,vn are linearly independent eigenvectors of A and λ1,λ2,…,λn are the corresponding eigenvalues.