Systems of Linear Equations

Solving Many Equations at Once

A linear equation relates variables using only sums and scalar multiples — no powers or products of variables, like $2x + 3y = 6$. A system is several such equations required to hold simultaneously. Solving systems is one of the core tasks of linear algebra, and it can be written compactly as a matrix equation $A\mathbf{x} = \mathbf{b}$.

Geometrically, a linear equation in two variables is a line, and a solution is a point on all the lines at once. This reveals exactly three possibilities:

• Exactly one solution — the lines cross at a single point (consistent, independent).
• No solution — the lines are parallel and distinct (inconsistent).
• Infinitely many solutions — the equations describe the same line (dependent).

The systematic method is Gaussian elimination: use row operations — swap two rows, scale a row, or add a multiple of one row to another — to reduce the system to a triangular (row-echelon) form, then back-substitute. Row operations never change the solution set, and they reveal which of the three cases holds. In matrix language, you row-reduce the augmented matrix $[A \mid \mathbf{b}]$.

The number of solutions connects to independence: a system with as many independent equations as unknowns has a unique solution; fewer independent equations leave free variables (infinitely many solutions); contradictory equations (a row like $0 = 1$) give none. This same machinery generalizes to any number of variables and is the computational heart of linear algebra.

Common pitfall: assuming every linear system has a unique solution. Depending on the geometry, a system can have one, none, or infinitely many solutions. Parallel-but-distinct equations are inconsistent (none); duplicate or dependent equations leave free variables (infinitely many). A row reducing to $0 = 1$ signals no solution, while a row of all zeros signals a free variable — jumping straight to "one solution" misses both.