Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Similarity of matrices

Siblings5
  • Sort by title
  • Sort by date

  • Definition of similar matrices
  • Similarity of matrices in an equivalence relation.
  • Definition of similarity transform
  • Similar matrices have the same eigenvalues and the same characteristic polynomials.
  • Every square matrix is similar to one in Jordan form.
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

Fill content

Description:Added similar matrices have same eigenvalues
# Similar matrices have the same eigenvalues and the same characteristic polynomials.

Put content here**Theorem:** If $A$ and $B$ are similar ($B = P^{-1}AP$), then they have the same eigenvalues and the same characteristic polynomial.
⏎
**Proof:** The characteristic polynomial of $B$ is:
⏎
$$\det(B - \lambda I) = \det(P^{-1}AP - \lambda I) = \det(P^{-1}(A - \lambda I)P) = \det(P^{-1})\det(A - \lambda I)\det(P)$$
⏎
Since $\det(P^{-1})\det(P) = 1$, we get:
⏎
$$\det(B - \lambda I) = \det(A - \lambda I)$$
⏎
So $A$ and $B$ have the same characteristic polynomial, hence the same eigenvalues.
⏎
**Note:** The converse is false. Having the same eigenvalues does NOT imply similarity. For example, $\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}$ and $\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$ both have eigenvalue 1 (with multiplicity 2) but are not similar (one is diagonalizable, the other is not).

# Parents

* Similarity of matrices
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026