Elementary Row Operations and Row Equivalence

Overview

A system of linear equations can be manipulated in three ways that leave its solution set untouched: the equations can be listed in a different order, an equation can be multiplied through by a non-zero constant, and a multiple of one equation can be added to another. Once the system has been packed into an augmented matrix, each of those manipulations becomes an operation on rows of numbers. The equations disappear; the arithmetic remains.

That translation is the whole point. Working with equations forces the symbols $x_1, x_2, \ldots, x_n$ to be carried through every step even though they never change and never take part in the arithmetic. Working with rows strips the notation down to what actually gets computed. The resulting operations — the elementary row operations — are simple enough to be executed by hand, by a fixed algorithm, or by a machine, and they are the atoms from which Gauss-Jordan elimination, matrix inversion, determinant evaluation by reduction, and the extraction of the fundamental subspaces are all built.

Two matrices are row-equivalent when one can be reached from the other by some finite sequence of these operations. Because every elementary row operation is reversible by another operation of the same type, row equivalence is symmetric as well as reflexive and transitive: it is a genuine equivalence relation, and it therefore carves the set of all $m \times n$ matrices into disjoint classes. Every member of a class encodes the same underlying linear system, and any member may be substituted for any other whenever the question at hand is about that system.

The engineering value is leverage. A large, badly conditioned-looking array of measured coefficients can be traded for a sparse, structured member of the same class without changing a single conclusion that can be drawn about the system. Selecting the best member of the class — the reduced row-echelon form — is the subject of the next step; establishing that any member will do is the subject of this one.

Definition

Row Operations

Each of the following three transformations converts an $m \times n$ matrix into a different matrix of the same size, and each is called an elementary row operation.

Interchange. Exchange the entire contents of two rows. Written $R_i \leftrightarrow R_j$ .
Scaling. Multiply every entry of a single row by the same non-zero scalar $\alpha$ . Written $\alpha R_i$ . The restriction $\alpha \ne 0$ is essential — scaling by zero destroys information and is not reversible.
Replacement. Multiply every entry of one row by a scalar $\alpha$ and add the results, entry by entry, to a second row. The row that was multiplied is left unchanged; only the target row is overwritten. Written $\alpha R_i + R_j$ , meaning row $j$ becomes $\alpha R_i + R_j$ .

In the shorthand $\alpha R_i + R_j$ the target row is always the one written last. Reading the notation in the wrong direction is the single most common source of arithmetic error in hand reduction.

Row-Equivalent Matrices

REM

Two matrices $A$ and $B$ of the same size are row-equivalent, written $A \sim B$ , when one can be obtained from the other by applying a finite sequence of elementary row operations. The sequence may be empty, so every matrix is row-equivalent to itself.

Row equivalence is defined only between matrices of identical size. It says nothing about matrices that differ in shape, and it is unrelated to equality of entries.

Concepts

Why the solution set survives

The central theorem of this topic states that if two augmented matrices are row-equivalent, the systems of linear equations they represent have exactly the same solution set. The proof is short because the work has already been done at the level of equations: a single row operation on an augmented matrix produces precisely the same effect as the corresponding equation operation on the system, and each equation operation is known to preserve solutions.

The reasoning for the replacement operation is worth spelling out, because it is the only one that is not obvious. Suppose a vector $\vec{x}$ satisfies both equation $i$ and equation $j$ . Then it satisfies any linear combination of them, so it satisfies the new equation $j$ . Conversely, if $\vec{x}$ satisfies the new equation $j$ and the untouched equation $i$ , subtracting $\alpha$ times equation $i$ recovers the original equation $j$ . Solutions therefore pass in both directions, which is exactly the statement that the solution set is unchanged rather than merely enlarged or shrunk.

Reversibility and what it buys

Each operation has an inverse of the same type. An interchange undoes itself: applying $R_i \leftrightarrow R_j$ twice restores the original. Scaling by $\alpha \ne 0$ is undone by scaling by $1/\alpha$ , which is why the non-zero restriction cannot be relaxed. Replacement by $\alpha R_i + R_j$ is undone by $-\alpha R_i + R_j$ , because row $i$ is not modified during the operation and is still available afterwards in its original form.

Reversibility is not a technicality. It is what upgrades “ $B$ can be reached from $A$ ” into “ $A$ and $B$ are interchangeable”. Without it the relation would be a one-way reachability, conclusions drawn from $B$ could not be transferred back to $A$ , and the entire method of solving a system by simplifying it would collapse.

