GraphMath

Row reduction

Echelon forms, pivots, rank and what elimination reveals

What does row reduction preserve, and what does it expose?

Row reduction transforms a matrix or an augmented system into a simpler equivalent form while preserving the solution set. This chapter develops echelon and reduced echelon forms, explains the algorithm through elementary operations and matrices, connects pivots to rank and dependence and shows what echelon form reveals algebraically and geometrically.

Open chapter PDF Key ideas Chapter index Back to Linear Algebra

Key ideas

Row reduction is not only a solving procedure. It is a structural tool that simplifies a matrix while keeping the important facts unchanged.

  • Echelon and reduced echelon forms organize pivots into a staircase pattern that makes dependence and solvability visible
  • Elementary row operations preserve the solution set of an augmented system and preserve matrix rank
  • Pivot columns mark structurally essential directions, while non-pivot columns mark dependent or redundant ones
  • The number of pivots gives rank, so echelon form turns independence into something countable
  • Row reduction changes rows by linear combinations, but the pivot positions still reveal which original columns matter
  • Elementary matrices show that the whole algorithm can be written as multiplication by invertible transformations

The chapter moves from definitions and mechanics to structure, then ends with numerical considerations and a fully visual 3×3 example.

Why are pivots so important?

Because each pivot marks a new independent direction that survives the reduction process. From those pivot positions we can read rank, constrained variables, free variables and which columns are essential to the span.

Related chapters

  • Linear equations uses reduced echelon form to solve systems and interpret pivot and free variables
  • Rank develops rank further after this chapter introduces it through pivot rows and pivot columns
  • First steps introduces span, independence and the first encounter with Ax = b, which row reduction turns into an algorithmic procedure
  • Inverse uses row reduction to test invertibility and compute inverses through augmented matrices
  • The four fundamental subspaces develops the deeper structural meaning of rank, pivot structure and dependence revealed here

Examples with visualizations

2×2 row reduction example

A step-by-step reduced echelon example with geometric line views

2 by 2 row reduction worked example showing algebraic steps, column direction frames and row normal line views
Full solution PDF

3×3 row reduction example

A step-by-step reduced echelon example with geometric plane views

3 by 3 row reduction worked example showing algebraic steps, column direction frames and row normal plane views
Full solution PDF

Chapter contents

The PDF is a single document. The page links below are best-effort: most browsers support them, but some viewers may ignore the page hint.

Topic Pages
Motivation 1
Definition of echelon form 2
Definition of reduced echelon form 3
Utility of row reduction algorithm 3–4
Row reduction algorithm overview 4–5
When are row exchanges needed? 5–6
Elementary matrices 6–7
Definition & calculation of rank 7–8
Row reduction steps preserve rank 8
Row rank = Col rank ⇔ rank(M) = rank(Mᵀ) 8–9
Rows & columns before & after row reduction 10
Reduced row echelon form of a full-rank n × n matrix is the identity matrix 10–11
Proof of linearly dependent columns → non-pivot columns & the corollary 11–13
What echelon form reveals 13–14
What echelon form reveals geometrically 15
Partial pivoting 15–16
Row reduction of a 3×3 matrix 16–17
Open PDF

What does echelon form reveal geometrically?

It shows which vectors contribute new directions and which do not. Pivot columns identify a minimal spanning set, while non-pivot columns reveal vectors that lie in the span of earlier pivot columns.

Was this chapter helpful?

Quick feedback helps us improve the site.

Yes No