Class 12 Maths, Worked in Full Past papersGet updates
Chapter 4 · Determinants

Exercise 4.5 · Q4: Consistency of a 3×33\times3 system containing a constant aa

Exercise 4.5Solving systems AX = B · Section 4.6
The question

Examine the consistency of the system of equations.

x+y+z=12x+3y+2z=2ax+ay+2az=4\begin{aligned} x+y+z&=1\\ 2x+3y+2z&=2\\ ax+ay+2az&=4 \end{aligned}
Exam answer

The system is AX=BAX = B⁠, where

A=[111232aa2a],X=[xyz], B=[124]\begin{aligned} A &= \begin{bmatrix} 1 & 1 & 1 \\ 2 & 3 & 2 \\ a & a & 2a \end{bmatrix}, \\ X &= \begin{bmatrix} x \\ y \\ z \end{bmatrix},\ B = \begin{bmatrix} 1 \\ 2 \\ 4 \end{bmatrix} \end{aligned}

Expanding along R1R_1⁠:

∣A∣=1∣32a2a∣−1∣22a2a∣+1∣23aa∣=1(4a)−1(2a)+1(−a)=a\begin{aligned} |A| &= 1\begin{vmatrix} 3 & 2 \\ a & 2a \end{vmatrix} - 1\begin{vmatrix} 2 & 2 \\ a & 2a \end{vmatrix} \\ &\quad + 1\begin{vmatrix} 2 & 3 \\ a & a \end{vmatrix} \\ &= 1(4a) - 1(2a) + 1(-a) \\ &= a \end{aligned}

If a≠0a \ne 0⁠, then ∣A∣=a≠0|A| = a \ne 0⁠. So A−1A^{-1} exists and the system has a unique solution, X=A−1BX = A^{-1}B⁠. The system is consistent.

If a=0a = 0⁠, then ∣A∣=0|A| = 0 and

A=[111232000]A = \begin{bmatrix} 1 & 1 & 1 \\ 2 & 3 & 2 \\ 0 & 0 & 0 \end{bmatrix}

Cofactors (the minors of the first two rows contain the zero row):

A11=A12=A13=0A21=A22=A23=0\begin{aligned} A_{11} &= A_{12} = A_{13} = 0 \\ A_{21} &= A_{22} = A_{23} = 0 \end{aligned} A31=∣1132∣=−1A32=−∣1122∣=0A33=∣1123∣=1\begin{aligned} A_{31} &= \begin{vmatrix} 1 & 1 \\ 3 & 2 \end{vmatrix} = -1 \\ A_{32} &= -\begin{vmatrix} 1 & 1 \\ 2 & 2 \end{vmatrix} = 0 \\ A_{33} &= \begin{vmatrix} 1 & 1 \\ 2 & 3 \end{vmatrix} = 1 \end{aligned} adj⁡A=[00−1000001]\operatorname{adj}A = \begin{bmatrix} 0 & 0 & -1 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix} (adj⁡A)B=[00−1000001][124]=[0+0−40+0+00+0+4]=[−404]≠O\begin{aligned} (\operatorname{adj}A)B &= \begin{bmatrix} 0 & 0 & -1 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{bmatrix}\begin{bmatrix} 1 \\ 2 \\ 4 \end{bmatrix} \\ &= \begin{bmatrix} 0 + 0 - 4 \\ 0 + 0 + 0 \\ 0 + 0 + 4 \end{bmatrix} \\ &= \begin{bmatrix} -4 \\ 0 \\ 4 \end{bmatrix} \ne O \end{aligned}

So for a=0a = 0⁠, ∣A∣=0|A| = 0 and (adj⁡A)B≠O(\operatorname{adj}A)B \ne O⁠: the system is inconsistent.

∴\therefore The system is consistent for every a≠0a \ne 0 and inconsistent for a=0a = 0⁠.

The answer key prints "Consistent". That is correct for every a≠0a \ne 0⁠; the question does not rule out a=0a = 0⁠, for which the system is inconsistent.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

