For AI agents: use /llms.txt for the Nakafa content index.
In linear algebra, matrix similarity explains how two different matrices can represent the same linear transformation in different bases. The entries change with the coordinates, but the underlying transformation does not.
Two matrices are said to be similar if there exists an invertible matrix such that:
The matrix is the change-of-basis matrix connecting the two representations.
Similar matrices represent the same linear transformation in two different bases. Let be the canonical basis and be another basis of .
If is an invertible matrix with columns :
Then we have or for . The matrix represents the basis transformation.
A vector can be expressed in the canonical basis through coordinates and in the basis through coordinates :
The matrix represents the coordinate transformation.
For the linear transformation , the canonical basis expresses with coordinates . The basis expresses the same vector with coordinates :
The calculation gives:
The same coordinate relation can be written as follows.
In the basis , the linear transformation is represented by with the matrix:
Similar matrices represent one linear transformation with respect to different bases of .
Let
The same transformation in the basis formed by the columns of has the matrix
Although the entries differ, both matrices have characteristic polynomial , trace , and determinant .
Because similar matrices describe the same transformation in different coordinates, they preserve its basis-independent properties. They have the same characteristic polynomial, determinant, trace, rank, eigenvalues with algebraic multiplicity, minimal polynomial, and Jordan block sizes.
They do not necessarily have the same entries, eigenvector coordinates, Euclidean norm, symmetry, or orthogonality. Those properties can depend on the chosen basis. A unitary or orthogonal change of basis preserves more geometric structure than a general similarity transformation.
| Preserved by similarity | Not generally preserved |
|---|---|
| Characteristic and minimal polynomials | Matrix entries |
| Eigenvalues and Jordan block sizes | Coordinate vectors of eigenvectors |
| Determinant, trace, and rank | Euclidean norm and symmetry |
For the determinant, we can show:
Since , then:
If is an eigenvector of with eigenvalue , such that , then is an eigenvector of with the same eigenvalue:
Matrix similarity preserves the spectrum. When the basis changes, the eigenvector coordinates change from to , but both coordinate vectors represent the same geometric direction.
Published: . Updated: .