Row Reduction

A rigorous guide to elementary row operations, RREF, equivalence, rank, and subspace extraction.

Represent → transform → verify. A linear-algebra object is represented as coordinates or a matrix, transformed through valid row or column operations, and checked against the original invariant or equation.

Precise definition

Row reduction uses three reversible operations: interchange two rows, multiply a row by a nonzero scalar, and add a multiple of one row to another. These operations create a row-equivalent matrix, usually REF or RREF.

Notation and mathematical language

Row equivalence preserves the solution set of $Ax=b$, the null space of a coefficient matrix, row space, and rank. It does not preserve the literal column space, determinant value without tracking, eigenvalues, or the represented linear transformation.

Conceptual picture

Each operation replaces equations by equivalent linear combinations. RREF exposes pivot variables and free variables, while the nonzero rows of RREF form a basis of the row space.

Fully worked example

Interpretation and application

Row reduction solves systems and computes rank, inverses, kernels, and bases. It is exact as an algebraic procedure; with measured or floating data, conditioning and tolerance determine whether a near-zero pivot should be treated as zero.