The third equation contains a constant aa whose value is not given, so the answer may depend on aa⁠. The determinant of the coefficient matrix works out to exactly ∣A∣=a|A| = a⁠. So for every a≠0a \ne 0 the matrix is non-singular and the system has exactly one solution: consistent. For a=0a = 0 the third equation becomes 0x+0y+0z=40x + 0y + 0z = 4⁠, that is 0=40 = 4⁠: inconsistent. The textbook's answer, "Consistent", is right for every a≠0a \ne 0⁠. The question does not rule out a=0a = 0⁠, so a complete answer states both cases.

Given, to find, and the plan
Given
Three linear equations in x,y,zx, y, z⁠; the third has coefficients aa⁠, aa⁠, 2a2a⁠, where aa is a real constant.
To find
Whether the system is consistent, for each possible value of aa⁠.
Plan
Write AX=BAX = B and expand ∣A∣|A|⁠. Part (i), a≠0a \ne 0⁠: conclude consistent, then find the solution through adj⁡A\operatorname{adj}A and check it. Part (ii), a=0a = 0⁠: compute (adj⁡A)B(\operatorname{adj}A)B and conclude, then confirm from the equations.

Basics you need

1The rule of Section 4.6.1

For AX=BAX = B with AA square: if ∣A∣≠0|A| \ne 0⁠, there is a unique solution X=A−1BX = A^{-1}B⁠. If ∣A∣=0|A| = 0 and (adj⁡A)B≠O(\operatorname{adj}A)B \ne O⁠, there is no solution. If ∣A∣=0|A| = 0 and (adj⁡A)B=O(\operatorname{adj}A)B = O⁠, the system may or may not be consistent. Basics: when a system has one, none or many solutions

2Expanding a 3×33\times3 determinant

Along row 1,

∣A∣=a11A11+a12A12+a13A13,\begin{aligned} |A|&=a_{11}A_{11}+a_{12}A_{12}\\ &\quad+a_{13}A_{13}, \end{aligned}

and the signs (−1)i+j(-1)^{i+j} of the cofactors follow

+−+−+−+−+\begin{matrix}+&-&+\\-&+&-\\+&-&+\end{matrix}

Basics: the + − + sign pattern

3Cofactors and the adjoint

Aij=(−1)i+jMijA_{ij} = (-1)^{i+j}M_{ij}⁠; adj⁡A\operatorname{adj}A is the transpose of the matrix of cofactors, and A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj}A when ∣A∣≠0|A| \ne 0⁠. Basics: why the inverse divides by |A|

4Algebra with a letter

Collect like terms such as 6a−2a=4a6a - 2a = 4a⁠, and remember 2a−4a=2−4a\frac{2a - 4}{a} = 2 - \frac4a only makes sense for a≠0a \ne 0⁠. Basics: algebra the chapter leans on

