SOLVER7 Study. Nothing Else.
Exercise 4.5 Q4

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

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Consistency of a Linear System Using Determinants

Detailed Explanation

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.

Formula Used

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.

Solution

  1. Step 1: Write the system in matrix form \( AX = B \). Here \[A = \begin{bmatrix} 1 & 1 & 1 \\ 2 & 3 & 2 \\ a & a & 2a \end{bmatrix}, \quad X = \begin{bmatrix} x \\ y \\ z \end{bmatrix}, \quad B = \begin{bmatrix} 1 \\ 2 \\ 4 \end{bmatrix}.\]
  2. Step 2: Compute the determinant of \( A \) by expanding along the first row: \[\det(A) = 1\begin{vmatrix} 3 & 2 \\ a & 2a \end{vmatrix} - 1\begin{vmatrix} 2 & 2 \\ a & 2a \end{vmatrix} + 1\begin{vmatrix} 2 & 3 \\ a & a \end{vmatrix}.\]
  3. Step 3: Evaluate each 2x2 determinant: \[\begin{vmatrix} 3 & 2 \\ a & 2a \end{vmatrix} = 6a - 2a = 4a,\] \[\begin{vmatrix} 2 & 2 \\ a & 2a \end{vmatrix} = 4a - 2a = 2a,\] \[\begin{vmatrix} 2 & 3 \\ a & a \end{vmatrix} = 2a - 3a = -a.\]
  4. Step 4: Substitute back: \[\det(A) = 1(4a) - 1(2a) + 1(-a) = 4a - 2a - a = a.\] So \( \det(A) = a \).
  5. Step 5: Case 1: If \( a \ne 0 \), then \( \det(A) = a \ne 0 \). The matrix \( A \) is invertible, so the system has a unique solution and is therefore consistent.
  6. Step 6: Case 2: If \( a = 0 \), the third equation becomes \( 0 \cdot x + 0 \cdot y + 0 \cdot z = 4 \), that is \[0 = 4,\] which is impossible. Hence when \( a = 0 \) the system is inconsistent (no solution).

Final 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 \).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the coefficient matrix \( A \), variable column \( X \), and constant column \( B \) from the given system. Writing the system in the form \( AX = B \) gives \[A = \begin{bmatrix} 1 & 1 & 1 \\ 2 & 3 & 2 \\ a & a & 2a \end{bmatrix}, \quad X = \begin{bmatrix} x \\ y \\ z \end{bmatrix}, \quad B = \begin{bmatrix} 1 \\ 2 \\ 4 \end{bmatrix}.\] — Reason: Expressing the system in matrix form lets us apply determinant-based consistency tests systematically.
  2. Step 2: Set up the determinant expansion of \( A \) along the first row: \[\det(A) = 1 \cdot \begin{vmatrix} 3 & 2 \\ a & 2a \end{vmatrix} - 1 \cdot \begin{vmatrix} 2 & 2 \\ a & 2a \end{vmatrix} + 1 \cdot \begin{vmatrix} 2 & 3 \\ a & a \end{vmatrix}.\] — Reason: Expanding along the first row is efficient here because all three entries in that row are 1, keeping the arithmetic simple.
  3. Step 3: Evaluate each 2×2 minor separately. For the first minor: \[\begin{vmatrix} 3 & 2 \\ a & 2a \end{vmatrix} = 3(2a) - 2(a) = 6a - 2a = 4a.\] For the second minor: \[\begin{vmatrix} 2 & 2 \\ a & 2a \end{vmatrix} = 2(2a) - 2(a) = 4a - 2a = 2a.\] For the third minor: \[\begin{vmatrix} 2 & 3 \\ a & a \end{vmatrix} = 2(a) - 3(a) = 2a - 3a = -a.\] — Reason: Computing each 2×2 determinant individually avoids sign errors before combining the results.
  4. Step 4: Combine the three minor values to get \( \det(A) \): \[\det(A) = 1(4a) - 1(2a) + 1(-a) = 4a - 2a - a = a.\] — Reason: Substituting back into the cofactor expansion gives us the determinant as a simple expression in \( a \), which we can now analyse by cases.
  5. Step 5: Analyse the case \( a \ne 0 \). When \( a \ne 0 \), we have \( \det(A) = a \ne 0 \), so \( A \) is invertible and the system has a unique solution. — Reason: A non-zero determinant guarantees invertibility, which directly implies a unique solution exists, making the system consistent.
  6. Step 6: Analyse the case \( a = 0 \). Substituting \( a = 0 \) into the original third equation (which had the form \( ax + ay + 2az = 4 \)) gives \( 0 \cdot x + 0 \cdot y + 0 \cdot z = 4 \), i.e., \( 0 = 4 \), which is a contradiction. — Reason: When all coefficients in a row vanish but the right-hand side is non-zero, that equation can never be satisfied, so the entire system has no solution and is inconsistent.

