Proving Linear Dependence in Spanned Vectors

XcKyle93
Messages
32
Reaction score
0

Homework Statement


This should be an easy one, I'm just making sure that I'm not screwing up horribly.

Prove that if v is in span(v1,v2, ..., vN), then v, v1, v2, ..., vN are linearly dependent.

Homework Equations


span(v1,v2, ..., vN) = {Ʃaivi}.

The Attempt at a Solution


If v is in span(v1,v2, ..., vN), then for some scalars a1, ..., aN, v = Ʃaivi. This means that 0 = Ʃaivi - v, which means that there exists a set of scalars, not all 0, that satisfy the homogeneous equation. This is because the scalar coefficient of v is -1.
 
Last edited:
Physics news on Phys.org
XcKyle93 said:

Homework Statement


This should be an easy one, I'm just making sure that I'm not screwing up horribly.

Prove that if v is in span(v1,v2, ..., vN), then v, v1, v2, ..., vN are linearly independent.

Homework Equations


span(v1,v2, ..., vN) = {Ʃaivi}.

The Attempt at a Solution

.
If v is in span(v1,v2, ..., vN), then for some scalars a1, ..., aN, v = Ʃaivi. This means that 0 = Ʃaivi - v, which means that there exists a set of scalars, not all 0, that satisfy the homogeneous equation. This is because the scalar coefficient of v is -1.

You mean dependent of course. But your argument is OK.
 
Okay, thanks. I was just making sure!
 
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