## You are here

Homesimilar matrix

## Primary tabs

# similar matrix

# Definition

A square matrix $A$ is *similar* (or *conjugate*) to a square matrix $B$ if there exists a nonsingular square matrix $S$ such that

$A=S^{{-1}}BS.$ | (1) |

Note that, given $S$ as above, we can define $R=S^{{-1}}$ and have $A=RBR^{{-1}}$. Thus, whether the inverse comes first or last does not matter.

Transformations of the form $S^{{-1}}BS$ (or $SBS^{{-1}}$) are called *similarity transformations*.

# Discussion

Similarity is useful for turning recalcitrant matrices into pliant ones. The canonical example is that a diagonalizable matrix $A$ is similar to the diagonal matrix of its eigenvalues $\Lambda$, with the matrix of its eigenvectors acting as the similarity transformation. That is,

$\displaystyle A$ | $\displaystyle=T\Lambda T^{{-1}}$ | (2) | ||

$\displaystyle=\left[\begin{array}[]{cccc}v_{1}&v_{2}&\ldots&v_{n}\end{array}% \right]\left[\begin{array}[]{ccc}\lambda_{1}&0&\ldots\\ 0&\lambda_{2}&\ldots\\ \vdots&\vdots&\lambda_{n}\end{array}\right]\left[\begin{array}[]{cccc}v_{1}&v_% {2}&\ldots&v_{n}\end{array}\right]^{{-1}}.$ | (3) |

This follows directly from the equation defining eigenvalues and eigenvectors,

$AT=T\Lambda.$ | (4) |

If $A$ is symmetric for example, then through this transformation, we have turned $A$ into the product of two orthogonal matrices and a diagonal matrix. This can be very useful. As an application, see the solution for the normalizing constant of a multidimensional Gaussian integral.

# Properties of similar matrices

1. Similarity is reflexive: All square matrices $A$ are similar to themselves via the similarity transformation $A=I^{{-1}}AI$, where $I$ is the identity matrix with the same dimensions as $A$.

2. Similarity is symmetric: If $A$ is similar to $B$, then $B$ is similar to $A$, as we can define a matrix $R=S^{{-1}}$ and have

$B=R^{{-1}}AR$ (5) 3. Similarity is transitive: If $A$ is similar to $B$, which is similar to $C$, we have

$A=S^{{-1}}BS=S^{{-1}}(R^{{-1}}CR)S=(S^{{-1}}R^{{-1}})C(RS)=(RS)^{{-1}}C(RS).$ (6) 4. Because of 1, 2 and 3, similarity defines an equivalence relation (reflexive, symmetric, and transitive) on square matrices, partitioning the space of such matrices into a disjoint set of equivalence classes.

5. If $A$ is similar to $B$, then their determinants are equal; i.e., $\det A=\det B$. This is easily verified:

$\det A=\det(S^{{-1}}BS)=\det(S^{{-1}})\det B\det S=(\det S)^{{-1}}\det B\det S% =\det B.$ (7) In fact, similar matrices have the same characteristic polynomial, which implies this result directly, the determinant being the constant term of the characteristic polynomial (up to sign).

6. Similar matrices represent the same linear transformation after a change of basis.

7. It can be shown that a matrix $A$ and its transpose $A^{T}$ are always similar.

## Mathematics Subject Classification

15A03*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections

## Comments

## entry can't be seen in html-mode!

I already saw an entry which can't be seen in html mode ('triangular matrix'). I thought it just a problem of that one entry, but now I came to another entry with the same problem. What is it? A new breakdown?

## Re: entry can't be seen in html-mode!

I've rerendered this one and now it displays

if anyother needs rerendering just say it so

f

G -----> H G

p \ /_ ----- ~ f(G)

\ / f ker f

G/ker f