Skip to content
NETMaths

Is this true?

Equivalent matrices are similar

No — it is false.

The counterexample

and

Both are invertible, so each is P·(the other)·Q for suitable invertible P, Q — every invertible n×n matrix is equivalent to every other, because equivalence sees nothing finer than rank. But A has eigenvalue 1 and B has eigenvalue 2, and similarity preserves eigenvalues. Equivalence allows an independent change of basis in the domain and the codomain; similarity forces the same basis on both sides.

The kind of mistake this is

Invariants don't determine

Two objects sharing an invariant were treated as the same object.

Others that fail the same way

Explained in full in Linear transformations, matrices and similarity

From Vector Spaces and Linear MapsLinear transformations, matrix representation, change of basis

ShareWhatsAppTelegram