Well, if you think about the columns of T as individual vectors then you see each Matrix Vector Product results in the zero vector. So, that means the columns of T are in the kernel (null space) of T. Now what does the rank-nullity theorem say?
I am confused by what you means by 'the columns of T as individual vectors then you see each Matrix Vector Product' .
We have not covered matrixes all that much. I am more just interested in what happens to the rank and nullity of T. If it helps, U is finite dimensional.
I just am interested in what what implies. Does it mean that it is surjective, injective, bijective, invertible, etc.
If that makes no sense, please excuse my English and ask me a question.
When one multiplies matrices they are multiply each row by each column. So if the matrix-matrix multiplication results in a 0 matrix, each column of T must have been in the kernel (null space) of T. This would imply that the matrix does not have {0} kernel and therefore is not invertible.
So we are saying if we have T composed of T equalling 0, then it is multiplying all the rows of T by all the columns of T of the matrix. The . So what is the nullity and the rank then, and why? obviously I am still a little confused but am trying to think through this very hard.
So ignoring multiplication all together, I thought we were just speaking in terms of linear algebra, sorry.
If then the kernel is not empty which means the nullity is not zero, i.e., the size of the kernel is not zero. By the rank nullity theorem we see that rank must be less than the dimenision of . Therefore, is not surjective and thus not invertible.
Defunkt:
How do you know ? I understand the first line of your answer, but do not see its implications. the Kernal is , and the image is the set of all z such that correct?
lvleph: how do I know the kernel is not empty? That helps though, because the objective of this exercise was that the nullity(T) >= 1/2 dim(U). I have no clue how to prove this though.
Thank you both for your help!
How did you define the image of a transformation? It is usually defined, for as , so for example if then , ie. the set of images of S.
This gives us that . Can you see why? If so, can you see how to finish now?
Don't look at the solution until you've given it a real try. I'm only leaving it here since I won't be able to attend this for a while.
Spoiler:
I really am forcing myself not to look at your 'spoiler or the lower post after I started to read it. However, I am seeing how this would be done incorporating the Rank-Nullity Theorem, however I am still lacking the ability to see how we know that from that the . T(U) is equal to the Im(T), I can see that. but the kernel is then T(x)=0 for all x in U, how is the image a subset of that?
Thanks!!