12-240/Classnotes for Tuesday November 15

DBN: Classes: 2012-13: 12-240 / Navigation Additions to this web site no longer count towards good deed points. # Week of... Notes and Links 1 Sep 10 About This Class, Tuesday, Thursday 2 Sep 17 HW1, Tuesday, Thursday, HW1 Solutions 3 Sep 24 HW2, Tuesday, Class Photo, Thursday 4 Oct 1 HW3, Tuesday, Thursday 5 Oct 8 HW4, Tuesday, Thursday 6 Oct 15 Tuesday, Thursday 7 Oct 22 HW5, Tuesday, Term Test was on Thursday. HW5 Solutions 8 Oct 29 Why LinAlg?, HW6, Tuesday, Thursday, Nov 4 is the last day to drop this class 9 Nov 5 Tuesday, Thursday 10 Nov 12 Monday-Tuesday is UofT November break, HW7, Thursday 11 Nov 19 HW8, Tuesday,Thursday 12 Nov 26 HW9, Tuesday , Thursday 13 Dec 3 Tuesday UofT Fall Semester ends Wednesday F Dec 10 The Final Exam (time, place, style, office hours times) Register of Good Deeds Add your name / see who's in!

Problem. Find the rank the matrix

[math]\displaystyle{ A=\begin{pmatrix}0&2&4&2&2\\4&4&4&8&0\\8&2&0&10&2\\6&3&2&9&1\end{pmatrix} }[/math].

Solution. Using (invertible!) row/column operations we aim to bring [math]\displaystyle{ A }[/math] to look as close as possible to an identity matrix:

Do	Get	Do	Get
1. Bring a [math]\displaystyle{ 1 }[/math] to the upper left corner by swapping the first two rows and multiplying the first row (after the swap) by [math]\displaystyle{ 1/4 }[/math].	[math]\displaystyle{ \begin{pmatrix}1&1&1&2&0\\0&2&4&2&2\\8&2&0&10&2\\6&3&2&9&1\end{pmatrix} }[/math]	2. Add [math]\displaystyle{ (-8) }[/math] times the first row to the third row, in order to cancel the [math]\displaystyle{ 8 }[/math] in position 3-1.	[math]\displaystyle{ \begin{pmatrix}1&1&1&2&0\\0&2&4&2&2\\0&-6&-8&-6&2\\6&3&2&9&1\end{pmatrix} }[/math]
3. Likewise add [math]\displaystyle{ (-6) }[/math] times the first row to the fourth row, in order to cancel the [math]\displaystyle{ 6 }[/math] in position 4-1.	[math]\displaystyle{ \begin{pmatrix}1&1&1&2&0\\0&2&4&2&2\\0&-6&-8&-6&2\\0&-3&-4&-3&1\end{pmatrix} }[/math]	4. With similar column operations (you need three of those) cancel all the entries in the first row (except, of course, the first, which is used in the canceling).	[math]\displaystyle{ \begin{pmatrix}1&0&0&0&0\\0&2&4&2&2\\0&-6&-8&-6&2\\0&-3&-4&-3&1\end{pmatrix} }[/math]
5. Turn the 2-2 entry to a [math]\displaystyle{ 1 }[/math] by multiplying the second row by [math]\displaystyle{ 1/2 }[/math].	[math]\displaystyle{ \begin{pmatrix}1&0&0&0&0\\0&1&2&1&1\\0&-6&-8&-6&2\\0&-3&-4&-3&1\end{pmatrix} }[/math]	6. Using two row operations "clean" the second column; that is, cancel all entries in it other than the "pivot" [math]\displaystyle{ 1 }[/math] at position 2-2.	[math]\displaystyle{ \begin{pmatrix}1&0&0&0&0\\0&1&2&1&1\\0&0&4&0&8\\0&0&2&0&4\end{pmatrix} }[/math]
7. Using three column operations clean the second row except the pivot.	[math]\displaystyle{ \begin{pmatrix}1&0&0&0&0\\0&1&0&0&0\\0&0&4&0&8\\0&0&2&0&4\end{pmatrix} }[/math]	8. Clean up the row and the column of the [math]\displaystyle{ 4 }[/math] in position 3-3 by first multiplying the third row by [math]\displaystyle{ 1/4 }[/math] and then performing the appropriate row and column transformations. Notice that by pure luck, the [math]\displaystyle{ 4 }[/math] at position 4-5 of the matrix gets killed in action.	[math]\displaystyle{ \begin{pmatrix}1&0&0&0&0\\0&1&0&0&0\\0&0&1&0&0\\0&0&0&0&0\end{pmatrix} }[/math]

Thus the rank of our matrix is 3.