Exercise 3.2 · Q12: Find when unknowns appear on both sides
Given
find the values of , , and .
Equating corresponding entries,
From (1): , so .
From (4): .
From (2): , so .
From (3): , so .
, , , .
Want the reason behind every step, the basics and the checks?
Equate corresponding entries, as always. The new feature is that the unknowns appear on both sides and some entries mix two unknowns. So the order of solving matters: two of the four equations contain a single unknown ( and ); solve those first, then feed the values into the other two to get and .
- Given
- An equation between matrices, with appearing on both sides.
- To find
- , , and .
- Plan
- (1) Check the orders. (2) Simplify the left side (scalar multiple) and the right side (sum). (3) Equate the four entries. (4) Solve for and first, then and . (5) Substitute back.
Basics you need
Entry is in row , column . Equations are formed position by position. Basics: rows, columns and the address a_ij
triples every entry; a sum of two matrices adds entries in the same position. Basics: adding only like with like
Same order and equal corresponding entries. Lesson: equality of matrices
Collect the unknown on one side by subtracting the same term from both sides, then divide. Solve the equation with a single unknown first and substitute. Basics: solving equations, one unknown at a time
Solution
Check the orders
All three matrices are . The left side (a matrix) is ; the right side is a sum of two matrices, which is defined and . So the two sides can be compared entry by entry, giving four equations for the four unknowns.
Matching orders are what make both the addition and the comparison legitimate.Simplify the left side
The scalar 3 multiplies every entry.Simplify the right side
Add entries in the same position:
so the right side is
Matrix addition works position by position. Each entry of the second matrix is added to the entry in the same place of the first; brackets can be dropped because addition of numbers is associative.Equate corresponding entries
The two sides are equal matrices, so:
Definition 2: equal matrices have equal corresponding entries. Notice which unknowns each equation contains: (1) only ; (4) only ; (2) contains and ; (3) contains and . That tells us the order to solve in.Solve (1) for and (4) for
(1): subtract from both sides, then divide by 2:
(4): subtract from both sides:
Each of these equations has a single unknown, appearing on both sides. Subtracting the same term from both sides gathers it on the left.Use in (2) to get
Subtract from both sides of (2), then put :
Equation (2) has two unknowns, but is now known from Step 5, so only is left.Use in (3) to get
Subtract from both sides of (3), then put :
Likewise, from Step 5 leaves as the only unknown in (3).Substitute back
With , , , , the left side is
and the right side is
The two sides match. ✓
Here , and . Every position agrees, so the values are correct. Since every solving step was reversible, they are the only values.
. (Textbook answer: .)
Equation by equation: (1) ✓; (2) ✓; (3) ✓; (4) ✓.
- Treating on the right as already known. The in the right side is the same unknown as on the left; (1) has on both sides and must be rearranged.
- Writing . The entry on the right is : the belongs there.
- Solving (2) or (3) first. Each has two unknowns; it cannot be finished until (1) or (4) has been solved.
- Equate entries first, then look at which unknowns each equation contains before solving.
- Solve the single-unknown equations first and substitute into the rest.
- Substituting back into the original matrices checks every entry at once.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Order of a matrix; entry | Steps 1, 4 | Section 3.2.1 |
| Steps 2, 8 | Section 3.4.2 | |
| Sum of matrices of the same order, entry by entry | Steps 3, 8 | Section 3.4.1 |
| Equal matrices: equal corresponding entries | Step 4 | Definition 2, Section 3.3.1 (Lesson: equality) |
| Same operation on both sides keeps an equation true | Steps 5 to 7 | Algebra of equations |
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 →