Exercise 4.5 · Q11: Solve , , by the matrix method
Solve system of linear equations, using matrix method, in Exercises 7 to 14.
11.
The system is , where
Expanding along :
. So exists and the system has a unique solution, .
Cofactors:
.
Want the reason behind every step, the basics and the checks?
Three equations in three unknowns are one matrix equation with a matrix . If , the unique solution is , where . The work is mostly bookkeeping: nine small determinants (the minors), each with the right sign, arranged and transposed into .
- Given
- , , .
- To find
- , , by the matrix method.
- Plan
- (1) Write , noting that is missing from the third equation. (2) Find , expanding along a row with a zero. (3) Find all nine minors and cofactors. (4) Build and . (5) Check . (6) Compute . (7) Check in all three equations.
Basics you need
Row of times is the left side of equation . A missing unknown has coefficient 0, and that 0 must be written into . Basics: matrix facts the chapter uses
Pick any row or column. Multiply each entry by its signed minor, using the sign pattern below, and add. A row with a 0 saves work, because that term vanishes. Basics: the + − + sign pattern
: delete row and column , take the determinant that is left. . is the transpose of the matrix . Basics: where the determinant comes from
The right-hand side goes into as it is; and . Basics: algebra the chapter leans on
Solution
Write the system as
The third equation has no -term, so its coefficient of is 0. With columns in the order :
is and is , so is defined and , like . Row by row,
which reproduces the three left-hand sides.
Leaving out the 0 would make the third row , only two entries, and would not even be a matrix. Each unknown keeps its own column, so a missing unknown leaves a 0 in its column.Section 4.6.1 (matrix form); Section 3.4.5 (row times column). Lesson: solving systems AX = BCompute by expanding along row 3
Row 3 is and contains a 0, so expand along it. The signs for row 3 are :
The two minors that matter are
So : is nonsingular and the system has a unique solution.
Each small determinant is the minor of the row-3 entry in front of it: delete row 3 and that entry's column. The first term is 0 whatever its minor is, which is why a row with a zero is the cheapest choice. The before the 3 comes from the sign , not from the entry itself.Section 4.2.3: a determinant can be expanded along any row or column, all six ways giving the same value. Section 4.6.1, Case I. Lesson: expanding a 3 × 3 determinantFind all nine minors and cofactors
For each entry, delete its row and column, evaluate the determinant left (), then attach the sign .
Row 1 (entries ):
Row 2 (entries ):
Row 3 (entries ):
Every cofactor is needed, including those of row 3 already used for , because contains all nine. Note that does not make its cofactor 0: depends only on the other entries, and it is 1. The sign is at positions where is even (the corners and the centre) and at the four others.Definitions 1 and 2, Section 4.4. Lesson: minors and cofactorsBuild and
Matrix of cofactors (each in position ):
Its transpose (rows become columns) is the adjoint:
and, since ,
The cofactors of row 1 of become column 1 of . This transpose is what makes row of meet its own cofactors in the product , giving on the diagonal.Definition 3, Section 4.5.1; Theorem 4, Section 4.5. Lesson: the adjointCheck:
Row of times column of :
so .
The diagonal entries are "a row times its own cofactors", which is (the expansion along that row). The off-diagonal entries are "a row times another row's cofactors", which is always 0. Seeing exactly this pattern confirms all nine cofactors at once.Theorem 1, Section 4.5, and the Note in Section 4.4 (a row times the cofactors of a different row gives 0). Basics: why the inverse divides by |A|Compute
is , is , so is . First , row by row:
So , , .
Multiplying on the left by gives , that is ; so this is the only possible solution, and Step 7 confirms it works. The fraction in is harmless: it is multiplied by whole numbers, and the factor comes last.Section 4.6.1, Case I; associativity of matrix multiplication, Section 3.4.6. Lesson: inverse of a matrixCheck in all three original equations
In detail: ; ; . All three hold.
A solution of the system must satisfy every equation. Checking all three in the original equations also guards against a slip in writing down or in Step 1.
, and
The unique solution is , , .
(Textbook answer: , , .)
A second expansion of . Along row 1, with the cofactors of Step 3: . Along column 1: . Same value every time, as Section 4.2.3 promises.
Without matrices. Adding the first two equations removes : . With this gives , and then the third equation gives , so . Consistent.
- Dropping the 0 for the missing . The third row of is , not shifted left.
- Sign slips in the cofactors. , and are positive because a negative minor meets a sign. Write every time.
- Forgetting the transpose. Using the cofactor matrix itself as gives a first entry , not 34, and the answer is wrong.
- Thinking a zero entry has a zero cofactor. but .
- For a system, expand along the row or column with the most zeros, but compute all nine cofactors for the adjoint.
- The product must be : it checks every cofactor at once.
- Fractions in cause no trouble. (Multiplying the second equation by 2 first would also work: it changes and but not the solution.)
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| A system written as | Step 1 | Section 4.6.1 (Lesson: solving systems) |
| Matrix product, row times column | Steps 1, 5, 6 | Section 3.4.5 (Chapter 3) |
| Expansion along any row or column, sign | Step 2 | Section 4.2.3 (Lesson: expanding a 3 × 3 determinant) |
| determinant | Steps 2, 3 | Section 4.2.2 |
| Minor , cofactor | Step 3 | Definitions 1 and 2, Section 4.4 (Lesson: minors and cofactors) |
| = transpose of | Step 4 | Definition 3, Section 4.5.1 (Lesson: the adjoint) |
| ; row times another row's cofactors is 0 | Step 5 | Theorem 1, Section 4.5; Note in Section 4.4 |
| when | Step 4 | Theorem 4, Section 4.5 (Lesson: inverse of a matrix) |
| is the unique solution | Steps 2, 6 | Section 4.6.1, Case I |
| Associativity, | Step 6 | Section 3.4.6 (Chapter 3) |
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 →