The system of linear equations \(\left( {\begin{array}{} 2&1&3\\ 3&0&1\\ 1&2&5 \end{array}} \right)\left( {\begin{array}{} a\\ b\\ c \end{array}} \right) = \left( {\begin{array}{} 5\\ { - 4}\\ {14} \end{array}} \right)\) has
infinitely many solutions
To determine the nature of solutions for a system of linear equations, we typically analyze the determinant of the coefficient matrix and the ranks of the coefficient matrix and the augmented matrix.
The given system of linear equations is in the matrix form \(AX = B\):
\[\left( {\begin{array}{} 2&1&3\\ 3&0&1\\ 1&2&5 \end{array}} \right)\left( {\begin{array}{} a\\ b\\ c \end{array}} \right) = \left( {\begin{array}{} 5\\ { - 4}\\ {14} \end{array}} \right)\]
Here, the coefficient matrix \(A\), the variable matrix \(X\), and the constant matrix \(B\) are:
\[A = \begin{pmatrix} 2 & 1 & 3 \\ 3 & 0 & 1 \\ 1 & 2 & 5 \end{pmatrix}, \quad X = \begin{pmatrix} a \\ b \\ c \end{pmatrix}, \quad B = \begin{pmatrix} 5 \\ -4 \\ 14 \end{pmatrix}\]
First, we calculate the determinant of the coefficient matrix \(A\), denoted as \(\det(A)\) or \(|A|\).
\[\det(A) = \begin{vmatrix} 2 & 1 & 3 \\ 3 & 0 & 1 \\ 1 & 2 & 5 \end{vmatrix}\]
Using cofactor expansion along the first row:
\[\det(A) = 2 \begin{vmatrix} 0 & 1 \\ 2 & 5 \end{vmatrix} - 1 \begin{vmatrix} 3 & 1 \\ 1 & 5 \end{vmatrix} + 3 \begin{vmatrix} 3 & 0 \\ 1 & 2 \end{vmatrix}\] \[\det(A) = 2((0)(5) - (1)(2)) - 1((3)(5) - (1)(1)) + 3((3)(2) - (0)(1))\] \[\det(A) = 2(0 - 2) - 1(15 - 1) + 3(6 - 0)\] \[\det(A) = 2(-2) - 1(14) + 3(6)\] \[\det(A) = -4 - 14 + 18\] \[\det(A) = -18 + 18\] \[\det(A) = 0\]
Since the determinant of the coefficient matrix \(A\) is \(0\), this tells us that the matrix \(A\) is singular. A singular coefficient matrix means that the system of linear equations does not have a unique solution. Instead, it will either have:
To distinguish between these two cases, we need to analyze the ranks of the coefficient matrix \(A\) and the augmented matrix \([A|B]\).
We form the augmented matrix \([A|B]\) by combining the coefficient matrix \(A\) with the constant vector \(B\):
\[[A|B] = \begin{pmatrix} 2 & 1 & 3 & | & 5 \\ 3 & 0 & 1 & | & -4 \\ 1 & 2 & 5 & | & 14 \end{pmatrix}\]
Now, we perform elementary row operations to transform the augmented matrix into its row echelon form to find its rank.
| Step | Operation | Augmented Matrix |
|---|---|---|
| 1 | Swap \(R_1 \leftrightarrow R_3\) | \[\begin{pmatrix} 1 & 2 & 5 & | & 14 \\ 3 & 0 & 1 & | & -4 \\ 2 & 1 & 3 & | & 5 \end{pmatrix}\] |
| 2 | \(R_2 \to R_2 - 3R_1\) | \[\begin{pmatrix} 1 & 2 & 5 & | & 14 \\ 0 & -6 & -14 & | & -46 \\ 2 & 1 & 3 & | & 5 \end{pmatrix}\] |
| 3 | \(R_3 \to R_3 - 2R_1\) | \[\begin{pmatrix} 1 & 2 & 5 & | & 14 \\ 0 & -6 & -14 & | & -46 \\ 0 & -3 & -7 & | & -23 \end{pmatrix}\] |
| 4 | \(R_2 \to -\frac{1}{2}R_2\) | \[\begin{pmatrix} 1 & 2 & 5 & | & 14 \\ 0 & 3 & 7 & | & 23 \\ 0 & -3 & -7 & | & -23 \end{pmatrix}\] |
| 5 | \(R_3 \to R_3 + R_2\) | \[\begin{pmatrix} 1 & 2 & 5 & | & 14 \\ 0 & 3 & 7 & | & 23 \\ 0 & 0 & 0 & | & 0 \end{pmatrix}\] |
From the row echelon form, we can determine the ranks:
According to the Rouché–Capelli theorem (also known as the Frobenius theorem), the consistency and nature of solutions for a system of linear equations \(AX=B\) are determined by comparing the ranks of \(A\) and \([A|B]\) with the number of variables \(n\):
In our case:
Since \(\rho(A) = \rho([A|B]) = 2\) and this rank is less than the number of variables \(n = 3\), the system of linear equations has infinitely many solutions.
A system of equations is said to be inconsistent if
If a system of simultaneous equations has infinite solutions, then that system of equations is called:
Consider the system of simultaneous equation,
x + 2y + z = 6
2x + y + 2z = 6
x + y + z = 5
The system has,
The system of equations x + 2y = 13 and 3x + 6y = 9 has:
For what value of k, the system linear equation has no solution
(3k + 1)x + 3y - 2 = 0
(k2 + 1)x + (k - 2)y - 5 = 0