Definition
An augmented matrix is a rectangular array of numbers formed by appending the columns of the coefficient matrix of a system of linear equations with the column vector of the system’s constant terms. It provides a compact representation used for applying row operations in methods such as Gaussian elimination.
Overview
In linear algebra, a system of $m$ linear equations in $n$ variables can be written in matrix form as $A\mathbf{x} = \mathbf{b}$, where $A$ is an $m \times n$ coefficient matrix, $\mathbf{x}$ is the column vector of unknowns, and $\mathbf{b}$ is the column vector of constants. The augmented matrix, denoted $[A \mid \mathbf{b}]$, combines $A$ and $\mathbf{b}$ into a single $(m) \times (n+1)$ matrix. This construction enables systematic manipulation of the entire system through elementary row operations without separately tracking the constant terms.
The augmented matrix is central to the algorithmic solution of linear systems, including:
- Gaussian elimination – transforming the matrix to row‑echelon form to identify solutions or detect inconsistency.
- Gauss‑Jordan elimination – further reduction to reduced row‑echelon form, yielding the explicit solution or showing parametric families of solutions.
- Rank determination – comparing the rank of the coefficient matrix with that of the augmented matrix to apply the Rouché–Capelli theorem for existence and uniqueness of solutions.
Etymology/Origin
The term “augmented” derives from the Latin augere meaning “to increase” or “to add.” In the context of linear algebra, it reflects the addition of the constant column to the coefficient matrix. The notion of using an augmented matrix dates back to the development of systematic elimination techniques in the 19th century, notably in the works of Carl Friedrich Gauss and later formalized in textbooks on linear algebra.
Characteristics
| Feature | Description |
|---|---|
| Structure | $[A \mid \mathbf{b}]$ where $A$ is $m \times n$ and $\mathbf{b}$ is $m \times 1$; overall size $m \times (n+1)$. |
| Elementary Row Operations | Permitted operations: row swapping, scalar multiplication of a row, and adding a multiple of one row to another; these preserve solution equivalence. |
| Row‑Echelon Forms | Used to determine consistency: if a row of the form $[0,0,\dots,0 \mid c]$ with $c |
| eq 0$ appears, the system is inconsistent. | |
| Rank Comparison | The rank of $A$ versus the rank of $[A \mid \mathbf{b}]$ informs the number of free variables: if ranks are equal and equal to $n$, a unique solution exists; if ranks are equal but less than $n$, infinitely many solutions exist. |
| Computational Use | Implemented in numerical linear‑algebra software (e.g., MATLAB, NumPy) as a convenient data structure for solving linear systems. |
Related Topics
- Coefficient matrix – the matrix $A$ containing only the coefficients of the variables.
- Row‑echelon form (REF) and reduced row‑echelon form (RREF) – canonical forms achieved via row operations on the augmented matrix.
- Gaussian elimination – algorithm that operates directly on the augmented matrix.
- Matrix rank – the dimension of the row (or column) space, crucial for solution classification.
- Linear system consistency – the condition under which a system of equations has at least one solution.
- Rouché–Capelli theorem – theorem linking ranks of $A$ and $[A \mid \mathbf{b}]$ to solution existence.
- LU decomposition – factorization technique that may be applied to the coefficient matrix; the augmented matrix is not directly decomposed but the decomposition aids solving $A\mathbf{x} = \mathbf{b}$.
The augmented matrix remains a fundamental construct in both theoretical investigations and practical computations involving linear equations.