Row equivalence is an equivalence relation

Three facts establish it. Reflexivity: $A \sim A$ , using the empty sequence of operations. Symmetry: if $A \sim B$ then $B \sim A$ , by reversing the sequence and replacing each operation with its inverse. Transitivity: if $A \sim B$ and $B \sim C$ then $A \sim C$ , by concatenating the two sequences.

A relation with these three properties behaves like equality without being as strict as equality, and it therefore partitions the underlying set into disjoint classes. Every $m \times n$ matrix belongs to exactly one row-equivalence class, and two matrices are row-equivalent precisely when they belong to the same one. The whole strategy of elimination is to move within a class towards its most convenient member.

Row operations as left multiplication

Every elementary row operation on an $m \times n$ matrix $A$ can be realised as multiplication on the left by a square $m \times m$ elementary matrix, obtained by applying that same operation to the identity matrix $I_m$ . A sequence of $k$ operations therefore corresponds to a product $E_k \cdots E_2 E_1 A = B$ , and setting $J = E_k \cdots E_2 E_1$ gives $JA = B$ with $J$ invertible, since each $E_i$ is invertible by reversibility.

This reformulation is the bridge from bookkeeping to algebra. It explains why row reduction of $[\, A \mid I_m \,]$ produces the transforming matrix $J$ in the right-hand block, why the same machinery computes a matrix inverse, and why row operations scale determinants in a predictable way. It also makes the asymmetry with column operations explicit: columns correspond to multiplication on the right, which changes the variables rather than the equations.

Row operations do not preserve everything

The invariants of row equivalence are precisely those attached to the row space and to the solution set: the row space itself, the null space, the rank, and the linear dependence relations among the columns. The column space is not preserved — the columns of the reduced matrix generally span a different subspace from the columns of the original, even though the pattern of dependence among them is identical. Neither is the determinant preserved, though it is scaled by a factor that each operation determines exactly.

Knowing which quantities survive is the difference between a valid argument and a plausible-looking one. Any claim of the form “ $A$ and its reduced form share property $P$ ” requires $P$ to be a row-equivalence invariant, and the column space is the classic counterexample that catches practitioners out.

Choosing the operations in practice

The definition permits any sequence; efficiency and accuracy dictate a much narrower choice. In exact arithmetic, interchanges are used to place a convenient entry — ideally a $1$ or a small integer — in the pivot position so that scaling introduces no fractions, and the whole reduction can often be carried out in integers by deferring the scaling step until the end. In floating-point arithmetic, interchanges are used to place the entry of largest magnitude in the pivot position, because the multiplier in the replacement step is then bounded by one in modulus and rounding errors do not amplify.

Both strategies exploit the same fact: the destination is fixed, so the operations may be chosen entirely on grounds of numerical or arithmetic convenience without any risk of reaching a different answer.

Applying a row operation correctly

Identify the target rowIn

\alpha R_i + R_j

the target is row

j

, written last. Only that row changes; row

i

is read but never modified.

Check the scalarFor a scaling operation

\alpha R_i

, confirm

\alpha \ne 0

. Scaling by zero is not an elementary row operation and destroys the row.

Compute entry by entryApply the arithmetic to all

n

columns of the target row, including the augmented column. Skipping the constants column is the most frequent hand error.

Record the operationWrite the shorthand beside the arrow. The record is what makes the reduction auditable and what allows the transforming matrix to be reconstructed.

Confirm reversibilityEvery step must be undoable by a single operation of the same type. If it is not, the step was not an elementary row operation.

Equations

The three elementary row operations in shorthand

EQ-RO-01

R_{i} \leftrightarrow R_{j}, α R_{i} (α \neq 0), α R_{i} + R_{j}

Interchange, scaling and replacement, in the standard shorthand used throughout the library. The first exchanges rows $i$ and $j$ ; the second multiplies row $i$ by a non-zero scalar; the third overwrites row $j$ with $\alpha$ times row $i$ added to it, leaving row $i$ untouched.

Replacement operation, entry by entry

EQ-RO-02

[B]_{j k} = α [A]_{i k} + [A]_{j k}, [B]_{p k} = [A]_{p k} (p \neq j), 1 \leq k \leq n

The replacement operation written on entries. Every column $k$ is affected in the target row, and no other row changes at all.

