Please, read it again. We have a basis of (not of ) and we need to prove that is a basis of .
Hi all ---
I'm trying to prove the rank-nullity theorem and am just stuck on the first line of the proof. I'm using the first proof on Wikipedia --- Rank ---
If is a linear transformation from an -dimensional vector space to a vector space , then
.
First proof on Wikipedia --- I've changed it a little ---
Assume and
Also assume { } forms a basis for
We can extend this to form a basis for : { }
etc...
My problem ---
If { } forms a basis for , I think I see why { } is a basis for <-- not a typo.
The last word isn't a typo. I'm not sure if this is right ---
If { } is a basis for , I ??can?? extend this to
{ } --- a basis for ???
This is why I think this --- Because the { }s form a basis already, then adding { } doesn't change that because these { }s are kind of unnecessary.
Original question --- But how does { } as a basis for suddenly turn into a basis for ? I can't figure out this jump? How can something represent now represent vector space ?
Thanks a lot ---
Hi Professor ---
Thanks for answering.
But I'm stuck on exactly why is a basis for ?
The proof assumed ---
is a basis for .
How did they get from this basis to --- a basis for ?
What I meant in my post is --- I edited out the confusion now --- is that if is a basis for , then it is possible? to extend this to ---
is a basis for . But I'm not sure about this.
But I DON'T see how is a basis for ?
Thanks ---
They are using the Incomplete basis theorem. Look Theorem 5.4.5 here: Basis of a vector space.
Hi Professor ---
Thanks for answering. I copy the theorem here ---
Because I've been stuck on this, I just want to make sure ---
The given linearly independent set of vectors ---
ie --- does NOT have to be in ?
And why does it NOT have to be in ? What's the intuition? I'm not after the formal proof.
I still don't see why a basis for can be a basis for ?
Thanks ---
You said "Also assume { } forms a basis for ker L.
We can extend this to form a basis for V: { }".
Do you not understand what "extend" means? We have a basis for ker L, a subspace of V and we add new vectors from V, that are not in ker L to fill out a full basis for V.
You also say, in your first post, "I think I see why { } is a basis for ker L'. No, that's impossible (unless ker L= V, of course) because we have extended adding vectors , etc. vectors that are NOT in ker L.
Here's how you do that: if ker L= V, then we are done. A basis for one is a basis for the other.
If ker L is not V, then there exist vectors in V that are not in ker L. Pick any one and add it to the basis of ker L. If we call that new vector , then we now have { }. Since was not in L, it cannot be written as a linear combination of the u vectors so this set is still a set of independent vectors. If it spans V, we are done. If it does not, by definition of "span", there must exist a vector, in V that is not in the span. Add it to the set. Again, because it was not in the span of the previous vectors, it is independent of them. See it this new set spans V. If it does, we are done- we have a set that is both independent and spans V- a basis for V. If not, there exist some other vector, that is not in its span. Add that vector.
That process must eventually end because we are given that V is a finite dimensional vector space. There must be some number N such that no set of more than N vectors can be independent.
Hi HallsofIvy ---
Thank you so much for answering. I get it now!
But for other readers - I just want to point out a typo. I hope you don't mind this at all. I just want other new to linear algebra --- like me! --- to know about it.
I put it in red --- it should be .
Thanks a lot again ---