In linear algebra, a matrix is in row echelon form if it can be obtained as the result of Gaussian elimination. In particular, every matrix can be put in row echelon form by a succession of elementary row operations. The term echelon comes from the French "échelon" ("level" or step of a ladder), and refers to the fact that the nonzero entries of a matrix in row echelon form look like an inverted staircase.
For square matrices, an upper triangular matrix with nonzero entries on the diagonal is in row echelon form, and a matrix in row echelon form is (weakly) upper triangular. Thus, the row echelon form can be viewed as a generalization of upper triangular form for rectangular matrices.
A matrix is in reduced row echelon form if it is in row echelon form, the first nonzero entry of each row is equal to and the ones above it within the same column equal . The reduced row echelon form of a matrix is unique and does not depend on the sequence of elementary row operations used to obtain it. The variant of Gaussian elimination that transforms a matrix to reduced row echelon form is sometimes called Gauss–Jordan elimination.
A matrix is in column echelon form if its transpose is in row echelon form. So, all properties of column echelon forms can be easily deduced from the corresponding properties of row echelon forms. Therefore, only row echelon forms are considered in the remainder of the article.
(General) row echelon form
A matrix is in row echelon form if
All rows having only zero entries are at the bottom. The leading entry (that is, the left-most nonzero entry) of every nonzero row, called the pivot, is on the right of the leading entry of every row above.
Some texts add the condition that the leading coefficient must be 1 while others require this only in reduced row echelon form.
These two conditions imply that all entries in a column below a leading coefficient are zeros.
The following is an example of a matrix in row echelon form, but not in reduced row echelon form (see below):
Many properties of matrices may be easily deduced from their row echelon form, such as the rank and the kernel.
Reduced row echelon form
A matrix is in reduced row echelon form (also called row canonical form) if it satisfies the following conditions: It is in row echelon form. The leading entry in each nonzero row is (called a leading one). Each column containing a leading has zeros in all its other entries.
For a matrix in row echelon form, the last condition is equivalent to
Each column containing a leading has zeros in all entries above the leading .
While a matrix may have several echelon forms, its reduced echelon form is unique.
Given a matrix in reduced row echelon form, if one permutes the columns in order to have the leading of the th row in the th column, one gets a matrix of the form
where is an identity matrix, is a matrix with the same number of rows as , and the two 's are zero matrices of appropriate size. However, since a permutation of columns is not a row operation, the resulting matrix is inequivalent.
Systems of linear equations
A system of linear equations is said to be in row echelon form if its augmented matrix is in row echelon form. Similarly, a system of linear equations is said to be in reduced row echelon form or in canonical form if its augmented matrix is in reduced row echelon form.
The canonical form may be viewed as an explicit solution of the linear system. In fact, the system is inconsistent if and only if one of the equations of the canonical form is reduced to 0 = 1; that is if there is a leading in the column of the constant terms Otherwise, regrouping in the right hand side all the terms of the equations but the leading ones, expresses the variables corresponding to the pivots as constants or linear functions of the other variables, if any.
Transformation to row echelon form
Gaussian elimination is the main algorithm for transforming every matrix into a matrix in row echelon form. A variant, sometimes called Gauss–Jordan elimination produces a reduced row echelon form. Both consist of a finite sequence of elementary row operations; the number of required elementary row operations is at most for an -by- matrix. For a given matrix, despite the row echelon form not being unique, all row echelon forms, including the reduced row echelon form, have the same number of zero rows and the pivots are located in the same positions.
This is an example of a matrix in reduced row echelon form, which shows that the left part of the matrix is not always an identity matrix: