Q.If and are symmetric matrices, then
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 symmetric matrices and , the commutator is always skew-symmetric, while is neither symmetric nor skew-symmetric in general — it is simply an arbitrary matrix.
Why This Approach Works
The key idea is simple: a symmetric matrix equals its own transpose, and a skew-symmetric matrix equals the negative of its transpose. When you multiply symmetric matrices, the transpose of the product reverses the order: (since , ). So the transpose of is , not itself. This reversal is the engine behind the entire problem.
We are asked to classify two expressions: and . The first is a classic commutator — its behaviour under transpose is well-known. The second is a linear combination that does not have a standard name. We will check each by taking its transpose and comparing with the original.
A common mistake is to assume is symmetric just because and are. That is false unless and commute. Always remember: , not .
Step-by-Step Solution
1. Recall the definitions
A matrix is symmetric if .
A matrix is skew-symmetric if .
Given: and .
2. Transpose of a product
For any matrices of compatible sizes:
Since and are symmetric, this becomes:
This is the only fact you need. The transpose flips the order, and symmetry removes the transposes on the individual matrices.
3. Analyse
Let . Take its transpose:
But . So:
This is exactly the definition of a skew-symmetric matrix.
For symmetric and , the commutator is always skew-symmetric:
Thus, the first blank is skew-symmetric.
4. Analyse
Let . Take its transpose:
Now compare with :
- For to be symmetric, we would need , i.e. .
- For to be skew-symmetric, we would need , i.e. . …
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.