A and B are two square matrices of the same dimensions that satisfy
A B = A , B A = B
Which of the following statement need not be true?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
(Edit: As Mark points out, statement 5 is not true. It is true only if the eigenspaces are orthogonal, but that need not be the case.)
The observation that you made could be simplified in the following way:
Log in to reply
Just read your report. Let me figure out what went wrong.
Log in to reply
The fact that A 0 = B 0 does not force A 1 = B 1 . The eigenspaces do not have to be orthogonal, for example.
I could have expressed my solution in terms of kernels, but thought that would make it less penetrable to the usual reader.
Log in to reply
@Mark Hennings – Ah yes thanks!
I've updated the question. How does it look now?
Log in to reply
@Calvin Lin – That's fine. I will edit my solution to match...
Nice Solution! Thanks @Calvin Lin sir , for reposting it :)
Problem Loading...
Note Loading...
Set Loading...
Certainly A 2 = A B A = A B = A and B 2 = B A B = B A = B , so both A and B are idempotent.
If A v = 0 , then B v = B A v = 0 . If B v = 0 then A v = A B v = 0 .
Since [ A , B ] = A − B , it is clear that A and B commute precisely when they are equal.
Thus the first three statements are certainly true. The last need not be, since the matrices A = ( 1 0 0 0 ) B = ( 1 1 0 0 ) satisfy the conditions of the question, and A ( 0 1 ) = ( 0 1 ) B ( 0 1 ) = ( 0 1 )