Final 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 \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Write \( AX = B \): \[A = \begin{bmatrix} 1 & 1 & 1 \\ 2 & 3 & 2 \\ a & a & 2a \end{bmatrix}, \quad X = \begin{bmatrix} x \\ y \\ z \end{bmatrix}, \quad B = \begin{bmatrix} 1 \\ 2 \\ 4 \end{bmatrix}\]
  2. Step 2: Expand \( \det(A) \) along row 1: \[\det(A) = 1\begin{vmatrix} 3 & 2 \\ a & 2a \end{vmatrix} - 1\begin{vmatrix} 2 & 2 \\ a & 2a \end{vmatrix} + 1\begin{vmatrix} 2 & 3 \\ a & a \end{vmatrix}\] \[= (6a - 2a) - (4a - 2a) + (2a - 3a) = 4a - 2a - a = a\]
  3. Step 3: For \( a \ne 0 \): \( \det(A) = a \ne 0 \), so the system is consistent with a unique solution. For \( a = 0 \): row 3 of the augmented matrix gives \( 0 = 4 \), which is a contradiction, so the system is inconsistent.

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 \).

➕ More Examples

More Examples

Example 1

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).

Example 2

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\)).

🎯 Try a Similar Question

Try a Similar Question

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\]

Solution

  1. Step 1: Write the coefficient matrix and compute its determinant: The coefficient matrix is \[A = \begin{bmatrix} 1 & 2 & 1 \\ 2 & 3 & 1 \\ k & k & 2k \end{bmatrix}\] Expanding along the first row: \[\det(A) = 1\cdot\begin{vmatrix} 3 & 1 \\ k & 2k \end{vmatrix} - 2\cdot\begin{vmatrix} 2 & 1 \\ k & 2k \end{vmatrix} + 1\cdot\begin{vmatrix} 2 & 3 \\ k & k \end{vmatrix}\]
  2. Step 2: Evaluate each 2×2 determinant: First minor: \(3(2k) - 1(k) = 6k - k = 5k\) Second minor: \(2(2k) - 1(k) = 4k - k = 3k\) Third minor: \(2(k) - 3(k) = 2k - 3k = -k\)
  3. Step 3: Substitute back to get det(A): \[\det(A) = 1(5k) - 2(3k) + 1(-k) = 5k - 6k - k = -2k\]
  4. Step 4: Case 1 — when k ≠ 0: If \(k \ne 0\), then \(\det(A) = -2k \ne 0\), so the matrix \(A\) is invertible and the system has a unique solution. The system is consistent.
  5. Step 5: Case 2 — when k = 0: If \(k = 0\), the third equation becomes \(0 \cdot x + 0 \cdot y + 0 \cdot z = 6\), i.e. \(0 = 6\), which is a contradiction. Therefore the system is inconsistent when \(k = 0\).
  6. Step 6: Conclusion: The system is consistent (with a unique solution) if and only if \(k \ne 0\). When \(k = 0\) the system is inconsistent.

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\).

Everything you get with Solver7

More questions in Determinants