how would i prove that for a vector space V, a subset of V that contains the zero vector is linearly dependent?
Printable View
how would i prove that for a vector space V, a subset of V that contains the zero vector is linearly dependent?
Isn't any vector space containing the zero vector linearly dependent or am I misreading this?
Consider the nonempty set. From here, we can see that:
i.e. 0 is a linear combination of the vectors in S whose coefficients aren't all 0.
thanks, just noticed after posting.
I have a problem with that definition of linear dependence and this is the ideal thread to get some opinions.
The definition of linear dependent I like to use is that any vector S can be constructed as a linear combination of the others.
Consider the set S = {0, i, j). Linearly dependent or not? I say not since you can't construct i as a linear combination of 0 and j .....
(I do understand the argument when the other definition is used that S is dependent ..... I just don't like it ......)
isn't that the definition of span? linearly independent means that a_1*v_1+...+a_n*v_n=0 for scalars a_i and vectors v_i in the vector spaces foces all the scalars to equal 0. i don't see where the trouble is.
from my understanding, ANY vector that contains the zero vector cannot be linearly independent (by earlier argument), thus linearly dependent. isn't that true?
Why does it have to be a subset that contains the zero vector? I thought it was any set of vector that contained it was linearly dependent .. well until mr. fantastic's example came up with his definition of linear independence.
Hmmm..... What about?
This set is clearly linearly dependent. But I cant express each element of S as a linear combination of the others. For example, (1,1) cannot be expressed as a linear combination of the others, yet S is linearly dependent.
Considering your knowledge, perhaps you meant:
Technically this statement is wrong too, unless you define it that way. A set S is defined to be linearly dependent if it is not linearly independent. So technically(formally, logically...) you have to negate the definition of linear independence to get the mathematical formulation for linear dependence. And that formulation is the one you dont like....Quote:
Originally Posted by Mr.F meant
I think this dilemma of implication and equivalence is pretty common. Generally if you have a set of vectors S where one is able to express some element of S as a linear combination of the others, then the set is definitely linearly dependent. However the other way round is not necessarily true. And your question works as wonderful illustration to this fact.
These are my thoughts and it could be unconvincing. Perhaps some MHF Algebraist can explain it better.
Thanks for this reply. In addition:
Linear Dependence Theorem: The set {} of non-zero vectors is linearly dependent if and only if some
,
, is a linear combination of the preceding ones.
Theorem: A set of two or more vectors{
} is linearly dependent if and only if one of the
is a linear combination of the other vectors in S.