Example 18: Show
If
then show that .
Let .
Let .
. Hence proved.
Want the reason behind every step, the basics and the checks?
Powers of a square matrix are repeated products: and . Once is known, the expression is just a combination of three matrices, worked out entry by entry like any sum of scalar multiples. Showing it "" means showing every one of its nine entries is 0.
- Given
- The matrix ; is the identity matrix and the zero matrix.
- To show
- .
- Plan
- Compute , then , all entries shown. Form and . Add the three matrices entry by entry and check each entry is 0.
Basics you need
Entry of a product is row of the first factor times column of the second. Basics: pair up, multiply, add
has 1 on the main diagonal and 0 elsewhere; has every entry 0. So has 40 on the diagonal and 0 elsewhere. Basics: identity and undo
, and matrices of the same order add entry by entry. means . Basics: adding only like with like
For a square matrix, and . By the associative law, , so . Lesson: properties of the operations
Solution
Check that every term makes sense
is square of order 3. So is , defined and , and likewise is . The matrices and are too, so the sum is defined and is . Here and is the zero matrix.
Only square matrices have powers: for we need columns of = rows of . The orders of and are not written, so we read them from the context: they must match the other terms.Identity matrix and zero matrix, Section 3.3 (vi) and (vii). Lesson: types of matricesCompute
Rows of : , , . Columns of : , , . Write :
is not the matrix of squared entries: its entry is 19, not . Each entry is a full row-times-column sum.Definition of the product, Section 3.4.5. Basics: pair up, multiply, addCompute
Rows of as before. Columns of : , , . Write :
We reuse rather than multiplying three matrices from scratch. Multiplying on the left of or on the right gives the same , by the associative law (Basic 4); the textbook uses , and the check box below uses the other order.Form and
Multiply every entry of by , and every entry of by :
Writing the subtraction as addition of negatives, , lets us add three matrices entry by entry without sign confusion. Note in the middle of . Since is zero off the diagonal, only affects the three diagonal entries.Add the three matrices entry by entry
Write , with , where is 1 on the diagonal and 0 off it (the entries of ):
Every one of the nine entries is 0, which is exactly what "" means. Off the diagonal, each entry of is exactly 23 times the matching entry of (for example and ), so cancels it. On the diagonal, is 40 each time (, , ), and cancels that.Equality with the zero matrix: every entry must be 0. Lesson: equality of matricesWhat the identity tells us: an inverse for (beyond the textbook)
This step is not part of the textbook's solution and is not needed for the answer. Rearranging, . The left side factors as , because and . So
Using the from Step 2, subtracts 23 from each diagonal entry:
So the inverse of is this matrix divided by 40. (The same factoring on the other side, , gives the product in the other order too.)
This shows why such identities matter: a polynomial equation satisfied by with a non-zero constant term lets us write down without any other method. For instance row 1 of times column 1 of is , which divided by 40 gives the 1 of .Inverse of a square matrix, Section 3.7. Lesson: invertible matrices
and every entry of is 0, so , as the textbook shows.
Other order for . should equal . Entry : row 2 of , , times column 2 of , , is . Entry : times is . Both agree with Step 3.
Apply everything to a column. Let . Then (the row sums of ), and . Now has entries , and , as it must if .
- Squaring the entries. ; it is computed by rows and columns.
- Writing instead of . A number cannot be subtracted from a matrix; is the matrix with 40 down the diagonal.
- Putting 40 in every entry. is zero off the diagonal, so only , , involve .
- Sign slips in . The entry is .
- To evaluate a matrix polynomial, compute the powers by repeated multiplication, then combine entry by entry, with the constant term becoming a multiple of .
- "" means every entry is 0; check all of them.
- An identity such as can be rearranged to , giving . (That every square matrix satisfies such an equation is the Cayley–Hamilton theorem, beyond this course.)
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Identity and zero matrix | Steps 1, 4 and 5 | Section 3.3 (vi) and (vii) (Lesson: types of matrices) |
| Steps 2 and 3 | Section 3.4.5 (Lesson: matrix multiplication) | |
| Step 3, check box | Associative law, Section 3.4.6 (Lesson: properties) | |
| ; | Steps 4 and 5 | Section 3.4.2 (Lesson: addition) |
| ; | Step 6 | Distributive law and identity, Section 3.4.6 |
| Inverse of a matrix | Step 6 (beyond the textbook's solution) | Definition 6, Section 3.7 (Lesson: invertible matrices) |
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 →