Exercise 3.2 · Q16: Prove
If
prove that .
(The book writes the right-hand side as 0; it means the zero matrix .)
Multiplying row by column, the entries of are
Multiplying row by column, the entries of are
. Hence proved.
Want the reason behind every step, the basics and the checks?
A matrix polynomial is evaluated exactly like a number polynomial, except that every power is a matrix product: and , and the constant term becomes so that it has the same order as everything else. So we compute and entry by entry, form the combination entry by entry, and see that all nine entries are .
- Given
- The matrix above, and , the identity matrix of order 3.
- To show
- , the zero matrix.
- Plan
- (1) Check that every term is defined and is . (2) Compute , every entry. (3) Compute , every entry. (4) Write , , . (5) Add the four matrices entry by entry and get .
Basics you need
If is and is , then is , and its entry is row of times column of : multiply matching entries and add. Basics: pair up, multiply, add
needs the columns of to equal its rows, so only a square matrix has powers. ; by the associative law , so it does not matter which way we group. Lesson: properties of multiplication
Matrices of the same order are added entry by entry, and multiplies every entry of by . Basics: adding only like with like
has 1 on the leading diagonal and 0 elsewhere; has every entry 0. So has 2 on the diagonal and 0 elsewhere. Basics: identity and undo
Solution
Check the orders
is . For , the columns of the first factor (3) equal the rows of the second (3), so is defined and is . Then is again times , so is defined and is . Scalar multiples keep the order, and is chosen of order 3. So all four terms , , , are , the sum is defined, and the result is a matrix. That is why the right-hand side must be the zero matrix , not the number 0.
A sum of matrices is only defined when all the terms have the same order. Checking this first tells us the identity we are proving makes sense, and tells us the size of .Product . Lesson: matrix multiplicationCompute
Row 1 of is ; the columns of are , , read downwards.
Row 2 of is :
Row 3 of is :
Assembling the nine entries:
is not found by squaring each entry. Squaring entries would give a first row , but the true first row is . Each entry of a product mixes a whole row with a whole column.Entry of a product: row of the first factor times column of the second. Basics: pair up, multiply, addCompute
Row 1 of is ; the columns of are still , , .
Row 2 of is :
Row 3 of is :
We reuse from Step 2 instead of multiplying three matrices from scratch. Computing instead would give the same matrix, because by the associative law. Notice the middle column: every product in Steps 2 and 3 has 0 in positions and , because column 2 of is , which only picks out the middle entry of each row.Associative law , Section 3.4.6. Lesson: properties of the operationsWrite the other three terms
Multiply every entry of by , every entry of by , and every entry of by :
Writing as means everything in the next step is a plain sum, so there is only one sign to track per entry. The constant 2 in the polynomial becomes : a number cannot be added to a matrix, but is the matrix that plays the role of "2".Scalar multiple: . Lesson: addition and scalar multiplicationAdd the four matrices entry by entry
Each entry of the result is (entry of ) + (entry of ) + (entry of ) + (entry of ):
So
Two matrices are equal only when every pair of corresponding entries is equal. So to prove the sum is we must show all nine entries are 0; it is not enough to check a few. The term only affects the three diagonal entries, which is why the 2 appears only in positions , , .Equality of matrices: same order and every corresponding entry equal (Definition 2). Lesson: equality of matrices
With having rows , , and having rows , , , every entry of is 0, so , as required. (The textbook gives no answer for this "prove that" question.)
Test the result on a column vector. Take with entries . Then is the row sums of : . Applying again: has entries , , ; these are the row sums of (, , ) ✓. Once more: has entries , , , the row sums of ✓. Now the first entry of is , the second is , the third is ✓.
- Squaring or cubing each entry. is , a row-times-column product; its entry is 5, not .
- Writing instead of . A number cannot be added to a matrix. Adding 2 to every entry would also be wrong: changes only the diagonal.
- Sign slips in the long sums. Write out as its own matrix first, then add; do not try to subtract and add in one go.
- Checking only the diagonal. All nine entries must be shown to be 0.
- To evaluate a polynomial in a square matrix, build the powers by repeated multiplication (reuse each power for the next) and replace the constant by .
- Always check orders first: powers need a square matrix, and the result of a sum has the common order of its terms.
- An equation is a strong fact about : it lets you rewrite as , so any higher power reduces to a combination of , and .
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| is defined when columns of = rows of ; gives | Step 1 | Section 3.4.5 (Lesson: multiplication) |
| Entry is row times column | Steps 2, 3 | Section 3.4.5 |
| Associative law | Step 3 | Section 3.4.6, property 1 |
| Scalar multiple ; sums of same-order matrices entry by entry | Steps 4, 5 | Sections 3.4.1 and 3.4.2 |
| Identity matrix and zero matrix | Steps 4, 5 | Section 3.3 (vi) and (vii) |
| Equality of matrices | Step 5 | Definition 2, Section 3.3.1 |
| The same style of proof for another matrix | Whole page | Example 18 () |
| All products and sums | Steps 2–5, Check | Recomputed in the site's verification script |
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 →