Elementary Matrices
Definition
An elementary matrix is a matrix that differs from the identity matrix by a single elementary row operation. Left-multiplying a matrix by an elementary matrix applies that row operation to .
Intuition
Every row operation is secretly a matrix multiplication. Writing elimination as turns the algorithmic sequence of steps into an algebraic identity, which then immediately yields the LU factorisation by inverting each .
Formal Description
Each step of Gaussian Elimination can be expressed as left-multiplication by an elementary matrix. For the matrix
the three elimination steps give , where:
and is the resulting upper-triangular matrix. adds twice row 1 to row 2; adds row 1 to row 3; subtracts row 2 from row 3.
Elementary matrices are always invertible; the inverse reverses the row operation (e.g., if adds times row to row , then adds times row to row ). The factorisation is the foundation of LU Decomposition.
Applications
- Provides the algebraic proof that Gaussian elimination produces an LU factorisation.
- Used to derive properties of determinants under row operations.
Trade-offs
- Elementary matrices are conceptually useful but are rarely formed explicitly in practice; storing and multiplying separate matrices costs far more than simply recording the multipliers.
- Only applicable when row operations suffice; column operations require right-multiplication, which is distinct.