Example 20: Verify , ,
If
and
verify that
(i) , (ii) , (iii) , where is any constant.
(i)
.
(ii)
.
(iii)
. Hence verified.
Want the reason behind every step, the basics and the checks?
Transposing a matrix means turning its rows into columns: the entry in row , column of moves to row , column of . Each of the three rules says that this "swap of addresses" does not interfere with another operation. Swapping twice puts every entry back where it started; adding (or scaling) entries and then moving them gives the same result as moving them first and then adding (or scaling). To verify each rule here, we compute both sides entry by entry and compare.
- Given
- Two matrices and , each of order (2 rows, 3 columns), and an arbitrary constant .
- To show
- (i) ; (ii) ; (iii) .
- Plan
- In each part, work out the left side and the right side separately, write down every entry, and check that the two matrices have the same order and the same entries. That is exactly what equality of matrices requires.
Basics you need
A matrix with rows and columns has order . The entry in row , column is written . For our : and . Basics: rows, columns and the address
If has order , its transpose has order , and the entry of is . In words: row 1 of becomes column 1 of , row 2 becomes column 2, and so on. Basics: reading a table sideways
Two matrices can be added only when they have the same order; then you add entries in matching positions. multiplies every entry of by . Basics: adding only like with like
Two matrices are equal when they have the same order and every pair of corresponding entries is equal. So "verify " means: check the orders, then check each entry.
Part (i):
Find , entry by entry
has order , so has order . Its entries come from with the two subscripts swapped:
Assembling them:
You can read this off directly: the first row of , which is , is now the first column; the second row is now the second column.
Transposing : row 1 (blue) becomes column 1 of and row 2 (gold) becomes column 2. A matrix becomes a matrix. Writing each entry with its address, , is the definition of transpose applied literally, so no entry can be put in the wrong place. Here means the entry of .Transpose again and compare with
has order , so has order , the same as . Its entry is the entry of , which is the entry of . Reading it off, the columns of become rows:
Entry by entry this is in row 1 and in row 2, exactly the entries of , and the orders agree. So .
Swapping the two subscripts twice returns them to the original order: . So every entry goes back to its own place. That is why the rule holds for every matrix, not just this one.Property (i) of Section 3.5.1: for any matrix .
Part (ii):
Check that is defined, then add entry by entry
and are both , so is defined and is . Add the entries in matching positions:
Matrix addition is only defined for matrices of the same order, because each entry of one must have a partner in the same position of the other. The entry cannot be simplified further, so we leave it in that exact form rather than rounding.Addition of matrices, Section 3.4.1. Basics: adding only like with likeTranspose the sum: the left side
is , so is . Row 1 of becomes column 1 and row 2 becomes column 2:
This is the same "rows become columns" rule as in Part (i), Step 1, now applied to the matrix .Transpose first, then add: the right side
From Part (i), Step 1,
is , so is : row 1 of , which is , becomes column 1, and row 2, which is , becomes column 2:
and are both , so they can be added. Entry by entry:
The right side is a different calculation from the left side: here we move the entries first and add afterwards. Doing it independently is what makes the comparison in the next step a genuine check.Compare
Both sides are , and their six entries agree position by position: ; ; . So .
In general, the entry of is the entry of , which is . The entry of is also . Both sides add the same two numbers; they only differ in whether the move happens before or after the addition.Property (iii) of Section 3.5.1: whenever and have the same order.
Part (iii):
Multiply by
Multiplying a matrix by a number multiplies every entry, and the order stays :
For example the entry is and the entry is .
Scalar multiplication, Section 3.4.2: .Transpose and take out the factor
is , so is . Row 1 of , which is , becomes column 1; row 2, which is , becomes column 2:
Every entry has the factor , so
using from Part (ii), Step 3. So for every constant .
Because is left as a letter, this one calculation covers every constant at once. Taking the common factor out of every entry is scalar multiplication read backwards. In general the entry of is , which is times the entry of .Property (ii) of Section 3.5.1: .
and , . All three properties are verified for these matrices.
Take . Then has rows and , so has rows ; ; . Multiplying (rows ; ; ) by gives the same rows. As a decimal check of the irrational entry, , and gives the same value in both and .
- Keeping the order the same. The transpose of a matrix is , not . If your still has 2 rows, you have only rearranged entries within rows.
- Turning columns into rows in the wrong order. Row 1 must become column 1 (not column 2), and the entries keep their order down the column: from top to bottom.
- Simplifying to or to 0.7. is already the exact value; a rounded decimal is not equal to it.
- Calling one computation a verification. To verify you must compute both and independently and then compare.
- has entries : rows become columns, and an matrix becomes .
- Transposing twice gives back the original matrix.
- Transpose "passes through" addition and scalar multiplication: and . The next example shows that for products the order of the factors reverses: .
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Order ; entry | All parts | Sections 3.2, 3.2.1 (Lesson: what a matrix is) |
| Equal matrices: same order, equal entries | All comparisons | Definition 2, Section 3.3.1 (Lesson: equality) |
| Sum defined only for equal orders; entrywise addition | Part (ii), Steps 1, 3 | Section 3.4.1 (Lesson: addition) |
| Part (iii), Steps 1, 2 | Section 3.4.2 | |
| All parts | Definition 3, Section 3.5 (Lesson: transpose) | |
| , , | Parts (i), (iii), (ii) | Section 3.5.1, properties (i), (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 →