Exercise 4.5 · Q1: Is , consistent?
Examine the consistency of the system of equations.
The system is , where
. So is non-singular, exists and the system has a unique solution, .
The system is consistent.
Want the reason behind every step, the basics and the checks?
A system is consistent when it has at least one solution. Write it as one matrix equation . If the coefficient matrix has , then exists and is a solution (in fact the only one), so the system is consistent. Here , so the answer is "consistent", and the solution itself is , : the two lines cross at the point .
- Given
- Two linear equations in the two unknowns and .
- To find
- Whether the system is consistent (has a solution) or inconsistent (has none).
- Plan
- (1) Write the system as . (2) Compute . (3) Since , conclude by Case I of Section 4.6.1. (4) Find the solution through the adjoint, and check it in both equations.
Basics you need
Section 4.6: a system is consistent if a solution (one or more) exists, and inconsistent if no solution exists. For two equations in , each equation is a line: lines that cross give one solution, parallel lines give none, the same line twice gives infinitely many. Basics: two lines, cross, parallel or the same
The coefficients form , the unknowns form the column , the right-hand sides form the column . Multiplying out row by column gives back the left-hand sides. Basics: matrix facts the chapter uses
If , then . For order 2, is found by swapping the two diagonal entries and changing the signs of the other two. Basics: why the inverse divides by |A|
Solution
Write the system as
Take the coefficients of and row by row, the unknowns as a column, and the right-hand sides as a column:
Orders: is and is , so is defined and is , the same order as . Row times column:
So says and : exactly the given system.
Two matrices are equal when their corresponding entries are equal, so the single equation holds precisely when both original equations hold. Multiplying out is the check that the coefficients sit in the right places (row 1 of belongs to the first equation, column 1 of to ).Compute
So : is non-singular.
The determinant decides which case of Section 4.6.1 we are in. A non-zero value, positive or negative, is all that matters; the minus sign does not make it "fail". It only matters later, because we divide by .Main diagonal product minus the other diagonal product. Lesson: determinant of a square matrixConclude: the system is consistent
Because , is invertible (Theorem 4, Section 4.5). Multiply on the left by :
So any solution must equal , and really is a solution, since . A solution exists and is unique, so the system is consistent.
"Consistent" only asks whether a solution exists. This is Case I of Section 4.6.1: a non-singular always gives exactly one solution, so no further test is needed. We still find the solution below, because it confirms the conclusion and is what the matrix method is for.Cofactors and
Cofactor , where the minor is what is left after deleting row and column . For a matrix each minor is a single entry, and the signs follow the pattern
is the transpose of the matrix of cofactors, so the cofactors of row go down column :
Deleting row 1 and column 1 leaves the entry 3; deleting row 1 and column 2 leaves 2 (the bottom-left entry); and so on. Here the matrix of cofactors happens to be symmetric, so transposing it changes nothing, but the transpose is still part of the definition. The quick rule agrees: swap the diagonal entries 1 and 3, change the signs of the two 2s.Definition 3, Section 4.5.1, and the Remark after Example 12 for order 2. Lesson: the adjoint, and a check that it is right
Check , entry by entry (row of times column of ):
So . ✓
Dividing by flips every sign of . Forgetting that sign is the most common slip, and the product check catches it at once: with the wrong sign the diagonal entries would come out .(Theorem 4). Basics: why the inverse divides by |A|The solution
So , .
is and is , so the product is : one entry for , one for . Each entry is a row of times the column .Row times column. Basics: matrix facts the chapter usesCheck in both original equations
The two equations as lines. Their slopes differ, so they cross at exactly one point, : the unique solution. Substituting back into the equations as printed in the question (not into the matrices) catches any slip made while building and . The picture shows the meaning: each equation is a line, and the lines have different slopes, and , so they cross at exactly one point.One crossing point means exactly one solution. Basics: two lines, cross, parallel or the same
, so the system is consistent, with the unique solution , . (Textbook answer: Consistent.)
Solve by elimination instead. Twice the first equation is . Subtract the second equation : the terms cancel and . Then . Same answer, by a method that does not use determinants at all.
- Thinking a negative determinant means "inconsistent". Only needs further testing; is non-zero.
- Dropping the sign when dividing by . Then has the wrong sign, and gives instead of .
- Using the matrix of cofactors without transposing. Here the two agree by luck; in general they do not.
- Stopping at "consistent" with no reason. The reason is the rule: guarantees the unique solution .
- To examine consistency, compute first. If , the system is consistent with exactly one solution.
- The solution is worth finding anyway: substituting it back is the best check.
- For two unknowns, means the two lines have different slopes, so they cross once.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Consistent: a solution exists; inconsistent: none exists | Step 3, Result | Section 4.6 (Lesson: solving systems AX = B) |
| Writing a system as | Step 1 | Section 4.6.1 |
| determinant | Step 2 | Section 4.2.2 |
| , unique | Step 3 | Section 4.6.1, Case I |
| Step 4 | Definitions 1 and 2, Section 4.4 | |
| = transpose of the matrix of cofactors; order 2 shortcut | Step 4 | Definition 3 and Remark, Section 4.5.1 |
| invertible , and | Steps 3, 5 | Theorem 4, Section 4.5 |
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 →