let A =
i need to find a 5x5 matrix M with rank(M) = 2 that AM = 4X5 zero matrix.
I thought of finding the inverse of A at first, but A is not a square matrix!!! i got stuck... help pls thanks!
and for any 5X5 matrix B such that AB = 0 then rank B <= 2. how can i prove this?
For the first bit, since rank(M) = 2 why don't you try:
Then you could sub it in AM = 0 to find relations on a-j and just choose any old matrix that works.
omg are you saying i have to multiply that all out and solve for it? is there a proper way of doing it?
That is the proper way of doing it. Pick any two linearly independent solutions of the system Ax=0. Then let B be the matrix whose first two columns are the solutions, and fill the remaining columns with zeros.
You can do the second bit easily if you know the following inequality. If A is an mxn matrix, and B is an nxp matrix, then
rank(A) + rank(B) - n <= rank(AB)
(Try to justify it by drawing a diagram or something, if you don't feel like proving it carefully.)
So in this case,
3 + rank(B) - 5 <= 0
=> rank(B) <= 2
Thanks for posting! You just need to create an account in order to submit the post
Already a member?
Oops, something wasn't right
please check the following:
Not got an account?
Sign up now
© Copyright The Student Room 2015 all rights reserved
The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.
Register Number: 04666380 (England and Wales), VAT No. 806 8067 22
Registered Office: International House, Queens Road, Brighton, BN1 3XE