Exercise 3.2 · Q4: Find , and verify
If
then compute and . Also, verify that .
Adding or subtracting corresponding entries,
LHS = RHS, that is, . Hence verified.
Want the reason behind every step, the basics and the checks?
Every entry of these sums and differences is computed in its own position, so in each position the claim is a statement about three ordinary numbers: . That is true for all numbers, so the matrix equation is true for all matrices of the same order. In the language of Section 3.4.3 it is the associative law of matrix addition applied to , and . Here we confirm it by computing both sides in full.
- Given
- Three matrices , , .
- To find
- and ; and to show .
- Plan
- (1) Check the orders. (2) Compute . (3) Compute . (4) Compute the left side . (5) Compute the right side . (6) Compare entry by entry, and explain why the equality always holds.
Basics you need
For matrices of the same order, and : add or subtract in each position. Basics: adding like with like
Two matrices are equal when they have the same order and every entry of one equals the entry in the same position of the other. So "verify" means: compute both sides and compare all nine positions. Basics: positions
For ordinary numbers, . Subtracting a negative adds: .
Solution
Orders
, , each have 3 rows and 3 columns, so each is . Every sum and difference in the question is therefore defined, and every result is .
Addition and subtraction need matching positions. With all three matrices , every intermediate matrix (, ) is also , so the later sums are defined too.Compute
Add the entries in each of the nine positions:
Each position is independent. The entries to watch are those with negatives: , , .Compute
The difference is defined position by position, (Section 3.4.2). The entry is the one sign trap: , so .Left side:
Add to the matrix found in Step 3:
The bracket in says: do first (done in Step 3), then add . Using the already computed is exactly what the bracket asks for.Right side:
Subtract from the matrix found in Step 2:
Now the bracket says: do first (Step 2), then subtract . Again the position has , giving .Compare, and see why it had to work
Both sides are , and the nine entries agree position by position:
So is verified for these matrices.
Why it always holds. Take any position . The left side has entry , the right side has . These are equal for all numbers, so the two matrices agree in every position. Equivalently, writing , the claim is , which is the associative law of matrix addition.
"Verify" asks only for the check with these particular matrices, which Steps 4 and 5 provide. The general reason explains why the check could not have failed (unless an arithmetic slip was made), and links the exercise to the property it illustrates.Associative law: for matrices of the same order. Lesson: properties of the operations
and both and equal
so . (Textbook answer: the same and .)
A third route to the same matrix: . First
and adding gives rows , , : the same matrix. ✓
Entry totals: totals 8, totals 20, totals 14, and , while the answer totals . ✓
- written as . Subtracting a negative adds; the entry of is .
- Mixing the bracket order. uses first; uses first. They agree in the end, but the working must follow each bracket.
- Checking only a few entries. Equality of matrices needs all nine positions to agree.
- A matrix identity built from and holds because it holds for numbers in each position.
- is , so rules for addition (here the associative law) cover subtraction too.
- Bracket every negative entry when you subtract it.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Sum of matrices of the same order | Steps 1, 2, 4 | Section 3.4.1 (Lesson: addition) |
| Negative and difference | Steps 3, 5 | Section 3.4.2 |
| Equality of matrices: same order, equal corresponding entries | Step 6 | Section 3.3.1, Definition 2 (Lesson: equality) |
| Associative law | Step 6 | Section 3.4.3 (ii) (Lesson: properties) |
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 →