14:26
Labtube-(Linear Algebra)-Row Space and Elementary Row Operations
Asghar Ghorbanpour
Overview
This video explains that the row space of a matrix remains invariant under elementary row operations. It demonstrates this by first proving that if one set of vectors is a linear combination of another set, then the span of the first set is a subset of the span of the second. It then applies this lemma to show that applying an elementary row operation to a matrix results in a new matrix whose row space is a subset of the original. By considering the inverse operation, it's shown that the original row space is also a subset of the new one, proving their equality. The concept is extended to equivalent matrices, and a crucial distinction is made between row space and column space behavior under these operations.
How was this?
Save this permanently with flashcards, quizzes, and AI chat
Chapters
- If a set of vectors {U1, ..., Uk} are all linear combinations of another set of vectors {V1, ..., Vm}, then the span of {U1, ..., Uk} is a subset of the span of {V1, ..., Vm}.
- This is because any linear combination of the Ui vectors can be rewritten as a linear combination of the Vi vectors.
- The span of a set of vectors is the set of all possible linear combinations of those vectors.
This fundamental lemma establishes a hierarchical relationship between the spans of vector sets, which is crucial for understanding how operations affect the underlying vector spaces.
When forming a linear combination of vectors U1 and U2, where each Ui is itself a linear combination of V1 and V2, the resulting vector can always be expressed as a linear combination of just V1 and V2.
- Each elementary row operation (swapping rows, scaling a row, adding a multiple of one row to another) transforms the rows of a matrix into linear combinations of the original rows.
- Consequently, the row space of the new matrix (formed by the new rows) is a subset of the row space of the original matrix.
- This is a direct application of the first lemma: the new rows are linear combinations of the old rows, so their span is contained within the span of the old rows.
This shows that performing a single elementary row operation does not expand the row space; it can only maintain it or shrink it.
If matrix B is obtained from matrix A by adding 2 times row 1 of A to row 2 of A, then each row of B is a linear combination of the rows of A, meaning the row space of B is contained within the row space of A.
- Every elementary row operation has a corresponding inverse operation that can reverse the transformation.
- If matrix B is obtained from A by an elementary row operation, then matrix A can be obtained from B by its inverse elementary row operation.
- Since the inverse operation also preserves the subset relationship, the row space of A must be a subset of the row space of B.
- Combining the subset relationships (row space of B is subset of A, and row space of A is subset of B) proves that the row spaces are equal.
This establishes that a single elementary row operation does not change the row space at all, proving equality rather than just containment.
If you swap two rows of a matrix, you can swap them back to recover the original matrix. This implies that the row space of the original and swapped matrices are identical.
- Equivalent matrices are matrices that can be transformed into one another through a finite sequence of elementary row operations.
- Since each individual elementary row operation preserves the row space, any finite sequence of these operations also preserves the row space.
- Therefore, all equivalent matrices share the same row space.
This generalizes the finding from single operations to any sequence of operations, meaning row reduction to a simpler form (like row echelon form) results in a matrix with the same row space as the original.
If matrix C can be obtained from matrix A by a series of row operations, then the row space of A is equal to the row space of C.
- While elementary row operations preserve the row space, they do not necessarily preserve the column space.
- The column space of a matrix may change when elementary row operations are applied.
- It is not possible to determine the column space of the original matrix solely from the column space of a row-reduced matrix.
This highlights a critical distinction in linear algebra: row operations are powerful tools for analyzing row space and solving systems, but they alter the column space, requiring different techniques to analyze it.
Consider a matrix where swapping two rows changes the order of the vectors that form the column space, thus altering the column space itself.
Key takeaways
- Elementary row operations do not change the row space of a matrix.
- The span of a set of vectors is a subset of the span of another set if the first set's vectors are linear combinations of the second set's vectors.
- The inverse of any elementary row operation exists and also preserves the row space.
- Equivalent matrices, connected by any sequence of elementary row operations, have identical row spaces.
- Row reduction to a simpler form (like row echelon form) yields a matrix with the same row space as the original.
- Unlike row space, column space is generally NOT preserved under elementary row operations.
Key terms
Row SpaceElementary Row OperationsLinear CombinationSpanLemmaCorollaryEquivalent MatricesColumn SpaceInverse Operation
Test your understanding
- How does the span of a set of vectors relate to the span of another set if the first set's vectors are linear combinations of the second?
- Why does an elementary row operation not change the row space of a matrix?
- What is the relationship between the row spaces of two equivalent matrices?
- How do elementary row operations affect the column space of a matrix, and why is this different from their effect on the row space?