{
  "id": "augmented-matrix",
  "title": "Augmented Matrix",
  "lang": "en",
  "source_lang": "en",
  "summary": "An augmented matrix combines a linear system’s coefficient matrix with its right-hand side, allowing row operations to determine consistency and solutions.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/augmented-matrix/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/augmented-matrix/",
      "json": "https://aiwiki.page/zh/augmented-matrix.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "An augmented matrix is a matrix formed by adjoining one or more columns to another matrix. In linear algebra, the term usually refers to the coefficient matrix of a system of linear equations together with the column of right-hand-side constants. Written \\([A\\mid b]\\), it records the entire system \\(Ax=b\\) in a compact form suitable for Gaussian elimination. The vertical separator distinguishes the coefficient columns from the right-hand side; it is a notational aid, not an additional matrix entry."
    },
    {
      "heading": "Definition and notation",
      "text": "Consider \\(m\\) linear equations in \\(n\\) unknowns:\n\n\\[\\begin{aligned} a_{11}x_1+\\cdots+a_{1n}x_n&=b_1,\\\\ a_{21}x_1+\\cdots+a_{2n}x_n&=b_2,\\\\ &\\vdots\\\\ a_{m1}x_1+\\cdots+a_{mn}x_n&=b_m. \\end{aligned}\\]\n\nTheir matrix form is \\(Ax=b\\), where \\(A=(a_{ij})\\) is the \\(m\\times n\\) coefficient matrix, \\(x\\) is the column of unknowns, and \\(b\\) is the column of constants. The augmented matrix is\n\n\\[[A\\mid b]= \\left[ \\begin{array}{ccc|c} a_{11}&\\cdots&a_{1n}&b_1\\\\ a_{21}&\\cdots&a_{2n}&b_2\\\\ \\vdots&&\\vdots&\\vdots\\\\ a_{m1}&\\cdots&a_{mn}&b_m \\end{array} \\right].\\]\n\nIt has \\(m\\) rows and \\(n+1\\) columns. Each row represents one equation, and the first \\(n\\) columns correspond to the unknowns in a fixed order. Missing terms must be represented by zero coefficients.\n\nThe entries may belong to any field, commonly the real numbers or complex numbers. The usual elimination rules rely on the ability to divide by any nonzero field element; they do not transfer unchanged to arbitrary rings."
    },
    {
      "heading": "Row operations and equivalent systems",
      "text": "Three elementary row operations are used to simplify an augmented matrix:\n\n- Interchange two rows.\n- Multiply a row by a nonzero scalar.\n- Add a scalar multiple of one row to another row.\n\nEach operation is reversible and preserves exactly the solution set of the represented system. Crucially, an operation must be applied to the entire row, including the right-hand-side entry.\n\nAlgebraically, a sequence of row operations amounts to left multiplication by an invertible matrix \\(E\\):\n\n\\[[A\\mid b]\\longmapsto[EA\\mid Eb].\\]\n\nBecause \\(E\\) is invertible, \\(Ax=b\\) and \\(EAx=Eb\\) have the same solutions.\n\nGaussian elimination produces a row echelon form, in which zero rows lie below nonzero rows and the leading nonzero entry of each successive nonzero row lies farther to the right. These leading entries are called pivots. Back substitution then determines the pivot variables in terms of any free variables.\n\nContinuing elimination above each pivot and scaling pivots to \\(1\\) produces reduced row echelon form. Unlike ordinary echelon form, the reduced row echelon form of a matrix is unique.\n\nRow operations should be distinguished from column operations. Interchanging coefficient columns changes the order of the variables, while general column operations require a corresponding change of variables. They do not, without such interpretation, preserve the same solution set."
    },
    {
      "heading": "Worked example",
      "text": "The system\n\n\\[\\begin{aligned} x+2y&=5,\\\\ 3x+4y&=11 \\end{aligned}\\]\n\nhas augmented matrix\n\n\\[\\left[ \\begin{array}{cc|c} 1&2&5\\\\ 3&4&11 \\end{array} \\right].\\]\n\nSubtracting three times the first row from the second gives\n\n\\[\\left[ \\begin{array}{cc|c} 1&2&5\\\\ 0&-2&-4 \\end{array} \\right].\\]\n\nThe second row states \\(-2y=-4\\), so \\(y=2\\); substituting into the first equation gives \\(x=1\\). Alternatively, scaling the second row by \\(-\\tfrac12\\) and then subtracting twice that row from the first produces\n\n\\[\\left[ \\begin{array}{cc|c} 1&0&1\\\\ 0&1&2 \\end{array} \\right],\\]\n\nfrom which both values can be read directly."
    },
    {
      "heading": "Consistency, rank, and free variables",
      "text": "The augmented matrix determines whether a system is consistent, meaning that it has at least one solution. A row of the form\n\n\\[\\left[ \\begin{array}{cccc|c} 0&0&\\cdots&0&c \\end{array} \\right], \\qquad c\\ne0,\\]\n\nrepresents the impossible equation \\(0=c\\), so the system is inconsistent.\n\nMore generally, consistency is characterized by matrix rank:\n\n\\[Ax=b\\text{ is consistent} \\quad\\Longleftrightarrow\\quad \\operatorname{rank}(A)=\\operatorname{rank}([A\\mid b]).\\]\n\nAppending \\(b\\) leaves the rank unchanged precisely when \\(b\\) lies in the span of the columns of \\(A\\), or equivalently in the image of the linear map represented by \\(A\\).\n\nIf a consistent system has \\(n\\) unknowns and \\(\\operatorname{rank}(A)=r\\), then:\n\n- It has a unique solution when \\(r=n\\).\n- It has \\(n-r\\) free variables when \\(r<n\\).\n\nOver the real or complex numbers, a consistent system with at least one free variable has infinitely many solutions. Over a finite field with \\(q\\) elements, it instead has exactly \\(q^{n-r}\\) solutions.\n\nFor example,\n\n\\[\\left[ \\begin{array}{ccc|c} 1&2&-1&3\\\\ 0&0&0&0 \\end{array} \\right]\\]\n\nrepresents \\(x_1+2x_2-x_3=3\\). Setting \\(x_2=s\\) and \\(x_3=t\\) gives\n\n\\[x= \\begin{bmatrix} 3\\\\0\\\\0 \\end{bmatrix} +s \\begin{bmatrix} -2\\\\1\\\\0 \\end{bmatrix} +t \\begin{bmatrix} 1\\\\0\\\\1 \\end{bmatrix}.\\]\n\nIn general, if \\(x_p\\) is one particular solution, every solution has the form\n\n\\[x=x_p+z,\\qquad z\\in\\ker(A),\\]\n\nwhere \\(\\ker(A)\\) is the null space of \\(A\\). Thus a nonempty solution set is an affine space with dimension \\(n-r\\), as follows from the rank–nullity theorem."
    },
    {
      "heading": "Multiple right-hand sides and matrix inversion",
      "text": "The same construction applies to a matrix equation\n\n\\[AX=B,\\]\n\nwhere \\(B\\) has several columns. The augmented matrix \\([A\\mid B]\\) allows the same row operations to be applied simultaneously to all right-hand sides.\n\nAn important special case is the computation of an inverse matrix. For a square \\(n\\times n\\) matrix \\(A\\), form\n\n\\[[A\\mid I_n],\\]\n\nwhere \\(I_n\\) is the identity matrix. If row reduction transforms the left block into \\(I_n\\), then\n\n\\[[A\\mid I_n]\\longrightarrow[I_n\\mid A^{-1}].\\]\n\nIf \\(A\\) is singular, its left block cannot be reduced to the identity. This procedure is often called Gauss–Jordan inversion."
    },
    {
      "heading": "Numerical considerations",
      "text": "An augmented matrix is a representation, not a guarantee of computational accuracy. In floating-point arithmetic, elimination can accumulate rounding errors, and very small pivots may cause large intermediate values. Pivoting strategies, especially exchanging rows to select a suitable pivot, improve numerical stability.\n\nFor an ill-conditioned system, small perturbations in the coefficients or right-hand side can still produce large changes in the solution, even when the algorithm is stable. This sensitivity is described by the condition number.\n\nPractical software often stores the coefficient matrix and right-hand sides separately and uses an LU decomposition or another factorization rather than explicitly constructing a single augmented array. When solving \\(Ax=b\\), computing \\(A^{-1}\\) first is generally unnecessary. For inconsistent systems, row reduction identifies the absence of an exact solution; obtaining an approximate fit requires an additional criterion, such as least squares."
    }
  ],
  "links": [
    "matrix",
    "linear-algebra",
    "system-of-linear-equations",
    "gaussian-elimination",
    "field-mathematics",
    "real-number",
    "complex-number",
    "ring-mathematics",
    "matrix-rank",
    "linear-span",
    "image-linear-map",
    "linear-map",
    "finite-field",
    "null-space",
    "affine-space",
    "rank-nullity-theorem",
    "inverse-matrix",
    "identity-matrix",
    "floating-point-arithmetic",
    "numerical-stability",
    "condition-number",
    "lu-decomposition",
    "least-squares"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}