Question

Let A, B be n × n matrices. The following are two incorrect proofs that ABhas...

Let A, B be n × n matrices. The following are two incorrect proofs that ABhas the same non-zero eigenvalues as BA. For each, state two things wrong with the proof: (i) We will prove that AB and BA have the same characteristic equation. We have that

det(AB − λI) = det(ABAA−1 − λAA−1) = det(A(BA − λI)A−1)

= det(A) + det(BA − λI) − det(A)

= det(BA − λI)

Hence det(AB − λI) = det(BA − λI), and so AB and BA have the same eigenvalues

(ii) Suppose not. We will prove by contradiction. Let λ,μ be non-zero eigenvalues of AB,BA respectively such that λ ̸= μ. Then we have that for an eigenvector ⃗v

AB⃗v=λ⃗v, BA⃗v=μ⃗v=⇒(AB−BA)⃗v=(λ−μ)⃗v= ⇒ 0 ⃗v = ( λ − μ ) ⃗v

=⇒ λ − μ = 0

=⇒ λ = μ
Hence we have arrived at a contradiction. So AB and BA have the same eigenvalues.

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.
Prove the following statements: a) If A and B are two positive semidefinite matrices in IR...
Prove the following statements: a) If A and B are two positive semidefinite matrices in IR ^ n × n , then trace (AB) ≥ 0. If, in addition, trace (AB) = 0, then AB = BA =0 b) Let A and B be two (different) n × n real matrices such that R(A) = R(B), where R(·) denotes the range of a matrix. (1) Show that R(A + B) is a subspace of R(A). (2) Is it always true...
Q.Let A and B be n × n matrices such that A = A^2, B =...
Q.Let A and B be n × n matrices such that A = A^2, B = B^2, and AB = BA = 0. (a) Prove that rank(A + B) = rank(A) + rank(B). (b) Prove that rank(A) + rank(In − A) = n.
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...
Let A, B, and C be n×n matrices of the form A= [c_1...x...c_n], B= [c_1...y...c_n], and...
Let A, B, and C be n×n matrices of the form A= [c_1...x...c_n], B= [c_1...y...c_n], and C= [c_1...x+y...c_n] where x, y, and x+y are the jth column vectors. Use cofactor expansions to prove that det(C)=det(A)+det(B).
Let A be a (n × n) matrix. Show that A and AT have the same...
Let A be a (n × n) matrix. Show that A and AT have the same characteristic polynomials (and therefore the same eigenvalues). Hint: For any (n×n) matrix B, we have det(BT) = det(B). Remark: Note that, however, it is generally not the case that A and AT have the same eigenvectors!
4.4.3. Suppose A and B are n × n matrices. Prove that, if AB is invertible,...
4.4.3. Suppose A and B are n × n matrices. Prove that, if AB is invertible, then A and B are both invertible. Do not use determinants, since we have not seen them yet. Hint: Use Lemma 4.4.4. Lemma 4.4.4. If A ∈ Mm,n(F) and B ∈ Mn,k(F), then rank(AB) ≤ rank(A) and rank(AB) ≤ rank(B).
2. Let a and b be elements of a group, G, whose identity element is denoted...
2. Let a and b be elements of a group, G, whose identity element is denoted by e. Prove that ab and ba have the same order. Show all steps of proof.
Given that A and B are n × n matrices and T is a linear transformation....
Given that A and B are n × n matrices and T is a linear transformation. Determine which of the following is FALSE. (a) If AB is not invertible, then either A or B is not invertible. (b) If Au = Av and u and v are 2 distinct vectors, then A is not invertible. (c) If A or B is not invertible, then AB is not invertible. (d) If T is invertible and T(u) = T(v), then u =...
Let V = Pn(R), the vector space of all polynomials of degree at most n. And...
Let V = Pn(R), the vector space of all polynomials of degree at most n. And let T : V → V be a linear transformation. Prove that there exists a non-zero linear transformation S : V → V such that T ◦ S = 0 (that is, T(S(v)) = 0 for all v ∈ V) if and only if there exists a non-zero vector v ∈ V such that T(v) = 0. Hint: For the backwards direction, consider building...