Row Operations

Row Operations

The following methods used to transform matrices: trading two rows, multiplying a row by a nonzero scalar, or adding a scalar multiple of one row to another row.

Example 1: Trading rows 1 and 2 in a 3x3 matrix. Original: [[1,2,3],[4,5,6],[7,8,9]]. Result: [[4,5,6],[1,2,3],[7,8,9]]
Example 2: Row 3 multiplied by -10. Original matrix [[1,2,3],[4,5,6],[7,8,9]]; Result: [[1,2,3],[4,5,6],[-70,-80,-90]]
Example 3: Matrix row operation adding -4 times row 1 to row 3, transforming [[1,2,3],[4,5,6],[7,8,9]] to...

Key Formula

\text{Type 1: } R_i \leftrightarrow R_j \qquad \text{Type 2: } kR_i \to R_i \qquad \text{Type 3: } R_i + kR_j \to R_i

Where:

$R_i, R_j$ = Rows i and j of the matrix
$k$ = A nonzero scalar (any nonzero real number)
$\leftrightarrow$ = Swap (interchange) the two rows
$\to$ = "Replaces" — the result replaces the row on the left

Worked Example

Problem: Use row operations to transform the following matrix into row-echelon form:

\begin{bmatrix} 0 & 1 & 3 \\ 2 & 4 & 6 \\ 1 & 3 & 5 \end{bmatrix}

Step 1: Swap rows 1 and 3 so that the leading entry in row 1 is nonzero (Type 1 operation: R₁ ↔ R₃).

\begin{bmatrix} 1 & 3 & 5 \\ 2 & 4 & 6 \\ 0 & 1 & 3 \end{bmatrix}

Step 2: Eliminate the 2 below the leading 1 in column 1 by replacing R₂ with R₂ − 2R₁ (Type 3 operation).

R_2 - 2R_1 \to R_2: \quad \begin{bmatrix} 1 & 3 & 5 \\ 0 & -2 & -4 \\ 0 & 1 & 3 \end{bmatrix}

Step 3: Multiply R₂ by −1/2 to make its leading entry equal to 1 (Type 2 operation).

-\tfrac{1}{2}R_2 \to R_2: \quad \begin{bmatrix} 1 & 3 & 5 \\ 0 & 1 & 2 \\ 0 & 1 & 3 \end{bmatrix}

Step 4: Eliminate the 1 below the leading 1 in column 2 by replacing R₃ with R₃ − R₂ (Type 3 operation).

R_3 - R_2 \to R_3: \quad \begin{bmatrix} 1 & 3 & 5 \\ 0 & 1 & 2 \\ 0 & 0 & 1 \end{bmatrix}

Answer: The row-echelon form is

\begin{bmatrix} 1 & 3 & 5 \\ 0 & 1 & 2 \\ 0 & 0 & 1 \end{bmatrix}

. All three types of row operations were used.

Another Example

This example applies row operations to an augmented matrix to solve a system of linear equations, demonstrating how the operations lead all the way to reduced row-echelon form where you can read the solution directly.

Problem: Use row operations to solve the system of equations represented by the augmented matrix:

\left[\begin{array}{cc|c} 1 & 2 & 8 \\ 3 & 4 & 18 \end{array}\right]

Step 1: Eliminate the 3 in row 2, column 1 by replacing R₂ with R₂ − 3R₁.

R_2 - 3R_1 \to R_2: \quad \left[\begin{array}{cc|c} 1 & 2 & 8 \\ 0 & -2 & -6 \end{array}\right]

Step 2: Multiply R₂ by −1/2 to get a leading 1 in row 2.

-\tfrac{1}{2}R_2 \to R_2: \quad \left[\begin{array}{cc|c} 1 & 2 & 8 \\ 0 & 1 & 3 \end{array}\right]

Step 3: Eliminate the 2 above the leading 1 in column 2 by replacing R₁ with R₁ − 2R₂. This produces reduced row-echelon form.

R_1 - 2R_2 \to R_1: \quad \left[\begin{array}{cc|c} 1 & 0 & 2 \\ 0 & 1 & 3 \end{array}\right]

Answer: The solution is

x = 2

and

y = 3

Frequently Asked Questions

What are the three elementary row operations?

The three elementary row operations are: (1) swapping two rows, (2) multiplying an entire row by a nonzero scalar, and (3) adding a scalar multiple of one row to another row. These are the only operations allowed when performing Gaussian elimination or row reduction on a matrix.

Why do row operations not change the solution of a system of equations?

Each row operation corresponds to a legal algebraic manipulation of the original system: swapping two equations, multiplying both sides of an equation by a nonzero constant, or adding one equation to another. Since these algebraic steps never introduce or remove solutions, the transformed system has exactly the same solution set as the original.

When do you use row operations?

You use row operations whenever you need to simplify a matrix — most commonly to solve systems of linear equations via Gaussian elimination, to find the inverse of a matrix, or to determine the rank of a matrix. They are a core technique in any linear algebra or precalculus course.

Row-Echelon Form vs. Reduced Row-Echelon Form

	Row-Echelon Form	Reduced Row-Echelon Form
Definition	All entries below each leading 1 are zero; each leading 1 is to the right of the one above it	Same as row-echelon form, plus all entries above each leading 1 are also zero
Row operations used	Typically only forward elimination (working downward)	Forward and backward elimination (downward then upward)
How to read the solution	Requires back-substitution to find variable values	Solutions can be read directly from the matrix
Uniqueness	A matrix can have multiple row-echelon forms	Every matrix has exactly one reduced row-echelon form

Why It Matters

Row operations are the fundamental tool behind Gaussian elimination, which is how you solve systems of linear equations in algebra, precalculus, and linear algebra courses. They also appear when finding matrix inverses, computing determinants, and analyzing vector spaces. Mastering these three operations is essential before you can work with any matrix-based method.

Common Mistakes

Mistake: Multiplying a row by zero.

Correction: The scalar in a Type 2 operation must be nonzero. Multiplying a row by zero destroys information and changes the solution set, so it is not a valid elementary row operation.

Mistake: Changing both rows when adding one row to another.

Correction: In the operation R₁ + kR₂ → R₁, only R₁ is replaced. Row R₂ stays exactly as it was. A common error is accidentally modifying R₂ as well, which leads to incorrect results.

Related Terms

Matrix — The object row operations act on
Row of a Matrix — Individual rows that are manipulated
Row Reduction — The process of applying row operations systematically
Row-Echelon Form of a Matrix — One target form achieved via row operations
Reduced Row-Echelon Form of a Matrix — The unique fully simplified target form
Scalar — The nonzero constant used in Type 2 and Type 3 operations
Nonzero — Constraint on the scalar in row operations