Inverse of each elementary row operation

EQ-RO-03

(R_{i} \leftrightarrow R_{j}) \mapsto (R_{i} \leftrightarrow R_{j}), (α R_{i}) \mapsto (\frac{1}{α} R_{i}), (α R_{i} + R_{j}) \mapsto (- α R_{i} + R_{j})

Each operation is undone by exactly one operation of the same type. The middle identity requires $\alpha \ne 0$ , which is why scaling by zero is excluded from the definition.

Row equivalence as an equivalence relation

EQ-RO-04

A \sim A, A \sim B \Rightarrow B \sim A, (A \sim B and B \sim C) \Rightarrow A \sim C

Reflexivity, symmetry and transitivity. Together they partition $M_{mn}$ into disjoint row-equivalence classes.

Row-equivalent augmented matrices represent equivalent systems

EQ-RO-05

Row-equivalent augmented matrices represent equivalent systems

The theorem that licenses the entire method: row-equivalent augmented matrices have identical solution sets, so the simpler one may be analysed in place of the original.

Sequence of operations as a single non-singular factor

EQ-RO-06

Sequence of operations as a single non-singular factor

Each $E_i$ is the elementary matrix obtained by applying operation $i$ to $I_m$ . Every row-equivalence between $A$ and $B$ is equivalent to the existence of a non-singular $J$ with $JA = B$ .

Elementary matrices for a size-3 example

EQ-RO-07

Elementary matrices for a size-3 example

Each is the identity matrix with the corresponding operation already applied. Left multiplication by these matrices reproduces the operations exactly.

Variable Definitions

Symbols used on this page
Symbol	Name	Meaning	Domain / type
$A$	Original matrix	The $m \times n$ array on which operations are performed	m x n matrix
$B$	Transformed matrix	The result of applying a sequence of row operations to $A$	m x n matrix
$R_{i}$	Row $i$	The $i$ -th row of the matrix, treated as a single object in the operation shorthand	1 to m
$α$	Operation scalar	Multiplier used in a scaling or replacement operation; non-zero for scaling	complex scalar
$\sim$	Row equivalence	Relation holding between two matrices connected by a finite sequence of row operations	relation on M_mn
$E_{i}$	Elementary matrix	The identity matrix $I_m$ with a single row operation applied to it	m x m non-singular matrix
$J$	Transforming matrix	Product of the elementary matrices for the whole sequence, satisfying $JA = B$	m x m non-singular matrix
$[A ∣ \vec{b}]$	Augmented matrix	Coefficient matrix with the constants appended as a final column	m x (n+1) matrix
$S$	Solution set	Set of all vectors satisfying the represented system; invariant under row operations	subset of C^n

Worked Numerical Example

Problem statement

A three-loop resistive network is described by the system $x_1 + 2x_2 - x_3 = 2$ , $2x_1 + 3x_2 + x_3 = 11$ , $-x_1 + x_2 + 4x_3 = 13$ , where the unknowns are loop currents in amperes. Reduce the augmented matrix to an upper triangular form using elementary row operations only, recording each operation, then demonstrate that the sequence is reversible.

