Linear Algebra, Reduced Echelon Form

After developing the mechanics of Gauss' method,
we observed that it can be done in more than one way.
One example is that we sometimes have to swap rows and there can be more than
one row to choose from.
Another example is that from this matrix

( \begin{matrix}2 & 2 \\ 4 & 3\end{matrix} )

Gauss' method could derive any of these echelon form matrices.

( \begin{matrix}2 & 2 \\ 0 & − 1\end{matrix} ) \ ( \begin{matrix}1 & 1 \\ 0 & − 1\end{matrix} ) \ ( \begin{matrix}2 & 0 \\ 0 & − 1\end{matrix} )

The first results from − 2 {ρ}_{1} + {ρ}_{2}.
The second comes from following ( 1 / 2 ) {ρ}_{1} with − 4 {ρ}_{1} + {ρ}_{2}.
The third comes
from − 2 {ρ}_{1} + {ρ}_{2} followed by {}2 {ρ}_{2} + {ρ}_{1}
(after the first pivot the matrix is already in
echelon form so the second one is extra work
but it is nonetheless a legal row operation).

The fact that the echelon form outcome of Gauss' method
is not unique leaves us with some questions.
Will any two echelon form versions of a system have the same number of
free variables?
Will they in fact have exactly the same variables free?
In this section we will answer both questions "yes".
We will do more than answer the questions.
We will give a way to decide if one linear system
can be derived from another by row operations.
The answers to the two questions will follow from this larger result.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.