Systems of Linear Equations
A system of linear equations is a collection of equations where every variable appears only to the first power — no squares, no products of variables, no transcendental functions. Because of this constraint, such systems have a rich algebraic structure that we can exploit computationally: matrix algebra lets us write any system of any size as a single compact equation, and then a family of efficient algorithms can solve it.
System Notation
A general system of equations in unknowns takes the form:
Here is the coefficient in equation that multiplies variable , and is the right-hand side constant of equation .
Matrix Form
The entire system can be compressed into a single matrix equation. Collecting the coefficients into a matrix , the unknowns into a column vector , and the constants into a column vector :
This is written compactly as:
where:
- is an matrix of coefficients
- is an column vector of unknowns
- is an column vector of right-hand side constants
Solution
If is invertible, multiplying both sides on the left by gives the solution directly:
Basic Properties of
For a unique solution to exist, two conditions must hold:
- must be a square matrix of shape — the number of equations equals the number of unknowns.
- must be non-singular — its determinant must be non-zero, i.e. .
A singular matrix () means the rows are linearly dependent: at least one equation is redundant, and the system either has no solution or infinitely many.