
Linear Algebra Linear Algebra Math Forum 
 LinkBack  Thread Tools  Display Modes 
November 23rd, 2008, 05:34 AM  #1 
Newbie Joined: Nov 2008 Posts: 3 Thanks: 0  Proof AB = 0 ? B = 0, A invertible
How do I go about proving this? That if A is an invertible matrix then AB = 0 ? B = 0? And what about this: AX = AY ? X = Y? Thanks.

November 23rd, 2008, 01:58 PM  #2 
Senior Member Joined: Oct 2007 From: Chicago Posts: 1,701 Thanks: 3  Re: Proof AB = 0 ? B = 0, A invertible
Since A is invertible, you can multiply by A^(1) on the right side of each expression... that's it. Do that, and the proof will follow.


Tags 
invertible, proof 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Invertible Functions  ceity  Calculus  2  January 20th, 2014 02:08 AM 
Why Isn't This Matrix Invertible?  Magnesium  Linear Algebra  2  December 11th, 2013 02:09 AM 
Let f be an invertible function, and g = f^1....  elifast  Algebra  1  October 5th, 2012 03:26 AM 
T: V to V and [T]_B is invertible  tinynerdi  Linear Algebra  0  February 20th, 2010 05:58 PM 
Show that A must be invertible  450081592  Linear Algebra  1  November 28th, 2009 01:32 AM 