The reduced column echelon form of a matrix is defined by taking its transpose, forming the reduced row echelon form, and transposing back:It is obtained from by elementary column operations. Its nonzero columns precede its zero columns, the topmost nonzero entry of each nonzero column is , these leading entries move strictly downward as the column number increases, and each leading entry is the only nonzero entry in its row.
Every elementary column operation preserves the column space, because it and its inverse express each new column as a linear combination of the old columns. Thus the nonzero columns of the reduced form give a basis of the original column space. In contrast, elementary row operations preserve the row space. There is no general identity : the definition requires reducing , not .
For an invertible matrix of size , both reduced forms are . A singular example showing the distinction is
Articles by others on the same topic
There are currently no matching articles.