Exercise 3.3 · Q3: Verify and given
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?
We are given , not . But transposing twice brings a matrix back, , so transposing the given matrix recovers . After that the question is a straight verification: compute each side and compare. Notice the orders: is and is , so and themselves can never be added; the sums that appear are (both ) and (both ).
- Given
- , of order , and , of order .
- To show
- (i) ; (ii) .
- Plan
- (1) Recover from and find ; check all orders. (2) Left side of (i): add, then transpose. (3) Right side of (i): add and . (4) Compare. (5) The same for (ii).
Basics you need
: rows become columns. An matrix has an transpose. Basics: reading a table sideways
. Swapping rows and columns twice puts every entry back where it started. So if we know , we get by transposing . Basics: reading a table sideways
A sum or difference of matrices is defined only when the orders match, and it is computed entry by entry. Basics: adding only like with like
Getting ready: find and
Recover by transposing
The rows of are ; ; . Since , we write these rows as columns:
Transposing is its own undo (Basic 2). The order confirms it: is , so must be , the same order as . That is exactly what is needed for and to exist., Section 3.5.1, property (i). Lesson: transposeFind and list all orders
The rows of are and . As columns:
Orders: and are , so is and is . and are , so is . Every operation in the question is defined, and both sides of each equation are .
Order checks first: this question is a trap for anyone who tries to add the given to the given . Those have orders and , so is not defined at all.Sums need equal orders (Basic 3). Basics: adding like with like
Part (i):
(i) Left side: add, then transpose
The rows and become columns:
Sum entry by entry, Section 3.4.1; transpose, Definition 3.(i) Right side: add the transposes
is given and was found above:
For the right side we can use the given directly; recovering was only needed for the left side.(i) Compare
Both sides are with entries ; ; in the same positions, so .
Equal matrices: same order, equal corresponding entries (Definition 2).
Part (ii):
(ii) Left side: subtract, then transpose
Rows become columns:
: subtracting a negative adds. Every other entry is a plain subtraction.Difference , Section 3.4.2. Basics: adding like with like(ii) Right side: subtract the transposes
(ii) Compare
Both sides are with the same six entries, so .
This is what the general rule predicts: the entry of is , and so is the entry of . The computation confirms it for this particular pair.
With
both sides of (i) equal the first matrix below and both sides of (ii) equal the second:
So both identities are verified.
One entry by a third route: the (3,2) entry of is the (2,3) entry of , which is . Both sides show 4 there. ✓ Also should equal : for the (1,1) entry, . ✓
- Adding to . Their orders are and , so the sum does not exist. Recover first, or transpose .
- Treating the given matrix as . The question gives . Using it as changes every answer.
- Sign slips. is .
- If you are given , transpose it to get : .
- Always write the order of each matrix; it tells you which sums exist.
- holds for any two matrices of the same order.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Transpose , order | Getting ready; Parts (i), (ii) | Definition 3, Section 3.5 (Lesson: transpose) |
| Getting ready, Step 1 | Section 3.5.1, property (i) | |
| Sum and difference entry by entry, equal orders needed | Parts (i), (ii) | Sections 3.4.1 and 3.4.2 (Lesson: addition) |
| Equality of matrices | Part (i), Step 3; Part (ii), Step 3 | Definition 2, Section 3.3.1 |
| , | Part (ii), Step 3 | Section 3.5.1, properties (ii), (iii) |
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 →