Similarity

students, imagine two different-looking maps of the same city 🗺️. One map may be rotated, stretched, or drawn in a different style, but it still represents the same city. In linear algebra, similarity is a way to describe matrices that look different but represent the same linear transformation in different coordinate systems.

In this lesson, you will learn:

• what similar matrices are and why they matter,
• how to recognize and use the similarity relationship,
• how similarity connects to diagonalization,
• and why similarity is useful in dynamical systems.

By the end, you should be able to explain similarity clearly, use it in matrix problems, and understand why it is one of the most important ideas in diagonalization and dynamical systems.

What Similarity Means

Two square matrices $A$ and $B$ are similar if there exists an invertible matrix $P$ such that

$$B=P^{-1}AP.$$

This equation is the heart of the topic. It says that $A$ and $B$ are related by a change of basis. They are not necessarily the same matrix, but they represent the same linear transformation when measured in different coordinate systems.

Think of a basketball court 🏀. If you describe a player’s location using feet from one corner, you get one set of coordinates. If you change your reference point, the coordinates change, but the player has not moved. Similar matrices work the same way: the underlying transformation stays the same, but the matrix description changes.

A key idea is that similarity only makes sense for square matrices of the same size. If $A$ is an $n \times n$ matrix and $P$ is an invertible $n \times n$ matrix, then $P^{-1}AP$ is also an $n \times n$ matrix.

Why the formula matters

The formula $B=P^{-1}AP$ means that $A$ and $B$ are connected by three steps:

1. use $P$ to change coordinates,
2. apply the transformation $A$,
3. use $P^{-1}$ to return to the original coordinate system.

So similarity is not random algebra. It is the mathematical language of changing how we describe a transformation.

Similarity as a Change of Basis

To understand similarity, students, it helps to know what a basis is. A basis is a set of vectors used to describe all vectors in a space. For example, the standard basis in $\mathbb{R}^2$ is

$$e_1=\begin{bmatrix}1\\0\end{bmatrix}, \quad e_2=\begin{bmatrix}0\\1\end{bmatrix}.$$

If we choose a different basis, the coordinates of vectors change. A linear transformation also gets a new matrix representation in that basis.

Suppose a linear transformation $T$ has matrix $A$ in one basis, and matrix $B$ in another basis. Then those matrices are similar. The matrix $P$ is the change-of-basis matrix that converts coordinates from one basis to the other.

This means similarity is not just about formulas. It is about describing the same motion, stretching, rotation, or shear in different coordinate systems. That is why the topic belongs in diagonalization and dynamical systems: it helps simplify complicated transformations.

A small example

Let

$$A=\begin{bmatrix}2 & 1\\0 & 3\end{bmatrix}.$$

This matrix is upper triangular. It stretches space differently in different directions and also mixes coordinates a little because of the $1$ in the upper-right corner.

If we can find an invertible matrix $P$ such that $P^{-1}AP$ is diagonal, then $A$ is similar to a diagonal matrix. That diagonal form is easier to understand because diagonal matrices act independently on each coordinate.

Important Properties of Similar Matrices

Similar matrices share many important features. These facts are extremely useful because they let us learn about a matrix by looking at a simpler similar matrix.

1. Same determinant

If $A$ and $B$ are similar, then

$$\det(B)=\det(A).$$

This happens because

$$\det(P^{-1}AP)=\det(P^{-1})\det(A)\det(P)=\det(A).$$

2. Same trace

If $A$ and $B$ are similar, then they have the same trace:

$$\operatorname{tr}(B)=\operatorname{tr}(A).$$

The trace is the sum of the diagonal entries. For similar matrices, this value is preserved.

3. Same eigenvalues

Similar matrices have the same eigenvalues, including algebraic multiplicities. This is one of the most important facts in the subject.

If $A$ and $B$ are similar, then they satisfy the same characteristic polynomial:

$$\det(A-\lambda I)=\det(B-\lambda I).$$

So similarity preserves the spectral information of a matrix.

4. Same diagonalizability status

If one matrix in a similarity class is diagonalizable, then every similar matrix is diagonalizable too. This is because diagonalizability depends on whether the matrix can be written in a basis of eigenvectors, and similarity changes the basis but not the underlying transformation.

Similarity and Diagonalization

Diagonalization is one of the biggest reasons similarity matters. A matrix $A$ is diagonalizable if it is similar to a diagonal matrix $D$:

$$A=PDP^{-1}.$$

This is the same as saying

$$P^{-1}AP=D.$$

The diagonal matrix $D$ is much easier to use than $A$ because powers of diagonal matrices are simple:

$$D^k=\begin{bmatrix}d_1^k & 0\\0 & d_2^k\end{bmatrix}$$

