Question

We say two n × n matrices A and B are similar if there is an...

We say two n × n matrices A and B are similar if there is an invertible n × n matrix P such that

A = PBP^ -1.

a) Show that if A and B are similar n × n matrices, then they must have the same determinant.

b) Show that if A and B are similar n × n matrices, then they must have the same eigenvalues.

c) Give an example to show that A and B can be similar n × n matrices, but have different eigenvectors.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let matrices A,B∈Mn×n(R). Show that if A and B are each similar to some diagonal matrix,...
Let matrices A,B∈Mn×n(R). Show that if A and B are each similar to some diagonal matrix, and also have the same eigenvectors (but not necessarily the same eigenvalues), then  AB=BA.
We say the a matrix A is similar to a matrix B if there is some...
We say the a matrix A is similar to a matrix B if there is some invertible matrix P so that B=P^-1 AP. Show that if A and B are similar matrices and b is an eigenvalue for B, then b is also an eigenvalue for A. How would an eigenvector for B associated with b compare to an eigenvector for A?
Hi, I know that if two matrices A and B are similar matrices then they must...
Hi, I know that if two matrices A and B are similar matrices then they must have the same eigenvalues with the same geometric multiplicities. However, I was wondering if that statement was equivalent. In order terms, if two matrices have the same eigenvalues with the same geometric multiplicities, must they be similar? If not, is it always false?
Hi, I know that if two matrices A and B are similar matrices then they must...
Hi, I know that if two matrices A and B are similar matrices then they must have the same eigenvalues with the same geometric and algebraic multiplicities. However, I was wondering if that statement was equivalent. In order terms, if two matrices have the same eigenvalues with the same algebraic multiplicities, must they be similar? What about geometric multiplicities?
The questions this week is about diagonalizability of matrices when we have fewer than n different...
The questions this week is about diagonalizability of matrices when we have fewer than n different eigenvalues. Recall the following facts as starting points: • An n × n matrix is diagonalizable if and only if it has n linearly independent eigenvectors. • Eigenvectors with different eigenvalues must be linearly independent. • The number of times an eigenvalue appears as a root of the characteristic polynomial is at least the dimension of the corresponding eigenspace, and the total degree of...
Let A, B ? Mn×n be invertible matrices. Prove the following statement: Matrix A is similar...
Let A, B ? Mn×n be invertible matrices. Prove the following statement: Matrix A is similar to B if and only if there exist matrices X, Y ? Mn×n so that A = XY and B = Y X.
(7) Prove the following statements. (c) If A is invertible and similar to B, then B...
(7) Prove the following statements. (c) If A is invertible and similar to B, then B is invertible and A−1 is similar to B−1 . (d) The trace of a square matrix is the sum of the diagonal entries in A and is denoted by tr A. It can be verified that tr(F G)=tr(GF) for any two n × n matrices F and G. Prove that if A and B are similar, then tr A = tr B
Normally, we start with a matrix and find the eigenvalues and eigenvectors. But it’s interesting to...
Normally, we start with a matrix and find the eigenvalues and eigenvectors. But it’s interesting to see if this process can be performed in reverse. Suppose that a 2x2 matrix has eigenvalues of +2 and -1 but no info on the eigenvectors. Can you find the matrix? How many matrices would have these eigenvalues?
Normally, we start with a matrix and find the eigenvalues and eigenvectors. But it’s interesting to...
Normally, we start with a matrix and find the eigenvalues and eigenvectors. But it’s interesting to see if this process can be performed in reverse. Suppose that a 2x2 matrix has eigenvalues of +2 and -1 but no info on the eigenvectors. Can you find the matrix? How many matrices would have these eigenvalues?
Linear Algebra question:Suppose A and B are invertible matrices,with A being m*m and B n*n.For any...
Linear Algebra question:Suppose A and B are invertible matrices,with A being m*m and B n*n.For any m*n matrix C and any n*m matrix D,show that: a)(A+CBD)-1-A-1C(B-1+ DA-1C)-1DA-1 b) If A,B and A+B are all m*m invertible matrices,then deduce from a) above that (A+B)-1=A-1-A-1(B-1+A-1)-1A-1