Similar matrix

From Wikipedia, the free encyclopedia

In linear algebra, two n-by-n matrices A and B over the field K are called similar if there exists an invertible n-by-n matrix P over K such that

P ⁻¹AP = B.

One of the meanings of the term similarity transformation is such a transformation of a matrix A into a matrix B.

In group theory similarity is called conjugacy.

Similar matrices share many properties: they have the same rank, the same determinant, the same trace, the same eigenvalues (but not necessarily the same eigenvectors), the same characteristic polynomial and the same minimal polynomial. There are two reasons for these facts:

• two similar matrices can be thought of as describing the same linear map, but with respect to different bases
• the map X P⁻¹XP is an automorphism of the associative algebra of all n-by-n matrices

Because of this, for a given matrix A, one is interested in finding a simple "normal form" B which is similar to A -- the study of A then reduces to the study of the simpler matrix B. For example, A is called diagonalizable if it is similar to a diagonal matrix. Not all matrices are diagonalizable, but at least over the complex numbers (or any algebraically closed field), every matrix is similar to a matrix in Jordan form. Another normal form, the rational canonical form, works over any field. By looking at the Jordan forms or rational canonical forms of A and B, one can immediately decide whether A and B are similar.

Similarity of matrices does not depend on the base field: if L is a field containing K as a subfield, and A and B are two matrices over K, then A and B are similar as matrices over K if and only if they are similar as matrices over L. This is quite useful: one may safely enlarge the field K, for instance to get an algebraically closed field; Jordan forms can then be computed over the large field and can be used to determine whether the given matrices are similar over the small field. This approach can be used, for example, to show that every matrix is similar to its transpose.

If in the definition of similarity, the matrix P can be chosen to be a permutation matrix then A and B are permutation-similar; if P can be chosen to be a unitary matrix then A and B are unitarily equivalent. The spectral theorem says that every normal matrix is unitarily equivalent to some diagonal matrix.

Another important equivalence relation for real matrices is congruency.

Two real matrices A and B are called congruent if there is a regular real matrix P such that

P^TAP = B.