Exercise 3.2 · Q17: Find with
If
find so that .
Since , equating corresponding entries,
.
Want the reason behind every step, the basics and the checks?
A matrix equation between matrices is really four ordinary equations, one for each entry. Compute both sides as matrices, set corresponding entries equal, and solve. Because there is one unknown but four equations, a value of exists only if all four equations give the same ; checking that is part of the answer.
- Given
- The matrix and the identity of order 2.
- To find
- The number for which .
- Plan
- (1) Check orders. (2) Compute entry by entry. (3) Write entry by entry in terms of . (4) Equate the four pairs of entries and solve each. (5) Confirm that one satisfies all four, and substitute back.
Basics you need
The entry of is row of times column of : multiply matching entries and add. Basics: pair up, multiply, add
multiplies every entry by ; subtracts entry by entry (same order needed). Basics: adding only like with like
Two matrices of the same order are equal exactly when every pair of corresponding entries is equal. Lesson: equality of matrices
Collect the unknown on one side, then divide by its coefficient. Basics: solving equations
Solution
Check the orders
is , so is , defined, of order . and are both , so is defined and . Both sides of the equation are , so comparing them makes sense.
Equality of matrices first requires the same order; only then can entries be compared one to one.Compute
The rows of are and ; its columns are and read downwards.
Watch the signs: . This is where most slips in this question happen.A negative times a negative is positive. Basics: pair up, multiply, addWrite entry by entry
Subtracting entry by entry:
has 2 only on the diagonal, so it changes only the and entries. The off-diagonal entries of are just those of .Equate corresponding entries and solve each
means
so the four entry equations are:
Each equation is linear in with a non-zero coefficient of , so each has exactly one solution, and all four give . Hence , and it is the only value that works.
Any one equation would already suggest , but the matrix equation demands all four at once. If two entries had given different values of , no would exist at all. Here they agree, so is a genuine solution; and since the equation alone forces , no other value can work.Substitute back
With :
which is exactly from Step 2. So .
Substituting the answer into the original equation catches any arithmetic slip in Steps 2 to 4.
, that is, . (Textbook answer: .)
A test on a column vector: take with entries . Then is the first column of : . Applying again: and , so has entries . On the other side, has entries and ✓. With having entries : is ; is and ; and is , ✓.
- Squaring the entries to get with rows , . That is not matrix multiplication.
- Treating as subtracted from every entry. It changes only the diagonal; the off-diagonal entries of are and .
- Using only one entry. One entry suggests a value; all four must agree for that value to be an answer.
- Sign slip in , which gives .
- A matrix equation of order is scalar equations, one per entry.
- With fewer unknowns than entries, the system is overdetermined: a solution exists only if every entry equation agrees, so check them all.
- is another polynomial identity of a square matrix, like the one in Exercise 3.2 Q16; it lets you replace by in any longer calculation.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Product defined when columns of the first = rows of the second; entry = row times column | Steps 1, 2 | Section 3.4.5 (Lesson: multiplication) |
| Scalar multiple and difference of matrices | Steps 3, 5 | Section 3.4.2 |
| Identity matrix of order 2 | Step 3 | Section 3.3 (vi) |
| Equal matrices have equal corresponding entries | Step 4 | Definition 2, Section 3.3.1 |
| All products and the value | Steps 2–5, Check | Recomputed in the site's verification script |
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 →