RankRizz
JEE ADVANCED 2024 · PAPER 1+3 / −1HARDTRANSCRIBED

JEE Advanced 2024 Mathematics question — Transpose, symmetric and skew-symmetric matrices

Let α\alpha and β\beta be the distinct roots of the equation x2+x−1=0x^2 + x - 1 = 0. Consider the set T={1,α,β}T = \{1, \alpha, \beta\}. For a 3×33 \times 3 matrix M=(aij)3×3M = (a_{ij})_{3 \times 3}, define Ri=ai1+ai2+ai3R_i = a_{i1} + a_{i2} + a_{i3} and Cj=a1j+a2j+a3jC_j = a_{1j} + a_{2j} + a_{3j} for i=1,2,3i = 1, 2, 3 and j=1,2,3j = 1, 2, 3.

Match each entry in List-I to the correct entry in List-II.

List-IList-II
(P)The number of matrices M=(aij)3×3M = (a_{ij})_{3 \times 3} with all entries in TT such that Ri=Cj=0R_i = C_j = 0 for all i,ji, j is(1)1
(Q)The number of symmetric matrices M=(aij)3×3M = (a_{ij})_{3 \times 3} with all entries in TT such that Cj=0C_j = 0 for all jj is(2)12
(R)Let M=(aij)3×3M = (a_{ij})_{3 \times 3} be a skew symmetric matrix such that aij∈Ta_{ij} \in T for i>ji \gt j. Then the number of elements in the set {(xyz):x,y,z∈R,M(xyz)=(a120−a23)}\left\{\begin{pmatrix} x \\ y \\ z \end{pmatrix} : x, y, z \in R, M\begin{pmatrix} x \\ y \\ z \end{pmatrix} = \begin{pmatrix} a_{12} \\ 0 \\ -a_{23} \end{pmatrix}\right\} is(3)Infinite
(S)Let M=(aij)3×3M = (a_{ij})_{3 \times 3} be a matrix with all entries in TT such that Ri=0R_i = 0 for all ii. Then the absolute value of the determinant of MM is(4)6
(5)0
SOLUTION

The quadratic x2+x−1=0x^{2}+x-1=0 has distinct roots α, β\alpha,\,\beta satisfying the Vieta relations α+β=−1\alpha+\beta=-1 and αβ=−1\alpha\beta=-1. Consequently 1+α+β=01+\alpha+\beta=0, a fact that will be used repeatedly.

Case P (row and column sums zero, no symmetry condition):

Let a row be (t1,t2,t3)(t_{1},t_{2},t_{3}) with each tk∈T={1,α,β}t_{k}\in T=\{1,\alpha,\beta\} and t1+t2+t3=0t_{1}+t_{2}+t_{3}=0. Write the counts of 1,α,β1,\alpha,\beta in the row as (n1,nα,nβ)(n_{1},n_{\alpha},n_{\beta}). Then n1+nα+nβ=3n_{1}+n_{\alpha}+n_{\beta}=3 and n1−nβ+α ⁣(nα−nβ)=0.n_{1}-n_{\beta}+\alpha\!\left(n_{\alpha}-n_{\beta}\right)=0. Since 1,α1,\alpha are linearly independent over Q\mathbb{Q}, we must have n1=nα=nβ=1.n_{1}=n_{\alpha}=n_{\beta}=1. Thus every row is a permutation of (1,α,β)(1,\alpha,\beta), and the same holds for every column.

A 3×33\times3 array in which each row and column contains every symbol exactly once is a Latin square of order 33. For a fixed first row there are exactly 22 such squares; there are 3!=63!=6 possible first rows, giving 6×2=126\times2=12 matrices.

Therefore P→12  .P\rightarrow 12\;.

Case Q (symmetric matrices with column sums zero):

Because the matrix is symmetric, row sums equal column sums, so every row also sums to 00 and hence is a permutation of (1,α,β)(1,\alpha,\beta). Let the diagonal be (d1,d2,d3)(d_{1},d_{2},d_{3}). If any two diagonal entries were equal, the corresponding column would repeat that entry, violating the “one-of-each’’ rule; therefore d1,d2,d3d_{1},d_{2},d_{3} are all distinct. There are 3!=63!=6 ways to choose this ordered diagonal.

Once the diagonal is fixed, the (i,j)(i,j)-entry for i<ji\lt j must be the unique element of TT different from did_{i} and djd_{j}, and symmetry forces the (j,i)(j,i)-entry to be the same. Hence the rest of the matrix is determined uniquely.

Thus there are 66 symmetric matrices, so Q→6  .Q\rightarrow 6\;.

Case R (skew-symmetric matrix and a linear system):

A 3×33\times3 skew-symmetric matrix is of the form M=(0bc−b0d−c−d0),M=\begin{pmatrix}0&b&c\\-b&0&d\\-c&-d&0\end{pmatrix}, where b,c,d∈Tb,c,d\in T (because the entries below the diagonal are required to lie in TT). The given system is M(xyz)=(b0−d).M\begin{pmatrix}x\\y\\z\end{pmatrix}= \begin{pmatrix}b\\0\\-d\end{pmatrix}.

The second column of MM is [b, 0, −d] ⁣T\bigl[b,\,0,\,-d\bigr]^{\!T}, exactly the required right-hand side. Since the rank of a 3×33\times3 skew-symmetric matrix is 00 or 22 (it is never full), this right-hand side is always in the column space, so the system is consistent. Because the rank is 22, the solution space has dimension 3−2=13-2=1, containing infinitely many vectors.

Hence the set in question is infinite, so R→Infinite  .R\rightarrow \text{Infinite}\;.

Case S (row sums zero, determinant):

Each row sums to 00, so (as in Case P) every row is a permutation of (1,α,β)(1,\alpha,\beta). Thus every row lies in the plane x+y+z=0x+y+z=0, a 22-dimensional subspace of R3\mathbb{R}^{3}. Three vectors confined to a plane are necessarily linearly dependent, so the matrix is singular and its determinant is 00.

Therefore S→0  .S\rightarrow 0\;.

Collecting the results:
(P) →\to 12 (Option 2), (Q) →\to 6 (Option 4), (R) →\to Infinite (Option 3), (S) →\to 0 (Option 5)

The option that matches this combination is
Option C: (P) →\rightarrow (2), (Q) →\rightarrow (4), (R) →\rightarrow (3), (S) →\rightarrow (5).

Tagged Transpose, symmetric and skew-symmetric matrices. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicTranspose, symmetric and skew-symmetric matrices
TypeMultiple choice