Form the augmented matrix
Coefficients occupy the first three columns in the order $x_1, x_2, x_3$ ; the constants occupy the fourth. The vertical rule is a reading aid and carries no arithmetic meaning — the constants column takes part in every operation exactly like any other column.
$[\begin{matrix} 1 & 2 & - 1 & 2 \\ 2 & 3 & 1 & 11 \\ - 1 & 1 & 4 & 13 \end{matrix}]$
Clear column 1 with two replacement operations
Entry $(1,1)$ is already $1$ , so no interchange or scaling is needed. Apply $-2R_1 + R_2$ : row 2 becomes $(2-2,\ 3-4,\ 1+2,\ 11-4) = (0,\ -1,\ 3,\ 7)$ . Then apply $1R_1 + R_3$ : row 3 becomes $(-1+1,\ 1+2,\ 4-1,\ 13+2) = (0,\ 3,\ 3,\ 15)$ . Row 1 is read twice and modified never.
$Clear column 1 with two replacement operations$
Scale row 2 to obtain a leading one
Apply $-1R_2$ . The scalar is non-zero, so the operation is legitimate and reversible by $-1R_2$ again. Deferring this scaling until the column below has been cleared would also have been valid; the order is a matter of arithmetic taste, not correctness.
$Scale row 2 to obtain a leading one$
Clear below the second pivot
Apply $-3R_2 + R_3$ : row 3 becomes $(0,\ 3-3,\ 3+9,\ 15+21) = (0,\ 0,\ 12,\ 36)$ . Then apply $\tfrac{1}{12} R_3$ to produce the third leading one.
$[\begin{matrix} 1 & 2 & - 1 & 2 \\ 0 & 1 & - 3 & - 7 \\ 0 & 0 & 1 & 3 \end{matrix}]$
Read the equivalent system
The final matrix is row-equivalent to the first, so by the equivalence theorem the system it represents has exactly the same solution set as the original. That system is $x_1 + 2x_2 - x_3 = 2$ , $x_2 - 3x_3 = -7$ , $x_3 = 3$ . Back-substituting gives $x_3 = 3$ , then $x_2 = -7 + 9 = 2$ , then $x_1 = 2 - 4 + 3 = 1$ .
$x_{1} = 1, x_{2} = 2, x_{3} = 3$
Verify in the original equations
Substitution into the untouched original system is the only check that catches an arithmetic slip made during reduction: $1 + 4 - 3 = 2$ ; $2 + 6 + 3 = 11$ ; $-1 + 2 + 12 = 13$ . All three hold, so the reduction was performed correctly.
$[\begin{matrix} 1 & 2 & - 1 \\ 2 & 3 & 1 \\ - 1 & 1 & 4 \end{matrix}] [\begin{matrix} 1 \\ 2 \\ 3 \end{matrix}] = [\begin{matrix} 2 \\ 11 \\ 13 \end{matrix}]$
Reverse the sequence
Running the record backwards, replacing each operation with its inverse, returns the starting matrix: $12 R_3$ , then $3R_2 + R_3$ , then $-1R_2$ , then $-1R_1 + R_3$ , then $2R_1 + R_2$ . Because reversal is always possible, the two matrices are interchangeable rather than merely connected in one direction.
$[\begin{matrix} 1 & 2 & - 1 & 2 \\ 0 & 1 & - 3 & - 7 \\ 0 & 0 & 1 & 3 \end{matrix}] \sim [\begin{matrix} 1 & 2 & - 1 & 2 \\ 2 & 3 & 1 & 11 \\ - 1 & 1 & 4 & 13 \end{matrix}]$

Result

Five elementary row operations reduce a fully populated coefficient array to a triangular one whose solution can be read off by inspection. The loop currents are $1\,\mathrm{A}$ , $2\,\mathrm{A}$ and $3\,\mathrm{A}$ . The reduction changed the numbers on the page but not one property of the network: the two augmented matrices lie in the same row-equivalence class and describe the same physical circuit.

Applications & Industry Use

Electrical engineering

Mesh and nodal analysis by hand

Loop current and node voltage formulations produce a coefficient matrix populated directly from resistances and conductances. Elementary row operations are the standard hand technique for reducing such systems, and the operation record doubles as a design audit trail showing exactly which loops were combined to eliminate which unknown.

Structural engineering

Condensing degrees of freedom

Static condensation eliminates interior degrees of freedom from a stiffness matrix before assembly of a superelement. The elimination is a sequence of replacement operations applied to the rows corresponding to the interior nodes, and reversibility guarantees the condensed model carries the same information as the full one.

Chemical process engineering

Reconciling redundant mass balances

Plant mass balances are typically written with more equations than independent constraints. Row operations reveal which balance equations are combinations of others, and the operation record identifies precisely which streams were used to derive the redundant relation — information that a rank number alone does not provide.

Computing & numerical software

The inner loop of LU factorisation

A dense LU factorisation is nothing but a disciplined sequence of interchanges and replacement operations, with the multipliers $\alpha$ stored rather than discarded. The stored multipliers form the lower triangular factor, so the operation record is the factorisation.

Cryptography & coding theory

Bringing a generator matrix to standard form

A linear block code is unchanged when its generator matrix undergoes row operations, because the row space — the set of codewords — is a row-equivalence invariant. Reduction to systematic form $[\, I_k \mid P \,]$ is performed exactly this way over the finite field of the code.

Surveying & geodesy

Eliminating nuisance parameters

Adjustment computations carry parameters of no interest, such as receiver clock offsets. Adding a multiple of one observation equation to another removes the nuisance term while leaving the estimated coordinates untouched, which is a replacement operation applied for a purely modelling reason.

