Exercise 3.3 · Q6: Verify for two rotation-type matrices
(i) If
then verify that .
(ii) If
then verify that .
(i)
Let . Then
(ii)
Let . Then
Want the reason behind every step, the basics and the checks?
The entry of is row of times column of . But row of is column of . So the diagonal entries of are "a column times itself", which here is , and the off-diagonal entries are "column 1 times column 2", whose two terms cancel to 0. That is exactly the identity matrix.
- Given
- Two matrices whose entries are and , for any real .
- To show
- , the identity matrix, in each case.
- Plan
- For each part: (1) write ; (2) check the product is defined and is ; (3) compute each of the four entries as a row-times-column sum; (4) simplify with ; (5) compare with .
Basics you need
Entry of a product is row of the first matrix times column of the second: pair the entries, multiply, add. For matrices each entry is a sum of two products. Basics: pair up, multiply, add
. For a matrix this swaps the two off-diagonal entries. Basics: reading a table sideways
for every real . It comes from the point lying on the unit circle . Basics: trigonometric tools
has 1 on the main diagonal and 0 elsewhere. For order 2 its entries are 1, 0, 0, 1. Basics: identity and undo
Part (i)
(i) Write and check orders
Rows of become columns: row 1 becomes column 1, row 2 becomes column 2.
and are both : columns of (2) = rows of (2), so is defined and is , the same order as .
Transpose, Definition 3; product orders, Section 3.4.5. Lesson: transpose(i) Compute the four entries of
Row of times column of . Column 1 of is ; column 2 is .
In and the two products are the same number with opposite signs, because multiplication of numbers is commutative (). So they cancel for every , with no trigonometric identity needed. The diagonal entries need the Pythagorean identity (Basic 3).Row-times-column rule, Section 3.4.5 (Basic 1). Basics: pair up, multiply, add(i) Assemble and compare with
Every entry matches the identity matrix of order 2, so for every real .
The identity matrix (Basic 4), Section 3.3 (Lesson: types of matrices).
Part (ii)
(ii) Write and check orders
Row 1 of , , becomes column 1; row 2, , becomes column 2:
As before, is defined and is .
(ii) Compute the four entries of
Column 1 of is ; column 2 is .
This matrix is the matrix of Part (i) with and interchanged. The same two facts do all the work: the diagonal entries are , and the off-diagonal products cancel in pairs.(ii) Assemble and compare with
So for every real in Part (ii) as well.
A matrix with is one whose columns each have "length" 1 () and are "perpendicular" to each other (their row-times-column product is 0). In both parts, the two columns are and , or the same with sin and cos swapped, which have exactly this property. (One can check in the same way that too, though the question does not ask for it.)Pythagorean identity (Basic 3). Basics: trigonometric tools
In both (i) and (ii), the entries of are and , so
for every real .
Take (radians): and . Then
- and , which add to , giving ;
- , and . ✓
- Forgetting a minus sign in . Transposing moves from position (2,1) to (1,2); it keeps its sign.
- Squaring a negative incorrectly. .
- Multiplying entry by entry. is not obtained by multiplying matching entries; each entry is a row-times-column sum.
- Row of is column of , so collects "column times column" products of .
- turns the diagonal entries into 1; the off-diagonal terms cancel in pairs.
- Matrices with appear again later: their inverse is simply their transpose.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Transpose | Part (i), Step 1; Part (ii), Step 1 | Definition 3, Section 3.5 (Lesson: transpose) |
| Product defined for by ; entry = row times column | Part (i), Step 2; Part (ii), Step 2 | Section 3.4.5 (Lesson: multiplication) |
| Diagonal entries in both parts | Trigonometry, Class XI (Basics) | |
| Identity matrix | Part (i), Step 3; Part (ii), Step 3 | Section 3.3, types of 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 →