Solution

  1. Write the system as AX=BAX = B

    A=[111232aa2a]X=[xyz],B=[124]\begin{gathered} A=\begin{bmatrix}1&1&1\\2&3&2\\a&a&2a\end{bmatrix}\\ X=\begin{bmatrix}x\\y\\z\end{bmatrix},\quad B=\begin{bmatrix}1\\2\\4\end{bmatrix} \end{gathered}

    AA is 3×33\times3 and XX is 3×13\times1⁠, so AXAX is 3×13\times1⁠, and row by row

    AX=[x+y+z2x+3y+2zax+ay+2az],AX=\begin{bmatrix}x+y+z\\2x+3y+2z\\ax+ay+2az\end{bmatrix},

    which is the left side of the system. So AX=BAX = B is the given system.

    Each row of AA lists the coefficients of one equation in the order x,y,zx, y, z⁠. The letter aa is simply part of the coefficients of the third equation; it is a fixed number, not a fourth unknown.
  2. Expand ∣A∣|A| along row 1

    No row or column contains a zero, so no expansion is shorter than another. Row 1 is the convenient choice because its entries are all 1, so each minor is multiplied by just 1:

    ∣A∣=1∣32a2a∣−1∣22a2a∣+1∣23aa∣\begin{aligned} |A|&=1\begin{vmatrix}3&2\\a&2a\end{vmatrix}-1\begin{vmatrix}2&2\\a&2a\end{vmatrix}\\ &\quad+1\begin{vmatrix}2&3\\a&a\end{vmatrix} \end{aligned}

    The three 2×22\times2 determinants:

    ∣32a2a∣=3(2a)−a(2)=4a∣22a2a∣=2(2a)−a(2)=2a∣23aa∣=2(a)−a(3)=−a\begin{aligned} \begin{vmatrix}3&2\\a&2a\end{vmatrix}&=3(2a)-a(2)=4a\\ \begin{vmatrix}2&2\\a&2a\end{vmatrix}&=2(2a)-a(2)=2a\\ \begin{vmatrix}2&3\\a&a\end{vmatrix}&=2(a)-a(3)=-a \end{aligned}

    Signed sum, with the pattern + − ++\,-\,+⁠:

    ∣A∣=1(4a)−1(2a)+1(−a)=4a−2a−a=a\begin{aligned} |A|&=1(4a)-1(2a)+1(-a)\\ &=4a-2a-a=a \end{aligned}
    Each minor comes from deleting row 1 and the column of the entry being used: column 1 for the first, column 2 for the second, column 3 for the third. The middle term carries a minus sign from the pattern. Everything collapses to the single letter aa⁠, and that is the key to the whole question.
    Expansion along R1R_1⁠, Section 4.2.3. Lesson: expanding a 3 × 3 determinant
  3. Two cases

    Since ∣A∣=a|A| = a⁠:

    • if a≠0a \ne 0⁠, then ∣A∣≠0|A| \ne 0⁠: unique solution, the system is consistent (Part (i) below);
    • if a=0a = 0⁠, then ∣A∣=0|A| = 0⁠: we must compute (adj⁡A)B(\operatorname{adj}A)B (Part (ii) below).
    The question gives no value for aa⁠, so we cannot just say "consistent" or "inconsistent" without looking at every possible value. Only one value, a=0a = 0⁠, makes the determinant vanish, so there are exactly two cases.
    Section 4.6.1, Cases I and II. Lesson: solving systems AX = B

