Solution RREF.C33 Robert Beezer
Following the algorithm of Theorem REMEF, and working to create pivot columns from left to right, we have \begin{align*} & \begin{bmatrix} 1 & 2 & -1 & -1 \\ 2 & 4 & -1 & 4 \\ -1 & -2 & 3 & 5 \end{bmatrix} \xrightarrow{\rowopadd{-2}{1}{2}} \begin{bmatrix} 1 & 2 & -1 & -1 \\ 0 & 0 & 1 & 6 \\ -1 & -2 & 3 & 5 \end{bmatrix}\\ \xrightarrow{\rowopadd{1}{1}{3}} & \begin{bmatrix} \leading{1} & 2 & -1 & -1 \\ 0 & 0 & 1 & 6 \\ 0 & 0 & 2 & 4 \end{bmatrix} \xrightarrow{\rowopadd{1}{2}{1}} \begin{bmatrix} \leading{1} & 2 & 0 & 5 \\ 0 & 0 & 1 & 6 \\ 0 & 0 & 2 & 4 \end{bmatrix}\\ \xrightarrow{\rowopadd{-2}{2}{3}} & \begin{bmatrix} \leading{1} & 2 & 0 & 5 \\ 0 & 0 & \leading{1} & 6 \\ 0 & 0 & 0 & -8 \end{bmatrix} \xrightarrow{\rowopmult{-\frac{1}{8}}{3}} \begin{bmatrix} \leading{1} & 2 & 0 & 5 \\ 0 & 0 & \leading{1} & 6 \\ 0 & 0 & 0 & 1 \end{bmatrix}\\ \xrightarrow{\rowopadd{-6}{3}{2}} & \begin{bmatrix} \leading{1} & 2 & 0 & 5 \\ 0 & 0 & \leading{1} & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix} \xrightarrow{\rowopadd{-5}{3}{1}} \begin{bmatrix} \leading{1} & 2 & 0 & 0 \\ 0 & 0 & \leading{1} & 0 \\ 0 & 0 & 0 & \leading{1} \end{bmatrix} \end{align*}