Design Considerations

Never scale by zero, and never scale to clear a fraction you have not checked

The prohibition on $\alpha = 0$ exists because such an operation cannot be undone: the row is annihilated and the equation it represented is silently discarded, which can convert an inconsistent system into a consistent one. Scaling by a symbolic expression carries the same danger whenever that expression can vanish for some parameter value, so any parameter-dependent scaling must be accompanied by an explicit case split.

Restrict every step to rows

Column operations look symmetric and are not. Exchanging two columns of an augmented matrix reorders the unknowns without relabelling them, and adding a multiple of one column to another changes the system entirely. Neither preserves the solution set. If a column permutation is genuinely wanted — for numerical pivoting, for instance — the permutation must be recorded and undone when the solution is reported.

Choose interchanges for stability, not for tidiness

Since the reachable set is unaffected by the order of operations, interchanges are free to be selected on numerical grounds. Partial pivoting places the entry of largest magnitude in the pivot position so that every replacement multiplier satisfies $|\alpha| \le 1$ , bounding error growth. In exact rational arithmetic the opposite instinct applies: choose the entry that keeps the fractions smallest.

Keep the record if you will need the transformation

The sequence of operations is often more valuable than the destination. It determines the non-singular $J$ with $JA = B$ , the factor by which the determinant was scaled, and the multipliers of an LU factorisation. Recording operations costs nothing at the time and cannot be reconstructed cheaply afterwards, so decide before starting whether the transformation is needed.

Batch multiple right-hand sides

If several load cases share a coefficient matrix, append all the constant vectors as extra columns and reduce the whole block once. The operations depend only on the coefficient part, so this costs a fraction more per additional right-hand side and avoids repeating the dominant cubic work.

Watch for growth in exact arithmetic

Replacement operations on integer matrices can inflate entries rapidly, and rational arithmetic can produce numerators and denominators far larger than anything in the input or output. For matrices beyond a few hundred rows, a fraction-free elimination or a modular approach is preferable to naive rational row operations.

Standards & Codes

Notation, interchange and numerical standards that govern how this material is written down, stored and computed in production systems.

Applicable standards, conventions and reference implementations
Reference	Title	Relevance to this topic
`ISO 80000-2`	Quantities and units — Part 2: Mathematics	Fixes the typographic conventions used for the objects manipulated here: italic scalars, bracketed matrices, and upright operator names. The row-operation shorthand $\alpha R_i + R_j$ is a discipline convention rather than a standardised symbol, so it must be defined wherever it is used in a formal document.
`IEEE 754-2019`	IEEE Standard for Floating-Point Arithmetic	Defines the rounding behaviour of the multiply-add that constitutes a replacement operation. Because the standard guarantees correctly rounded results but not exact ones, a sequence of row operations that is mathematically reversible is only approximately reversible in binary floating point.
`BLAS Level 1`	Basic Linear Algebra Subprograms, vector operations	The replacement operation is exactly the `xAXPY` kernel, $\vec{y} \leftarrow \alpha \vec{x} + \vec{y}$ , and scaling is `xSCAL`. Row interchange is `xSWAP`. All three elementary operations are therefore single standardised library calls.
`LAPACK reference`	Linear Algebra PACKage reference implementation	The routine `xLASWP` applies a recorded sequence of row interchanges to a matrix, and `xGETRF` returns the interchange record as an integer pivot array. Industrial practice stores the operation sequence rather than the intermediate matrices.
`ISO/IEC 40314`	Mathematical Markup Language (MathML) Version 3.0	Encodes the matrices and operation annotations on this page as structured markup, so that intermediate reduction states remain machine-readable and accessible to assistive technology rather than being flattened into images.

Material Selection

For a mathematical topic, "material" is the numeric representation: the scalar field, storage format and precision the computation is built from.

