# Row Equivalence of Matrices is Transitive

## Problem 642

If $A, B, C$ are three $m \times n$ matrices such that $A$ is row-equivalent to $B$ and $B$ is row-equivalent to $C$, then can we conclude that $A$ is row-equivalent to $C$?

If so, then prove it. If not, then provide a counterexample.

## Definition (Row Equivalent).

Two matrices are said to be row equivalent if one can be obtained from the other by a sequence of elementary row operations.

## Proof.

Yes, in this case $A$ and $C$ are row-equivalent.

By assumption, the matrices $A$ and $B$ are row-equivalent, which means that there is a sequence of elementary row operations that turns $A$ into $B$.

Call this sequence $r_1 , r_2 , \cdots , r_n$, where each $r_i$ is an elementary row operation.
(Start with applying $r_1$ to $A$.)

By another assumption, $B$ is row-equivalent to $C$, which means that there is a sequence of elementary row operations which transforms $B$ into $C$; call this sequence $s_1 , s_2 , \cdots , s_m$.

Putting these sequences together, the operations $r_1 , r_2 , \cdots , r_n$ , $s_1 , s_2 , \cdots , s_m$ will transform the matrix $A$ into $C$.

This proves that $A$ and $C$ are row-equivalent.

##### Find all Column Vector $\mathbf{w}$ such that $\mathbf{v}\mathbf{w}=0$ for a Fixed Vector $\mathbf{v}$
Let $\mathbf{v} = \begin{bmatrix} 2 & -5 & -1 \end{bmatrix}$. Find all $3 \times 1$ column vectors $\mathbf{w}$ such that...