Proving Symmetry of A*B^-1: Invertible Matrices A and B | AB = BA

  • Thread starter Thread starter pyroknife
  • Start date Start date
  • Tags Tags
    Matrix Proof
pyroknife
Messages
611
Reaction score
4
the matrices A and B are
invertible symmetric matrices and AB = BA.
Show that A*B^-1 is symmetric


(A*B^-1)^T
=A^T * (B^-1)^T
=A^T * (B^T)^-1

Since A and B are symmetric
=A*B^-1


Is this right? Is (B^-1)^T = (B^T)^-1?
 
Physics news on Phys.org
pyroknife said:
the matrices A and B are
invertible symmetric matrices and AB = BA.
Show that A*B^-1 is symmetric


(A*B^-1)^T
=A^T * (B^-1)^T
=A^T * (B^T)^-1

Since A and B are symmetric
=A*B^-1


Is this right? Is (B^-1)^T = (B^T)^-1?
Yes, that is true, but "(A*B^-1)^T= A^T*(B^-1)^T" isn't.
Rather, (A*B^{-1})^T= (B^{-1})^T*B^T.
 
HallsofIvy said:
Yes, that is true, but "(A*B^-1)^T= A^T*(B^-1)^T" isn't.
Rather, (A*B^{-1})^T= (B^{-1})^T*B^T.

Oh I memorized the identity wrong. (AB^T)=B^t*A^T
 
The solution in the book first proves
IF AB=BA, then B^-1 * A *B=A, so B^-1*A=AB^-1

For the last type, the "B^-1*A=AB^-1", part how did they go from B^-1 * A *B=A to
B^-1*A=AB^-1.

Did they divide both sides by B?
 
pyroknife said:
The solution in the book first proves
IF AB=BA, then B^-1 * A *B=A, so B^-1*A=AB^-1

For the last type, the "B^-1*A=AB^-1", part how did they go from B^-1 * A *B=A to
B^-1*A=AB^-1.

Did they divide both sides by B?

They multiplied both sides on the right by B^(-1). Talking about 'dividing' matrices by B is ambiguous. You can 'divide' on the left or the right.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top