Part (i): the case a≠0a \ne 0

  1. Consistent

    For a≠0a \ne 0⁠, ∣A∣=a≠0|A| = a \ne 0⁠, so AA is non-singular, A−1A^{-1} exists (Theorem 4), and X=A−1BX = A^{-1}B is the unique solution (Section 4.6.1, Case I). So for every a≠0a \ne 0 the system is consistent.

    This already answers the question for a≠0a \ne 0⁠. The next steps find the solution itself, which confirms the conclusion and shows how it depends on aa⁠.
  2. All nine cofactors

    Delete row ii and column jj to get the minor, then attach the sign (−1)i+j(-1)^{i+j}⁠. These formulas hold for every value of aa⁠:

    A11=(−1)1+1∣32a2a∣=6a−2a=4aA12=(−1)1+2∣22a2a∣=−(4a−2a)=−2aA13=(−1)1+3∣23aa∣=2a−3a=−aA21=(−1)2+1∣11a2a∣=−(2a−a)=−aA22=(−1)2+2∣11a2a∣=2a−a=aA23=(−1)2+3∣11aa∣=−(a−a)=0A31=(−1)3+1∣1132∣=2−3=−1A32=(−1)3+2∣1122∣=−(2−2)=0A33=(−1)3+3∣1123∣=3−2=1\begin{aligned} A_{11}&=(-1)^{1+1}\begin{vmatrix}3&2\\a&2a\end{vmatrix}\\ &=6a-2a=4a\\ A_{12}&=(-1)^{1+2}\begin{vmatrix}2&2\\a&2a\end{vmatrix}\\ &=-(4a-2a)=-2a\\ A_{13}&=(-1)^{1+3}\begin{vmatrix}2&3\\a&a\end{vmatrix}\\ &=2a-3a=-a\\ A_{21}&=(-1)^{2+1}\begin{vmatrix}1&1\\a&2a\end{vmatrix}\\ &=-(2a-a)=-a\\ A_{22}&=(-1)^{2+2}\begin{vmatrix}1&1\\a&2a\end{vmatrix}\\ &=2a-a=a\\ A_{23}&=(-1)^{2+3}\begin{vmatrix}1&1\\a&a\end{vmatrix}\\ &=-(a-a)=0\\ A_{31}&=(-1)^{3+1}\begin{vmatrix}1&1\\3&2\end{vmatrix}\\ &=2-3=-1\\ A_{32}&=(-1)^{3+2}\begin{vmatrix}1&1\\2&2\end{vmatrix}\\ &=-(2-2)=0\\ A_{33}&=(-1)^{3+3}\begin{vmatrix}1&1\\2&3\end{vmatrix}\\ &=3-2=1 \end{aligned}

    Check: row 1 times its own cofactors gives

    1(4a)+1(−2a)+1(−a)=a=∣A∣. ✓1(4a)+1(-2a)+1(-a)=a=|A|.\ \checkmark
    A21A_{21} and A22A_{22} have the same minor. Deleting row 2 leaves rows 1 and 3, and in those rows columns 1 and 2 of AA are identical (1 above aa⁠). So deleting column 1 or deleting column 2 leaves the same block, with rows (1,1)(1, 1) and (a,2a)(a, 2a)⁠. Only the sign differs. The check against ∣A∣|A| confirms the first row of cofactors.
    Definitions 1 and 2, Section 4.4. Lesson: minors and cofactors
  3. adj⁡A\operatorname{adj}A⁠, and A(adj⁡A)=∣A∣IA(\operatorname{adj}A) = |A|I

    Transpose the matrix of cofactors (cofactors of row ii go down column ii⁠):

    adj⁡A=[4a−a−1−2aa0−a01]\operatorname{adj}A=\begin{bmatrix}4a&-a&-1\\-2a&a&0\\-a&0&1\end{bmatrix}

    Check with Theorem 1, row of AA times column of adj⁡A\operatorname{adj}A⁠:

    (1,1): 4a−2a−a=a(1,2): −a+a+0=0(1,3): −1+0+1=0(2,1): 2(4a)+3(−2a)+2(−a)=0(2,2): 2(−a)+3(a)+2(0)=a(2,3): 2(−1)+3(0)+2(1)=0(3,1): a(4a)+a(−2a)+2a(−a)=0(3,2): a(−a)+a(a)+2a(0)=0(3,3): a(−1)+a(0)+2a(1)=a\begin{aligned} (1,1)&:\ 4a-2a-a=a\\ (1,2)&:\ -a+a+0=0\\ (1,3)&:\ -1+0+1=0\\ (2,1)&:\ 2(4a)+3(-2a)+2(-a)=0\\ (2,2)&:\ 2(-a)+3(a)+2(0)=a\\ (2,3)&:\ 2(-1)+3(0)+2(1)=0\\ (3,1)&:\ a(4a)+a(-2a)+2a(-a)=0\\ (3,2)&:\ a(-a)+a(a)+2a(0)=0\\ (3,3)&:\ a(-1)+a(0)+2a(1)=a \end{aligned}

    So A(adj⁡A)=aI=∣A∣IA(\operatorname{adj}A) = aI = |A|I⁠. ✓ Hence A−1=1aadj⁡AA^{-1} = \frac1a\operatorname{adj}A⁠.

    The first column of adj⁡A\operatorname{adj}A is the first row of cofactors, 4a,−2a,−a4a, -2a, -a⁠, and so on. The product check is the strongest test available: all nine entries must match ∣A∣I|A|I⁠, so a wrong sign anywhere would show.
    Definition 3 and Theorem 1, Section 4.5.1. Lesson: the adjoint
  4. The solution X=A−1BX = A^{-1}B

    First (adj⁡A)B(\operatorname{adj}A)B⁠, a 3×33\times3 times a 3×13\times1⁠, so a 3×13\times1 column:

    [4a(1)+(−a)(2)+(−1)(4)−2a(1)+a(2)+0(4)−a(1)+0(2)+1(4)]=[2a−404−a]\begin{aligned} &\begin{bmatrix}4a(1)+(-a)(2)+(-1)(4)\\-2a(1)+a(2)+0(4)\\-a(1)+0(2)+1(4)\end{bmatrix}\\ &=\begin{bmatrix}2a-4\\0\\4-a\end{bmatrix} \end{aligned}

    Then divide by ∣A∣=a|A| = a (allowed, as a≠0a \ne 0⁠):

    x=2a−4a=2−4ay=0a=0z=4−aa=4a−1\begin{aligned} x&=\frac{2a-4}{a}=2-\frac{4}{a}\\ y&=\frac{0}{a}=0\\ z&=\frac{4-a}{a}=\frac{4}{a}-1 \end{aligned}
    X=A−1B=1a(adj⁡A)BX = A^{-1}B = \frac{1}{a}(\operatorname{adj}A)B⁠, so computing (adj⁡A)B(\operatorname{adj}A)B first keeps the fractions to the last line. The answer depends on aa⁠, as it must: changing aa changes the third equation.
    Row times column, then the scalar 1a\frac1a⁠. Basics: matrix facts the chapter uses
  5. Check in all three equations

    x+y+z=2−4a+0+4a−1=1 ✓2x+3y+2z=4−8a+0+8a−2=2 ✓ax+ay+2az=2a−4+0+8−2a=4 ✓\begin{aligned} x+y+z&=2-\tfrac{4}{a}+0+\tfrac{4}{a}-1\\ &=1\ \checkmark\\ 2x+3y+2z&=4-\tfrac{8}{a}+0+\tfrac{8}{a}-2\\ &=2\ \checkmark\\ ax+ay+2az&=2a-4+0+8-2a\\ &=4\ \checkmark \end{aligned}
    In each line the terms with aa cancel, leaving the right-hand side 1, 2, 4. In the third line, a⋅(2−4a)=2a−4a\cdot(2 - \frac4a) = 2a - 4 and 2a(4a−1)=8−2a2a(\frac4a - 1) = 8 - 2a⁠. The check works for every a≠0a \ne 0 at once.

