The three elementary row operations on a matrix are defined as follows.
(1) Interchanging two rows:
$R_i \leftrightarrow R_j$ interchanges rows $i$ and $j$.
(2) Multiplying a row by a non-zero scalar(a number):
$tR_i$ multiplies row $i$ by the non-zero scalar (number) $t$.
(3) Adding a multiple of one row to another row:
$R_j+tR_i$ adds $t$ times row $i$ to row $j$.
First, the augmented matrix of the system is
1 & 2 & 3 & 4 \\
5 & 6 & 7 & 8 \\
9 & 10 & 11 & 12
We apply elementary row operations as follows to reduce the system to row echelon form.
The corresponding system of linear equations of it is
The last equation $0z=0$ means that $z$ can be any number.
(More systematically, the variables corresponding to leading $1$’s in the echelon form matrix are dependent variables, and the rests are independent (free) variables.)
So let us say that $t$ is a value for $z$, namely $z=t$.
Then from the second equation, we have $y=-2t+3$.
From the first equation, we have
Thus the solution set is
\[(x,y,z)=(t-2, -2t+3, t)\]
for any $t$.
You may want to check whether the answer is correct by substituting this solution to the original equations.
Also, if you further reduce the matrix into reduced row echelon form, the last system becomes simpler (and simplest in a sense).
This procedure, to reduce a matrix until reduced row echelon form, is called the Gauss-Jordan elimination.
Possibilities For the Number of Solutions for a Linear System
Determine whether the following systems of equations (or matrix equations) described below has no solution, one unique solution or infinitely many solutions and justify your answer.
where $a,b,c, d$ […]