# Why do elementary matrix operations not affect the row space of a given matrix?

I have shown that two of the three elementary operations will not change the image of the row space of the matrix: given a row vector $\vec{v}$, $k\vec{v}$ will span the same (scalar multiplication), and switching the order of the rows won't change anything because the span of the row vectors will be the same (vectors will be in a different order). However, how would one show that adding/subtracting vectors does not change the row space?

-

HINT $\ \$ If $\rm\ v\in V\$ then $\rm\ w\in V\ \iff\ w+c\:v\in V\:.\$ Thus $\rm\ span(v,w)\ =\ span(v,w+c\:v)\:.$

-

Suppose the rows of the matrix are $A=(v_1 ,v_2 ,...,v_n)$, then switching two rows, is just switching the order of the vectors, and as you said, it doesn't change the span of this set. The same is true for multiplying by a scalar ($\neq 0$) one of the rows.

Suppose you want to change $v_2$ to the vector $v_2 + \alpha v_1$ which is the last elementary operation. The span of $B=(v_1 ,v_2 + \alpha v_1 ,...,v_n)$ will contain $(v_2 + \alpha v_1) - \alpha v_1 = v_2$ so $A \subseteq span(B) \Rightarrow span(A) \subseteq span(B)$. In the same way $v_2 + \alpha v_1 \in span(A)$ so $B\subseteq span(A) \Rightarrow span(B) \subseteq span (A)$.

now you have that $span(B)=span(A)$ so adding one row (times a scalar) to another doesn't change the row space.

-

Yet another attempt to convey the answer succinctly:

By definition, the rowspan is the collection of vectors you can get when you take (the sums of) all possible combinations of the row-vectors (together with scalar multiples).

When you add one vector to another, you may think of this as "doing some of the combining ahead of time". You're not going to change the collection of "all possible combinations of the rows" by doing some of the combining ahead of time.

-