Part (ii): the case a=0a = 0

  1. ∣A∣=0|A| = 0⁠, so compute (adj⁡A)B(\operatorname{adj}A)B

    With a=0a = 0⁠, ∣A∣=a=0|A| = a = 0⁠, so AA is singular and Case II of Section 4.6.1 applies. The cofactor formulas of Part (i), Step 2 hold for every aa⁠, so put a=0a = 0 in them:

    adj⁡A=[00−1000001]\operatorname{adj}A=\begin{bmatrix}0&0&-1\\0&0&0\\0&0&1\end{bmatrix} (adj⁡A)B=[0(1)+0(2)+(−1)(4)0(1)+0(2)+0(4)0(1)+0(2)+1(4)]=[−404]≠O\begin{aligned} (\operatorname{adj}A)B&=\begin{bmatrix}0(1)+0(2)+(-1)(4)\\0(1)+0(2)+0(4)\\0(1)+0(2)+1(4)\end{bmatrix}\\ &=\begin{bmatrix}-4\\0\\4\end{bmatrix}\ne O \end{aligned}

    So for a=0a = 0 the system is inconsistent.

    The reason for the rule: if some X0X_0 satisfied AX0=BAX_0 = B⁠, then (adj⁡A)B=(adj⁡A)AX0(\operatorname{adj}A)B = (\operatorname{adj}A)AX_0⁠, which equals ∣A∣X0=O|A|X_0 = O by Theorem 1. Here (adj⁡A)B(\operatorname{adj}A)B has non-zero entries, so no solution can exist.
    Section 4.6.1, Case II, and Theorem 1. Lesson: solving systems AX = B
  2. See it directly

    With a=0a = 0 the third equation reads 0x+0y+0z=40x + 0y + 0z = 4⁠. The left side is 0 for every x,y,zx, y, z⁠, and 0≠40 \ne 4⁠, so no triple satisfies it, and the whole system has no solution.

    This confirms the matrix test in the plainest possible way. It also shows why the one-word answer "Consistent" holds only with the condition a≠0a \ne 0⁠.
