Exercise 4.4 · Q1: Adjoint of a matrix
Find adjoint of each of the matrices in Exercises 1 and 2.
1.
Minors:
Cofactors, :
Want the reason behind every step, the basics and the checks?
The adjoint is built in two moves: replace every entry by its cofactor, then transpose (turn rows into columns). Nothing is divided and no determinant of the whole matrix is needed. For a matrix the two moves together come to a simple rule, which the textbook states after Example 12: swap the two diagonal entries and change the sign of the other two. We work from the definition and then confirm the answer with that rule.
- Given
- The matrix above, with , , , .
- To find
- , which is again a matrix.
- Plan
- Find the four minors , attach the signs to get the cofactors , place them in the matrix of cofactors, transpose it. Then check with the shortcut and with Theorem 1, .
Basics you need
is the entry in row and column . So in , (row 1, column 2) and (row 2, column 1). Basics: rows, columns and positions
The minor is the determinant left after deleting row and column . The cofactor is : the same number, with its sign changed when is odd. Lesson: minors and cofactors
is when is even and when it is odd. For a matrix the signs are in row 1 and in row 2. Basics: the + − + sign pattern
The transpose of a matrix has the rows of the matrix as its columns: the entry in position moves to position . Basics: transpose and identity
is the transpose of the matrix of cofactors (Definition 3, Section 4.5.1). Lesson: the adjoint
Solution
Check the order and list the entries
has 2 rows and 2 columns, so it is a square matrix of order . The adjoint is defined only for square matrices, and has the same order, . We need one cofactor for each of the four entries: , , and .
Every step below refers to entries by their position , and the sign of a cofactor depends only on that position. Writing the positions out first keeps the bookkeeping straight.Positions are always given row first, then column. Basics: rows, columns and positionsFind the four minors
For each entry, delete its row and its column. In a matrix this leaves a single entry, and the determinant of a matrix is just . So each minor is simply the entry left over.
- : delete row 1 and column 1; left is . So .
- : delete row 1 and column 2; left is . So .
- : delete row 2 and column 1; left is . So .
- : delete row 2 and column 2; left is . So .
This is Definition 1 of Section 4.4 applied four times. The minor of each entry is the entry diagonally opposite to it: deleting a row and a column of a grid always leaves the one cell that shares neither.Determinant of a matrix of order one: (Section 4.2.1). Lesson: determinant of a square matrixAttach the signs: the four cofactors
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 So , , , .
The cofactor is the minor multiplied by (Definition 2, Section 4.4). For and the sum is odd, so those two minors change sign. For and the sum is even, so they stay as they are.Place each cofactor in its own position
The matrix of cofactors has in row , column :
This matrix is the halfway point of the definition. Each number sits where its element sat in : the cofactor of , which is , goes in row 1, column 2.Transpose to get
Row 1 of , which is , becomes column 1; row 2, which is , becomes column 2:
Definition 3 says the adjoint is the transpose of the cofactor matrix, not the cofactor matrix itself. The reason is Theorem 1: with the transpose, row of meets the cofactors of its own row in the product , which gives on the diagonal (see the check below).Transposing moves the entry in position to position ; diagonal entries stay put. Basics: transpose and identityConfirm with the shortcut
The Remark after Example 12 says: for a matrix, is obtained by interchanging and and changing the signs of and . Swapping 1 and 4 and negating 2 and 3 gives
the same matrix as in Step 5.
The blue diagonal entries 1 and 4 change places; the gold entries 2 and 3 stay where they are but change sign. This is exactly what the transposed cofactor matrix of Steps 4 and 5 produced. The shortcut is not a separate fact; it is what Steps 2 to 5 always produce. For a general matrix with entries in row 1 and in row 2, the cofactors are , , , , and transposing the cofactor matrix gives diagonal swapped, the other two negated.Use the shortcut to check your work, but be able to do the long way: for matrices (Exercise 4.4 Q2) there is no such shortcut. Lesson: the adjoint
(Textbook answer: the same matrix, with entries in row 1 and in row 2.)
Theorem 1 says . Here , so the product should be . Row times column:
Exactly , as the theorem predicts, so the adjoint is right.
- Stopping at the cofactor matrix. The matrix of Step 4, with in row 1 and in row 2, is , not . The adjoint is its transpose.
- Forgetting the signs. Using the minors without gives a matrix with no minus signs, which fails the check .
- Mixing up the shortcut. It is the diagonal pair that swaps and the off-diagonal pair that changes sign, not the other way round.
- Confusing adjoint and inverse. No division by happens here. Dividing by would give , a different matrix.
- Adjoint = transpose of the matrix of cofactors. Minors first, then signs, then transpose.
- For any matrix,
- is a quick and reliable check on any adjoint.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Minor : delete row , column | Step 2 | Definition 1, Section 4.4 (Lesson: minors and cofactors) |
| Determinant of order one: | Step 2 | Section 4.2.1 |
| Cofactor | Step 3 | Definition 2, Section 4.4 |
| Adjoint = transpose of | Steps 4, 5 | Definition 3, Section 4.5.1 (Lesson: the adjoint) |
| Transpose: entry moves to | Step 5 | Chapter 3, Definition 3, Section 3.5 |
| shortcut: swap diagonal, negate the rest | Step 6 | Remark after Example 12, Section 4.5.1 |
| Check | Section 4.2.2 | |
| Check | Theorem 1, Section 4.5.1 | |
| Product of matrices, row times column | Check | Chapter 3, Section 3.4.5 (Basics: matrix facts) |
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 →