We’d prefer a more methodical method to decide if every vector in belongs to some spanning set, compared to the guess-and-check method we used in Activity 2.2.6.
We’re guaranteed at least one solution if the RREF of the corresponding augmented matrix has no contradictions; likewise, we have no solutions if the RREF corresponds to the contradiction . Given
Note these two possibilities are decided based on whether or not the RREF of the vector equation’s coefficient matrix (that is, ) has either all pivot rows, or at least one non-pivot row (a row of zeroes):
One of our important results in this lesson is Fact 2.2.5, which states that a set of vectors is required to span . While we developed some geometric intuition for why this true, we did not prove it in class. Before coming to class next time, follow the steps outlined below to convince yourself of this fact using the concepts we learned in this lesson.