Row Equivalence — Definition, Formula & Example
Row equivalence is the relationship between two matrices of the same size when you can turn one into the other using only elementary row operations: swapping rows, scaling a row by a nonzero number, or adding a multiple of one row to another.
Two matrices and are row equivalent, written , if there is an invertible matrix with . Equivalently, is a product of elementary matrices. Row equivalence is an equivalence relation. Each equivalence class contains exactly one matrix in reduced row-echelon form (RREF). So if and only if .
Key Formula
Where:
- = Two matrices of the same size, m by n
- = Elementary matrices, one for each row operation, applied in order from to
- = The invertible m by m product of the elementary matrices
Worked Example
Problem: Decide whether and are row equivalent.
Step 1: Reduce to reduced row-echelon form.
Step 2: Reduce the same way. Use , then , then , then .
Step 3: The two RREFs match, so . To build an explicit path from to , first apply 's two operations. Then undo 's operations in reverse order, replacing each one with its inverse: , then (its own inverse), then , then .
Answer: Yes. and are row equivalent because they share the same reduced row-echelon form.
Why It Matters
Gaussian elimination works because row-equivalent augmented matrices represent systems with exactly the same solution set. In a first linear algebra course, row equivalence also gives the standard invertibility test: a square matrix is invertible if and only if .
Common Mistakes
Mistake: Assuming row-equivalent matrices share everything, including their column space or determinant.
Correction: Row operations preserve the row space, the null space, and the rank. They can change the column space and the determinant. For example, and differ by one row swap, yet their column spaces are different lines.
