Let $V$ be a vector space over a scalar field $K$.
Let $S=\{\mathbf{v}_1, \mathbf{v}_2, \dots, \mathbf{v}_n\}$ be the set of vectors in $V$, where $n \geq 2$.

Then prove that the set $S$ is linearly dependent if and only if at least one of the vectors in $S$ can be written as a linear combination of remaining vectors in $S$.

$(\implies)$: If $S$ is linearly dependent, then a vector is a linear combination

Suppose that the set $S=\{\mathbf{v}_1, \mathbf{v}_2, \dots, \mathbf{v}_n\}$ is linearly dependent. Then there exists scalars $c_1, c_2, \dots, c_n$ in $K$ such that
\[c_1\mathbf{v}_1+c_2\mathbf{v}_2+\cdots+c_n\mathbf{v}_n=\mathbf{0}\]
and not all of $c_1, \dots, c_n$ are zero.
(This is just the definition of linearly dependency.)

Since at least one of $c_1, \dots, c_n$ is nonzero, without loss of generality we may assume that $c_1\neq 0$.
Then we have
\begin{align*}
c_1\mathbf{v}_1=-c_2\mathbf{v}_2-c_3\mathbf{v}_3-\cdots -c_n\mathbf{v}_n
\end{align*}
and we divide this by $c_1\neq 0$ and obtain
\begin{align*}
\mathbf{v}_1=-\frac{c_2}{c_1}\mathbf{v}_2-\frac{c_3}{c_1}\mathbf{v}_3-\cdots -\frac{c_n}{c_1}\mathbf{v}_n.
\end{align*}
Therefore, we have written the vector $\mathbf{v}_1$ as a linear combination of $\mathbf{v}_2, \mathbf{v}_3, \dots, \mathbf{v}_n$.

$(\impliedby)$: If a vector is a linear combination, then $S$ is linearly dependent

Suppose now that some vector of $S$ is a linear combination of the remaining vectors.
Without loss of generality, we may assume that $\mathbf{v}_1$ is a linear combination of the remaning vectors. So we have
\[\mathbf{v}_1=c_2\mathbf{v}_2+c_3\mathbf{v}_3+\cdots+c_n\mathbf{v}_n,\]
for some scalars $c_2, c_3, \dots, c_n$ in $K$.

This implies that we have
\[\mathbf{v}_1-c_2\mathbf{v}_2-c_3\mathbf{v}_3-\cdots-c_n\mathbf{v}_n=\mathbf{0},\]
and this is a nontrivial linear combination of vectors in $S$ because the coefficient of $\mathbf{v}_1$ is $1 \neq 0$.
Thus, the set $S$ is linearly dependent.

If there are More Vectors Than a Spanning Set, then Vectors are Linearly Dependent
Let $V$ be a subspace of $\R^n$.
Suppose that
\[S=\{\mathbf{v}_1, \mathbf{v}_2, \dots, \mathbf{v}_m\}\]
is a spanning set for $V$.
Prove that any set of $m+1$ or more vectors in $V$ is linearly dependent.
We give two proofs. The essential ideas behind […]

Can We Reduce the Number of Vectors in a Spanning Set?
Suppose that a set of vectors $S_1=\{\mathbf{v}_1, \mathbf{v}_2, \mathbf{v}_3\}$ is a spanning set of a subspace $V$ in $\R^3$. Is it possible that $S_2=\{\mathbf{v}_1\}$ is a spanning set for $V$?
Solution.
Yes, in general, $S_2$ can be a spanning set.
As an […]

The Subset Consisting of the Zero Vector is a Subspace and its Dimension is Zero
Let $V$ be a subset of the vector space $\R^n$ consisting only of the zero vector of $\R^n$. Namely $V=\{\mathbf{0}\}$.
Then prove that $V$ is a subspace of $\R^n$.
Proof.
To prove that $V=\{\mathbf{0}\}$ is a subspace of $\R^n$, we check the following subspace […]

Prove that any Set of Vectors Containing the Zero Vector is Linearly Dependent
Prove that any set of vectors which contains the zero vector is linearly dependent.
Solution.
Let $\mathbf{0}$ be the zero vector, and $\mathbf{v}_1, \cdots, \mathbf{v}_k$ are the other vectors in the set.
Then we have the non-trivial linear combination
\[1 \cdot […]

Linear Independent Vectors and the Vector Space Spanned By Them
Let $V$ be a vector space over a field $K$. Let $\mathbf{u}_1, \mathbf{u}_2, \dots, \mathbf{u}_n$ be linearly independent vectors in $V$. Let $U$ be the subspace of $V$ spanned by these vectors, that is, $U=\Span \{\mathbf{u}_1, \mathbf{u}_2, \dots, \mathbf{u}_n\}$.
Let […]

Linearly Independent/Dependent Vectors Question
Let $V$ be an $n$-dimensional vector space over a field $K$.
Suppose that $\mathbf{v}_1, \mathbf{v}_2, \dots, \mathbf{v}_k$ are linearly independent vectors in $V$.
Are the following vectors linearly independent?
\[\mathbf{v}_1+\mathbf{v}_2, \quad \mathbf{v}_2+\mathbf{v}_3, […]