for a $2 \times 2$ diagonal matrix with diagonal entries $d_1$ and $d_2$.

This is powerful when studying repeated actions, such as applying the same linear transformation many times.

Why diagonalization helps

Suppose a system evolves by the rule

$$x_{n+1}=Ax_n.$$

Then after $n$ steps,

$$x_n=A^n x_0.$$

If $A$ is diagonalizable, then

$$A=PDP^{-1},$$

so

$$A^n=PD^nP^{-1}.$$

This makes computation much easier because $D^n$ is simple to calculate.

That is why similarity is essential: it allows us to replace a hard matrix with an easier similar one without changing the underlying transformation.

Example of diagonalization

Let

$$A=\begin{bmatrix}4 & 1\\0 & 2\end{bmatrix}.$$

Its eigenvalues are $4$ and $2$, which are different. A $2 \times 2$ matrix with two distinct eigenvalues is diagonalizable. So there exists an invertible matrix $P$ such that

$$P^{-1}AP=\begin{bmatrix}4 & 0\\0 & 2\end{bmatrix}.$$

Now the behavior of the transformation is clearer. One direction is multiplied by $4$ and another by $2$. The similar diagonal matrix shows the action directly.

Similarity in Dynamical Systems

In a discrete dynamical system, a matrix often describes how a state changes over time:

$$x_{n+1}=Ax_n.$$

If $A$ is similar to a simpler matrix $B$, then studying $B$ can reveal how the system behaves.

For example, if $A$ is similar to a diagonal matrix with entries $\lambda_1$ and $\lambda_2$, then the long-term behavior depends on the magnitudes of those eigenvalues.

• If $|\lambda|>1$, that direction grows.
• If $|\lambda|<1$, that direction shrinks.
• If $|\lambda|=1$, the behavior may stay bounded or oscillate, depending on the matrix.

This is useful in areas like population models, economics, and computer graphics 🎮. The matrix may be complicated in standard coordinates, but similarity helps reveal the essential growth and decay patterns.

Real-world interpretation

Imagine a two-species population model where one species affects the other. The matrix describing the system may mix the populations together. After a change of basis, the same system may separate into simpler directions that each evolve independently. Similarity helps uncover those hidden independent behaviors.

How to Check Similarity in Practice

To show that two matrices are similar, a common strategy is to find an invertible matrix $P$ such that

$$B=P^{-1}AP.$$

There are also helpful checks:

• Compare traces and determinants.
• Compare characteristic polynomials.
• Compare eigenvalues.
• Check whether both matrices have the same Jordan form, when studied later.

However, having the same trace, determinant, or eigenvalues alone does not always guarantee similarity. These are necessary conditions, but not always sufficient.

A warning example

Two matrices can have the same eigenvalues but still fail to be similar if their eigenspaces have different dimensions. For instance, one matrix may be diagonalizable while another with the same eigenvalues may not be. So students, always remember that similarity is stronger than just sharing eigenvalues.

Why Similarity Is Important

Similarity is important because it preserves the true nature of a linear transformation while letting us choose the best coordinate system. That makes hard problems easier.

In diagonalization, similarity turns a matrix into a diagonal one whenever possible. In dynamical systems, similarity helps us understand repeated behavior over time. In both settings, the idea is the same: simplify the matrix without changing the transformation it represents.

This is a major reason linear algebra is so useful. Many complicated systems become understandable when viewed through a better basis.

Conclusion

Similarity is one of the central ideas in linear algebra because it describes when two matrices represent the same linear transformation in different coordinate systems. The formula $B=P^{-1}AP$ captures this change of basis. Similar matrices have the same determinant, trace, eigenvalues, and diagonalizability properties. They are especially important in diagonalization, where the goal is often to find a diagonal matrix similar to the original one. In dynamical systems, similarity helps us study repeated transformations more clearly and predict long-term behavior. Once you understand similarity, students, you have a powerful tool for simplifying and interpreting linear transformations.

Study Notes

• Similar matrices satisfy $B=P^{-1}AP$ for an invertible matrix $P$.
• Similarity means two matrices represent the same linear transformation in different bases.
• Similar matrices have the same determinant, trace, and eigenvalues.
• Similarity preserves whether a matrix is diagonalizable.
• A matrix is diagonalizable if it is similar to a diagonal matrix: $A=PDP^{-1}$.
• Diagonalization makes powers of matrices easier to compute because $A^n=PD^nP^{-1}$.
• In dynamical systems, similarity helps analyze repeated updates like $x_{n+1}=Ax_n$.
• Same eigenvalues do not always mean similar matrices; more information is needed.
• Similarity is a change of coordinates, not a change in the underlying transformation.