31.1. Definition of Similar Matrices

Let A and B be two square matrices of order n. We say that matrix A is similar to matrix B if there exists a nonsingular (invertible) matrix P such that:

B = P⁻¹AP

This relation is known as matrix similarity.

Two matrices A and B are considered similar if you can transform one into the other by using a change-of-basis matrix P that is invertible. The equation B = P⁻¹AP expresses this relation, meaning that B is derived from A through the transformation defined by P. Essentially, similar matrices can be viewed as representing the same linear transformation under different settings or bases.

Think of it like translating a book into another language. The original and the translation convey the same story (similar transformation) but use different words (different bases or matrices). The translator (the change-of-basis matrix P) ensures that the meaning is preserved while changing the language.

• A ∼ B: Denotes that A is similar to B. • The matrix P is called the change-of-basis matrix.

In mathematical notation, when we write A ∼ B, it indicates that the matrices A and B are similar. The matrix P, which is used in the transformation from A to B (or vice versa), is specifically referred to as the change-of-basis matrix. This terminology is important as it helps us discuss and reference the properties and behaviors of similar matrices in further detail.

Imagine A as a painter and B as the painting made through their unique style. When we say A ∼ B, we mean that both the painter and the painting can represent the same emotion, just expressed in different ways. The technique used by the painter (the change-of-basis matrix P) is what makes this transformation possible.

Properties:

1. Reflexivity: Every matrix is similar to itself. A = I⁻¹AI ⇒ A ∼ A
2. Symmetry: If A ∼ B, then B ∼ A. Since B = P⁻¹AP ⇒ A = PBP⁻¹
3. Transitivity: If A ∼ B and B ∼ C, then A ∼ C. If B = P⁻¹AP and C = Q⁻¹BQ, then C = (QP)⁻¹A(QP) ⇒ A ∼ C

These properties show that matrix similarity is an equivalence relation.

The properties of similarity include:

1. Reflexivity: A matrix is always similar to itself because any transformation using the identity matrix will yield the same matrix.
2. Symmetry: If A is similar to B, then B is also similar to A; this means that you can reverse the transformation.
3. Transitivity: If A is similar to B and B is similar to C, then A is also similar to C, which means that the similarity can pass through these matrices. Together, these properties establish that similarity is an equivalence relation, which is a key concept in linear algebra.

Consider a group of friends who can communicate and speak through a common language: while they might use different languages (similar matrices) amongst themselves, they can always understand each other no matter the order of conversation (reflexivity, symmetry, transitivity). Their fundamental connection remains, just like the equivalence relation in matrix similarity.

--