Examine the consistency of the system of equations in Exercises 1 to 6.
\( x + y + z = 1\)
\(2x + 3y + 2z = 2\)
\(ax + ay + 2az = 4\)
CBSE Class 12 Maths · Determinants
CBSE Class 12 Maths · Determinants
Think of a system of equations like a set of rules a machine must follow. When the parameter \( a \) is any number other than zero, the machine has exactly one way to work — everything is consistent. But when \( a = 0 \), one rule becomes impossible, like asking someone to have 4 apples when they have none. An impossible rule means no solution exists. So the whole system only works — stays consistent — when \( a \ne 0 \).
Answer: The system is consistent (with a unique solution) for every \( a \ne 0 \), since \( \det(A) = a \ne 0 \). If \( a = 0 \), the third equation reduces to \( 0 = 4 \), so the system is inconsistent. Thus the system is consistent precisely when \( a \ne 0 \).
A system of linear equations can be written in matrix form as \( AX = B \), where \( A \) is the coefficient matrix, \( X \) is the column of variables, and \( B \) is the column of constants. To check consistency we first evaluate \( \det(A) \). If \( \det(A) \ne 0 \), the matrix \( A \) is invertible, the system has a unique solution, and it is consistent. If \( \det(A) = 0 \), we must examine \( (\text{adj}\,A)B \): if this is the zero matrix the system may have infinitely many solutions (consistent), but if it is a non-zero matrix the system has no solution and is inconsistent. Here the coefficients contain the parameter \( a \), so we must handle it carefully.
For \( AX = B \): if \( \det(A) \ne 0 \) the system is consistent with a unique solution \( X = A^{-1}B \). If \( \det(A) = 0 \), check \( (\text{adj}\,A)B \): zero matrix means consistent (infinitely many solutions), non-zero means inconsistent.
The system is consistent (with a unique solution) for every \( a \ne 0 \), since \( \det(A) = a \ne 0 \). If \( a = 0 \), the third equation reduces to \( 0 = 4 \), so the system is inconsistent. Thus the system is consistent precisely when \( a \ne 0 \).
A common mistake is to conclude the system is consistent simply because \( \det(A) = a \) can be non-zero, without separately checking the special value \( a = 0 \). Always test the case that makes the determinant zero.
The system is consistent (with a unique solution) for every \( a \ne 0 \), since \( \det(A) = a \ne 0 \). If \( a = 0 \), the third equation reduces to \( 0 = 4 \), so the system is inconsistent. Thus the system is consistent precisely when \( a \ne 0 \).
One common mistake: students sometimes factor \( a \) out of the third row before expanding and forget to multiply it back in, leading to an incorrect determinant value (e.g., writing \( \det(A) = 1 \) instead of \( \det(A) = a \)) and therefore drawing the wrong conclusion about consistency.
Answer: The system is consistent (with a unique solution) for every \( a \ne 0 \), since \( \det(A) = a \ne 0 \). If \( a = 0 \), the third equation reduces to \( 0 = 4 \), so the system is inconsistent. Thus the system is consistent precisely when \( a \ne 0 \).
Question: Examine the consistency of the following system of equations: \[2x + y - z = 3\] \[x - y + 2z = 1\] \[4x - y + 3z = k\] where \(k\) is a real number. Discuss consistency for \(k = 5\) and \(k = 7\).
Solution: Write the system as \(AX = B\) where \[A = \begin{bmatrix} 2 & 1 & -1 \\ 1 & -1 & 2 \\ 4 & -1 & 3 \end{bmatrix}, \quad X = \begin{bmatrix} x \\ y \\ z \end{bmatrix}, \quad B = \begin{bmatrix} 3 \\ 1 \\ k \end{bmatrix}\] Step 1: Compute \(\det(A)\). Expanding along the first row: \[\det(A) = 2\begin{vmatrix} -1 & 2 \\ -1 & 3 \end{vmatrix} - 1\begin{vmatrix} 1 & 2 \\ 4 & 3 \end{vmatrix} + (-1)\begin{vmatrix} 1 & -1 \\ 4 & -1 \end{vmatrix}\] Computing the 2×2 determinants: \[\begin{vmatrix} -1 & 2 \\ -1 & 3 \end{vmatrix} = (-1)(3) - (2)(-1) = -3 + 2 = -1\] \[\begin{vmatrix} 1 & 2 \\ 4 & 3 \end{vmatrix} = (1)(3) - (2)(4) = 3 - 8 = -5\] \[\begin{vmatrix} 1 & -1 \\ 4 & -1 \end{vmatrix} = (1)(-1) - (-1)(4) = -1 + 4 = 3\] Therefore: \[\det(A) = 2(-1) - 1(-5) + (-1)(3) = -2 + 5 - 3 = 0\] Since \(\det(A) = 0\), we must examine \((\text{adj}\,A)\,B\). Step 2: Find \(\text{adj}\,A\) by computing all cofactors. Cofactor \(C_{11}\): \[C_{11} = (+1)\begin{vmatrix} -1 & 2 \\ -1 & 3 \end{vmatrix} = (-3 + 2) = -1\] Cofactor \(C_{12}\): \[C_{12} = (-1)\begin{vmatrix} 1 & 2 \\ 4 & 3 \end{vmatrix} = (-1)(3 - 8) = 5\] Cofactor \(C_{13}\): \[C_{13} = (+1)\begin{vmatrix} 1 & -1 \\ 4 & -1 \end{vmatrix} = (-1 + 4) = 3\] Cofactor \(C_{21}\): \[C_{21} = (-1)\begin{vmatrix} 1 & -1 \\ -1 & 3 \end{vmatrix} = (-1)(3 - 1) = -2\] Cofactor \(C_{22}\): \[C_{22} = (+1)\begin{vmatrix} 2 & -1 \\ 4 & 3 \end{vmatrix} = (6 + 4) = 10\] Cofactor \(C_{23}\): \[C_{23} = (-1)\begin{vmatrix} 2 & 1 \\ 4 & -1 \end{vmatrix} = (-1)(-2 - 4) = 6\] Cofactor \(C_{31}\): \[C_{31} = (+1)\begin{vmatrix} 1 & -1 \\ -1 & 2 \end{vmatrix} = (2 - 1) = 1\] Cofactor \(C_{32}\): \[C_{32} = (-1)\begin{vmatrix} 2 & -1 \\ 1 & 2 \end{vmatrix} = (-1)(4 + 1) = -5\] Cofactor \(C_{33}\): \[C_{33} = (+1)\begin{vmatrix} 2 & 1 \\ 1 & -1 \end{vmatrix} = (-2 - 1) = -3\] The adjoint is the transpose of the cofactor matrix: \[\text{adj}\,A = \begin{bmatrix} -1 & -2 & 1 \\ 5 & 10 & -5 \\ 3 & 6 & -3 \end{bmatrix}\] Step 3: Compute \((\text{adj}\,A)\,B\). \[(\text{adj}\,A)\,B = \begin{bmatrix} -1 & -2 & 1 \\ 5 & 10 & -5 \\ 3 & 6 & -3 \end{bmatrix} \begin{bmatrix} 3 \\ 1 \\ k \end{bmatrix}\] Row 1: \((-1)(3) + (-2)(1) + (1)(k) = -3 - 2 + k = k - 5\) Row 2: \((5)(3) + (10)(1) + (-5)(k) = 15 + 10 - 5k = 25 - 5k = 5(5 - k)\) Row 3: \((3)(3) + (6)(1) + (-3)(k) = 9 + 6 - 3k = 15 - 3k = 3(5 - k)\) So: \[(\text{adj}\,A)\,B = \begin{bmatrix} k - 5 \\ 5(5-k) \\ 3(5-k) \end{bmatrix}\] Case 1: \(k = 5\) \[(\text{adj}\,A)\,B = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix} = O\] Since \(\det(A) = 0\) and \((\text{adj}\,A)B = O\), the system is consistent with infinitely many solutions. Case 2: \(k = 7\) \[(\text{adj}\,A)\,B = \begin{bmatrix} 2 \\ -10 \\ -6 \end{bmatrix} \ne O\] Since \(\det(A) = 0\) and \((\text{adj}\,A)B \ne O\), the system is inconsistent.
Answer: For \(k = 5\): the system is consistent (infinitely many solutions). For \(k = 7\): the system is inconsistent (no solution).
Question: Examine the consistency of the following system of equations: \[x + 2y + 3z = 6\] \[2x + 4y + 6z = 12\] \[3x + 6y + 9z = 18\]
Solution: Write the system as \(AX = B\) where \[A = \begin{bmatrix} 1 & 2 & 3 \\ 2 & 4 & 6 \\ 3 & 6 & 9 \end{bmatrix}, \quad X = \begin{bmatrix} x \\ y \\ z \end{bmatrix}, \quad B = \begin{bmatrix} 6 \\ 12 \\ 18 \end{bmatrix}\] Step 1: Observe that each row of \(A\) is a multiple of \((1,\, 2,\, 3)\). Specifically, Row 2 \(= 2 \times\) Row 1 and Row 3 \(= 3 \times\) Row 1. Hence the rows are linearly dependent. Step 2: Compute \(\det(A)\). Expanding along the first row: \[\det(A) = 1\begin{vmatrix} 4 & 6 \\ 6 & 9 \end{vmatrix} - 2\begin{vmatrix} 2 & 6 \\ 3 & 9 \end{vmatrix} + 3\begin{vmatrix} 2 & 4 \\ 3 & 6 \end{vmatrix}\] Computing the 2×2 determinants: \[\begin{vmatrix} 4 & 6 \\ 6 & 9 \end{vmatrix} = 36 - 36 = 0\] \[\begin{vmatrix} 2 & 6 \\ 3 & 9 \end{vmatrix} = 18 - 18 = 0\] \[\begin{vmatrix} 2 & 4 \\ 3 & 6 \end{vmatrix} = 12 - 12 = 0\] Therefore: \[\det(A) = 1(0) - 2(0) + 3(0) = 0\] Since \(\det(A) = 0\), we must compute \((\text{adj}\,A)\,B\). Step 3: Compute the cofactors of \(A\). Since every \(2 \times 2\) minor of \(A\) is zero (all rows are proportional), every cofactor is 0. Hence: \[\text{adj}\,A = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}\] Step 4: Compute \((\text{adj}\,A)\,B\). \[(\text{adj}\,A)\,B = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix}\begin{bmatrix} 6 \\ 12 \\ 18 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix} = O\] Since \(\det(A) = 0\) and \((\text{adj}\,A)B = O\), the system is consistent with infinitely many solutions. Step 5: Verify directly. Dividing each equation by the respective multiplier, all three equations reduce to: \[x + 2y + 3z = 6\] This is a single equation in three unknowns, confirming infinitely many solutions exist (e.g., \(x = 6 - 2t - 3s\) for free parameters \(t, s\)).
Answer: The system is consistent with infinitely many solutions (all three equations are equivalent to \(x + 2y + 3z = 6\)).
Question: Examine the consistency of the following system of equations, where \(k\) is a real constant: \[x + 2y + z = 3\] \[2x + 3y + z = 5\] \[kx + ky + 2kz = 6\]
Answer: The system is consistent with a unique solution for every \(k \ne 0\), since \(\det(A) = -2k \ne 0\). When \(k = 0\), the third equation becomes \(0 = 6\), so the system is inconsistent. Thus the system is consistent precisely when \(k \ne 0\).