Exercise 4.5 · Q4: Consistency of a system containing a constant
Examine the consistency of the system of equations.
The system is , where
Expanding along :
If , then . So exists and the system has a unique solution, . The system is consistent.
If , then and
Cofactors (the minors of the first two rows contain the zero row):
So for , and : the system is inconsistent.
The system is consistent for every and inconsistent for .
The answer key prints "Consistent". That is correct for every ; the question does not rule out , for which the system is inconsistent.
Want the reason behind every step, the basics and the checks?
The third equation contains a constant whose value is not given, so the answer may depend on . The determinant of the coefficient matrix works out to exactly . So for every the matrix is non-singular and the system has exactly one solution: consistent. For the third equation becomes , that is : inconsistent. The textbook's answer, "Consistent", is right for every . The question does not rule out , so a complete answer states both cases.
- Given
- Three linear equations in ; the third has coefficients , , , where is a real constant.
- To find
- Whether the system is consistent, for each possible value of .
- Plan
- Write and expand . Part (i), : conclude consistent, then find the solution through and check it. Part (ii), : compute and conclude, then confirm from the equations.
Basics you need
For with square: if , there is a unique solution . If and , there is no solution. If and , the system may or may not be consistent. Basics: when a system has one, none or many solutions
Along row 1,
and the signs of the cofactors follow
; is the transpose of the matrix of cofactors, and when . Basics: why the inverse divides by |A|
Collect like terms such as , and remember only makes sense for . Basics: algebra the chapter leans on
Solution
Write the system as
is and is , so is , and row by row
which is the left side of the system. So is the given system.
Each row of lists the coefficients of one equation in the order . The letter is simply part of the coefficients of the third equation; it is a fixed number, not a fourth unknown.Expand 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:
The three determinants:
Signed sum, with the pattern :
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 , and that is the key to the whole question.Expansion along , Section 4.2.3. Lesson: expanding a 3 × 3 determinantTwo cases
Since :
- if , then : unique solution, the system is consistent (Part (i) below);
- if , then : we must compute (Part (ii) below).
The question gives no value for , so we cannot just say "consistent" or "inconsistent" without looking at every possible value. Only one value, , 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
Consistent
For , , so is non-singular, exists (Theorem 4), and is the unique solution (Section 4.6.1, Case I). So for every the system is consistent.
This already answers the question for . The next steps find the solution itself, which confirms the conclusion and shows how it depends on .All nine cofactors
Delete row and column to get the minor, then attach the sign . These formulas hold for every value of :
Check: row 1 times its own cofactors gives
and have the same minor. Deleting row 2 leaves rows 1 and 3, and in those rows columns 1 and 2 of are identical (1 above ). So deleting column 1 or deleting column 2 leaves the same block, with rows and . Only the sign differs. The check against confirms the first row of cofactors.Definitions 1 and 2, Section 4.4. Lesson: minors and cofactors, and
Transpose the matrix of cofactors (cofactors of row go down column ):
Check with Theorem 1, row of times column of :
So . ✓ Hence .
The first column of is the first row of cofactors, , and so on. The product check is the strongest test available: all nine entries must match , so a wrong sign anywhere would show.Definition 3 and Theorem 1, Section 4.5.1. Lesson: the adjointThe solution
First , a times a , so a column:
Then divide by (allowed, as ):
, so computing first keeps the fractions to the last line. The answer depends on , as it must: changing changes the third equation.Row times column, then the scalar . Basics: matrix facts the chapter usesCheck in all three equations
In each line the terms with cancel, leaving the right-hand side 1, 2, 4. In the third line, and . The check works for every at once.
Part (ii): the case
, so compute
With , , so is singular and Case II of Section 4.6.1 applies. The cofactor formulas of Part (i), Step 2 hold for every , so put in them:
So for the system is inconsistent.
The reason for the rule: if some satisfied , then , which equals by Theorem 1. Here has non-zero entries, so no solution can exist.Section 4.6.1, Case II, and Theorem 1. Lesson: solving systems AX = BSee it directly
With the third equation reads . The left side is 0 for every , and , 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 .
. For every the system is consistent, with the unique solution
For the system is inconsistent. (Textbook answer: Consistent. That is correct for every , 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 , so that case is given too.)
Pick values of and test the formula in the original equations.
| Equation 1 | Equation 2 | Equation 3 | ||
|---|---|---|---|---|
All nine checks hold.
- Treating as an unknown. is a constant in the coefficients; the unknowns are only.
- Leaving out the condition on . "Consistent" is true for every , but at the third equation is . A full answer names both cases.
- Losing the minus sign of the middle term in the row 1 expansion; then comes out instead of .
- Dividing by without saying . The formulas and do not exist at , which is exactly the inconsistent case.
- When a system contains a constant, find the values that make ; they are the only ones needing extra work.
- Cofactors computed with a letter remain valid for every value of the letter, so they can be reused in the special case.
- For , proves there is no solution.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Consistent and inconsistent systems | Parts (i), (ii) | Section 4.6 (Lesson: solving systems AX = B) |
| Expansion of a determinant along a row | Solution, Step 2 | Section 4.2.3 |
| ; row times its cofactors | Part (i), Step 2 | Definitions 1, 2, Section 4.4 |
| = transpose of the matrix of cofactors | Part (i), Step 3 | Definition 3, Section 4.5.1 |
| Part (i), Step 3; Part (ii), Step 1 | Theorem 1, Section 4.5.1 | |
| Part (i), Steps 1, 3 | Theorem 4, Section 4.5 | |
| Cases I and II for | Solution, Step 3; Parts (i), (ii) | Section 4.6.1 |
| The chapter restricts itself to systems with unique solutions | Result | Note in Section 4.6 |
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 →