User Name Remember Me? Password

 Linear Algebra Linear Algebra Math Forum

 March 3rd, 2012, 05:49 AM #1 Member   Joined: Jan 2012 Posts: 63 Thanks: 0 matrix invertible problem Let A be n*n matrix such that A^k=0(n,n) (the n*n zero matrix) for some natural integer k. show that In+A is invertible. attempt solutions: for A^k=0(n,n) then we have A=0 or A is a matrix not equal to 0 ,but for some k s.t. A^k=0 for case 1, if A=0 then In+A =In ,and det(In+A) not zero then it is invertible for case 2. if A is not 0 then i dont know how to argue this one.cause for some A is not zero , maybe det(In+A)=0 or maybe A is not zero but A^k is not zero as well can someone give me some helps March 3rd, 2012, 07:37 AM #2 Senior Member   Joined: Feb 2012 Posts: 628 Thanks: 1 Re: matrix invertible problem Not sure if this works, but I believe if then A must be of the form (or the transpose), in which case . Now, if you add to this matrix, you get , the determinant of which is , hence it is invertible. March 3rd, 2012, 12:55 PM #3 Member   Joined: Jul 2010 Posts: 44 Thanks: 0 Re: matrix invertible problem how do i delete this post? March 6th, 2012, 11:45 AM #4 Newbie   Joined: Dec 2011 Posts: 15 Thanks: 0 Re: matrix invertible problem Suppose for some vector . So . This means that is an eigenvalue of A which is a contradiction since zero is the only eigenvalue of A. Tags invertible, matrix, problem ,
,

matrix a^k=0

Click on a term to search for related topics.
 Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post PrototypePHX Linear Algebra 6 January 25th, 2014 11:36 PM Magnesium Linear Algebra 2 December 11th, 2013 02:09 AM shine123 Linear Algebra 1 September 21st, 2012 08:47 AM problem Linear Algebra 3 August 31st, 2011 05:30 AM paulyc2010 Algebra 4 April 18th, 2010 02:50 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top      