Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (anonymous):

wat do they mean by this:1.A set{alpha(i)} of non-zero vector is linearly dependent if and only if some (alpha)k is a linear combination of the alpha(j) with j

OpenStudy (turingtest):

a linear combination of vectors us a set of vectors added together multiplied by some constant

OpenStudy (turingtest):

say we have a set of n vectors\[\{\vec v_1,\vec v_2,...,\vec v_n\}\]if any vector \(\vec v_k\) in the set can be written as\[\vec v_k=c_1\vec v_1+c_2\vec v_2+...+c_n\vec v_n\]where \(c_1,c_2,..c_n\) are scalars and at least two are non-zero

OpenStudy (turingtest):

for example \[\vec v_1=\langle1,2,3\rangle\]\[\vec v_2=\langle1,0,3\rangle\]\[\vec v_3=\langle3,2,9\rangle\]are not a set of linearly independent vector because one can be written as a linear combination of the other two\[\vec v_3=\vec v_1+2\vec v_2\]

OpenStudy (turingtest):

the notation you have presented is strange, I just trying to illustrate the concept

OpenStudy (anonymous):

on the first question wat do they mean by saying j<k

OpenStudy (turingtest):

that I'm not too sure about... I think I need to be more familiar with exactly what they mean by k, i, and j in your book

OpenStudy (anonymous):

k;i;j are the foot notes

OpenStudy (turingtest):

yes, but does i pertain to the number of vectors and j to the number of elements? is k a random vector in the set (I think that's what they mean by that part)

OpenStudy (turingtest):

1.A set \(\{\alpha_i\}\) of non-zero vector is linearly dependent if and only if some \(\alpha_k\) is a linear combination of the \(\alpha_j\) with \(j<k\). 2.A set \(\{\alpha_i\}\) of non-zero vector is linearly independent iff \(\alpha_k\) is not an element of \(\langle\alpha_j,......,\alpha_{k-1}\rangle\) is this exactly how it is stated?

OpenStudy (anonymous):

yes

OpenStudy (turingtest):

I feel like I understand linear independence, but this phrasing is confusing me I'm not sure why they require j<k

OpenStudy (turingtest):

@phi

OpenStudy (anonymous):

but he is not there .Thanks

OpenStudy (turingtest):

sorry, he is online though... hopefully he'll help us out good luck!

OpenStudy (phi):

they are indexing (labeling) each vector. If you start with vector 1, and start adding vectors, if you get to vector k, and it is linearly dependent on the previous vectors 1 to k-1, then the set is linearly dependent. It is (obviously?) true. If you get to the end of the all the vectors and none are linearly dependent, then the set is independent.

OpenStudy (turingtest):

ok, that makes sense I just couldn't see the point of arranging the vectors in some order like that, such that the vector in question v_k is at the end of the list.

OpenStudy (anonymous):

it makes sense

OpenStudy (phi):

I'm guessing so you can go on to define a basis (minimum number of vectors that are independent)

OpenStudy (phi):

such that the vector in question v_k is at the end of the list. that is a bit misleading. say a max of three vectors can be independent and you start with v1,v2,v3,v4 any of the 4 could be in the independent set e.g. (v4,v3,v2) the last one will always be dependent of the first 3.

OpenStudy (anonymous):

does the definition of basis reflects only to the finite sets only?

OpenStudy (phi):

I only learned what Strang taught in his course.

OpenStudy (anonymous):

@jacobian check this

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!