{
  "id": "row-echelon-form",
  "title": "Row Echelon Form",
  "lang": "en",
  "source_lang": "en",
  "summary": "Row echelon form is a staircase arrangement of a matrix’s leading nonzero entries, used to solve linear systems and determine rank and linear dependence.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Echelon form",
    "Echelon matrix"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/row-echelon-form/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/row-echelon-form/",
      "json": "https://aiwiki.page/zh/row-echelon-form.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "In linear algebra, a row echelon form is a form of a matrix in which zero rows appear at the bottom and the first nonzero entry of each successive nonzero row lies strictly farther to the right. This staircase pattern makes the matrix’s structure easier to analyze. Every matrix over a field can be transformed into row echelon form by elementary row operations. It is a central tool for solving systems of linear equations, computing rank, and identifying dependencies among rows and columns."
    },
    {
      "heading": "Definition",
      "text": "Let \\(A\\) be an \\(m\\times n\\) matrix over a field, such as the real numbers or complex numbers. The leading entry of a nonzero row is its first nonzero entry when read from left to right.\n\nThe matrix is in row echelon form if:\n\n- Every zero row is below every nonzero row.\n- The leading entry of each nonzero row lies strictly to the right of the leading entry of the row above it.\n\nThese conditions imply that every entry below a leading entry is zero. This consequence is often listed as a third condition in textbook definitions.\n\nA leading entry is commonly called a pivot, and its location a pivot position. A column containing a pivot position is a pivot column. In descriptions of elimination algorithms, “pivot” can also mean an entry selected to carry out an elimination step.\n\nFor example,\n\n\\[U= \\begin{pmatrix} 2&-1&3&4&0\\\\ 0&0&5&2&1\\\\ 0&0&0&0&-3\\\\ 0&0&0&0&0 \\end{pmatrix}\\]\n\nis in row echelon form. Its pivots lie in columns \\(1\\), \\(3\\), and \\(5\\).\n\nThe zero matrix is also in row echelon form: the requirements concerning nonzero rows hold vacuously.\n\nConventions\n\nUnder a common definition, used here, pivots need not equal \\(1\\). Some texts require every leading entry to be \\(1\\), calling the resulting arrangement row echelon form or normalized row echelon form. These conventions differ only by scaling nonzero rows.\n\nRow echelon form is not the same as upper triangular form. An upper triangular matrix has zero entries below its main diagonal, but it can fail the staircase condition. For example,\n\n\\[\\begin{pmatrix} 0&1\\\\ 0&2 \\end{pmatrix}\\]\n\nis upper triangular but is not in row echelon form, because both rows have their leading entry in the same column."
    },
    {
      "heading": "Elementary row operations and elimination",
      "text": "The elementary row operations are:\n\n- Interchanging two rows.\n- Multiplying a row by a nonzero scalar.\n- Adding a scalar multiple of one row to another row.\n\nEach operation is reversible. Matrices connected by a sequence of these operations are called row equivalent.\n\nGaussian elimination constructs an echelon form by processing columns from left to right. In each column that contains an available nonzero entry, the procedure selects a pivot, moves its row into position if necessary, and eliminates the entries below it. Columns without an available nonzero entry are skipped.\n\nFor example,\n\n\\[A= \\begin{pmatrix} 1&2&1\\\\ 2&4&3\\\\ 1&3&2 \\end{pmatrix}.\\]\n\nThe operations\n\n\\[R_2\\leftarrow R_2-2R_1, \\qquad R_3\\leftarrow R_3-R_1\\]\n\nproduce\n\n\\[\\begin{pmatrix} 1&2&1\\\\ 0&0&1\\\\ 0&1&1 \\end{pmatrix}.\\]\n\nInterchanging the last two rows gives\n\n\\[U= \\begin{pmatrix} 1&2&1\\\\ 0&1&1\\\\ 0&0&1 \\end{pmatrix},\\]\n\nwhich is in row echelon form.\n\nEquivalently, row reduction gives\n\n\\[U=EA,\\]\n\nwhere \\(E\\) is an invertible matrix representing the combined row operations."
    },
    {
      "heading": "Reduced row echelon form",
      "text": "A matrix is in reduced row echelon form, abbreviated RREF, if it is in row echelon form and additionally:\n\n- Every pivot equals \\(1\\).\n- Every pivot is the only nonzero entry in its column.\n\nThus, echelon form requires zeros below pivots, while reduced echelon form requires zeros both above and below them.\n\nFor example,\n\n\\[\\begin{pmatrix} 1&2&0&-1\\\\ 0&0&1&3\\\\ 0&0&0&0 \\end{pmatrix}\\]\n\nis in reduced row echelon form. Nonpivot columns may still contain nonzero entries.\n\nContinuing elimination above the pivots and normalizing them is commonly called Gauss–Jordan elimination.\n\nA matrix can have many different row echelon forms, since row scaling and other permissible operations can change their entries. In contrast, every matrix over a field has exactly one reduced row echelon form. Consequently, two matrices of the same size are row equivalent if and only if their reduced row echelon forms are identical."
    },
    {
      "heading": "Solving linear systems",
      "text": "A linear system\n\n\\[Ax=b\\]\n\nis reduced by applying row operations to its augmented matrix\n\n\\[[\\,A\\mid b\\,].\\]\n\nBecause the operations replace equations by equivalent equations, they preserve the solution set.\n\nConsider the echelon augmented matrix\n\n\\[\\left( \\begin{array}{ccc|c} 1&2&-1&3\\\\ 0&1&2&4\\\\ 0&0&0&0 \\end{array} \\right).\\]\n\nThe variables \\(x_1\\) and \\(x_2\\) correspond to pivot columns of the coefficient matrix; \\(x_3\\) is a free variable. Setting \\(x_3=t\\) gives\n\n\\[x_2=4-2t, \\qquad x_1=3-2x_2+t=-5+5t.\\]\n\nHence the solutions are\n\n\\[x= \\begin{pmatrix} -5\\\\4\\\\0 \\end{pmatrix} +t \\begin{pmatrix} 5\\\\-2\\\\1 \\end{pmatrix}.\\]\n\nThis process of solving upward from the last nonzero equation is called back substitution.\n\nA 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 contradiction \\(0=c\\), so the system has no solution. In particular, a pivot in the augmented column signals inconsistency.\n\nFor a consistent system with \\(n\\) unknowns and coefficient rank \\(r\\), there are \\(n-r\\) free variables. The solution is unique exactly when \\(r=n\\). Over an infinite field, a consistent system with at least one free variable has infinitely many solutions; over a finite field with \\(q\\) elements, it has \\(q^{\\,n-r}\\) solutions."
    },
    {
      "heading": "Rank and fundamental subspaces",
      "text": "The rank of a matrix equals the number of pivots in any row echelon form, or equivalently the number of its nonzero rows.\n\nRow reduction also provides information about several associated subspaces.\n\nRow space\n\nElementary row operations preserve the row space: each new row is a linear combination of the original rows, and reversibility gives the converse inclusion. The nonzero rows of an echelon form are linearly independent and therefore form a basis for the original row space.\n\nColumn space\n\nRow operations generally change the column space itself, but they preserve all linear dependence relations among corresponding columns. Indeed, if \\(U=EA\\) with \\(E\\) invertible, then\n\n\\[Ac=0\\quad\\Longleftrightarrow\\quad Uc=0.\\]\n\nThe pivot columns of \\(U\\) identify which columns of the original matrix \\(A\\) form a basis for its column space. Taking the pivot columns from \\(U\\) instead generally gives a basis for the column space of \\(U\\), not that of \\(A\\).\n\nNull space\n\nRow operations preserve the null space, because the homogeneous systems \\(Ax=0\\) and \\(Ux=0\\) have exactly the same solutions.\n\nIf \\(A\\) has \\(n\\) columns and rank \\(r\\), parametrizing the free variables yields a null-space basis with \\(n-r\\) vectors. This gives\n\n\\[\\dim(\\ker A)=n-r,\\]\n\nan instance of the rank–nullity theorem."
    },
    {
      "heading": "Other computational uses",
      "text": "For a square matrix, echelon form supports several further calculations:\n\n- Invertibility: An \\(n\\times n\\) matrix is invertible exactly when it has \\(n\\) pivots. Its reduced row echelon form is then the identity matrix.\n- Matrix inverse: Reducing \\([\\,A\\mid I\\,]\\) to \\([\\,I\\mid A^{-1}\\,]\\), when possible, computes the inverse.\n- Determinant: For a square echelon matrix, the determinant is the product of its diagonal entries. Recovering the original determinant requires tracking row swaps and row scalings; adding a multiple of one row to another leaves the determinant unchanged.\n- Factorization: Recording elimination multipliers leads to LU decomposition, often incorporating a permutation matrix when rows are interchanged."
    },
    {
      "heading": "Exact and numerical computation",
      "text": "Over an exact field, echelon form and reduced echelon form have precise algebraic meanings. With floating-point arithmetic, rounding errors can make a theoretically zero entry appear as a small nonzero number.\n\nPractical elimination algorithms therefore use pivoting strategies. Partial pivoting selects an entry of largest absolute value in the available part of the current column, helping control elimination multipliers. It does not eliminate every possible difficulty with numerical stability.\n\nThe distinction between exact rank and numerical rank is especially important near singularity. Numerical rank depends on a tolerance and the scale of the matrix, rather than solely on whether computed entries are literally zero. For rank estimation in such settings, QR decomposition with column pivoting and singular value decomposition are commonly used alternatives to direct echelon reduction.\n\nThe field assumption also matters. Over a general ring, nonzero pivots need not be invertible, so the usual row-normalization and elimination arguments do not automatically apply. Integer matrices reduced using only integer-preserving operations require different normal forms."
    }
  ],
  "links": [
    "linear-algebra",
    "matrix",
    "field-mathematics",
    "system-of-linear-equations",
    "real-number",
    "complex-number",
    "gaussian-elimination",
    "finite-field",
    "matrix-rank",
    "linear-subspace",
    "linear-combination",
    "basis-linear-algebra",
    "null-space",
    "rank-nullity-theorem",
    "identity-matrix",
    "inverse-matrix",
    "determinant",
    "lu-decomposition",
    "floating-point-arithmetic",
    "numerical-stability",
    "qr-decomposition",
    "singular-value-decomposition"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}