We say that a set of vectors is linearly dependent if one vector in the set belongs to the span of the others. Otherwise, we say the set is linearly independent.
You can think of linearly dependent sets as containing a redundant vector, in the sense that you can drop a vector out without reducing the span of the set. In the above image, all three vectors lay in the same planar subspace, but only two vectors are needed to span the plane, so the set is linearly dependent.
Activity 2.4.2 (~10 min)
Consider the following three vectors in \(\IR^3\text{:}\)
A pivot column establishes linear independence and creates a contradiction.
A non-pivot column both describes a linear combination and reveals the number of solutions.
A pivot row describes the bound variables and prevents a contradiction.
A non-pivot row prevents contradictions and makes the vector equation solvable.
Fact 2.4.2
For any vector space, the set \(\{\vec v_1,\dots\vec v_n\}\) is linearly dependent if and only if the vector equation \(x_1\vec v_1+ x_2 \vec v_2+\dots+x_n\vec v_n=\vec{0}\) is consistent with infinitely many solutions.
Likewise, the set of vectors \(\{\vec v_1,\dots\vec v_n\}\) is linearly independent if and only the vector equation
is linearly dependent (the part that shows its linear system has infinitely many solutions).
Observation 2.4.3
Compare the following results:
A set of \(\IR^m\) vectors \(\{\vec v_1,\dots\vec v_n\}\) is linearly independent if and only if \(\RREF\left[\begin{array}{ccc}\vec v_1&\dots&\vec v_n\end{array}\right]\) has all pivot columns.
A set of \(\IR^m\) vectors \(\{\vec v_1,\dots\vec v_n\}\) is linearly dependent if and only if \(\RREF\left[\begin{array}{ccc}\vec v_1&\dots&\vec v_n\end{array}\right]\) has at least one non-pivot column.
A set of \(\IR^m\) vectors \(\{\vec v_1,\dots\vec v_n\}\) spans \(\IR^m\) if and only if \(\RREF\left[\begin{array}{ccc}\vec v_1&\dots&\vec v_n\end{array}\right]\) has all pivot rows.
A set of \(\IR^m\) vectors \(\{\vec v_1,\dots\vec v_n\}\) fails to span \(\IR^m\) if and only if \(\RREF\left[\begin{array}{ccc}\vec v_1&\dots&\vec v_n\end{array}\right]\) has at least one non-pivot row.
Activity 2.4.4
Part 1.
Write a statement involving the solutions of a vector equation that’s equivalent to each claim:
Activity 2.4.4
Part 1.
“The set of vectors \(\left\{ \left[\begin{array}{c}
1 \\
-1 \\
0 \\
-1
\end{array}\right] , \left[\begin{array}{c}
5 \\
5 \\
3 \\
1
\end{array}\right] , \left[\begin{array}{c}
9 \\
11 \\
6 \\
3
\end{array}\right] \right\}\) is linearly independent.”
Activity 2.4.4
Part 2.
“The set of vectors \(\left\{ \left[\begin{array}{c}
1 \\
-1 \\
0 \\
-1
\end{array}\right] , \left[\begin{array}{c}
5 \\
5 \\
3 \\
1
\end{array}\right] , \left[\begin{array}{c}
9 \\
11 \\
6 \\
3
\end{array}\right] \right\}\) is linearly dependent.”
Activity 2.4.4
Part 2.
Explain how to determine which of these statements is true.
Activity 2.4.5 (~5 min)
What is the largest number of \(\IR^4\) vectors that can form a linearly independent set?
\(\displaystyle 3\)
\(\displaystyle 4\)
\(\displaystyle 5\)
You can have infinitely many vectors and still be linearly independent.
Activity 2.4.6 (~5 min)
Is is possible for the set of Euclidean vectors \(\{\vec v_1, \vec v_2,\ldots, \vec v_n, \vec 0\}\) to be linearly independent?