Question

An \( n \times n \) matrix is formed using 0, 1 and -1 as its elements. The number of such matrices which are skew symmetric is:

• A. \( \frac{n(n-1)}{2} \)
• B. \( (n-1)^2 \)
• C. \( 2^{n(n-1)/2} \)
• D. \( 3^{n(n-1)/2} \)

Hint:

For skew symmetric matrices, set diagonal elements to 0 and use the condition \( a_{ij} = -a_{ji} \). Count the independent off-diagonal elements (\( \frac{n(n-1)}{2} \)) and compute the number of choices for each.

Answer 1

The Correct Option is D

Step 1: Definition of a skew symmetric matrix.
A matrix \( A \) is skew symmetric if \( A^T = -A \). This means \( a_{ij} = -a_{ji} \) for all \( i, j \) in an \( n \times n \) matrix. Also, the diagonal elements \( a_{ii} = 0 \).
Step 2: Number of independent elements.
In a skew symmetric matrix:
The diagonal elements \( a_{ii} \) (from \( i = 1 \) to \( n \)) must be 0.
For off-diagonal elements \( a_{ij} \) (where \( i \neq j \)), \( a_{ij} = -a_{ji} \). Each pair \( (a_{ij}, a_{ji}) \) is determined by a single value \( a_{ij} \).
The number of unique off-diagonal pairs \( (i, j) \) where \( i<j \) is given by: \[ \binom{n}{2} = \frac{n(n-1)}{2}. \]
Step 3: Value assignment using 0, 1, and -1.
Each independent off-diagonal element \( a_{ij} \) (for \( i<j \)) can be 0, 1, or -1. The corresponding \( a_{ji} = -a_{ij} \):
If \( a_{ij} = 0 \), then \( a_{ji} = 0 \).
If \( a_{ij} = 1 \), then \( a_{ji} = -1 \).
If \( a_{ij} = -1 \), then \( a_{ji} = 1 \).
Each pair \( (i, j) \) with \( i<j \) has 3 choices for \( a_{ij} \). The total number of skew symmetric matrices is: \[ 3^{\frac{n(n-1)}{2}}. \]
Step 4: Verification with an example.
For \( n = 1 \), the matrix is \( [a_{11}] \), where \( a_{11} = 0 \). There is \( 3^{1(1-1)/2} = 3^0 = 1 \) matrix.
For \( n = 2 \), the matrix is: \[ \begin{bmatrix} 0 & a_{12}
-a_{12} & 0 \end{bmatrix}, \] where \( a_{12} \) can be 0, 1, or -1, resulting in \( 3^{2(2-1)/2} = 3^1 = 3 \) matrices, which matches the calculation.
Step 5: Select the correct answer.
The number of skew symmetric matrices is \( 3^{\frac{n(n-1)}{2}} \), which corresponds to option (D).