Tricky Matrices

Algebra Level pending

Two non null matrices A A and B B satisfy A B = B AB=B and B A = A BA=A . Then the matrix A 2 + B 2 A^2+B^2 equals

Here I I stands for the identity matrix

A B AB A + B A+B I I

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.

3 solutions

Chris Lewis
Feb 27, 2020

We have A 2 = B A B A = B A B A = B B A = B B A = B A = B A = A A^2 = BA\cdot BA = B\cdot AB \cdot A = B \cdot B \cdot A = B \cdot BA = B \cdot A = BA = A

and

B 2 = A B A B = A B A B = A A B = A A B = A B = A B = B B^2 = AB\cdot AB = A\cdot BA \cdot B = A \cdot A \cdot B = A \cdot AB = A \cdot B = AB = B

so A 2 + B 2 = A + B A^2+B^2=A+B .

That's you 👶

A Former Brilliant Member - 1 year, 3 months ago
Karan Chatrath
Feb 25, 2020

Let the matrix A A have m m rows and n n columns and matrix B B have n n rows and p p columns. The matrix A B AB will therefore have m m rows and p p columns. The number of columns of A A and the number of rows of B B must be same, otherwise, the multiplication A B AB is not possible.

Since:

A B = B AB = B

We can conclude that

m = n m = n

We can make similar arguments and conclude that

m = n = p m = n = p

Therefore A A and B B are square matrices. Consider the expression:

X = A 2 + B 2 X = A^2 + B^2 X = A A + B B \implies X = A \cdot A + B \cdot B

Assuming the matrices A A and B B are invertible, from the given information we get:

A = B B 1 = I A = B B^{-1} = I B = A A 1 = I B = A A^{-1} = I

This leads to

X = A A + B B = A ( B B 1 ) + B ( A A 1 ) X = A \cdot A + B \cdot B = A\left(B B^{-1}\right) + B\left(A A^{-1}\right)

Which simplifies to:

X = A 2 + B 2 = A + B = 2 I \boxed{X = A^2 + B^2 = A + B =2I}

Is there a way of proving this expression without assuming that A A and B B are invertible? I am curious. If not, a note that the matrices are full-rank (row or column) should be mentioned in the problem statement.

Karan Chatrath - 1 year, 3 months ago

Log in to reply

What I have done is as follows

A B = B A B = I B ( A I ) B = A = I AB=B\implies AB=IB\implies (A-I) B=\varnothing\implies A=I . Similarly, B A = A B = I BA=A\implies B=I . Hence A 2 = A , B 2 = B A^2=A, B^2=B , and A 2 + B 2 = A + B A^2+B^2=A+B .

Even though it is inherent that matrices A A and B B are invertible, it was not necessary to use this fact explicitly.

A Former Brilliant Member - 1 year, 3 months ago

Log in to reply

The matrices A = ( 1 2 0 0 ) A=\begin{pmatrix} 1 & 2\\ 0 & 0 \end{pmatrix}

and

B = ( 1 2 0 0 ) B=\begin{pmatrix} 1 & -2\\ 0 & 0 \end{pmatrix}

satisfy the condition, but A I A\neq I and neither matrix is invertible...

Chris Lewis - 1 year, 3 months ago

Log in to reply

@Chris Lewis Brilliant ! In fact the matrices

A = [ 1 a 0 0 ] A=\left[{\begin {array} {cc} 1 & a\\ 0 & 0\\ \end {array} }\right ]

and

B = [ 1 b 0 0 ] B=\left[{\begin {array} {cc} 1 & b\\0 & 0\\ \end {array}}\right ]

are non invertible non identity matrices satisfying those conditions.

A Former Brilliant Member - 1 year, 3 months ago

Aha - found a way!

Chris Lewis - 1 year, 3 months ago
Rocco Dalto
Apr 4, 2020

Not assuming A A and B B are invertible.

A B = B ( A B ) A = B A = A A ( B A ) = A A 2 = A AB = B \implies (AB)A = BA = A \implies A(BA) = A \implies A^2 = A

and

B A = A ( B A ) B = A B = B B ( A B ) = B B 2 = B BA = A \implies (BA)B = AB = B \implies B(AB) = B \implies B^2 = B

A 2 + B 2 = A + B \implies A^2 + B^2 = A + B .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...