Last one, I promise! Question in next post.
Let A =\(\left[\begin{matrix}0 & 1 & 7 & 8 \\ 1 & 3 & 3 & 8 \\ -2 & -5 & 1 & -8 \end{matrix}\right]\) Write A in termos of A=EFGR, where R is in the row echelon form and E, F, G are elementary matrices. I've reduced to row echelon form and found that R = \(AE^{-1}F^{-1}G^{-1}\) but that's it. I cannot seem to remember elemetary matrices.
In this case, R = \(\left[\begin{matrix}1 & 3 & 3 & 8 \\ 0 & 1 & 7 & 8\\ 0 & 0 & 0 & 0\end{matrix}\right]\)
Sorry for mistypes. I'm kinda drowsy at the moment.
simply multupl GFE both sides ?
That's where I started the problem: \(A=REFG \leftrightarrow R =AE^{-1}F^{-1}G^{-1}\). But I need to find the elementary matrices and that's what I do not recall.
whats the first row operation that you have done ?
I've swapped L2 and L1
whats the corresponding elementary matrix ?
In other words, what matrix needs to be multiplied by A in order to swap L2 and L1 ?
\[\left[\begin{matrix}1 & 3 & 3 & 8 \\ 0 & 1 & 7 & 8 \\-2 & -5 & 1 & -8\end{matrix}\right]\]
That's the first operation I've done.
Careful, these two statements are really completely different: \( A=EFGR \) \(R = AE^{-1}F^{-1}G^{-1}\) Left and right multiplication are specific, so if you right multiply that second statement by \(GFE\) you get: \[A = R GFE \ne EFGR \]
Oh, right. I see what we are getting into...
Yeah, that was sloppy of me. My bad.
But I do get it now. It's the matrix that I have to multiply which gives the product after each operation
Below red matrix swaps first and second rows \[\left[\begin{matrix}1 & 3 & 3 & 8 \\ 0 & 1 & 7 & 8\\ 0 & 0 & 0 & 0\end{matrix}\right] = \color{red}{\left[\begin{matrix}0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 1 \end{matrix}\right]} \left[\begin{matrix}0 & 1 & 7 & 8 \\ 1 & 3 & 3 & 8 \\ -2 & -5 & 1 & -8 \end{matrix}\right]\]
All right, thats E. , then. Now for G this should be \(\left[\begin{matrix}1 & 0 & 0 \\ 0 & 1 & 0 \\ 2 & 0 & 1 \end{matrix}\right]\)
I meant F.
are you doing 2*row1 + row3 ?
2R1+R3
\[\left[\begin{matrix}1 & 3 & 3 & 8 \\ 0 & 1 & 7 & 8\\ 0 & 1 & 7 & 8\end{matrix}\right] = \color{red}{\left[\begin{matrix}1 & 0 & 0 \\ 0 & 1 & 0 \\ 2 & 0 & 1 \end{matrix}\right]} \color{red}{\left[\begin{matrix}0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 1 \end{matrix}\right]} \left[\begin{matrix}0 & 1 & 7 & 8 \\ 1 & 3 & 3 & 8 \\ -2 & -5 & 1 & -8 \end{matrix}\right]\]
Okay, seems right. For G I've managed to grab \(\left[\begin{matrix}1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & -1 & 1 \end{matrix}\right]\)
Which is -R2 + R3.
looks good, so far you have : \[R=GFEA \]
They are all nonsingular, so now onto calculating the inverse matrices...
Is it? I thought I'd multiply the elments outside the main row by -1.
No, it doesn't work. Getting sloppy again.
Let me do it with the usual way
yeah it works only for the row swapping matrices 1) inverse of a row swapping matrix is itself
but finding other inverses should be trivial
\[\left[\begin{matrix}1 & 0 & 0 \\ 0 & 1 & 0 \\ 2 & 0 & 1 \end{matrix}\right]^{-1} = \left[\begin{matrix}1 & 0 & 0 \\ 0 & 1 & 0 \\ -2 & 0 & 1 \end{matrix}\right]\]
Yeah, I'm slow writing in LaTeX but that's what I've found and the last one you just do a32=-a32
yeah
for \(a_{32} \in G\) that is.
I guess it finishes the question, then. Just plug in the inverse matrices and R and I'm done!
Thanks for the help!
Np :)
Might as well do a last problem before going to bed! Haha!
Join our real-time social learning platform and learn together with your friends!