Combining Aniket and Mark

Algebra Level 5

A A and B B are two square matrices of the same dimensions that satisfy

A B = A , B A = B AB = A, BA = B

Which of the following statement need not be true?

A v = 0 B v = 0 Av = 0 \Leftrightarrow Bv = 0 A 2 = A , B 2 = B A^2 = A, B^2 = B A B = B A A = B AB = BA \Leftrightarrow A = B A v = v B v = v Av = v \Leftrightarrow Bv = v

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.

1 solution

Mark Hennings
Feb 19, 2017

Certainly A 2 = A B A = A B = A A^2 = ABA = AB = A and B 2 = B A B = B A = B B^2 = BAB = BA = B , so both A A and B B are idempotent.

If A v = 0 Av=0 , then B v = B A v = 0 Bv = BAv = 0 . If B v = 0 Bv = 0 then A v = A B v = 0 Av = ABv = 0 .

Since [ A , B ] = A B [A,B] = A - B , it is clear that A A and B 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 0 1 0 ) A \; = \; \left(\begin{array}{cc} 1 & 0 \\ 0 & 0 \end{array} \right) \hspace{2cm} B \; = \; \left(\begin{array}{cc} 1 & 0 \\ 1 & 0 \end{array} \right) satisfy the conditions of the question, and A ( 1 0 ) = ( 1 0 ) B ( 1 0 ) ( 1 0 ) A\binom{1}{0} \; = \; \binom{1}{0} \hspace{2cm} B\binom{1}{0} \neq \binom{1}{0}

(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:

  1. (Characteristic of idempotents) Since the minimal polynomial of these matrices is x 2 x = 0 x^2 - x = 0 does not have repeated roots, we can split V n = A 1 A 0 V^n = A_1 \oplus A_0 such that given u a A 1 , v a A 0 u_a \in A_1, v_a \in A_0 we have A ( u a + v a ) = u a A(u_a + v_a) = u_a . This is the split into eigenspaces. Likewise, define V n = B 1 B 0 V^n = B_1 \oplus B_0 .
  2. Since B A = B BA = B , hence B v a = B A v a = B 0 = 0 B v_a = BA v_a = B 0 = 0 so B 0 A 0 B_0 \subset A_0 .
  3. Since A B = A AB =A , hence A v b = A B v b = A 0 = 0 A v_b = AB v_b = A 0 = 0 so A 0 B 0 A_0 \subset B_0 .
  4. Thus A 0 = B 0 A_0 = B_0 .
  5. So A 1 = B 1 A_1 = B_1 , and thus these matrices are identical.

Calvin Lin Staff - 4 years, 3 months ago

Log in to reply

Just read your report. Let me figure out what went wrong.

Calvin Lin Staff - 4 years, 3 months ago

Log in to reply

The fact that A 0 = B 0 A_0=B_0 does not force A 1 = B 1 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.

Mark Hennings - 4 years, 3 months ago

Log in to reply

@Mark Hennings Ah yes thanks!

I've updated the question. How does it look now?

Calvin Lin Staff - 4 years, 3 months ago

Log in to reply

@Calvin Lin That's fine. I will edit my solution to match...

Mark Hennings - 4 years, 3 months ago

Nice Solution! Thanks @Calvin Lin sir , for reposting it :)

Aniket Sanghi - 4 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...