Solving Systems with Matrices

From Equations to Matrices

Every system of linear equations can be encoded as a single matrix equation AX = B. For a 2×2 system like ax + by = e and cx + dy = f, we form the coefficient matrix A = [[a,b],[c,d]], the variable vector X = [[x],[y]], and the constant vector B = [[e],[f]]. Multiplying A by X reproduces the original equations row by row: the first row of A times X gives ax + by, and the second row gives cx + dy. This compact notation is not merely cosmetic — it transforms the problem of solving equations into a problem of matrix arithmetic, unlocking powerful algebraic and computational tools.

The same idea extends to systems of 3 equations in 3 unknowns: AX = B where A is 3×3, X is 3×1, and B is 3×1. The matrix framework scales elegantly to any number of equations and unknowns, making it the foundation of modern numerical computation.

The Inverse Matrix Method

For a 2×2 system AX = B, if det(A) ≠ 0 then A is invertible and we can multiply both sides on the left by A⁻¹: A⁻¹(AX) = A⁻¹B, giving (A⁻¹A)X = A⁻¹B, so IX = A⁻¹B, and therefore X = A⁻¹B. The formula A⁻¹ = (1/det(A))[[d,−b],[−c,a]] gives the inverse directly for a 2×2 matrix [[a,b],[c,d]].

This is analogous to solving the scalar equation ax = b by dividing: x = b/a = a⁻¹b. The critical caveat is that in matrix algebra, multiplication is not commutative, so we must carefully multiply on the left by A⁻¹ on both sides.

The inverse method is elegant and efficient for 2×2 systems. However, computing inverses of large matrices is computationally expensive, so Gaussian elimination is preferred for 3×3 and larger systems.

Gaussian Elimination

Gaussian elimination (row reduction) is the systematic procedure for solving any linear system by transforming the augmented matrix [A|B] into row echelon form using three elementary row operations: (1) swap two rows; (2) multiply a row by a non-zero scalar; (3) add a multiple of one row to another row. These operations do not change the solution set of the system — they simply rewrite the equations in an equivalent, easier-to-solve form.

Once the augmented matrix is in echelon form (zeros below the main diagonal), we can read off the solution by back-substitution: solve the last equation for the last variable, substitute into the second-to-last equation to find the second-to-last variable, and so on. This process is systematic and guaranteed to find the solution (or identify when none exists) in a finite number of steps.

For a 3×3 system, the goal is to produce an upper-triangular augmented matrix. Each elimination step uses a “pivot” (the leading non-zero entry in a row) to create zeros below it in the same column. Careful choice of row operations keeps the arithmetic manageable.

Types of Solutions

A system of two linear equations in two unknowns has a geometric interpretation: each equation defines a straight line in the plane. The solution is the set of points where the lines intersect. There are three possibilities: (1) the lines intersect at a single point → unique solution; (2) the lines are parallel (same slope, different intercepts) → no solution (inconsistent); (3) the lines are identical (same slope, same intercept) → infinitely many solutions (dependent system).

The determinant of A detects which case applies: if det(A) ≠ 0, the lines intersect uniquely; if det(A) = 0, the lines are either parallel or coincident, and you must inspect the augmented matrix to distinguish the two subcases. In an inconsistent system, row reduction produces a row like [0, 0 | c] with c ≠ 0, which represents the impossible equation 0 = c. In a dependent system, a row of all zeros [0, 0 | 0] appears, indicating a free variable.

For 3×3 systems, the geometric picture is three planes in space. The solution can be a single point (unique), a line (infinitely many, one free variable), a plane (infinitely many, two free variables), or empty (inconsistent). The augmented row-reduction procedure identifies all these cases.

3×3 Systems and Back-Substitution

For three equations in three unknowns, write the augmented 3×4 matrix and apply row operations to obtain zeros below the main diagonal. Once in echelon form, solve by back-substitution. The final row gives the value of the last variable directly; substitute into the previous row to get the next variable; substitute into the first row to get the first variable. Check all three values in the original equations before writing your final answer.

When a row of the form [0, 0, 0 | 0] appears during elimination, there is a free variable: the system has infinitely many solutions, typically expressed as a parametric family. When a row [0, 0, 0 | c] with c ≠ 0 appears, the system is inconsistent and has no solution.