StopWatch said:
Is there anything more I should do in finding the basis other than realizing that (a,b) is it? The reasoning being that -a is a linear combination of a (and the other -a a linear combination of itself of course) so those are the only two left?
I'd also like to introduce three other questions if anyone has time, since I think that one is cleared up then if I'm right about that. Thanks Dick, by the way.
Prove for a transformation T: V --> W:
(a) If dim(V ) > dim(W), then T cannot be 1-1.
(b) If dim(V ) < dim(W), then T cannot be onto.
(c) If dim(V ) = dim(W), then T is 1-1 if and only if T is onto.
First, I'd like to clear up that I have some terms in my head right:
Kernel(T) = all the things the transformation maps to 0, including the 0 vector.
Dimension of a vector space or subspace = the number of vectors in its basis
And what are the rules exactly on mapping to a subspace versus mapping from a vector space to a vector space? Am I only mapping from a vector space to a vector space if I'm mapping ALL the elements from one to another? Is it otherwise subspace to subspace? vectorspace to subspace? or subspace to vector space? depending on whether SOME --> SOME, ALL -->SOME, SOME-->ALL, respectively?
Is the preimage the same as the domain?
Sorry that got a bit messy, do those questions make sense?
first, some basics. a mapping is just a function. so if you have a mapping f:V→W where V and W are vector spaces, it has to be defined for every v in V, but it does not have to take on every value in W. for example f(v) = 0 is a perfectly good mapping. of course, we're usually only interesting in LINEAR mappings, because those preserve "vector-space-ness".
one of the first things you usually show is that if T is a linear transformation T:V→W, that im(T) (or the image set T(V)) is a subspace of W. ker(T) on the other hand, is a subspace of V. these concepts are "dual" to each other: a smaller kernel means a bigger image. at the extremes:
T:V→W given by T(v) = 0, has ker(T) = V, and im(T) = {0}.
T:V→V given by T(v) = v, has ker(T) = {0}, and im(T) = V.
if a kernel is as small as possible, T is injective.
if an image is as large as possible, T is surjective. note: these are not quite "technical" definitions, they are just to give you an idea of what is going on.
now, for your questions:
a) suppose dim(V) > dim(W). this means that there are more elements in any basis for V, than there are in any basis for W. pick a basis, any basis, for V, say:
{v
1,v
2,...,v
n}
consider the set {T(v
1),T(v
2),...,T(v
n)}. can this set be linearly independent? if not, than by the linearity of T...
b) use the same idea, except now the set of T(v
j) has fewer elements than any basis for W. can it be a basis for W? is there any difference between im(T) and
span(T(v
1),T(v
2),...,T(v
n))? if W has elements not in this span, then...
c) if you've answered (a) and (b), it should be clear how to prove this.