Result

∣A∣=a|A| = a⁠. For every a≠0a \ne 0 the system is consistent, with the unique solution

x=2−4a,y=0,z=4a−1.x=2-\frac{4}{a},\quad y=0,\quad z=\frac{4}{a}-1.

For a=0a = 0 the system is inconsistent. (Textbook answer: Consistent. That is correct for every a≠0a \ne 0⁠, the case that fits the Note in Section 4.6 restricting the chapter to systems with unique solutions. The question itself does not rule out a=0a = 0⁠, so that case is given too.)

Check it with numbers

Pick values of aa and test the formula in the original equations.

aa(x,y,z)(x, y, z)Equation 1Equation 2Equation 3
22(0,0,1)(0, 0, 1)0+0+1=10+0+1 = 10+0+2=20+0+2 = 20+0+4=40+0+4 = 4
44(1,0,0)(1, 0, 0)1+0+0=11+0+0 = 12+0+0=22+0+0 = 24+0+0=44+0+0 = 4
−1-1(6,0,−5)(6, 0, -5)6+0−5=16+0-5 = 112+0−10=212+0-10 = 2−6+0+10=4-6+0+10 = 4

All nine checks hold.

Common mistakes
  1. Treating aa as an unknown. aa is a constant in the coefficients; the unknowns are x,y,zx, y, z only.
  2. Leaving out the condition on aa⁠. "Consistent" is true for every a≠0a \ne 0⁠, but at a=0a = 0 the third equation is 0=40 = 4⁠. A full answer names both cases.
  3. Losing the minus sign of the middle term in the row 1 expansion; then ∣A∣|A| comes out 5a5a instead of aa⁠.
  4. Dividing by aa without saying a≠0a \ne 0⁠. The formulas 2−4a2 - \frac4a and 4a−1\frac4a - 1 do not exist at a=0a = 0⁠, which is exactly the inconsistent case.
What to take away
  1. When a system contains a constant, find the values that make ∣A∣=0|A| = 0⁠; they are the only ones needing extra work.
  2. Cofactors computed with a letter remain valid for every value of the letter, so they can be reused in the special case.
  3. For ∣A∣=0|A| = 0⁠, (adj⁡A)B≠O(\operatorname{adj}A)B \ne O proves there is no solution.

Every fact used, and where it comes from

FactUsed inSource
Consistent and inconsistent systemsParts (i), (ii)Section 4.6 (Lesson: solving systems AX = B)
Expansion of a 3×33\times3 determinant along a rowSolution, Step 2Section 4.2.3
Aij=(−1)i+jMijA_{ij} = (-1)^{i+j}M_{ij}⁠; ∣A∣=|A| = row times its cofactorsPart (i), Step 2Definitions 1, 2, Section 4.4
adj⁡A\operatorname{adj}A = transpose of the matrix of cofactorsPart (i), Step 3Definition 3, Section 4.5.1
A(adj⁡A)=(adj⁡A)A=∣A∣IA(\operatorname{adj}A) = (\operatorname{adj}A)A = |A|IPart (i), Step 3; Part (ii), Step 1Theorem 1, Section 4.5.1
∣A∣≠0|A| \ne 0 ⇒\Rightarrow A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj}APart (i), Steps 1, 3Theorem 4, Section 4.5
Cases I and II for AX=BAX = BSolution, Step 3; Parts (i), (ii)Section 4.6.1
The chapter restricts itself to systems with unique solutionsResultNote in Section 4.6
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →