If AB is invertible, then A and B are invertible for square matrices A and B.(adsbygoogle = window.adsbygoogle || []).push({});

I am curious about the proof of the above. I know there is a very straightforward proof that involves determinants, but I am interested in seeing if there is a proof that doesn't use determinants.

In an attempt to proof this, I considered the contrapositive:

If at least one of {A,B} is singular, then AB is singular.

I successfully proved that if B is singular (or if both A and B are singular), then AB is necessarily singular. To do this, I showed that Bx = 0 having nontrivial solutions implies that ABx= 0 has nontrivial solutions.

Unfortunately, I was not able to apply the above step to the case where only A is singular. If A is singular, Ax= 0 has nontrivial solutions. But how can I show that ABx = 0 has nontrivial solutions?

BiP

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# If AB is invertible, then A and B are invertible.

Loading...

Similar Threads - invertible invertible | Date |
---|---|

B Invertibility of a Matrix | Jun 9, 2017 |

I Proving a result about invertibility without determinants | Feb 27, 2017 |

Proof of invertibility | Feb 4, 2016 |

Matrix is Invertible: is this notation ok? | Oct 2, 2015 |

Invertible Matrix Theorem | Apr 26, 2015 |

**Physics Forums - The Fusion of Science and Community**