Representation and precision selection
Representation	Select when	Trade-off
Exact integer arithmetic with deferred scaling	Small integer matrices reduced by hand or symbolically, where fractions are an obstacle to checking.	Every intermediate entry stays an integer and every step is verifiable by inspection, but the result is not in reduced form until the scaling operations are applied at the end.
Exact rational arithmetic	Symbolic work where the pivot pattern and the exact solution are both required.	No tolerance decisions and no rounding, at the cost of unbounded growth in numerator and denominator size as replacement operations accumulate.
IEEE 754 binary64	Numerical solution of engineering systems of moderate to large size.	Predictable speed and memory, but reversibility becomes approximate; undoing a long sequence of operations does not recover the original matrix bit for bit.
Fixed-point arithmetic	Embedded controllers and FPGA implementations where no floating-point unit is available.	Deterministic timing and small silicon area, but scaling operations demand explicit range analysis to avoid overflow, and the non-zero pivot test becomes a magnitude threshold.
Finite field arithmetic modulo a prime	Coding theory, cryptography, and modular rank certification.	Exact, with operand size fixed and no growth at all, but the notion of a “large” pivot for stability purposes does not exist, and results must be interpreted only within that field.
Sparse row storage with an operation log	Very large structured systems where the matrix itself cannot be held densely.	Replacement operations create fill-in, so the log of operations may be far cheaper to store than the sequence of intermediate matrices; a fill-reducing ordering must be chosen before any operation is applied.

Manufacturing Notes

Implementation notes — how the result is actually produced by hand, by algorithm and by library, including cost and numerical behaviour.

Cost of a single operation

On a matrix with $n$ columns, an interchange moves $2n$ values and performs no arithmetic; a scaling performs $n$ multiplications; a replacement performs $n$ multiplications and $n$ additions, or $n$ fused multiply-add instructions. Full elimination of an $n \times n$ system uses roughly $n^2/2$ replacement operations, giving the familiar $\tfrac{2}{3}n^3$ floating-point operation count.

Hand procedure that avoids the common errors

Fix the pivot row before touching anything else and do not modify it while it is in use. Clear the entire column in one pass, writing every operation beside its arrow. Carry the constants column at every step. Where the arithmetic permits, defer scaling operations so that intermediate entries stay integral, then normalise once at the end.

Interchanges are usually simulated, not performed

Production code rarely moves data during an interchange. Instead a permutation vector is updated and rows are addressed indirectly, or the permutation is applied once at the end. LAPACK follows the second approach, returning an integer pivot array from the factorisation and providing xLASWP to apply it. Physically swapping rows in a large dense array costs memory bandwidth for no arithmetic gain.

Verification of a reduction

Two checks are worth performing. Substitute a candidate solution into the original equations, since an error made during reduction produces a matrix that is internally consistent but no longer row-equivalent to the input. Independently, accumulate the operations into $J$ and confirm $JA = B$ directly; the residual $\|JA - B\|$ also quantifies how far floating-point reversibility has been lost.

Library surfaces for the operations

SymPy exposes row-level manipulation through Matrix.row_op, Matrix.row_swap and Matrix.elementary_row_op, which are useful for reproducing a hand reduction exactly. NumPy offers no row-operation API by design: the intended interface is a factorisation such as scipy.linalg.lu_factor, which performs the operations internally and returns their record as pivot indices.

Failure Modes & Common Mistakes

Failure modes, root causes and prevention
Failure mode / mistake	Impact	Root cause	Prevention & detection
Reading the replacement shorthand backwards	high	Interpreting $\alpha R_i + R_j$ as an instruction to overwrite row $i$ rather than row $j$ .	Adopt the invariant that the target row is always the one written last, and confirm after every step that exactly one row has changed.
Forgetting the constants column	high	Applying the operation to the coefficient block only, so the augmented column falls out of step with the coefficients.	Treat the augmented matrix as a single array with $n+1$ columns and apply every operation across its full width.
Scaling a row by zero	high	Multiplying by an expression that turns out to vanish, typically a symbolic parameter.	State and check the non-vanishing condition explicitly, and split the analysis into cases wherever a parameter can make the multiplier zero.
Applying column operations	high	Assuming symmetry between rows and columns because both look like arrays of numbers.	Restrict every step to rows. Column operations change the variables, correspond to multiplication on the right, and do not preserve the solution set.
Modifying the pivot row mid-pass	medium	Using a row that has already been altered in the current step as the source for the next elimination in the same column.	Lock the pivot row for the duration of the column pass and use only its original values as the source.
Claiming the column space is preserved	medium	Over-generalising from the fact that the row space, null space and rank are all row-equivalence invariants.	Remember that only the dependence relations among columns survive, not the span of the columns. Recover the column space from the original columns indexed by the pivot positions.
Assuming determinant invariance	medium	Treating row equivalence as if it preserved every scalar attached to the matrix.	Track the scaling factor: an interchange negates the determinant, scaling by $\alpha$ multiplies it by $\alpha$ , and replacement leaves it unchanged.
Relying on exact reversibility in floating point	low	Undoing a long recorded sequence of operations and expecting the original entries to return exactly.	Treat reversibility as a mathematical property, not a numerical one. Retain the original matrix rather than attempting to reconstruct it.

