06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

4.3. THE ROW REDUCED ECHELON FORM 113<br />

Proof: Viewing the columns of A from left to right take the first nonzero column. Pick<br />

a nonzero entry in this column and switch the row containing this entry with the top row of<br />

A. Now divide this new top row by the value of this nonzero entry to get a 1 in this position<br />

and then use row operations to make all entries below this entry equal to zero. Thus the<br />

first nonzero column is now e 1 . Denote the resulting matrix by A 1 . Consider the submatrix<br />

of A 1 to the right of this column and below the first row. Do exactly the same thing for it<br />

that was done for A. Thistimethee 1 will refer to F m−1 . Use this 1 and row operations<br />

to zero out every entry above it in the rows of A 1 . Call the resulting matrix A 2 . Thus A 2<br />

satisfies the conditions of the above definition up to the column just encountered. Continue<br />

this way till every column has been dealt with and the result must be in row reduced echelon<br />

form. <br />

The following diagram illustrates the above procedure. Say the matrix looked something<br />

like the following.<br />

⎛<br />

⎞<br />

0 ∗ ∗ ∗ ∗ ∗ ∗<br />

0 ∗ ∗ ∗ ∗ ∗ ∗<br />

⎜<br />

⎟<br />

⎝ . . . . . . . ⎠<br />

0 ∗ ∗ ∗ ∗ ∗ ∗<br />

First step would yield something like<br />

⎛<br />

⎞<br />

0 1 ∗ ∗ ∗ ∗ ∗<br />

0 0 ∗ ∗ ∗ ∗ ∗<br />

⎜<br />

⎟<br />

⎝ . . . . . . . ⎠<br />

0 0 ∗ ∗ ∗ ∗ ∗<br />

For the second step you look at the lower right corner as described,<br />

⎛<br />

⎞<br />

∗ ∗ ∗ ∗ ∗<br />

⎜<br />

⎟<br />

⎝ . . . . . ⎠<br />

∗ ∗ ∗ ∗ ∗<br />

and if the first column consists of all zeros but the next one is not all zeros, you would get<br />

something like this.<br />

⎛<br />

⎞<br />

0 1 ∗ ∗ ∗<br />

⎜<br />

⎟<br />

⎝ . . . . . ⎠<br />

0 0 ∗ ∗ ∗<br />

Thus, after zeroing out the term in the top row above the 1, you get the following for the<br />

next step in the computation of the row reduced echelon form for the original matrix.<br />

⎛<br />

⎞<br />

0 1 ∗ 0 ∗ ∗ ∗<br />

0 0 0 1 ∗ ∗ ∗<br />

⎜<br />

⎝<br />

.<br />

.<br />

.<br />

.<br />

.<br />

.<br />

⎟<br />

. ⎠ .<br />

0 0 0 0 ∗ ∗ ∗<br />

Next you look at the lower right matrix below the top two rows and to the right of the first<br />

four columns and repeat the process.<br />

Definition 4.3.3 The first pivot column of A is the first nonzero column of A. The next<br />

pivot column is the first column after this which is not a linear combination of the columns to<br />

its left. The third pivot column is the next column after this which is not a linear combination

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!