If the matrix A is both symmetric and skew symmetric, then (A) A is a diagonal matrix (B) A is a zero matrix (C) A is a square matrix (D) None of these
CBSE Class 12 Maths · Matrices
CBSE Class 12 Maths · Matrices
Imagine a magic mirror that can do two opposite things at once. One rule says the mirror shows your exact reflection, and another rule says it flips everything to the opposite. If both rules must be true together, the only way out is if there is nothing to reflect at all! A matrix that is both symmetric and skew-symmetric is like that mirror with nothing in it. Every number inside the matrix must be zero, because any non-zero number cannot equal both itself and its own negative at the same time.
Answer: Option (B): \(A\) is a zero matrix, since the only matrix satisfying \(A^{T} = A\) and \(A^{T} = -A\) together is \(A = 0\).
A square matrix \(A\) is called symmetric if it equals its own transpose, that is \(A^{T} = A\). A square matrix \(A\) is called skew-symmetric if its transpose equals its negative, that is \(A^{T} = -A\). The question asks what happens when a single matrix satisfies BOTH conditions at the same time. If both equations hold, we can equate the two expressions for \(A^{T}\) and see what constraint this puts on the entries of \(A\). This is a standard property used throughout the Matrices chapter.
Symmetric: \(A^{T} = A\). Skew-symmetric: \(A^{T} = -A\).
Option (B): \(A\) is a zero matrix, since the only matrix satisfying \(A^{T} = A\) and \(A^{T} = -A\) together is \(A = 0\).
A common mistake is to think the answer is a diagonal matrix. While a skew-symmetric matrix has zero diagonal entries, being symmetric as well forces ALL entries (not just off-diagonal ones) to be zero, so the matrix must be the zero matrix.
Option (B): \(A\) is a zero matrix, since the only matrix satisfying \(A^{T} = A\) and \(A^{T} = -A\) together is \(A = 0\).
One common mistake: Students sometimes think a matrix can be both symmetric and skew-symmetric with non-zero entries, forgetting to equate the two expressions for \( A^{T} \) and work through the algebra that forces \( 2A = 0 \), hence \( A = 0 \).
Answer: Option (B): \(A\) is a zero matrix, since the only matrix satisfying \(A^{T} = A\) and \(A^{T} = -A\) together is \(A = 0\).
Question: Let B be a square matrix such that B is both symmetric and skew-symmetric. What can you conclude about B? Choose the correct option: (A) B is an identity matrix (B) B is a diagonal matrix (C) B is a zero matrix (D) B is an invertible matrix
Solution: Since B is symmetric, we have \[B^T = B\] Since B is skew-symmetric, we have \[B^T = -B\] From both conditions together: \[B = -B\] Adding B to both sides: \[2B = O\] Dividing both sides by 2: \[B = O\] Thus every element of B is zero, so B must be the zero matrix.
Answer: (C) B is a zero matrix
Question: A square matrix C satisfies both \(C^T = C\) and \(C^T = -C\). If \(c_{ij}\) denotes the element in the \(i\)-th row and \(j\)-th column of C, find the value of \(c_{ij}\) for all i and j. Also state what type of matrix C must be.
Solution: Since C is symmetric: \[C^T = C \quad \Rightarrow \quad c_{ji} = c_{ij} \text{ for all } i, j\] Since C is skew-symmetric: \[C^T = -C \quad \Rightarrow \quad c_{ji} = -c_{ij} \text{ for all } i, j\] Substituting the first result into the second: \[c_{ij} = -c_{ij}\] Adding \(c_{ij}\) to both sides: \[2c_{ij} = 0\] Dividing by 2: \[c_{ij} = 0 \text{ for all } i \text{ and } j\] Since every element of C equals zero, C must be the zero matrix.
Answer: \(c_{ij} = 0\) for all i and j; C is the zero matrix.
Question: Let \(A\) be an \(n \times n\) matrix such that \(A\) is skew-symmetric. If it is further given that \(A = A^{T}\) (i.e. \(A\) is also symmetric), which of the following is necessarily true? (A) \(A\) is an identity matrix (B) \(A\) is a diagonal matrix with non-zero entries (C) \(A\) must be a singular matrix but not necessarily zero (D) Every element of \(A\) must be zero, i.e. \(A\) is the zero matrix
Answer: Option (D): Every element of \(A\) must be zero, i.e. \(A\) is the zero matrix. This follows because \(A^{T} = A\) and \(A^{T} = -A\) together imply \(A = -A\), giving \(2A = O\) and hence \(A = O\).