Matrix Formulation and Forward Look
A linear system of equations in unknowns can be compactly written as , where is an matrix (the coefficient matrix), is a column vector of unknowns, and is the right-hand side vector.
Gaussian elimination corresponds to multiplying on the left by elementary matrices — one for each row operation. The sequence of operations can be packaged into an LU decomposition: , where is lower triangular and is upper triangular (echelon form).
This matrix perspective opens the door to the deep theory of linear algebra: column spaces, null spaces, rank, invertibility. We've been doing linear algebra all along — now we have the language to say it precisely.
In upcoming chapters we will study: vectors and linear combinations, the geometry of column and null spaces, rank and nullity, matrix multiplication, and invertibility. Everything connects back to the solution structure we've seen here.
Formal View
Why This Matters
Matrix notation is the compact language that unlocks all of linear algebra's power.
- Scientific computing uses matrix algebra for everything from weather simulation to genome analysis
- Deep learning represents neural networks as sequences of matrix multiplications
- Quantum mechanics uses matrix algebra (Hermitian operators, eigenvalues) as its mathematical language
- Computer graphics transforms scene geometry via 4×4 matrix multiplications per vertex
Quiz
A linear system of 3 equations in 4 unknowns can be written as where has size:
The matrix in completely encodes all information about the linear system.
Common Mistakes
- Writing with dimensions transposed — rows = equations (), columns = unknowns ().
- Forgetting that is shorthand for the full system, not just one equation.