Exercise 4.5 · Q9: Solve , by the matrix method
Solve system of linear equations, using matrix method, in Exercises 7 to 14.
9.
The system is , where
. So exists and the system has a unique solution, .
.
Want the reason behind every step, the basics and the checks?
Two equations in two unknowns are one matrix equation : the coefficients form , the unknowns form and the right-hand sides form . If , the matrix has an inverse, and multiplying both sides by "undoes" exactly the way dividing undoes multiplying for numbers: , with . The whole solution is: find , build , divide, multiply.
- Given
- The equations and .
- To find
- The values of and that satisfy both, using the matrix method.
- Plan
- (1) Write the system as . (2) Compute ; it must not be 0. (3) Find the cofactors and . (4) Form and check . (5) Compute entry by entry. (6) Check the answer in both equations.
Basics you need
Row of times the column gives the left side of equation . A matrix times a column is a column, so is two number equations at once, by equality of matrices. Basics: matrix facts the chapter uses
For rows and , the determinant is : the product down the main diagonal minus the product down the other diagonal. Basics: where the determinant comes from
The minor is what remains after deleting row and column ; the cofactor is (signs / ). The adjoint is the transpose of the matrix of cofactors. Basics: the + − + sign pattern
(Theorem 1). So when , the matrix times gives : it is . Basics: why the inverse divides by |A|
Each equation is a straight line. means the lines have different slopes, so they cross at exactly one point: the system has exactly one solution. Basics: two lines, cross, parallel or the same
Solution
Write the system as
Put the coefficients of and in the rows of (one row per equation, -column first), the unknowns in , and the right-hand sides in :
Orders: is , is , so is defined (2 columns of , 2 rows of ) and is , the same order as . Multiplying out,
so says exactly and .
Writing the product out is how we know was built correctly: each entry of must reproduce the left side of one equation. Note the coefficient of in both equations is negative, so the second column of holds and , signs included.Section 4.6.1 writes any system as in this way. A product is row times column (Section 3.4.5). Lesson: solving systems AX = BCompute and decide whether there is a unique solution
Since , is nonsingular, so exists and the system has a unique solution.
Here is why the solution is unique. If solves , multiply both sides on the left by : , so , that is . So any solution must equal . And really is a solution, because . Geometrically, the slopes are and , which differ, so the two lines cross once.Case I of Section 4.6.1: if is nonsingular, is the unique solution. Definition 5, Section 4.5: nonsingular means . Basics: two linesFind the four cofactors and
For a matrix, deleting a row and a column leaves a single entry, and that entry is the minor. With , , , :
The matrix of cofactors, and its transpose, the adjoint:
Shortcut check: swapping and (4 and ) and changing the signs of and (, ) gives the same matrix.
is what is left after deleting row 1 and column 1, namely ; is left after deleting row 1 and column 2, namely ; and so on. The sign is when is even and when it is odd. The transpose matters: cofactor goes to position (2, 1) of the adjoint.Definitions 1 and 2, Section 4.4 (minor, cofactor); Definition 3, Section 4.5.1 (adjoint); the Remark after Example 12 (the shortcut). Basics: the sign patternForm and check that
Check: compute entry by entry (row of times column of ):
so
The check costs four short products and catches almost every slip in the cofactors. The diagonal entries must come out as and the off-diagonal ones as 0, exactly as Theorem 1 says. We keep the factor outside the matrix to avoid fractions inside it.Compute , entry by entry
is and is , so is defined and is , like . First multiply by :
Then divide by :
By equality of matrices, , .
The order matters: , never . We got there by multiplying on the left by , and here is not even defined (a times a ). Multiplying by first keeps the arithmetic in whole numbers until the last line.Equality of matrices (Section 3.3.1): two columns are equal when their entries are equal one by one. Basics: rows, columns and positionsCheck the answer in both original equations
Both equations hold, so the solution is correct.
A check in only one equation is not enough: many wrong pairs satisfy one of the two lines. Checking both confirms the point lies on both lines, which is what "solution of the system" means.
, so is invertible with
and the unique solution is
(Textbook answer: , .)
Solve again by elimination, without matrices. Multiply the first equation by 5 and the second by 3: and . Subtracting, , so . Then , so . Same answer.
In decimals, and . Then
- Losing the sign of . is , not or . Dropping the minus in gives , , which fails both equations.
- Using the matrix of cofactors as the adjoint. The adjoint is its transpose: and swap places.
- Writing . That product is not defined here, and in general matrix multiplication is not commutative. It is .
- Dropping the signs of the coefficients when building . The -column is , not .
- The matrix method is always the same four moves: ; ; ; .
- For a matrix, is "swap the diagonal, negate the other two". Check it with .
- Fractional answers are normal. Keep outside until the last step, and always check in every equation.
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, 4, 5 | Section 3.4.5 (Chapter 3) |
| determinant | Step 2 | Section 4.2.2 (Lesson: determinant) |
| Nonsingular means | Step 2 | Definition 5, Section 4.5 |
| If is nonsingular, is the unique solution | Steps 2, 5 | Section 4.6.1, Case I |
| Minor and cofactor | Step 3 | Definitions 1 and 2, Section 4.4 (Lesson: minors and cofactors) |
| = transpose of the cofactor matrix; shortcut | Step 3 | Definition 3 and the Remark after Example 12, Section 4.5.1 (Lesson: the adjoint) |
| Step 4 | Theorem 1, Section 4.5 | |
| Step 4 | Theorem 4, Section 4.5 (Lesson: inverse of a matrix) | |
| Equality of matrices, entry by entry | Steps 1, 5 | Section 3.3.1 (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 →