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

JEE Advanced 2025 Mathematics question — Adjoint and inverse of a matrix

Consider the matrix

P=(200020003).P = \begin{pmatrix} 2 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 3 \end{pmatrix}.

Let the transpose of a matrix XX be denoted by XTX^T. Then the number of 3×33 \times 3 invertible matrices QQ with integer entries, such that

Q−1=QTandPQ=QP,Q^{-1} = Q^T \quad \text{and} \quad PQ = QP,

is

SOLUTION

The two conditions on the integer matrix QQ are

1. Q−1=QTQ^{-1}=Q^{T}    ⇒\Rightarrow  QQ is an orthogonal matrix with integer entries.
2. PQ=QPPQ=QP with P=(200020003)P=\begin{pmatrix}2&0&0\\0&2&0\\0&0&3\end{pmatrix}.

Step 1: Characterise all 3×33\times3 integer orthogonal matrices.
If QQ is orthogonal and its entries are integers, each row (and each column) is a unit vector whose components are integers. The only integer vectors of length 1 are the six vectors(±1,0,0),  (0,±1,0),  (0,0,±1).(\pm1,0,0),\;(0,\pm1,0),\;(0,0,\pm1).Hence every row and every column of QQ contains exactly one entry ±1\pm1 and the rest are zeros. Such matrices are called signed permutation matrices.

The total number of signed permutation matrices of order 3 is 3!×23=6×8=483!\times2^{3}=6\times8=48 (choose a permutation of the columns and then choose the sign of the non-zero entry in each column).

Step 2: Impose the commutation condition PQ=QPPQ=QP.
Write Q=(qij)Q=(q_{ij}). From PQ=QPPQ=QP we get, for every pair (i,j),(i,j), Pii qij=qij Pjj.P_{ii}\,q_{ij}=q_{ij}\,P_{jj}.
Because P=diag(2,2,3),P=\text{diag}(2,2,3), this gives (Pii−Pjj) qij=0∀ i,j.(P_{ii}-P_{jj})\,q_{ij}=0\quad\forall\,i,j. Whenever Pii≠Pjj,P_{ii}\neq P_{jj}, the factor Pii−PjjP_{ii}-P_{jj} is non-zero, forcing q_{ij}=0.$</p> <p>Thus every entry mixing the first two coordinates with the third coordinate must vanish:q_{13}=q_{23}=q_{31}=q_{32}=0.ThereforeThereforeQhastheblock−diagonalformhas the block-diagonal formQ=\begin{pmatrix} \ast & \ast & 0\\ \ast & \ast & 0\\ 0 & 0 & \ast \end{pmatrix},wheretheasterisksaretheremainingpossiblewhere the asterisks are the remaining possible±\pm1oror0entries.</p><p><u>Step 3: Counttheadmissiblesignedpermutationmatricesthatsatisfytheblockstructure.</u><br/>•Thelower−rightentries.</p> <p><u>Step 3: Count the admissible signed permutation matrices that satisfy the block structure.</u><br /> • The lower-right1×\times1blockmustbeblock must be±\pm1(twochoices).<br/>•Theupper−left(two choices).<br /> • The upper-left2×\times2blockmustitselfbeasignedpermutationmatrix(tokeeporthogonalityandtomakeeachcolumn/rowhaveexactlyonenon−zeroentry).<br/>  −Thereareblock must itself be a signed permutation matrix (to keep orthogonality and to make each column/row have exactly one non-zero entry).<br />   - There are2! = 2waystopermutethetwocolumns.<br/>  −Independently,eachofthetwonon−zeroentriescanbeways to permute the two columns.<br />   - Independently, each of the two non-zero entries can be+1oror-1,giving, giving2^{2}=4signchoices.</p><p>Hencethenumberofpossiblesign choices.</p> <p>Hence the number of possible2×\times2blocksisblocks is2×\times4=8.<br/>Multiplyingbythetwochoicesinthe.<br /> Multiplying by the two choices in the1×\times1block,weobtainthefinalcountblock, we obtain the final count8×\times2 = 16.</p><p><u>Step 4: Conclusion.</u><br/>Exactly</p> <p><u>Step 4: Conclusion.</u><br /> Exactly16integermatricesinteger matricesQsatisfybothsatisfy bothQ^{-1}=Q^{T}andandPQ=QP.</p><p>Option Cwhichis:.</p> <p>Option C which is:16$$

Tagged Adjoint and inverse of a matrix. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicAdjoint and inverse of a matrix
TypeMultiple choice