Similar Matrices — Definition, Formula & Examples
Similar matrices are square matrices and where for some invertible matrix . They represent the same linear transformation but expressed in different bases.
Two matrices and are similar if there exists an invertible matrix such that . Similarity is an equivalence relation on the set of matrices: it is reflexive, symmetric, and transitive. Similar matrices share the same eigenvalues, determinant, trace, rank, and characteristic polynomial.
Key Formula
Where:
- = An $n \times n$ matrix
- = An $n \times n$ matrix similar to $A$
- = An invertible $n \times n$ matrix (the change-of-basis matrix)
How It Works
To show two matrices are similar, you need to find an invertible matrix that conjugates one into the other. In practice, you often check necessary conditions first: if and have different eigenvalues, traces, or determinants, they cannot be similar. If those match, you attempt to find by solving for the columns of . Diagonalization is a special case — when you diagonalize into , you are showing is similar to a diagonal matrix .
Worked Example
Problem: Verify that A and B are similar, where , , and .
Step 1: Compute . Since swaps rows, it is its own inverse.
Step 2: Compute .
Step 3: Compute .
Answer: Since , the matrices and are similar. Notice they share the same trace (), determinant (), and eigenvalues ( and ).
Why It Matters
Similar matrices appear throughout linear algebra whenever you change basis — for instance, diagonalizing a matrix to compute its powers efficiently. In differential equations and control theory, recognizing similarity lets you simplify a system into a canonical form without changing its fundamental behavior.
Common Mistakes
Mistake: Assuming that equal eigenvalues, trace, and determinant guarantee similarity.
Correction: These are necessary but not sufficient conditions. For example, the identity matrix and share eigenvalues, trace, and determinant, but they are not similar.
