Row_equivalence
Row equivalence
Equivalence of matrices under row operations
In linear algebra, two matrices are row equivalent if one can be changed to the other by a sequence of elementary row operations. Alternatively, two m × n matrices are row equivalent if and only if they have the same row space. The concept is most commonly applied to matrices that represent systems of linear equations, in which case two matrices of the same size are row equivalent if and only if the corresponding homogeneous systems have the same set of solutions, or equivalently the matrices have the same null space.
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (September 2012) |
Because elementary row operations are reversible, row equivalence is an equivalence relation. It is commonly denoted by a tilde (~).[1]
There is a similar notion of column equivalence, defined by elementary column operations; two matrices are column equivalent if and only if their transpose matrices are row equivalent. Two rectangular matrices that can be converted into one another allowing both elementary row and column operations are called simply equivalent.