In linear algebra, a matrix is in row echelon form if it can be obtained as the result of Gaussian elimination. Every matrix can be put in row echelon form by applying a sequence 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 the steps of a 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, with the additional property that the first nonzero entry of each row is equal to 1 {\displaystyle 1} and is the only nonzero entry of its column. The reduced row echelon form of a matrix is unique and does not depend on the sequence of elementary row operations that is used to obtain it. The specific type 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. Since all properties of column echelon forms can therefore immediately be deduced from the corresponding properties of row echelon forms, only row echelon forms are considered in the remainder of the article.
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 leftmost non-zero entry) of every non-zero row, called the pivot, is to 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 4 × 5 {\displaystyle 4\times 5} matrix in row echelon form, but not in reduced row echelon form:
[ 1 a 0 a 1 a 2 a 3 0 0 2 a 4 a 5 0 0 0 1 a 6 0 0 0 0 0 ] {\displaystyle \left[{\begin{array}{ccccc}1&a_{0}&a_{1}&a_{2}&a_{3}\\0&0&2&a_{4}&a_{5}\\0&0&0&1&a_{6}\\0&0&0&0&0\end{array}}\right]}
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 1 (called a leading one). Each column containing a leading 1 has zeros in all its other entries. If the first two conditions are verified, the last condition is equivalent to:
Each column containing a leading 1 has zeros in all entries above the leading 1. 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 1 of the ith row in the ith column, one gets a matrix of the form
( I X 0 0 ) , {\displaystyle {\begin{pmatrix}I&X\\0&0\end{pmatrix}},}
… excerpt ends here. Continue reading the full article.