FAQs

Why are there exactly three elementary row operations and not more?

Three suffice to reach the reduced row-echelon form of any matrix, which is the canonical representative of the row-equivalence class, so no fourth operation could extend the reachable set. They are also independent: none of the three can be expressed as a finite sequence of the other two. Anything larger would be redundant, anything smaller would be insufficient.

Is row equivalence the same as the two matrices being equal?

No. Row-equivalent matrices normally have completely different entries; what they share is a row space, a null space, a rank, and the solution set of the system they represent when augmented identically. Equality is a much stronger condition, and only the empty sequence of operations preserves it.

Can I apply several row operations at once?

Two replacement operations with different target rows commute and can safely be performed in the same pass, which is what makes column clearing parallelisable. Operations that share a target row, or that modify a row being used as a source, do not commute and must be sequenced explicitly. When in doubt, apply one operation at a time and re-read the matrix between steps.

Do row operations change the determinant?

They change it in a completely predictable way. An interchange multiplies the determinant by $-1$ , scaling a row by $\alpha$ multiplies it by $\alpha$ , and a replacement operation leaves it unchanged. Tracking these factors during a reduction to triangular form is the standard efficient method of evaluating a determinant.

Why is the solution set unchanged rather than merely contained in the new one?

Because each operation is reversible. The forward operation shows every original solution satisfies the new system, and the inverse operation shows every new solution satisfies the original one. Containment in both directions is set equality; without reversibility only one containment would follow.

Do row operations preserve the column space of a matrix?

No, and this is the classic trap. Row operations preserve the row space, the null space and the rank, and they preserve the linear dependence relations among the columns, but the span of the columns generally changes. A basis for the column space must be assembled from columns of the original matrix, selected by the pivot positions found in the reduced one.

What does row equivalence look like in matrix algebra terms?

$A$ and $B$ are row-equivalent exactly when there exists a non-singular matrix $J$ with $JA = B$ . Each elementary operation corresponds to left multiplication by an invertible elementary matrix, and the product of those matrices is $J$ . This viewpoint explains why row operations preserve the null space, since $JA\vec{x} = \vec{0}$ and $A\vec{x} = \vec{0}$ have the same solutions when $J$ is invertible.

References

Beezer, R. A. A First Course in Linear Algebra, Version 0.70. University of Puget Sound, 2006. Section RREF, Definition RO and Definition REM. Licensed under the GNU Free Documentation License v1.2.
ISO 80000-2:2019, Quantities and units — Part 2: Mathematics. International Organization for Standardization.
IEEE 754-2019, IEEE Standard for Floating-Point Arithmetic. Institute of Electrical and Electronics Engineers.
Golub, G. H. and Van Loan, C. F. Matrix Computations, 4th edition. Johns Hopkins University Press, 2013.
Anderson, E. et al. LAPACK Users' Guide, 3rd edition. Society for Industrial and Applied Mathematics, 1999.
Higham, N. J. Accuracy and Stability of Numerical Algorithms, 2nd edition. Society for Industrial and Applied Mathematics, 2002.

AI Suggested Questions

Construct two 3x3 matrices that are row-equivalent but share no identical entries, and give the explicit operation sequence connecting them.
Show why adding a multiple of one column to another can change the solution set of a system, with a concrete two-variable counterexample.
Derive the elementary matrix for each of the three row operations on a 4x4 matrix and verify that left multiplication reproduces the operation.
How badly does reversibility of a recorded operation sequence degrade in binary64 for an ill-conditioned 100x100 matrix?
Explain how partial pivoting bounds the replacement multipliers and what that implies for the growth factor during elimination.
Which matrix properties are invariant under row equivalence, which under column equivalence, and which under both?

Related Calculators

Row Operation Stepper

Apply interchange, scaling and replacement operations one at a time to a matrix, with a full reversible history.

RREF Calculator

Reduce any matrix to reduced row-echelon form and export the exact sequence of elementary row operations used.

Row Equivalence Checker

Decide whether two matrices of the same size are row-equivalent and, if so, report the non-singular matrix $J$ with $JA = B$ .