Rearuh

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

B=P−1AP.{displaystyle B=P^{-1}AP.}

Similar matrices represent the same linear operator under two (possibly) different bases, with P being the change of basis matrix.^[1][2]

A transformation A ↦ P⁻¹AP is called a similarity transformation or conjugation of the matrix A. In the general linear group, similarity is therefore the same as conjugacy, and similar matrices are also called conjugate; however in a given subgroup H of the general linear group, the notion of conjugacy may be more restrictive than similarity, since it requires that P be chosen to lie in H.

Motivating example

When defining a linear transformation, it can be the case that a change of basis can result in a simpler form of the same transformation. For example, the matrix representing a rotation in ℝ³ when the axis of rotation is not aligned with the coordinate axis can be complicated to compute. If the axis of rotation were aligned with the positive z-axis, then it would simply be

S=[cos⁡θ−sin⁡θ0sin⁡θcos⁡θ0001]{displaystyle S={begin{bmatrix}cos theta &-sin theta &0\sin theta &cos theta &0\0&0&1end{bmatrix}}},

where θ{displaystyle theta } is the angle of rotation. In the new coordinate system, the transformation would be written as

y′=Sx′{displaystyle y'=Sx'},

where x' and y' are the original and transformed vectors in a new basis containing a vector parallel to the axis of rotation. In the original basis, the transform would be written as

y=Tx{displaystyle y=Tx},

where vectors x and y and the unknown transform matrix T are in the original basis. To write T in terms of the simpler matrix, we use the change-of-basis matrix P that transforms x and y as x′=Px{displaystyle x'=Px} and y′=Py{displaystyle y'=Py}:

y′=Sx′⇒Py=SPx⇒y=(P−1SP)x=Tx{displaystyle {begin{aligned}&&y'&=Sx'\&Rightarrow &Py&=SPx\&Rightarrow &y&=left(P^{-1}SPright)x=Txend{aligned}}}

Thus, the matrix in the original basis is given by T=P−1SP{displaystyle T=P^{-1}SP}. The transform in the original basis is found to be the product of three easy-to-derive matrices. In effect, the similarity transform operates in three steps: change to a new basis (P), perform the simple transformation (S), and change back to the old basis (P⁻¹).

Properties

Similarity is an equivalence relation on the space of square matrices.

Because matrices are similar if and only if they represent the same linear operator with respect to (possibly) different bases, similar matrices share all properties of their shared underlying operator:

• Rank


• 
  Characteristic polynomial, and attributes that can be derived from it:
  
  
  
  • Determinant
  
  
  • Trace
  
  
  • 
    Eigenvalues, and their algebraic multiplicities
    
  
  
  
  


• 
  Geometric multiplicities of eigenvalues (but not the eigenspaces, which are transformed according to the base change matrix P used).


• Minimal polynomial


• Frobenius normal form


• 
  Jordan normal form, up to a permutation of the Jordan blocks


• Index of nilpotence


• 
  Elementary divisors, which form a complete set of invariants for similarity of matrices over a principal ideal domain
  

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. Neither of these forms is unique (diagonal entries or Jordan blocks may be permuted) so they are not really normal forms; moreover their determination depends on being able to factor the minimal or characteristic polynomial of A (equivalently to find its eigenvalues). The rational canonical form does not have these drawbacks: it exists over any field, is truly unique, and it can be computed using only arithmetic operations in the field; A and B are similar if and only if they have the same rational canonical form. The rational canonical form is determined by the elementary divisors of A; these can be immediately read off from a matrix in Jordan form, but they can also be determined directly for any matrix by computing the Smith normal form, over the ring of polynomials, of the matrix (with polynomial entries) XI_n − A (the same one whose determinant defines the characteristic polynomial). Note that this Smith normal form is not a normal form of A itself; moreover it is not similar to XI_n − A either, but obtained from the latter by left and right multiplications by different invertible matrices (with polynomial entries).

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 so because the rational canonical form over K is also the rational canonical form over L. This means that one may use Jordan forms that only exist over a larger field to determine whether the given matrices are similar.

In the definition of similarity, if 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. Specht's theorem states that two matrices are unitarily equivalent if and only if they satisfy certain trace equalities.

See also

• Canonical forms


• Matrix congruence


• Matrix equivalence

Notes

References

• 
  Beauregard, Raymond A.; Fraleigh, John B. (1973), A First Course In Linear Algebra: with Optional Introduction to Groups, Rings, and Fields, Boston: Houghton Mifflin Co., ISBN 0-395-14017-X.mw-parser-output cite.citation{font-style:inherit}.mw-parser-output .citation q{quotes:"""""""'""'"}.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-maint{display:none;color:#33aa33;margin-left:0.3em}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}
  


• 
  Bronson, Richard (1970), Matrix Methods: An Introduction, New York: Academic Press, LCCN 70097490
  


• Horn and Johnson, Matrix Analysis, Cambridge University Press, 1985.
  ISBN 0-521-38632-2. (Similarity is discussed many places, starting at page 44.)