Hi so this seems pretty intuitive but i dont see how i could formally prove it. Could i get some tips with this ?
Prove that if you remove a vector from a set of linear independent vectors, the vectors of the set are still linear independent.
0
$\begingroup$
linear-algebra
-
0Remember that linear independence of $v_1, \ldots, v_n$ means that the only scalars $a_1, \ldots, a_n$ that satisfy $a_1v_1 + \ldots + a_nv_n = 0$ is only when $a_1 = a_2 = \ldots = a_n = 0$. – 2017-01-12
2 Answers
2
It's easier to prove the contrapositive: If the vectors of a set are linearly dependent, then when you add a vector, the new set will be linearly dependent.
Let's say $V$ is linearly dependent. If you can prove that $V+\{ \mathbf{v} \}$ is linearly dependent for any vector $\mathbf v$, you have proven the contrapositive of the original statement, which is logically equivalent to the original.
0
Let $V$ be a set of linear independent vectors and $V_x$ be the same set without vector $x$. What can we say about $V$ if $V_x$ is linear dependent?
-
0Oh so you mean i could say that if Vx was linear dependent then V would be linear dependent so its a contradiction ? – 2017-01-12
-
0right! so $V_x$ must be linear independent. – 2017-01-12
-
0thanks , how could i prove it by using the defintion that Mnifldz did ? – 2017-01-12