Saturday, April 8, 2017

linear algebra - If an invertible matrix A commutes with C, show that A1 commutes with C



This is taken from a problem in Introduction to Linear Algebra by Strang:





If an invertible matrix A commutes with C, show that A1 commutes with C




This is what I tried to do, take note of the specific order in which I've multiplied the various matrices, as matrix multiplication is not commutative. (i.e.. left multiplication right multiplication)



Because A commutes with C, this means AC=CA



AC=CAIAC=CAIAA1(AC)=(CA)A1A   (AA1=I=A1A)A(A1(AC))=((CA)A1)AA1((AA1)(AC))=A1((CA)A1)A)   Left multiply by A1A1A1((AA1)(AC))=A1A1(CA)   Left multiply by A1A1(C)=A1A1(CA)




But the problem comes up in the last step, as it not yet been proven that A1 commutes with CA, and it would not constitute a proof to assume that A1 commutes with CA, when we are trying to find out if A1 commutes with C in the first place. If A1 did commute with CA then we could proceed as follows.



Assuming A1 commutes with CAA1(C)=(CA)A1A1A1(C)=(C)(AA1)A1A1(C)=(C)A1q.e.d



For reference this was the official solution, which I'm quite sure makes the assumption that A1 commutes with CA.




If AC=CA , multiply left and right by A1 to find CA1=A1C




The above only works if left multiplication by A1 is equivalent to right multiplication by A1, which only occurs if it is assumed that A1 commutes with CA




But I'm not satisfied with the above proof method in assuming A1 commutes with CA, nor the official solution, which I'm sure is making the same assumption. Is there any possible way to complete the proof without making this assumption?


Answer



Suppose that AC=CA. Multiplying on the right by A1, we get ACA1=C, and then multiplying on the left by A1, we get CA1=A1C.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...