Prove Linear Independence of {u_1,u_2,...,u_k} for k=2,3,...,n-1

[Phymath]

let me know if u think i did this proof correctly...

use the definition of linear independence to prove that if $${u_1,u_2,...,u_n}$$ is a linearly independent set, then $${u_1,u_2,...,u_k}$$ is also a linearly independent set for any
$$k = 2,3,...,n-1$$

well here's what i did...
if the set of vectors $${u_1,u_2,...,u_n}$$ is linearly independent then none of the vectors in that set is linear combination of the others. therefore
$$c_1 u_1 + c_2 u_2 + ... + c_n u_n = \vect{0}$$ is satisfied only by the set of scalars $${c_1,c_2,...,c_n}$$ that is $$c_1 = 0, c_2 = 0, ..., c_n = 0$$ then.. $$c_1 u_1 + c_2 u_2 +...+c_(n-1) u_(n-1) = -c_n u_n$$ should only be satisfied by the same set where $$c_1 = 0, c_2 = 0, ..., c_n = 0$$ because no vector is a linear combination of the others by definition. thus this can be expanded to...$$c_1 u_1 + c_1 u_2 + ... + c_k u_k = -c_n u_n -c_(n-1) u_(n-1) - ... -c_(k+1) u_(k+1)$$ the only solution is the set where $$c_1 = 0, c_2 = 0, ..., c_n = 0$$, thus the set $${u_1,u_2, ...,u_k}$$ is linearly independent for any $$k=2,3,...,n-1.$$

tell me what u think..

 

[matt grime]

I think that this question doesn't even need proof.

If there is a linear combination of u_1,..,u_k that is zero, then there is a linear combination of u_1,..,u_n (k<=n) that is also zero. done. You're writing far too much.

 

[HallsofIvy]

Well, yes, it needs a proof, its just a trivial one!

Phymath: Suppose $$\{u_1,u_2,...,u_{n-1}\}$$ were not linearly independent. That would mean that there exist constants $${\kc_1,c_2,...,c_{n-1}\}$$, not all 0, such that $$c_1u_1+ c_2u_2+...+c_{n-1}u_{n-1}= 0$$.
What does that tell you about the orginal set $$\{u_1,u_2,...,u_n\}$$?

 

[Phymath]

well idk i guess that's why i asked the question in the first place. I suppose it could mean that u_(n-1) is a linear combination of the procedding u vectors..$$u_1, u_2, ...,u_{n-2}$$ no? but i thought by defination that can't be...i suppose that i tells excaztly what i said in my proof that there are no scalar constants to be a solution to that set other then all the constants have to be 0. because taking ur equation if they are linearly dependent (aka not linearly independent) then u can do this, which is by defintion only solved if the constants are zero, please help me out here...i don't get ur point
$$c_1 u_1 +c_2 u_2 +...+c_(n-2) u_(n-2) = -c_(n-1) u_(n-1)$$

 

[mathwonk]

linear dependence means zero is a non trivial linear combination of some of the vectors.

but if zero is a linear combination of some of the first k vectors, then zero is also (the same) linear combination of some of the full set of n vectors.

how's this?

 

[mathwonk]

another point of view: linear independence means the map sending the standard unit vectors to those vectors is injective. but an injective map on n space restricts to an injective map on a k dimensional subspace.

ok ok i know that makes it worse.

 

[Phymath]

linear dependence means zero is a non trivial linear combination of some of the vectors.

but if zero is a linear combination of some of the first k vectors, then zero is also (the same) linear combination of some of the full set of n vectors.

how's this?

yes but i have to work this backwards...n then to k not k then to n

 

[mathwonk]

you are mistaking the logic. to prove " if all n vectors are independent then so are the first k", is the same as proving: " if the first k vectors are dependent then so are all n".

so i worked from k to n because I was proving the second statement. I.e. I was working with dependency, and proving your statement "by contradiction". proofs by contradiction work backwards, instead of assuming the hypothesis is true and then deducing the conclusion is also true, you assume instead that the conclsuion is false and then deduce that the hypothesis would also be false.

its the same thing.