A linear equation in the variables x1,x2,…,xn is an equation that can be written in the form
a1x1+a2x2+⋯+anxn=b
a1,a2,…,an are the coefficients (real or complex numbers, usually known in advance),
x1,x2,…,xn are the variables, and b is a constant.
For example 2x1−3x2=5 is linear. Equations such as x1x2=4, x1+x2=3 or 4x1−5x2=x1x2 are not linear (products of variables, roots, powers, etc. are not allowed).
A system of linear equations (a linear system) is a collection of one or more linear equations involving the same variables, e.g.
2x1−3x25x1+2x2=5=10
A solution of the system is a list (s1,s2,…,sn) of numbers that makes every equation true when substituted for x1,…,xn.
The solution set is the set of all possible solutions.
Two systems are equivalent if they have the same solution set.
The Three Possible Cases — the Picture with Lines
With two variables, each linear equation describes a line in the x1x2-plane: the solutions of that one equation are exactly the points on its line. A solution of the system must lie on all the lines at once, so the solution set is the intersection of the lines.
Two lines in the plane can only meet in three ways:
Picture
Solutions
Name
Lines are parallel (never meet)
no solution
inconsistent
Lines cross at exactly one point
exactly one (unique) solution
consistent
Lines coincide (the same line)
infinitely many solutions
consistent
Fact (Lay §1.1): Every system of linear equations has either
no solution, or
exactly one solution, or
infinitely many solutions.
A system is consistent if it has at least one solution (case 2 or 3), and inconsistent if it has none (case 1).
There is no linear system with “exactly 2” or “exactly 5” solutions. As soon as there are two different solutions, there are infinitely many (every point on the line through them works). The same three cases hold for three variables, where each equation is a plane in R3.
Coefficient Matrix, Augmented Matrix, Matrix and Vector Forms
The essential information of a system is stored in a rectangular array called a matrix. For the system 2x1−3x2=5, 5x1+2x2=10:
The augmented matrix[A∣b] is the coefficient matrix with the column of constants added on the right (the augmented column):
[A∣b]=[25−32510]
The size of a matrix is written m×n: mrows first, then ncolumns. Here A is 2×2 and [A∣b] is 2×3. A column with n entries, like x, is a vector in Rn.
The same system can be written in three equivalent ways:
Form
For our example
System of equations
2x1−3x2=5,5x1+2x2=10
Matrix equationAx=b
[25−32][x1x2]=[510]
Vector equation
x1[25]+x2[−32]=[510]
All three have the same solution set and are all solved by row reducing the same augmented matrix [A∣b].
The vector equation reads ”b is a linear combination of the columns of A with weights x1,x2”. Lay develops the vector form in §1.3 and the product Ax=x1a1+⋯+xnan in §1.4 — but it is worth seeing now that they are just new notation for the same system.
Elementary Row Operations and Row Equivalence
Solving a system means replacing it with an equivalent system that is easier to solve. On the augmented matrix this is done with three elementary row operations:
Switch (interchange): swap two rows, e.g. R1↔R2.
Scale: multiply all entries of a row by a nonzero constant, e.g. R2←21R2.
Replace (replacement): add to one row a multiple of another row, e.g. R3←R3+4R1.
Two matrices are row equivalent (written A∼B) if one can be turned into the other by a sequence of elementary row operations. Every row operation is reversible (swap back, scale by 1/c, subtract the multiple again).
Fact (Lay §1.1): If the augmented matrices of two linear systems are row equivalent, then the two systems have the same solution set.
Back-substitute: x3=3, x2=4+4(3)=16, x1=2(16)−3=29. Check in the original third equation: −4(29)+5(16)+9(3)=−116+80+27=−9 ✓. Unique solution (29,16,3).
Spotting an Inconsistent System
If row reduction produces a row of the form
[0⋯0b]with b=0,
that row means 0x1+⋯+0xn=b, i.e. 0=b — impossible. The system is inconsistent. In the language of §1.2: the augmented column has a pivot.
A row of all zeros [0⋯0∣0] is harmless (0=0); it just means one equation was redundant. Only [0⋯0∣b] with b=0 signals “no solution”.
Solved Examples (Textbook Questions)
Exercise 1
(Adapted from Lay §1.1, Exercise 1)
Solve the system using elementary row operations on the augmented matrix: