Q.If
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →For both matrices, the product equals the identity matrix because the rows of each are orthonormal — they are orthogonal matrices representing rotations. The verification reduces to using and checking that off-diagonal terms cancel.
Why this works: Orthogonal Matrix Verification
A matrix is called orthogonal if (or equivalently ). Geometrically, orthogonal matrices preserve lengths and angles — they represent rotations or reflections. The key condition is that the rows (or columns) of must be unit vectors that are perpendicular to each other.
For a matrix, this means:
- Each row has length : the sum of squares of its entries equals .
- The dot product of the two rows equals .
Both matrices given are classic rotation matrices (the first rotates by , the second by with a sign twist). So we expect to hold for all .
Part (i):
Step 1: Write down (the transpose).
Transpose swaps rows and columns:
Step 2: Multiply .
We compute the product:
Multiply entry by entry:
- Top-left:
- Top-right:
- Bottom-left:
- Bottom-right:
So:
A common mistake is to compute instead of . For orthogonal matrices, both equal , but the problem specifically asks for . Always check the order.
Part (ii):
Step 1: Write .
Step 2: Multiply . …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.