Exercise 4.4 · Q3: Verify ,
Verify in Exercises 3 and 4.
3.
Cofactors: , , , .
. Hence verified.
Want the reason behind every step, the basics and the checks?
Theorem 1 of Section 4.5.1 says that a square matrix times its adjoint, in either order, is times the identity. To verify it for this matrix we compute all three sides separately and compare them entry by entry. This matrix has a twist: its second row is times its first, so . The theorem then predicts that both products are the zero matrix, and that is what we find.
- Given
- The matrix above.
- To show
- , and are the same matrix.
- Plan
- Compute . Find the four cofactors and . Multiply in both orders, entry by entry. Compare with .
Basics you need
, and is the transpose of . For a matrix this means: swap the diagonal entries, change the sign of the other two (Remark after Example 12). Lesson: the adjoint
The entry of is row of times column of : multiply matching entries and add. Order matters, so and are two separate calculations. Basics: matrix facts the chapter uses
has on the diagonal and 0 elsewhere; in particular is the zero matrix . Basics: scaling and adding matrices
A square matrix with is called singular (Definition 4, Section 4.5); it has no inverse (Theorem 4). Basics: why the inverse divides by |A|
Solution
Compute
So : is a singular matrix.
We need for the right-hand side . It is 0 because the rows are proportional: row 2 is , so the two diagonal products and are equal and cancel.The four cofactors
For each entry, delete its row and its column; the single entry left over is the minor . Then multiply by , which is for positions , and for , :
Element Minor Cofactor ; delete row 1 and column 1 ; delete row 1 and column 2 ; delete row 2 and column 1 ; delete row 2 and column 2 In a matrix, deleting row and column leaves one entry, the one diagonally opposite, and that number is the minor. The positions and have odd , so their minors change sign.Definitions 1 and 2, Section 4.4. Basics: the + − + sign patternBuild
The matrix of cofactors and its transpose:
Shortcut check: swap and on the diagonal, change the signs of and . This gives the same .
The adjoint is the transpose of the cofactor matrix (Definition 3). Doing it both ways, by the definition and by the Remark after Example 12, guards against a slip before we use in two products.Compute
Both factors are , so the product is defined and is . Write ; entry is row of times column of :
Each product pairs a row of with a column of . The diagonal entries are expansions of along a row, so they equal . The off-diagonal entries pair a row with the cofactors of the other row, and such sums are always 0 (Note in Section 4.4).Row times column; a negative times a negative is positive: . Basics: matrix facts the chapter usesCompute
Now the rows come from and the columns from . Write :
Matrix multiplication is not commutative in general, so has to be computed on its own; the question asks us to verify both orders. Here the entries are column-wise expansions: and are expanded along a column, and use the cofactors of a different column.Compute and compare
All three matrices are the zero matrix, entry for entry, so
Two matrices are equal when they have the same order and the same entries in every position. All three are with every entry 0, so the identity of Theorem 1 is verified for this .Scalar multiple: every entry of is multiplied by 0. Basics: scaling and adding matricesWhat the zero result means
Theorem 1 holds for every square matrix, singular or not. When we may divide it by to get (Theorem 4). Here , so that division is impossible, and indeed this has no inverse.
If some had , then (Theorem 3), which is impossible when . The zero products we found are the visible sign of this: is not the zero matrix, yet times it gives , something an invertible matrix could never do.
and
Both and equal the zero matrix , which is . Hence is verified. (The answer key gives nothing for this question, since it is a verification.)
The Remark after Theorem 3 says ; for this is . Directly:
Also the columns of are and , both multiples of , and row 1 of gives ; row 2 is times row 1, so it also gives 0. That is why every entry of vanished.
- Thinking the verification "failed". Getting is correct here because ; is then the zero matrix too.
- Computing only one product. The question asks for both orders. Matrix products need not commute, so each must be computed.
- Sign slips with two negative entries. and ; the minus signs cancel in pairs.
- Trying to form . would need division by 0. A singular matrix has no inverse.
- holds for every square matrix, including singular ones, where both sides are .
- Diagonal entries of the product are expansions of ; off-diagonal entries use cofactors of the wrong row or column and are always 0.
- Proportional rows mean : the matrix is singular and has no inverse.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Step 1, Check | Section 4.2.2 (Lesson: determinant) | |
| Singular: | Steps 1, 7 | Definition 4, Section 4.5 |
| Minor and cofactor | Step 2 | Definitions 1 and 2, Section 4.4 (Lesson: minors and cofactors) |
| Adjoint; shortcut | Step 3 | Definition 3 and Remark after Example 12, Section 4.5.1 |
| Product of matrices, row times column | Steps 4, 5 | Chapter 3, Section 3.4.5 (Basics: matrix facts) |
| Elements times cofactors of another row (or column) sum to 0 | Step 4 | Note in Section 4.4 |
| Scalar multiple of a matrix; equality of matrices | Step 6 | Chapter 3, Sections 3.4.2 and 3.3.1 |
| Steps 6, 7 | Theorem 1, Section 4.5.1 (Lesson: the adjoint) | |
| ; invertible | Step 7 | Theorems 3 and 4, Section 4.5 (Lesson: inverse of a matrix) |
| Check | Remark after Theorem 3, Section 4.5 |
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 →