From intersections and elimination to augmented matrices, row echelon form, and parametric solution sets — understanding linear systems as both geometry and structure
Every real system — a business, a physical structure, an electrical circuit, a supply chain, a network — involves many quantities that must satisfy many conditions simultaneously. The mathematics that describes this kind of constraint is the system of linear equations. You have already solved pairs of equations in Algebra I and Algebra II. This chapter deepens that skill into a complete theory: a systematic way of representing, analyzing, and solving any system of linear equations, regardless of size.
Chapter 3 connects what you already know about intersecting lines with the powerful methods of row reduction that linear algebra makes possible. You will move from two-variable systems solved by hand to three-variable systems described geometrically by planes, and finally to systems in any number of variables represented as augmented matrices. The chapter introduces the three elementary row operations, row echelon form, reduced row echelon form, pivot positions, free variables, and parametric solution sets — all in service of the single goal of understanding exactly when a system has one solution, no solution, or infinitely many solutions, and what those solutions look like structurally.
By the end of this chapter, you will be able to solve any linear system that can be represented exactly, classify the system by its solution structure, and interpret the result geometrically and in context. These skills will carry directly into Chapter 4 (matrix operations), Chapter 5 (matrix inverses), Chapter 8 (vector spaces), Chapter 10 (rank and null space), and every applied chapter in this book.
A small bakery sells loaves of bread for $4 each and muffins for $2 each. On Monday, 30 items were sold for a total of $96. How many loaves and how many muffins were sold? Now suppose you also know that the bakery sold exactly twice as many muffins as loaves. Does the new condition change the solution? What if the third condition were something impossible to satisfy along with the first two? By the end of this chapter, you will have a complete method — algebraic, matrix-based, and geometric — for answering these questions for any number of variables and any number of conditions.
A linear equation in variables x1, x2, …, xn is any equation that can be written in the form
a₁x₁ + a₂x₂ + ⋯ + aₙxₙ = b
where a1, a2, …, an and b are real numbers called coefficients and x1 through xn are the unknowns. Every variable appears to the first power only. There are no products of variables, no variables in denominators, and no variables under radicals or inside exponential functions.
A system of linear equations is a collection of two or more linear equations that all use the same variables and must all be satisfied at the same time. A solution of the system is an assignment of values to all variables that makes every equation in the system true simultaneously. If such an assignment exists, the system is called consistent. If no assignment satisfies all equations at once, the system is inconsistent.
| Type | Example | Why it qualifies |
|---|---|---|
| Linear | 3x − 2y = 7 | Both variables appear to the first power; no products of variables |
| Linear | x + y + z = 0 | Three variables, all first-power, sum equals zero |
| Not linear | xy + z = 5 | Contains a product of two variables |
| Not linear | x² + y = 3 | Variable raised to a power other than 1 |
| Not linear | 1/x + y = 2 | Variable in denominator |
Each linear equation in two variables describes a line in the coordinate plane. Each linear equation in three variables describes a plane in three-dimensional space. Solving a system geometrically means finding all points that lie on every line or plane in the system at the same time — their intersection.
The idea of simultaneous conditions is the heart of a linear system. Each equation acts as a constraint: it rules out most of the plane and keeps only the points along one line. Two constraints together keep only the points satisfying both. As you add more equations, each new constraint restricts the solution set further. The goal of this chapter is to develop a reliable method — rooted in matrix algebra — for finding exactly what survives all the constraints at once.
4x − 7y = 12x² + y = 3x + y + z − w = 0√x + 2y = 50.5x − 3y = 1xy = 6
A system of two linear equations in two variables x and y takes the general form:
a₁x + b₁y = c₁
a₂x + b₂y = c₂
Geometrically, each equation describes a line in the xy-plane. The solution of the system is the set of all points (x, y) that lie on both lines simultaneously. There are exactly three geometric possibilities for two lines in a plane.
| Case | Description | Number of Solutions | System Type |
|---|---|---|---|
| One intersection point | The lines cross at exactly one point | Exactly one solution | Consistent, independent |
| Parallel lines | Lines have the same slope but different y-intercepts; never meet | No solution | Inconsistent |
| Coincident lines | The two equations describe the same line | Infinitely many solutions | Consistent, dependent |
In substitution, you solve one equation for one variable, then substitute that expression into the other equation to produce a single-variable equation. Solve, then back-substitute to find the remaining variable.
x + 2y = 8 and 3x − y = 3.From equation 1: x = 8 − 2y
Substitute into equation 2:
3(8 − 2y) − y = 3
24 − 6y − y = 3
24 − 7y = 3
−7y = −21
y = 3
Back-substitute:
x = 8 − 2(3) = 8 − 6 = 2
In elimination, you multiply one or both equations by constants so that the coefficient of one variable becomes opposite in sign across the two equations. Adding the equations then eliminates that variable. Elimination is the method that generalizes most naturally into matrix row reduction, and it is the primary technique this chapter will develop further.
2x + 3y = 12 and 4x − y = 10. 2x + 3y = 12 [equation 1]
12x − 3y = 30 [equation 2 × 3]
─────────────────
14x = 42
x = 3
Substitute x = 3 into equation 1:
2(3) + 3y = 12
6 + 3y = 12
3y = 6
y = 2
x − 2y = 4 and −2x + 4y = 3. 2x − 4y = 8 [equation 1 × 2]
−2x + 4y = 3 [equation 2]
─────────────────
0 = 11 ← contradiction!
3x − 6y = 9 and −x + 2y = −3. 3x − 6y = 9 [equation 1]
−3x + 6y = −9 [equation 2 × 3]
─────────────────
0 = 0 ← always true
x − 2y = 3, so x = 3 + 2y. The solution set is all pairs of the form (3 + 2y, y) for any value of y. The system has infinitely many solutions — it is consistent and dependent.y = 2x − 1, 3x + y = 9x − y = 5, 2x + 3y = 53x + 2y = 14, 5x − 2y = 102x − 4y = 6, −x + 2y = −34x + y = 7, 8x + 2y = 9A system of three linear equations in three variables x, y, z takes the form:
a₁x + b₁y + c₁z = d₁
a₂x + b₂y + c₂z = d₂
a₃x + b₃y + c₃z = d₃
Solving such a system by hand uses the same elimination idea used for two variables, but applied twice. The goal is to reduce to a two-variable system, solve it, then use those values to find the third variable. The formal technique for this is called back-substitution.
The standard hand-calculation method for a three-variable system is:
x + y + z = 62x − y + z = 3x + 2y − z = 2
Step 1: Eliminate x from equations (2) and (3).
Eq(2) − 2·Eq(1):
(2x − y + z) − 2(x + y + z) = 3 − 12
−3y − z = −9 … call this Eq(4)
Eq(3) − Eq(1):
(x + 2y − z) − (x + y + z) = 2 − 6
y − 2z = −4 … call this Eq(5)
Step 2: Solve Eq(4) and Eq(5) for y and z.
Eq(4): −3y − z = −9
Eq(5): y − 2z = −4 → y = 2z − 4
Substitute y = 2z − 4 into Eq(4):
−3(2z − 4) − z = −9
−6z + 12 − z = −9
−7z = −21
z = 3
Then: y = 2(3) − 4 = 2
Step 3: Back-substitute into Eq(1):
x + 2 + 3 = 6 → x = 1
Label your equations (1), (2), (3), … and label each derived equation (4), (5), … as you go. Note which operation produced each new equation, for example "Eq(2) − 2·Eq(1)". This habit reduces errors and makes it easier to find mistakes during checking.
Every linear equation in two variables represents a line in the plane. Every linear equation in three variables represents a plane in space. Understanding the possible geometric relationships between these objects helps predict the solution structure of any system.
In two dimensions, two lines can intersect at exactly one point, be parallel (never intersect), or be identical (the same line, infinitely many intersections).
In three dimensions, the intersection of three planes is more varied. Three planes can all meet at a single point. Two planes can be parallel while the third crosses both, producing no common intersection. All three planes can share a common line. Three planes can form a triangle-like arrangement with no common point. All three planes can be identical, or two can be identical with the third crossing them in a line. The algebra of row reduction will reveal which case applies in any given system.
| Geometric Configuration | Number of Solutions | Algebraic Signal |
|---|---|---|
| Three planes meet at one point | Exactly one | RREF has three pivot columns; no free variables |
| Three planes share a common line | Infinitely many (1 free variable) | RREF has one zero row, two pivot columns |
| All three planes identical | Infinitely many (2 free variables) | RREF has two zero rows, one pivot column |
| No common intersection point | None | RREF has a contradiction row: [0 0 0 | k] with k ≠ 0 |
Three planes, one intersection point: Imagine three flat sheets of glass set at angles to each other. If they are positioned correctly, there is exactly one point in space where all three sheets touch each other at once. That point is the unique solution.
Three planes, shared line: Tilt all three planes so that they all contain the same line — like three pages of a book open to different angles but all attached at the spine. Any point on that spine is a solution; there are infinitely many.
No intersection: Like three pages from different books stacked roughly parallel but at slight angles — they never all agree on a single point.
The most important first question about any linear system is whether it has a solution at all. A system is consistent if at least one solution exists, and inconsistent if no solution exists. Inconsistency arises from a logical contradiction among the equations: the conditions they impose are mutually exclusive and cannot all be satisfied at once.
When solving by elimination — or by row reduction — an inconsistent system reveals itself through a contradiction row: a row of the form
0x + 0y + 0z = k (where k ≠ 0)
This row is the algebraic equivalent of the statement 0 = k, which is false for any nonzero k. No values of any variable can satisfy it. If such a row appears anywhere in the matrix during row reduction, the system is immediately inconsistent and the search for solutions ends.
A linear system is inconsistent if and only if its augmented matrix can be row-reduced to contain a row of the form [0 0 ··· 0 | k] where k ≠ 0. In this case, the system has no solution.
If no such row appears, the system is consistent, and the solution set is either a unique point or an infinite family described by free variables.
When a consistent system has fewer constraints than unknowns — or when some equations are redundant versions of others — the system has infinitely many solutions. Such systems are called dependent or underdetermined.
In matrix terms, a dependent system produces one or more zero rows in row echelon form: rows of the form [0 0 ··· 0 | 0]. These rows carry no information. They are the algebraic echo of redundant equations.
When zero rows appear, the system has free variables: variables that are not controlled by any pivot and can therefore take any real value. For each free variable, there is a one-dimensional family of solutions. The complete solution set can be described using parameters — arbitrary real numbers that trace out that family. This parametric form of the solution will be developed fully in Section 3.12.
A zero row [0 0 0 | 0] and a contradiction row [0 0 0 | 5] look similar but have completely opposite meanings. A zero row means one equation was redundant — the system is consistent and may have free variables. A contradiction row means the system is impossible — there is no solution. Always check the last entry in every near-zero row.
x + y − z = 0, 2x − y + z = 3, −x + 2y + z = 3x + y = 5, 2x + 2y = 11[1 2 0 | 3][0 0 1 | 2][0 0 0 | 0]Hand calculation of elimination becomes cumbersome for large systems. To systematize the process and eventually automate it, linear algebra represents a system as a matrix. The key insight is that the variables x, y, z serve only as placeholders in the computation — what matters are the coefficients and the right-hand side constants. We can strip away the variables and track only the numbers.
Given a system of m linear equations in n unknowns, the coefficient matrix is the m × n array of coefficients. The augmented matrix appends the right-hand side constants as an additional column, separated by a vertical bar to remind us it is not a coefficient column.
2x − y + 3z = 5x + 4y − z = −23x − 2y + z = 0
⎡ 2 −1 3 | 5 ⎤
⎢ 1 4 −1 | −2 ⎥
⎣ 3 −2 1 | 0 ⎦
⎡ 1 0 −2 | 4 ⎤
⎢ 0 3 1 | 9 ⎥
⎣ 0 0 5 | 15 ⎦
x + 0y − 2z = 4 → x − 2z = 40x + 3y + z = 9 → 3y + z = 90x + 0y + 5z = 15 → 5z = 15Always write equations in standard form — all variable terms on the left, constant on the right, variables in consistent order — before reading off the augmented matrix. An equation like 3z + x = 2y + 7 must be rewritten as x − 2y + 3z = 7 before you form the matrix.
Row reduction works by replacing a system with an equivalent system — one that has exactly the same solution set — using three types of legal operations. Because each row of the augmented matrix represents a linear equation, any operation that would produce an equivalent set of equations corresponds to a valid operation on rows. There are exactly three such operations.
In a row replacement operation, the row being modified changes. The row being used as the multiplier stays the same. Write R₁ + 2R₂ → R₁, not R₁ + 2R₂ → R₂. The arrow tells you which row is being replaced.
⎡ 2 4 | 10 ⎤
⎣ 1 −1 | 2 ⎦
⎡ 1 −1 | 2 ⎤
⎣ 2 4 | 10 ⎦
Effect: The equations are reordered. Same system, more convenient form.
R₂ becomes: [2 − 2(1), 4 − 2(−1), 10 − 2(2)]
= [0, 6, 6]
⎡ 1 −1 | 2 ⎤
⎣ 0 6 | 6 ⎦
Effect: The x-term is eliminated from the second equation. This is the core elimination step.
6y = 6, so y = 1. Back-substitute: x − 1 = 2, so x = 3.x + 3y = 7, 2x − y = 4x − y + 2z = 3, 3x + y − z = 1, 2x + 2z = 4[ 1 3 | 5 ] [ 0 2 | 4 ][ 1 0 2 | 3 ] [ 0 1 −1 | 2 ] [ 0 0 0 | 0 ][ 3 6 | 9 ] [ 2 −1 | 4 ]The goal of row reduction is to transform the augmented matrix into a simpler form from which the solution can be read off or computed by back-substitution. The first target form is called row echelon form (abbreviated REF).
A matrix is in row echelon form if it satisfies all three of the following conditions:
The leading entries form a "staircase" pattern stepping down and to the right. Each leading entry is called a pivot.
⎡ 2 3 −1 | 5 ⎤
⎢ 0 1 4 | 2 ⎥
⎣ 0 0 3 | 6 ⎦
⎡ 2 3 −1 | 5 ⎤
⎢ 0 1 4 | 2 ⎥
⎣ 0 2 0 | 4 ⎦
The systematic process of reducing a matrix to row echelon form is called Gaussian elimination. Work column by column from left to right. For each column, identify the topmost nonzero entry in the current working submatrix as the pivot. Use row replacement operations to zero out all entries below that pivot. Then move to the next column.
2x + 4y − 2z = 24x + 9y − 3z = 8−2x − 3y + 7z = 10
⎡ 2 4 −2 | 2 ⎤
⎢ 4 9 −3 | 8 ⎥
⎣ −2 −3 7 | 10 ⎦
R₂ − 2R₁ → R₂: [4−4, 9−8, −3+4, 8−4] = [0, 1, 1, 4]
R₃ + R₁ → R₃: [−2+2, −3+4, 7−2, 10+2] = [0, 1, 5, 12]
⎡ 2 4 −2 | 2 ⎤
⎢ 0 1 1 | 4 ⎥
⎣ 0 1 5 | 12 ⎦
R₃ − R₂ → R₃: [0−0, 1−1, 5−1, 12−4] = [0, 0, 4, 8]
⎡ 2 4 −2 | 2 ⎤
⎢ 0 1 1 | 4 ⎥
⎣ 0 0 4 | 8 ⎦
4z = 8 → z = 2y + z = 4 → y = 4 − 2 = 22x + 4y − 2z = 2 → 2x + 8 − 4 = 2 → 2x = −2 → x = −1
Row echelon form still requires back-substitution to read off the solution. Reduced row echelon form (RREF) takes the simplification further: it eliminates entries not only below but also above each pivot, and scales each pivot to 1. The result is a matrix from which the solution can be read directly, with no back-substitution needed.
A matrix is in reduced row echelon form if it satisfies all conditions for REF, and additionally:
Every matrix has a unique RREF. No matter what sequence of row operations you perform, you will always arrive at the same RREF for a given matrix.
⎡ 1 0 0 | 3 ⎤
⎢ 0 1 0 | −1 ⎥
⎣ 0 0 1 | 2 ⎦
⎡ 1 2 0 | 5 ⎤
⎢ 0 0 1 | 3 ⎥
⎣ 0 0 0 | 0 ⎦
⎡ 1 3 −2 | 4 ⎤
⎢ 2 7 −3 | 9 ⎥
⎣ −1 1 4 | 7 ⎦
R₂ − 2R₁ → R₂:
⎡ 1 3 −2 | 4 ⎤
⎢ 0 1 1 | 1 ⎥
⎣ −1 1 4 | 7 ⎦
R₃ + R₁ → R₃:
⎡ 1 3 −2 | 4 ⎤
⎢ 0 1 1 | 1 ⎥
⎣ 0 4 2 | 11 ⎦
R₃ − 4R₂ → R₃:
⎡ 1 3 −2 | 4 ⎤
⎢ 0 1 1 | 1 ⎥
⎣ 0 0 −2 | 7 ⎦
(−1/2)R₃ → R₃:
⎡ 1 3 −2 | 4 ⎤
⎢ 0 1 1 | 1 ⎥
⎣ 0 0 1 | −7/2 ⎦
R₂ − R₃ → R₂:
⎡ 1 3 −2 | 4 ⎤
⎢ 0 1 0 | 9/2 ⎥
⎣ 0 0 1 | −7/2 ⎦
R₁ + 2R₃ → R₁:
⎡ 1 3 0 | 1 ⎤
⎢ 0 1 0 | 9/2 ⎥
⎣ 0 0 1 | −7/2 ⎦
R₁ − 3R₂ → R₁:
⎡ 1 0 0 | 1 − 27/2 ⎤ ⎡ 1 0 0 | −25/2 ⎤
⎢ 0 1 0 | 9/2 ⎥ = ⎢ 0 1 0 | 9/2 ⎥
⎣ 0 0 1 | −7/2 ⎦ ⎣ 0 0 1 | −7/2 ⎦
Gaussian elimination reduces to REF, then uses back-substitution. Gauss–Jordan elimination continues to RREF, allowing the solution to be read directly. Both are valid. For systems solved by hand, REF plus back-substitution is often faster. For understanding solution structure and for programming, RREF is cleaner and more systematic.
[ 1 2 3 | 4 ] [ 0 1 5 | 2 ] [ 0 0 1 | 1 ][ 1 0 2 | 3 ] [ 0 1 1 | 4 ] [ 0 0 0 | 0 ][ 0 1 3 | 4 ] [ 1 2 1 | 3 ][ 2 4 | 6 ] [ 0 1 | 3 ]
x + 2y + z = 8, 2x + 3y − z = 5, −x + y + 2z = 7x − y + z = 2, 2x + y − z = 7, x + 2y + 2z = 11[ 1 0 3 | 5 ] [ 0 1 −1 | 2 ] [ 0 0 0 | 0 ]
After row reduction, the pivot positions of a matrix are the locations of the leading 1s in its RREF. A column of the coefficient portion of the augmented matrix that contains a pivot is called a pivot column. The variable corresponding to a pivot column is called a basic variable — its value is determined by the system. A column of the coefficient portion that contains no pivot is called a free variable column. The variable corresponding to a free-variable column is not controlled by any pivot. It can take any real value, and each choice generates a different solution.
Counting pivot columns is the key to understanding solution structure:
⎡ 1 2 0 3 | 7 ⎤
⎢ 0 0 1 −1 | 4 ⎥
⎣ 0 0 0 0 | 0 ⎦
When a system has free variables, we describe the complete solution set in parametric form. Each free variable is renamed as a parameter — typically t, s, or another letter — that can take any real value. The basic variables are then expressed in terms of the parameters. Together, the parameter equations describe all solutions at once.
Reading off the parametric solution from RREF is straightforward: for each pivot row, express the basic variable on that row in terms of any free variables that appear in the same row.
⎡ 1 3 0 | 2 ⎤
⎢ 0 0 1 | 5 ⎥
⎣ 0 0 0 | 0 ⎦
Variables are x₁, x₂, x₃.
Row 1: x₁ + 3x₂ = 2 → x₁ = 2 − 3x₂
Row 2: x₃ = 5
Row 3: 0 = 0 (no information)
x₁ = 2 − 3t
x₂ = t
x₃ = 5
x₁ + x₂ − 2x₃ + x₄ = 32x₁ + x₂ − 3x₃ + x₄ = 4x₁ − x₂ + x₄ = 1
⎡ 1 1 −2 1 | 3 ⎤
⎢ 2 1 −3 1 | 4 ⎥
⎣ 1 −1 0 1 | 1 ⎦
R₂ − 2R₁ → R₂: [0, −1, 1, −1, −2]
R₃ − R₁ → R₃: [0, −2, 2, 0, −2]
⎡ 1 1 −2 1 | 3 ⎤
⎢ 0 −1 1 −1 | −2 ⎥
⎣ 0 −2 2 0 | −2 ⎦
(−1)R₂ → R₂:
⎡ 1 1 −2 1 | 3 ⎤
⎢ 0 1 −1 1 | 2 ⎥
⎣ 0 −2 2 0 | −2 ⎦
R₃ + 2R₂ → R₃: [0, 0, 0, 2, 2]
(1/2)R₃ → R₃:
⎡ 1 1 −2 1 | 3 ⎤
⎢ 0 1 −1 1 | 2 ⎥
⎣ 0 0 0 1 | 1 ⎦
Back-clear column 4:
R₂ − R₃ → R₂: [0, 1, −1, 0, 1]
R₁ − R₃ → R₁: [1, 1, −2, 0, 2]
Back-clear column 2:
R₁ − R₂ → R₁: [1, 0, −1, 0, 1]
RREF:
⎡ 1 0 −1 0 | 1 ⎤
⎢ 0 1 −1 0 | 1 ⎥
⎣ 0 0 0 1 | 1 ⎦
x₁ = 1 + x₃
x₂ = 1 + x₃
x₄ = 1
Let x₃ = t:
x₁ = 1 + t, x₂ = 1 + t, x₃ = t, x₄ = 1
The parametric solution can be written in vector form. For Example 3.12.1: the solution is the vector (2, 0, 5) plus t times the vector (−3, 1, 0). This is a line through (2, 0, 5) in the direction (−3, 1, 0). This vector description of a solution set is one of the most important ideas in all of linear algebra. It connects systems of equations to the geometry of lines, planes, and higher-dimensional spaces, and it reappears in Chapter 8 when we study vector spaces and in Chapter 10 when we study null spaces.
[ 1 0 0 | 5 ] [ 0 1 0 | 2 ] [ 0 0 1 | −1 ][ 1 0 2 | 4 ] [ 0 1 −1 | 3 ] [ 0 0 0 | 0 ][ 1 3 | 7 ] [ 0 0 | 1 ]x + 2y − z = 4, 2x + 4y − 2z = 8, x − y + 2z = 1Systems of linear equations are one of the most widely used tools in quantitative reasoning. Almost any situation involving multiple interrelated quantities — resource allocation, mixture problems, traffic flow, network balance, economic equilibrium, nutritional constraints, electrical circuits, supply chains — can be modeled as a linear system. The process is always the same: define variables, translate each constraint into a linear equation, assemble the system, solve, and interpret the solution in context.
Equation 1 (total volume): x + y = 100
Equation 2 (alcohol amount): 0.25x + 0.60y = 40
Augmented matrix:
⎡ 1 1 | 100 ⎤
⎣ 0.25 0.6 | 40 ⎦
R₂ − 0.25R₁ → R₂:
⎡ 1 1 | 100 ⎤
⎣ 0 0.35 | 15 ⎦
0.35y = 15 → y = 300/7 ≈ 42.86 mL
x = 100 − y ≈ 57.14 mL
Intersection A: 40 + x₄ = x₁ → x₁ − x₄ = 40
Intersection B: x₁ = x₂ + 50 → x₁ − x₂ = 50
Intersection C: 30 + x₂ = x₃ → −x₂ + x₃ = 30
Intersection D: x₃ = x₄ + 20 → x₃ − x₄ = 20
Augmented matrix:
⎡ 1 0 0 −1 | 40 ⎤
⎢ 1 −1 0 0 | 50 ⎥
⎢ 0 −1 1 0 | 30 ⎥
⎣ 0 0 1 −1 | 20 ⎦
After row reduction, this system is dependent — it has one free variable (x₄).
RREF result:
⎡ 1 0 0 −1 | 40 ⎤
⎢ 0 1 0 −1 | −10 ⎥
⎢ 0 0 1 −1 | 20 ⎥
⎣ 0 0 0 0 | 0 ⎦
x₁ = 40 + t
x₂ = −10 + t = t − 10
x₃ = 20 + t
x₄ = t
For physically valid flows, all xᵢ ≥ 0, so x₂ ≥ 0 requires t ≥ 10.
The augmented matrix includes the right-hand-side column. Every entry in the entire row — including the last column — must be updated in a row replacement operation. Never operate on the coefficient portion only.
The arrow tells you which row is being replaced. The notation R₁ + 3R₂ → R₁ means: take the current Row 1, add 3 times Row 2 to it, and put the result back in Row 1. Row 2 does not change.
A zero row [0 0 0 | 0] means the equation 0 = 0, which is always true. It signals a redundant equation and possible free variables — the system may still have infinitely many solutions. Inconsistency requires [0 0 0 | k] with k ≠ 0.
If a column of the coefficient matrix has no pivot, the corresponding variable is free. You cannot simply set it to zero; that would report only one specific solution from an entire infinite family. Introduce a parameter and write the complete solution set.
2x = y + 5 as [2 1 | 5] instead of [2 −1 | 5]
Before writing the augmented matrix, rewrite every equation in standard form: all variable terms on the left, all constants on the right. The equation 2x = y + 5 must become 2x − y = 5, giving the row [2, −1, | 5].
Row echelon form is not the final destination. REF still requires back-substitution; RREF allows direct reading. If you stop at REF for a system with free variables and do not continue to RREF, it is easy to misidentify which variables are free and to miss terms in the parametric solution.
Consistency depends on the right-hand-side column. If you reduce only the coefficient matrix, you cannot detect an inconsistent system — the contradiction row [0 0 | k] becomes invisible. Always augment the matrix with the right-hand-side constants before row reducing.
Each problem contains an error. Identify it and write the correct step or conclusion.
[2, −1 | 3] [1, 4 | 7] and obtains [2, −1 | 3] [5, 2 | 7]. What error did the student make? What is the correct result?[1 0 2 | 5] [0 0 0 | 0] with variables x₁, x₂, x₃. The student writes: "x₁ = 5, x₂ = 0, x₃ = 0." What is wrong? What is the correct complete solution?3y − 2x = 7, x + y = 4 and writes the augmented matrix as [3, −2 | 7] [1, 1 | 4]. What error was made and what should the augmented matrix be?[1 0 | 4] [0 0 | −3] for a two-variable system. The student says: "x₂ is free." Is this correct? Explain and give the correct conclusion.Classify each system (unique solution / no solution / infinitely many) without solving. Explain your reasoning.
x + y = 4, 2x + 2y = 8x + y = 4, 2x + 2y = 9x − y = 1, 2x + y = 83x − 6y = 9, x − 2y = 3x + y + z = 3, 2x + 2y + 2z = 6x + y = 4, x − y = 2, 2x = 63x − 2y = 5, x + 4y = 7x + y + z = 0, 2x − y = 3, y + 3z = −14x₁ − x₂ + 2x₃ − x₄ = 6, x₁ + x₃ = 4, −x₂ + x₄ = 1[1 0 | 5] [0 1 | −2][1 3 −1 | 7] [0 1 2 | 3] [0 0 1 | −1][1 0 2 | 4] [0 1 −1 | 3] [0 0 0 | 0]Perform the indicated row operation and write the result.
[2 4 | 8] [1 −1 | 3]: apply R₁ ↔ R₂[3 6 | 9] [2 1 | 5]: apply (1/3)R₁ → R₁[1 2 | 3] [3 5 | 8]: apply R₂ − 3R₁ → R₂[1 0 2 | 4] [2 1 3 | 7] [−1 2 1 | 3]: apply R₂ − 2R₁ → R₂, then R₃ + R₁ → R₃Reduce each system to RREF. Write the complete solution or state if inconsistent.
x + 2y = 7, 3x − y = 72x − y + z = 3, 4x + y − z = 9, x + 2y + 2z = 10x + y − 2z = 4, 2x + 3y − 5z = 9, x + 2y − 3z = 5x₁ + 2x₂ − x₃ = 5, 2x₁ + 5x₂ + x₃ = 3, x₁ + 3x₂ + 3x₃ = −2x + y + z = 3, x − y + z = 1, 2x + z = 4x − 2y + z = 1, 2x − 4y + 2z = 3 (two equations, three unknowns)Write the complete parametric solution for each system below.
[1 2 0 | 3] [0 0 1 | 5] [0 0 0 | 0] (variables x, y, z)[1 0 3 −1 | 2] [0 1 −2 1 | 4] [0 0 0 0 | 0] (variables x₁, x₂, x₃, x₄)x − y + 2z = 3, 2x − 2y + 4z = 62x + 3y + z = 12, x − y + 2z = 3 (two equations, three unknowns). How many dimensions does the solution set have? Explain.3I₁ − I₂ = 12, −I₁ + 4I₂ − I₃ = 0, −I₂ + 2I₃ = −8. Solve for the three loop currents.Each problem shows a student's work. Find the error and provide the correct solution or conclusion.
Starting matrix: [1 2 | 5] [3 4 | 11]
Student writes: R₂ − 3R₁ → R₂ and gets [1 2 | 5] [0 −2 | 11].
Identify and correct the error in the row operation.
After row reduction, a student gets RREF [1 0 3 | 4] [0 1 −1 | 2] [0 0 0 | 0] and writes: "x = 4, y = 2, z = 0."
What is wrong? Write the correct complete solution in parametric form.
A student row-reduces the augmented matrix of a system and gets [1 3 | 5] [0 0 | 0]. The student says: "The system has no solution because one equation disappeared."
Correct the student's conclusion and write the actual solution set.
For the system x + 3y = 5, 2x + 6y = 7, a student multiplies the first equation by 2, getting 2x + 6y = 10, and then says: "This confirms both equations are the same. The system is dependent."
Where did the student go wrong? What is the correct conclusion?
3x + 4y = 10, x − 2y = −4. Identify the type of system.x + y − z = 4, 2x − y + z = 1, 3x − 2y + 2z = 2.[1 −2 | 3] [0 0 | 5] after row reduction. What does this tell you about the system? What is the solution?2x − 3y + z = 7, x + y − 2z = −1, 3x − y + z = 9.x + 2y − z = 5, 2x + 4y − 2z = 10.[1 0 −2 1 | 3] [0 1 3 −1 | 5] [0 0 0 0 | 0]. Identify all pivot columns and free variables. Write the parametric solution.[1 2 | 3] [4 5 | 6], a student applies R₂ − 4R₁ → R₂ and writes [1 2 | 3] [0 −3 | 6]. What is wrong?Chapter 3 showed how the augmented matrix of a system can be transformed by row operations into a simpler form. Chapter 4 will step back and ask a broader question: what is a matrix, independent of any system? Matrices can encode data, describe transformations, represent networks, and organize computations far beyond system-solving. You will learn how to add matrices, scale them, and multiply them — discovering that matrix multiplication is not commutative (AB ≠ BA in general) and carries deep geometric meaning as the composition of transformations. Every matrix technique from this chapter — writing augmented matrices, understanding what rows and columns represent, interpreting the structure of a matrix — will carry directly into Chapter 4 and every chapter that follows.
Chapter 3 also laid the algebraic foundation for ideas that will emerge in geometric and structural form later in the book. The parametric solution you wrote in vector form — a particular solution plus a free combination of direction vectors — anticipates the null space of a matrix (Chapter 10) and the notion of a solution space as a vector subspace (Chapter 8). The pivot structure of a matrix, which determines whether a system has a unique solution or free variables, anticipates the concept of rank (Chapter 10) and linear independence (Chapter 9). Systems of equations are the algebraic core of linear algebra, and the matrix framework you built here supports everything that follows.