Exercise 4.4 · Q11: Inverse of a matrix with and
Find the inverse of the matrix (if it exists):
Let be the given matrix.
Expanding along :
Since , exists.
Cofactors, :
, the given matrix.
Want the reason behind every step, the basics and the checks?
Use . The identity makes for every angle , so the inverse always exists. Working out the adjoint shows , so : this matrix undoes itself.
- Given
- above, with , , , , and zeros elsewhere in row 1 and column 1. is any real angle.
- To find
- , if it exists.
- Plan
- (1) Compute using . (2)–(4) All nine minors and cofactors. (5) Matrix of cofactors and its transpose . (6) Divide by . (7) Check .
Basics you need
For every real : the point lies on the unit circle, so by Pythagoras its coordinates satisfy . Basics: algebra the chapter leans on
Row 1 is : two of its three terms vanish, so expanding along it leaves a single determinant (Section 4.2.3, Remarks). Lesson: expanding a 3 × 3 determinant
deletes row and column ; , with signs / / . Basics: the + − + sign pattern
is the transpose of ; if , (Definition 3, Theorem 4). Basics: why the inverse divides by |A|
Solution
Compute
Row 1 is , the row with the most zeros. Expand along it; its signs are :
So . This is non-zero for every , so always exists.
The entries depend on , so a priori might vanish for some angles and the answer would be "exists only when …". The identity removes completely, so no case analysis is needed. The minus sign in front of in position is what turns the product of the diagonal into .Pythagorean identity. Basics: algebra the chapter leans onCofactors of row 1
Deleting column 2 or column 3 leaves part of column 1, whose lower entries are both . A determinant with a whole column of zeros is . In detail, and .Cofactors of row 2
has a row of zeros (what is left of row 1), so it is . deletes row 2 and column 2, leaving rows 1, 3 and columns 1, 3: . deletes row 2 and column 3, leaving rows 1, 3 and columns 1, 2: . Position has , odd, so its sign is .Cofactors of row 3
deletes row 3 and column 2, leaving rows 1, 2 and columns 1, 3, that is over . keeps the top-left block. Test: row 2 of times its own cofactors is , which is , as it must be.Row times its own cofactors gives (Remark, Section 4.4). Lesson: minors and cofactorsMatrix of cofactors and
Transposing swaps entry with entry . Here the only off-diagonal pair that is not zero is , so the matrix is symmetric and the transpose changes nothing:
Even when the transpose turns out to change nothing, it must be checked: it is part of the definition of . Compare with : every entry of is the negative of the matching entry of , so .A matrix equal to its own transpose is symmetric. Basics: transpose and identity · Lesson: the adjointDivide by
This is itself: .
Theorem 4 gives . Since and , the two minus signs cancel. A matrix that is its own inverse satisfies , which we check next.Check:
Both factors are . Write for and for to keep the rows short. Row 1 of is , so row 1 of the product is row 1 of the second factor, . Likewise column 1 of the second factor is , so . The remaining four entries:
(using in and ). So
Drawn for . The lower-right block of reflects the -plane in the line at angle , and row 1 keeps the first coordinate fixed. A reflection undone by itself is why . The product confirms the inverse for every , because it only uses and , which hold for all angles. The figure gives the geometric reason: is a mirror reflection (in the last two coordinates), and doing a reflection twice returns every point to where it started. To see that the block really is a reflection, write , so . By the formulas for and , the block sends to , which is itself, and sends to , its negative. So it fixes every point of the violet line and reverses the direction perpendicular to it, which is exactly what a reflection in that line does.Row times column, then the Pythagorean identity. Basics: matrix facts the chapter uses
for every , so the inverse always exists, and
(Textbook answer: the same matrix.)
Take , as in the figure: , . Then and , so is about , that is ✓. Apply to the column : the result is column 2 of , that is . Apply again: the middle entry is , about , which is , and the last is minus , which is . We are back at ✓. At the matrix is diagonal with , and its square is diagonal with , all equal to 1, so it is ✓.
- Getting . The entry is , so the diagonal product is , and then is subtracted: .
- Dropping the sign of or . Positions and are "minus" places, so both cofactors are .
- Saying the inverse exists "only for some ". does not depend on at all.
- Forgetting to divide by . is not the inverse; .
- With trigonometric entries, simplify the determinant with an identity before deciding where it is zero; here makes it constant.
- A row like makes both the determinant and most cofactors quick.
- If , then . Reflections are the typical example.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| for all real | Steps 1, 4, 7 | Pythagorean identity (Class 11, Trigonometric Functions) |
| Expansion of a determinant along a row; choose the row with most zeros | Step 1 | Section 4.2.3 and its Remarks (Lesson: expanding) |
| Minor and cofactor | Steps 2–4 | Definitions 1 and 2, Section 4.4 (Lesson: minors and cofactors) |
| Row times its own cofactors | Step 4 | Remark, Section 4.4 |
| = transpose of | Step 5 | Definition 3, Section 4.5.1 (Lesson: the adjoint) |
| when | Step 6 | Theorem 4, Section 4.5 (Lesson: inverse) |
| Row-times-column rule for products | Step 7 | Chapter 3, Section 3.4.5 |
| and formulas | Step 7 (why the figure shows a reflection) | Class 11, Trigonometric Functions |
| Figure coordinates, the decimal check, all cofactors | Step 7, 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 →