Linear Algebra: Span, Linear Independence Proof

miglo
Messages
97
Reaction score
0

Homework Statement


Suppose v_1,v_2,v_3,...v_n are vectors such that v_1 does not equal the zero vector
and v_2 not in span{v_1}, v_3 not in span{v_1,v_2}, v_n not in span{v_1,v_2,...v_(n-1)}
show that v_1,v_2,v_3,...,V_n are linearly independent.


Homework Equations


linear independence, span


The Attempt at a Solution


he gave us a hint, which was to use induction
heres what i have so far
for the base case n=1
v_1 does not equal 0
so for cv_1=0, c must equal 0 making v_1 linearly independent
then assume v_n is linearly independent to show v_(n+1) is linearly independent
since v_n is linearly independent, then v_1,v_2,v_3,v_(n-1) are all linearly independent as well, my books states this as a remark to linear independence so i assume i can use it
and v_(n+1) not in span{v_1,...v_n}
therefore c_1v_1+c_2v_2+...+c_nv_n+c_(n+1)v_(n+1)=0 if either
c_(n+1)v_(n+1)=-c_1v_1-c_2v_2-...-c_nv_n
or c_(n+1)v_(n+1)=0
the former isn't true since its not in the span of all the vectors before it so then the latter must hold true

this is where i started doubting myself because then i would have to show that v_(n+1) is not zero and I am unsure on how to do that, also I am a beginner with proofs so I am not even sure if I am doing this correctly using induction

thanks in advance
 
Physics news on Phys.org
miglo said:

Homework Statement


Suppose v_1,v_2,v_3,...v_n are vectors such that v_1 does not equal the zero vector
and v_2 not in span{v_1}, v_3 not in span{v_1,v_2}, v_n not in span{v_1,v_2,...v_(n-1)}
show that v_1,v_2,v_3,...,V_n are linearly independent.

Homework Equations


linear independence, span

The Attempt at a Solution


he gave us a hint, which was to use induction
heres what i have so far
for the base case n=1
v_1 does not equal 0
so for cv_1=0, c must equal 0 making v_1 linearly independent
then assume v_n is linearly independent to show v_(n+1) is linearly independent
since v_n is linearly independent, then v_1,v_2,v_3,v_(n-1) are all linearly independent as well, my books states this as a remark to linear independence so i assume i can use it
and v_(n+1) not in span{v_1,...v_n}
therefore c_1v_1+c_2v_2+...+c_nv_n+c_(n+1)v_(n+1)=0 if either
c_(n+1)v_(n+1)=-c_1v_1-c_2v_2-...-c_nv_n
or c_(n+1)v_(n+1)=0
the former isn't true since its not in the span of all the vectors before it so then the latter must hold true

this is where i started doubting myself because then i would have to show that v_(n+1) is not zero and I am unsure on how to do that, also I am a beginner with proofs so I am not even sure if I am doing this correctly using induction

thanks in advance

You are really close. You can say v_(n+1) is not the zero vector. The zero vector is in the span of any set of vectors. Try and restate your argument knowing that.
 
Last edited:
so can i just say since the zero vector is in the span of any set of vectors and v_(n+1) is not in the span of all the vectors before it then v_(n+1) is not the zero vector??
if that's correct then c_(n+1) must equal zero thus showing that all the vectors are linearly independent
 
miglo said:
so can i just say since the zero vector is in the span of any set of vectors and v_(n+1) is not in the span of all the vectors before it then v_(n+1) is not the zero vector??
if that's correct then c_(n+1) must equal zero thus showing that all the vectors are linearly independent

Yes, that's pretty much it. If c_(n+1) is nonzero then v_(n+1) is in the span, contradiction. If c_(n+1) is zero then it shows they are linearly independent. Well done. You are better at proofs than you thought.
 
cool thanks!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top