Calculation:

Consider this matrix,

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Now, for a matrix to be in the reduced form, it must have the following properies.

1. The first non-zero element in each row must be 1, which is also known as the leading entry.

2. Each leading entry is in a column to the right of the entry in the previous row of the matrix.

3. If there are any rows with all zero elements, then they must be below the rows having a non-zero element.

Make the zeros in column 1 except the leading entry in row 1 and column 1. But here, it is observed that all the elements are already zero.

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Similarly, make the zeros in column 2 except the leading entry in row 2 and column 2.

But here, it is observed that all the elements are already zero,

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Then make the zeros in row 1 column 3 and row 2 column 3, except the leading entry in row 3 and column 3 with the of the operation,\({R}_{{1}}\to{R}_{{1}}+{2}{R}_{{3}}.\)

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}{R}_{{1}}\to{R}_{{1}}+{R}_{{3}}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Similarly, use the operations \({R}_{{3}}\to\frac{{{R}_{{3}}}}{{3}}{\quad\text{and}\quad}{R}_{{2}}\to{R}_{{2}}-{2}{\left({R}_{{3}}\right)}\) to get the desired result as,

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}{R}_{{3}}\to\frac{{{R}_{{3}}}}{{3}}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}{R}_{{2}}\to{R}_{{2}}-{2}{R}_{{3}}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{0}&{4}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}\)

The matrix obtained above by performing certain row transformations satisfies all the properties of the reduced form of a matrix.

Hence, the reduced form of the matrix \({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\) is

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{0}&{4}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}.\)

Consider this matrix,

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Now, for a matrix to be in the reduced form, it must have the following properies.

1. The first non-zero element in each row must be 1, which is also known as the leading entry.

2. Each leading entry is in a column to the right of the entry in the previous row of the matrix.

3. If there are any rows with all zero elements, then they must be below the rows having a non-zero element.

Make the zeros in column 1 except the leading entry in row 1 and column 1. But here, it is observed that all the elements are already zero.

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Similarly, make the zeros in column 2 except the leading entry in row 2 and column 2.

But here, it is observed that all the elements are already zero,

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Then make the zeros in row 1 column 3 and row 2 column 3, except the leading entry in row 3 and column 3 with the of the operation,\({R}_{{1}}\to{R}_{{1}}+{2}{R}_{{3}}.\)

\({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}{R}_{{1}}\to{R}_{{1}}+{R}_{{3}}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\)

Similarly, use the operations \({R}_{{3}}\to\frac{{{R}_{{3}}}}{{3}}{\quad\text{and}\quad}{R}_{{2}}\to{R}_{{2}}-{2}{\left({R}_{{3}}\right)}\) to get the desired result as,

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}{R}_{{3}}\to\frac{{{R}_{{3}}}}{{3}}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{2}&{0}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}{R}_{{2}}\to{R}_{{2}}-{2}{R}_{{3}}\)

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{0}&{4}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}\)

The matrix obtained above by performing certain row transformations satisfies all the properties of the reduced form of a matrix.

Hence, the reduced form of the matrix \({\left[\begin{matrix}{1}&{0}&-{3}&{1}\\{0}&{1}&{2}&{0}\\{0}&{0}&{3}&-{6}\end{matrix}\right]}\) is

\({\left[\begin{matrix}{1}&{0}&{0}&-{5}\\{0}&{1}&{0}&{4}\\{0}&{0}&{1}&-{2}\end{matrix}\right]}.\)