Exercise 3.3 · Q2: Verify and
If
and
then verify that
(i) , (ii)
(i)
LHS = RHS, so .
(ii)
LHS = RHS, so . Hence verified.
Want the reason behind every step, the basics and the checks?
"Verify" means: compute the left side, compute the right side, and see that they are the same matrix. The two routes are "add (or subtract) first, then transpose" and "transpose first, then add (or subtract)". They must agree, because transposing only moves entries, and adding happens entry by entry, so it does not matter whether the entries are moved before or after they are added.
- Given
- Two matrices and .
- To show
- (i) ; (ii) .
- Plan
- (1) Check the orders, so every sum and difference is defined. (2) Find and transpose it. (3) Find and and add them. (4) Compare. (5) Repeat with subtraction. (6) Explain why the result had to come out this way.
Basics you need
Two matrices of the same order are added by adding entries in the same position: . Subtraction works the same way: . Matrices of different orders cannot be added. Basics: adding only like with like
is with rows written as columns: . An matrix has an transpose. Basics: reading a table sideways
Two matrices are equal when they have the same order and every pair of corresponding entries is equal. So to verify an equation of matrices we compare all entries. Basics: rows, columns and addresses
Part (i):
(i) Check the orders
and are both , so is defined and is ; its transpose is . Also and are both , so is defined and is . Both sides have the same order, so comparing them makes sense.
An addition is only defined for matrices of the same order (Basic 1). Checking first means we never write down a meaningless sum.(i) Left side: add, then transpose
Add entry by entry:
Now write the rows ; ; as columns:
The left side tells us the order of operations: the bracket is formed first, and the dash acts on the whole result.Sum of matrices, Section 3.4.1; transpose, Definition 3. Basics: adding like with like(i) Right side: transpose, then add
Rows of become columns of , and rows of become columns of :
Add entry by entry:
Here the dashes act on and separately, before the addition. We get the same nine numbers as in the previous step, but by a different route.(Basic 2). Lesson: transpose(i) Compare
Part (i), Steps 2 and 3 give matrices of the same order whose nine entries agree position by position: in row 1, in row 2, in row 3. Hence .
Equality of matrices: same order and equal corresponding entries, Section 3.3.1 (Basic 3).
Part (ii):
(ii) Left side: subtract, then transpose
All four matrices are , so both differences are defined. Subtract entry by entry, taking care with the minus signs:
Rows become columns:
Subtracting a negative number adds it: and . These two entries are where sign slips usually happen.Difference , Section 3.4.2. Basics: adding like with like(ii) Right side: subtract the transposes
Using and from Part (i), Step 3:
(ii) Compare
Both sides are with the same nine entries, so .
Why it had to work
Take any position . On the left, the entry of is the entry of , which is . On the right, the entry of is . These are the same number for every and . The argument with in place of gives .
The verification above checks one pair of matrices. This short argument shows the rule holds for every pair of matrices of the same order, which is the property the textbook states in Section 3.5.1.Properties of transpose, Section 3.5.1 (iii): . Lesson: transpose
Both sides of (i) equal
and both sides of (ii) equal
So and are verified.
Pick one position, say row 3, column 1 of . It should be the row 1, column 3 entry of , that is . The matrix in Part (i), Step 2 has there. ✓ For , position (1,3) should be , and it is. ✓
- Transposing only one matrix. is not the right side; both and must be transposed.
- Sign slips in subtraction. is , not .
- Calling it verified after one entry. Two matrices are equal only when all corresponding entries agree.
- Transposing and adding can be done in either order: .
- To verify a matrix identity, compute both sides completely and compare every entry.
- An entry-level argument, , proves the rule for all matrices of the same order.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Sum of matrices of the same order | Part (i), Steps 2–3 | Section 3.4.1 (Lesson: addition) |
| Difference | Part (ii), Steps 1–2 | Section 3.4.2, "Difference of matrices" |
| Transpose | Throughout | Definition 3, Section 3.5 (Lesson: transpose) |
| Equality of matrices | Part (i), Step 4; Part (ii), Step 3 | Definition 2, Section 3.3.1 |
| in general | Part (ii), Step 4 | Section 3.5.1, property (iii); Example 20 |
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 →