Q.Find the values of if the matrix satisfy the equation .
For an orthogonal matrix, gives nine equations from equating entries. Solving them yields , , , with the sign pattern constrained by the off-diagonal equations.
The condition is the definition of an orthogonal matrix — its columns (and rows) form an orthonormal set. That means each column vector has length 1, and any two distinct columns are perpendicular (dot product zero). This is a powerful geometric check: we don't need to multiply the full matrices blindly; we can work column by column.
Let’s denote the columns of as:
The condition is equivalent to:
We’ll solve systematically.
- Column 1 with itself (norm squared = 1):
- Column 2 with itself:
- Column 3 with itself:
So far we have magnitudes. Now we need the sign relationships from dot products between different columns.
- Column 1 dot Column 2 = 0:
This is automatically 0 for any — no constraint. Good.
- Column 1 dot Column 3 = 0:
Also automatically satisfied. So column 1 is orthogonal to both 2 and 3 regardless of signs.
- Column 2 dot Column 3 = 0 — this is the only nontrivial orthogonality condition:
Again, it simplifies to — automatically satisfied! So all off-diagonal dot products vanish for any choice of signs.
A common mistake is to think the off-diagonal equations impose sign restrictions. Here they don’t — the structure of makes them vanish identically. But always check: if they hadn’t, signs would be linked.
Thus the only constraints are the three norm equations. So the signs of , , and are independent of each other.
When and is square, is orthogonal and also holds automatically. But here we only needed — the column orthonormality is sufficient.
The values are , , , with all sign choices independent.
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.