HOME/NOTES/CONCEPT

Matrices for JEE: Types, Powers, Transpose and Inverse

Ritesh Raj · 3 Nov 2026
Aa
20 min read14 sectionsConcept

A matrix is a rectangular arrangement of numbers that is handled as one object. You add matrices, multiply them, take powers of them and invert them, and the rules look like ordinary algebra with two important differences: the order of multiplication matters, and a product can be zero when neither factor is zero.

This note builds the chapter in the order JEE uses it: what a matrix is, the special types, the operations, transpose and the symmetric and skew-symmetric split, powers, the equation every 2×22\times2 matrix satisfies, the inverse, and elementary row operations. Every worked example is a JEE Main 2026 or JEE Advanced 2026 question unless it says otherwise, and every answer was re-derived from scratch.

What a matrix is

A matrix with mm rows and nn columns is said to have order m×nm\times n. The entry in row ii and column jj is written aija_{ij}, and the whole matrix is written A=[aij]m×nA=[a_{ij}]_{m\times n}.

A 3 by 4 matrix with row 2 and column 3 shaded and the entry a23 marked where they cross
A=[a11a12a13a21a22a23]2×3A=\begin{bmatrix}a_{11}&a_{12}&a_{13}\\a_{21}&a_{22}&a_{23}\end{bmatrix}_{2\times3}

The first index is always the row and the second is always the column. A matrix of order m×nm\times n has mnmn entries, so if each entry can be chosen from a set of kk numbers, the number of such matrices is

kmnk^{mn}

Two matrices are equal only when they have the same order and every corresponding entry is equal. So one matrix equation of order m×nm\times n is really mnmn ordinary equations.

Counting with a condition

When a question counts matrices with a condition, write the condition entry by entry first. It almost always becomes a condition on a sum of squares, a product of two entries, or a fixed trace, and the count becomes ordinary permutations and combinations.

Types of matrices

TypeConditionExample of order 3
Row matrixone row, order 1×n1\times n[140]\begin{bmatrix}1&4&0\end{bmatrix}
Column matrixone column, order m×1m\times1[205]\begin{bmatrix}2\\0\\5\end{bmatrix}
Square matrixm=nm=norder 3×33\times3
Zero matrix OOevery entry 00O3×3O_{3\times3}
Diagonalsquare, aij=0a_{ij}=0 for i≠ji\ne jdiag⁡(2,−1,5)\operatorname{diag}(2,-1,5)
Scalardiagonal with equal diagonal entriesdiag⁡(k,k,k)=kI\operatorname{diag}(k,k,k)=kI
Identity IIscalar with k=1k=1diag⁡(1,1,1)\operatorname{diag}(1,1,1)
Upper triangularsquare, aij=0a_{ij}=0 for i>ji>jzeros below the diagonal
Lower triangularsquare, aij=0a_{ij}=0 for i<ji<jzeros above the diagonal
Five 3 by 3 matrices side by side: diagonal, scalar, identity, upper triangular and lower triangular, with the zero entries shown faint

In a square matrix the entries a11,a22,…,anna_{11},a_{22},\ldots,a_{nn} form the principal diagonal, and their sum is the trace:

tr⁡(A)=a11+a22+⋯+ann\operatorname{tr}(A)=a_{11}+a_{22}+\cdots+a_{nn}

Trace is linear and does not care about the order of a product:

tr⁡(A+B)=tr⁡A+tr⁡B\operatorname{tr}(A+B)=\operatorname{tr}A+\operatorname{tr}B tr⁡(kA)=ktr⁡A\operatorname{tr}(kA)=k\operatorname{tr}A tr⁡(AB)=tr⁡(BA)\operatorname{tr}(AB)=\operatorname{tr}(BA)

Addition, scalar multiple and product

Matrices of the same order are added entry by entry, and kAkA multiplies every entry by kk. Addition is commutative and associative, OO is the additive identity, and k(A+B)=kA+kBk(A+B)=kA+kB.

The product ABAB is defined only when the number of columns of AA equals the number of rows of BB. If AA is m×nm\times n and BB is n×pn\times p, then ABAB is m×pm\times p and

(AB)ij=ai1b1j+ai2b2j+⋯+ainbnj(AB)_{ij}=a_{i1}b_{1j}+a_{i2}b_{2j}+\cdots+a_{in}b_{nj}

That is, row ii of AA against column jj of BB, term by term, then add.

Row 2 of A shaded, column 1 of B shaded, and the single entry they produce in AB shaded at row 2 column 1

Multiplication is associative, A(BC)=(AB)CA(BC)=(AB)C, and distributes over addition, A(B+C)=AB+ACA(B+C)=AB+AC. Also AI=IA=AAI=IA=A for a square AA.

Three habits from ordinary algebra that fail for matrices

ABAB and BABA are usually different, even when both exist.

AB=OAB=O does not force A=OA=O or B=OB=O. For example the matrix with rows (1,1)(1,1) and (0,0)(0,0) times the matrix with rows (1,1)(1,1) and (−1,−1)(-1,-1) is OO.

AB=ACAB=AC does not give B=CB=C unless AA is invertible.

So (A+B)2=A2+AB+BA+B2(A+B)^2=A^2+AB+BA+B^2, and it equals A2+2AB+B2A^2+2AB+B^2 only when AB=BAAB=BA.

The column picture

Multiplying a matrix by the standard column e1=[100]Te_1=\begin{bmatrix}1&0&0\end{bmatrix}^T picks out its first column, e2e_2 its second, and e3e_3 its third:

Me1=column 1 of MMe_1=\text{column 1 of }M Me2=column 2 of MMe_2=\text{column 2 of }M

So if a question tells you what MM does to e1e_1, e2e_2, e3e_3, it has handed you MM column by column. Similarly eiTMe_i^TM is row ii of MM.

A 3 by 3 matrix M with its three columns in different shades, and arrows from Me1, Me2, Me3 to the matching columns

Example 1 (JEE Main 2026, 5 April Shift 2). Let MM be a 3×33\times3 matrix such that Me1=[123]TMe_1=\begin{bmatrix}1&2&3\end{bmatrix}^T, Me2=[012]TMe_2=\begin{bmatrix}0&1&2\end{bmatrix}^T and Me3=[−111]TMe_3=\begin{bmatrix}-1&1&1\end{bmatrix}^T, where e1,e2,e3e_1,e_2,e_3 are the standard unit columns. If M[xyz]T=[1711]TM\begin{bmatrix}x&y&z\end{bmatrix}^T=\begin{bmatrix}1&7&11\end{bmatrix}^T, then x+y+zx+y+z equals

Tap an option to check your answer
(1)44
(2)55
(3)77
(4)1111
▸ SHOW SOLUTION

Step 1. Write M column by column

M=[10−1211321]M=\begin{bmatrix}1&0&-1\\2&1&1\\3&2&1\end{bmatrix}

Step 2. Three equations

x−z=1x-z=12x+y+z=72x+y+z=73x+2y+z=113x+2y+z=11

Step 3. Solve

Third minus second:

x+y=4x+y=4

First gives z=x−1z=x-1. Into the second:

3x+y=83x+y=8

So 2x=42x=4, x=2x=2, y=2y=2, z=1z=1.

x+y+z=5x+y+z=5

Answer: (2) 55

Transpose

The transpose ATA^T is obtained by turning the rows of AA into columns. If AA is m×nm\times n, then ATA^T is n×mn\times m and (AT)ij=aji(A^T)_{ij}=a_{ji}.

A 2 by 3 matrix and its 3 by 2 transpose, with the first row of A and the first column of the transpose in the same shade
(AT)T=A,(kA)T=kAT(A^T)^T=A,\quad (kA)^T=kA^T (A+B)T=AT+BT(A+B)^T=A^T+B^T (AB)T=BTAT(AB)^T=B^TA^T

The order reverses in the last rule. For three factors, (ABC)T=CTBTAT(ABC)^T=C^TB^TA^T.

One identity is worth keeping ready. The (j,j)(j,j) entry of ATAA^TA is column jj of AA against itself, which is the sum of the squares of that column. Adding over all jj:

tr⁡(ATA)=∑i,jaij2\operatorname{tr}(A^TA)=\sum_{i,j}a_{ij}^2

So tr⁡(ATA)\operatorname{tr}(A^TA) is the sum of the squares of every entry of AA, and it is 00 only when A=OA=O.

Example 2 (JEE Main 2026, 24 January Shift 1). The number of 3×23\times2 matrices AA which can be formed using the elements of the set {−2,−1,0,1,2}\{-2,-1,0,1,2\} such that the sum of all the diagonal elements of ATAA^TA is 55, is ______.

▸ SHOW SOLUTION

Step 1. Turn the condition into a sum of squares

AA has 66 entries and

tr⁡(ATA)=5\operatorname{tr}(A^TA)=5

which is the sum of the squares of all 66 entries.

Each square is 00, 11 or 44.

Step 2. List the ways to make 5

Five squares equal to 11 and one equal to 00, or one 44, one 11 and four 00s.

Step 3. Count each case

Five entries ±1\pm1 and one 00: choose the place of 00 in 66 ways, signs in 252^5 ways.

6×32=1926\times32=192

One entry ±2\pm2, one entry ±1\pm1, rest 00: places in 6×56\times5 ways, signs in 2×22\times2 ways.

30×4=12030\times4=120

Step 4. Add

192+120=312192+120=312

Answer: 312312

Symmetric and skew-symmetric matrices

A square matrix is symmetric if AT=AA^T=A, that is aij=ajia_{ij}=a_{ji}, and skew-symmetric if AT=−AA^T=-A, that is aij=−ajia_{ij}=-a_{ji}.

Putting i=ji=j in the skew condition gives aii=−aiia_{ii}=-a_{ii}, so every diagonal entry of a skew-symmetric matrix is 00.

A symmetric matrix with mirror-image entries across the diagonal, and a skew-symmetric matrix with zeros on the diagonal and opposite entries across it

Every square matrix splits in exactly one way into a symmetric part and a skew-symmetric part:

A=A+AT2+A−AT2A=\frac{A+A^T}{2}+\frac{A-A^T}{2}

Proof. Put P=A+AT2P=\dfrac{A+A^T}{2} and Q=A−AT2Q=\dfrac{A-A^T}{2}. Then PT=AT+A2=PP^T=\dfrac{A^T+A}{2}=P and QT=AT−A2=−QQ^T=\dfrac{A^T-A}{2}=-Q, and P+Q=AP+Q=A. If also A=P1+Q1A=P_1+Q_1 with P1P_1 symmetric and Q1Q_1 skew, taking transposes gives AT=P1−Q1A^T=P_1-Q_1, so P1=A+AT2=PP_1=\dfrac{A+A^T}{2}=P and Q1=QQ_1=Q.

Facts that come up often:

  • A+ATA+A^T is symmetric and A−ATA-A^T is skew-symmetric, for any square AA.
  • AATAA^T and ATAA^TA are symmetric for any AA, square or not.
  • If AA and BB are symmetric, ABAB is symmetric exactly when AB=BAAB=BA.
  • For any BB, BTABB^TAB is symmetric when AA is symmetric and skew-symmetric when AA is skew.

Example 3 (IITianForum). How many symmetric matrices of order 33 have every entry from {−1,0,1}\{-1,0,1\} and trace 00?

▸ SHOW SOLUTION

Step 1. Count the free entries

A symmetric 3×33\times3 matrix is fixed by its 33 diagonal entries and the 33 entries above the diagonal. The entries below are copies.

Step 2. Above the diagonal

Any values:

33=273^3=27

Step 3. The diagonal

Three entries from {−1,0,1}\{-1,0,1\} adding to 00: all three 00 (one way), or one each of 11, 00, −1-1 in some order (3!=63!=6 ways).

1+6=71+6=7

Step 4. Multiply

7×27=1897\times27=189

Answer: 189189

Example 4 (IITianForum). Let BB be a square matrix with ∣B∣=3\lvert B\rvert=3, and let AA satisfy

3A+B=BT−2AT3A+B=B^T-2A^T

Then ∣A+B∣\lvert A+B\rvert is

Tap an option to check your answer
(1)00
(2)11
(3)33
(4)99
▸ SHOW SOLUTION

Step 1. Collect A on one side

3A+2AT=BT−B(1)3A+2A^T=B^T-B\qquad(1)

Step 2. Transpose

3AT+2A=B−BT(2)3A^T+2A=B-B^T\qquad(2)

Step 3. Add (1) and (2)

5(A+AT)=O  ⟹  AT=−A5(A+A^T)=O\implies A^T=-A

So AA is skew-symmetric.

Step 4. Back into (1)

3A−2A=BT−B  ⟹  A=BT−B3A-2A=B^T-B\implies A=B^T-BA+B=BTA+B=B^T

Step 5. Determinant

∣A+B∣=∣BT∣=∣B∣=3\lvert A+B\rvert=\lvert B^T\rvert=\lvert B\rvert=3

Answer: (3) 33

Transposing the given equation and adding is the standard first move whenever AA and ATA^T appear together.

Orthogonal matrices

A square matrix is orthogonal if

AAT=IAA^T=I

Then ATA^T is the inverse of AA, so ATA=IA^TA=I as well. Read entry by entry, AAT=IAA^T=I says each row has sum of squares 11 and any two different rows have dot product 00. ATA=IA^TA=I says the same for the columns.

Example 5 (JEE Advanced 2026, Paper 1). For real numbers α,β,γ,δ,μ\alpha,\beta,\gamma,\delta,\mu, consider

M=[α12−1213β13γδμ]M=\begin{bmatrix}\alpha&\tfrac{1}{\sqrt2}&-\tfrac{1}{\sqrt2}\\\tfrac{1}{\sqrt3}&\beta&\tfrac{1}{\sqrt3}\\\gamma&\delta&\mu\end{bmatrix}

with MMT=IMM^T=I. Let u⃗\vec u, v⃗\vec v, w⃗\vec w be the vectors whose components are the first, second and third columns of MM. Match List-I with List-II.

List-IList-II
(P) γ2+δ2\gamma^2+\delta^2(1) 00
(Q) if xu⃗+yv⃗+zw⃗=j^x\vec u+y\vec v+z\vec w=\hat j, then x=x=(2) 11
(R) ∣u⃗⋅(v⃗×w⃗)∣\lvert\vec u\cdot(\vec v\times\vec w)\rvert(3) 12\tfrac{1}{\sqrt2}
(S) ∣u⃗×(v⃗×w⃗)∣\lvert\vec u\times(\vec v\times\vec w)\rvert(4) 13\tfrac{1}{\sqrt3}
(5) 56\tfrac56
Tap an option to check your answer
(1)P→5, Q→4, R→2, S→1
(2)P→4, Q→5, R→1, S→2
(3)P→5, Q→3, R→2, S→1
(4)P→5, Q→4, R→1, S→2
▸ SHOW SOLUTION

Step 1. Rows of M

Row 1 has sum of squares 11:

α2+12+12=1  ⟹  α=0\alpha^2+\frac12+\frac12=1\implies\alpha=0

Row 2 has sum of squares 11 and is perpendicular to row 1:

13+β2+13=1,β2−16=0\frac13+\beta^2+\frac13=1,\qquad \frac{\beta}{\sqrt2}-\frac{1}{\sqrt6}=0β=13\beta=\frac{1}{\sqrt3}

Step 2. Columns of M, for (P)

MTM=IM^TM=I too, so each column has sum of squares 11:

0+13+γ2=1  ⟹  γ2=230+\frac13+\gamma^2=1\implies\gamma^2=\frac2312+13+δ2=1  ⟹  δ2=16\frac12+\frac13+\delta^2=1\implies\delta^2=\frac16γ2+δ2=56\gamma^2+\delta^2=\frac56

Step 3. (Q)

xu⃗+yv⃗+zw⃗x\vec u+y\vec v+z\vec w is MM times the column (x,y,z)(x,y,z). So

M[xyz]=[010]  ⟹  [xyz]=MT[010]M\begin{bmatrix}x\\y\\z\end{bmatrix}=\begin{bmatrix}0\\1\\0\end{bmatrix}\implies\begin{bmatrix}x\\y\\z\end{bmatrix}=M^T\begin{bmatrix}0\\1\\0\end{bmatrix}

That is the second row of MM read as a column, so x=13x=\dfrac{1}{\sqrt3}.

Step 4. (R)

u⃗⋅(v⃗×w⃗)\vec u\cdot(\vec v\times\vec w) is the determinant with u⃗,v⃗,w⃗\vec u,\vec v,\vec w as rows, which is det⁡(MT)=det⁡M\det(M^T)=\det M. From MMT=IMM^T=I, (det⁡M)2=1(\det M)^2=1.

∣u⃗⋅(v⃗×w⃗)∣=1\lvert\vec u\cdot(\vec v\times\vec w)\rvert=1

Step 5. (S)

u⃗×(v⃗×w⃗)=(u⃗⋅w⃗)v⃗−(u⃗⋅v⃗)w⃗\vec u\times(\vec v\times\vec w)=(\vec u\cdot\vec w)\vec v-(\vec u\cdot\vec v)\vec w

Different columns are perpendicular, so both dot products are 00 and the value is 00.

Answer: (1) P→5, Q→4, R→2, S→1

Powers of a square matrix

A2=AAA^2=AA, A3=A2AA^3=A^2A, and so on, with A0=IA^0=I. Powers of the same matrix always commute, AmAn=AnAm=Am+nA^mA^n=A^nA^m=A^{m+n}. Three named types appear constantly:

NameConditionConsequence
IdempotentA2=AA^2=AAn=AA^n=A for all n≥1n\ge1
InvolutoryA2=IA^2=IAeven=IA^{\text{even}}=I, Aodd=AA^{\text{odd}}=A
Nilpotent of index kkAk=OA^k=O, Ak−1≠OA^{k-1}\ne Oevery higher power is OO

The method for a high power: write A as I + N

If II and NN commute, which they always do, the binomial theorem works for (I+N)n(I+N)^n exactly as for numbers. When N2=ON^2=O every term from N2N^2 on vanishes:

(I+N)n=I+nNwhen N2=O(I+N)^n=I+nN\qquad\text{when }N^2=O

When N2≠ON^2\ne O but N3=ON^3=O:

(I+N)n=I+nN+(n2)N2(I+N)^n=I+nN+\binom n2N^2

So for a high power, subtract II and square what is left. If it dies quickly, the power is a short polynomial in nn.

The 2 by 2 matrix N with rows (2, minus 4) and (1, minus 2), its square shown as the zero matrix, and A to the n written as I plus n N
Upper or lower triangular with 1s on the diagonal

A triangular matrix with every diagonal entry 11 is always I+NI+N with NN strictly triangular, and a strictly triangular 3×33\times3 matrix always has N3=ON^3=O. That is why such matrices are the favourite source of A99A^{99} and A100A^{100} questions.

Example 6 (JEE Main 2026, 28 January Shift 2). Let

A=[3−41−1]A=\begin{bmatrix}3&-4\\1&-1\end{bmatrix}

and BB be a matrix such that A100=100B+IA^{100}=100B+I. Then the sum of all the elements of B100B^{100} is ______.

▸ SHOW SOLUTION

Step 1. Subtract I

N=A−I=[2−41−2]N=A-I=\begin{bmatrix}2&-4\\1&-2\end{bmatrix}N2=[4−4−8+82−2−4+4]=ON^2=\begin{bmatrix}4-4&-8+8\\2-2&-4+4\end{bmatrix}=O

Step 2. The power

A100=(I+N)100=I+100NA^{100}=(I+N)^{100}=I+100N

Comparing with 100B+I100B+I gives B=NB=N.

Step 3. Power of B

N2=ON^2=O, so B100=N100=OB^{100}=N^{100}=O and the sum of its elements is 00.

Answer: 00

Example 7 (JEE Main 2026, 21 January Shift 2). For

A=[3−41−1],B=[−2949−1318]A=\begin{bmatrix}3&-4\\1&-1\end{bmatrix},\quad B=\begin{bmatrix}-29&49\\-13&18\end{bmatrix}

if (A15+B)X=O(A^{15}+B)X=O where XX is the column with entries xx, yy, then which is true?

Tap an option to check your answer
(1)x=5, y=7x=5,\ y=7
(2)x=18, y=11x=18,\ y=11
(3)x=11, y=2x=11,\ y=2
(4)x=16, y=3x=16,\ y=3
▸ SHOW SOLUTION

Step 1. Same A as Example 6

A=I+NA=I+N with N2=ON^2=O, so

A15=I+15N=[31−6015−29]A^{15}=I+15N=\begin{bmatrix}31&-60\\15&-29\end{bmatrix}

Step 2. Add B

A15+B=[2−112−11]A^{15}+B=\begin{bmatrix}2&-11\\2&-11\end{bmatrix}

Step 3. Solve

Both rows give 2x−11y=02x-11y=0, so (x,y)(x,y) is a multiple of (11,2)(11,2). Only option (3) fits.

Answer: (3) x=11, y=2x=11,\ y=2

Example 8 (JEE Main 2026, 6 April Shift 2). Let

A=[100310931]A=\begin{bmatrix}1&0&0\\3&1&0\\9&3&1\end{bmatrix}

and B=[bij]=A99−IB=[b_{ij}]=A^{99}-I. Then b31−b21b32\dfrac{b_{31}-b_{21}}{b_{32}} is

Tap an option to check your answer
(1)9999
(2)199199
(3)149149
(4)159159
▸ SHOW SOLUTION

Step 1. Subtract I and find the powers of N

N=[000300930],N2=[000000900]N=\begin{bmatrix}0&0&0\\3&0&0\\9&3&0\end{bmatrix},\qquad N^2=\begin{bmatrix}0&0&0\\0&0&0\\9&0&0\end{bmatrix}

and N3=ON^3=O.

Step 2. The power

A99=I+99N+(992)N2A^{99}=I+99N+\binom{99}{2}N^2B=99N+4851N2B=99N+4851N^2

Step 3. Read the three entries

b21=99×3=297b_{21}=99\times3=297b32=99×3=297b_{32}=99\times3=297b31=99×9+4851×9=44550b_{31}=99\times9+4851\times9=44550

Step 4. The ratio

44550−297297=44253297=149\frac{44550-297}{297}=\frac{44253}{297}=149

Answer: (3) 149149

Example 9 (JEE Advanced 2026, Paper 1). Let

M=[2−110]M=\begin{bmatrix}2&-1\\1&0\end{bmatrix}

and let p,q,r,s,a,b,c,dp,q,r,s,a,b,c,d be integers with

M26=[pqrs],∑k=126Mk=[abcd]M^{26}=\begin{bmatrix}p&q\\r&s\end{bmatrix},\quad \sum_{k=1}^{26}M^k=\begin{bmatrix}a&b\\c&d\end{bmatrix}

Which of the following is (are) TRUE?

(1) There is an invertible real 2×22\times2 matrix NN with MN=NJMN=NJ, where

J=[1101]J=\begin{bmatrix}1&1\\0&1\end{bmatrix}

(2) a=378a=378

(3) For any integers m,nm,n there are unique integers x,yx,y with px+qy=mpx+qy=m and rx+sy=nrx+sy=n

(4) For each t>0t>0 the system (a+t)x+by=1(a+t)x+by=1, cx+(d+t)y=−1cx+(d+t)y=-1 has a unique solution

▸ SHOW SOLUTION

Step 1. Write M as I + N

M−I=[1−11−1],(M−I)2=OM-I=\begin{bmatrix}1&-1\\1&-1\end{bmatrix},\qquad (M-I)^2=OMk=I+k(M−I)=[1+k−kk1−k]M^k=I+k(M-I)=\begin{bmatrix}1+k&-k\\k&1-k\end{bmatrix}

Step 2. M to the 26 and the sum

M26=[27−2626−25]M^{26}=\begin{bmatrix}27&-26\\26&-25\end{bmatrix}∑k=126Mk=26I+351(M−I)\sum_{k=1}^{26}M^k=26I+351(M-I)∑k=126Mk=[377−351351−325]\sum_{k=1}^{26}M^k=\begin{bmatrix}377&-351\\351&-325\end{bmatrix}

So a=377a=377 and (2) is false.

Step 3. Option (3)

ps−qr=27(−25)+26⋅26=1ps-qr=27(-25)+26\cdot26=1

By Cramer's rule the unique solution is x=sm−qnx=sm-qn, y=pn−rmy=pn-rm, both integers. True.

Step 4. Option (4)

(377+t)(t−325)+3512(377+t)(t-325)+351^2=t2+52t+676=t^2+52t+676t2+52t+676=(t+26)2>0t^2+52t+676=(t+26)^2>0

The coefficient determinant is never 00 for t>0t>0, so the solution is unique. True.

Step 5. Option (1)

Put

N=[p1q1r1s1]N=\begin{bmatrix}p_1&q_1\\r_1&s_1\end{bmatrix}

and compare entries of MNMN and NJNJ:

MN=[2p1−r12q1−s1p1q1]MN=\begin{bmatrix}2p_1-r_1&2q_1-s_1\\p_1&q_1\end{bmatrix}NJ=[p1p1+q1r1r1+s1]NJ=\begin{bmatrix}p_1&p_1+q_1\\r_1&r_1+s_1\end{bmatrix}

This needs r1=p1r_1=p_1 and q1=p1+s1q_1=p_1+s_1. Take p1=1p_1=1, s1=0s_1=0:

N=[1110],det⁡N=−1≠0N=\begin{bmatrix}1&1\\1&0\end{bmatrix},\qquad \det N=-1\ne0

So NN is invertible. True.

Answer: (1), (3), (4)

The equation every 2×2 matrix satisfies

For

A=[abcd]A=\begin{bmatrix}a&b\\c&d\end{bmatrix}

multiply out A2A^2 and check directly that

A2−(a+d)A+(ad−bc)I=OA^2-(a+d)A+(ad-bc)I=O

That is,

A2−(tr⁡A)A+(det⁡A)I=OA^2-(\operatorname{tr}A)A+(\det A)I=O

This one line does three jobs. It lowers any power: A2A^2 is a combination of AA and II, so A3A^3, A4A^4, and every higher power is too. It gives the inverse when det⁡A≠0\det A\ne0:

A−1=(tr⁡A)I−Adet⁡AA^{-1}=\frac{(\operatorname{tr}A)I-A}{\det A}

And it decodes a given equation. If AA is not a multiple of II and A2−pA+qI=OA^2-pA+qI=O, subtracting the identity above gives (tr⁡A−p)A=(det⁡A−q)I(\operatorname{tr}A-p)A=(\det A-q)I, which forces tr⁡A=p\operatorname{tr}A=p and det⁡A=q\det A=q.

Why the matrix must not be a multiple of I

If A=kIA=kI, then A2−pA+qI=OA^2-pA+qI=O only says k2−pk+q=0k^2-pk+q=0, and the trace and determinant are 2k2k and k2k^2, not pp and qq. Check this case separately whenever a question allows it.

Example 10 (IITianForum). A square matrix PP satisfies P2=I+PP^2=I+P. If Pn=8I+13PP^n=8I+13P, then nn is

Tap an option to check your answer
(1)55
(2)66
(3)77
(4)88
▸ SHOW SOLUTION

Step 1. One multiplication rule

Every power is aI+bPaI+bP. Multiplying by PP:

P(aI+bP)=aP+bP2P(aI+bP)=aP+bP^2=bI+(a+b)P=bI+(a+b)P

Step 2. Climb

PowerIIPP
P2P^21111
P3P^31122
P4P^42233
P5P^53355
P6P^65588
P7P^7881313

Answer: (3) 77

The coefficients are consecutive Fibonacci numbers, because each new row is (previous PP-coefficient, sum of the previous two).

Example 11 (JEE Main 2026, 4 April Shift 1). Let SS be the set of all 2×22\times2 matrices

A=[abcd]A=\begin{bmatrix}a&b\\c&d\end{bmatrix}

with a,b,c,d∈{0,1,2,3,4}a,b,c,d\in\{0,1,2,3,4\} and A2−4A+3I=OA^2-4A+3I=O. The number of matrices in SS whose diagonal sum is 44 is

Tap an option to check your answer
(1)2020
(2)1717
(3)2121
(4)1919
▸ SHOW SOLUTION

Step 1. Use the 2×2 identity with trace 4

A2−4A+(det⁡A)I=OA^2-4A+(\det A)I=O

Subtract the given equation:

(det⁡A−3)I=O  ⟹  ad−bc=3(\det A-3)I=O\implies ad-bc=3

Conversely, trace 44 and determinant 33 give the equation back. So count a+d=4a+d=4 with ad−bc=3ad-bc=3.

Step 2. Go through the diagonal

(a,d)(a,d)adadneeded bcbcpairs (b,c)(b,c)
(0,4)(0,4), (4,0)(4,0)00−3-300
(1,3)(1,3), (3,1)(3,1)330099 each
(2,2)(2,2)441111

For bc=0bc=0 with b,c∈{0,…,4}b,c\in\{0,\ldots,4\}: 5+5−1=95+5-1=9 pairs. For bc=1bc=1: only (1,1)(1,1).

Step 3. Add

9+9+1=199+9+1=19

Answer: (4) 1919

Example 12 (JEE Advanced 2026, Paper 2). Let

S=[0−110],T=[1101]S=\begin{bmatrix}0&-1\\1&0\end{bmatrix},\quad T=\begin{bmatrix}1&1\\0&1\end{bmatrix} ST=[abcd]ST=\begin{bmatrix}a&b\\c&d\end{bmatrix}

Let H={x+iy:y>0}H=\{x+iy:y>0\}. Which of the following is (are) TRUE?

(1) b+iad+ic=i\dfrac{b+ia}{d+ic}=i

(2) If ω=−1+i32\omega=\dfrac{-1+i\sqrt3}{2}, then aω+bcω+d=ω\dfrac{a\omega+b}{c\omega+d}=\omega

(3) If m>2m>2 is an integer with (ST)2=(ST)m(ST)^2=(ST)^m, then mm is a multiple of 88

(4) If z∈Hz\in H, then az+bcz+d∈H\dfrac{az+b}{cz+d}\in H

▸ SHOW SOLUTION

Step 1. The product

ST=[0−111]ST=\begin{bmatrix}0&-1\\1&1\end{bmatrix}

so a=0a=0, b=−1b=-1, c=1c=1, d=1d=1.

Step 2. Option (1)

−11+i=−1+i2≠i\frac{-1}{1+i}=\frac{-1+i}{2}\ne i

False.

Step 3. Option (2)

1+ω=−ω21+\omega=-\omega^2, so

−1ω+1=1ω2=ω\frac{-1}{\omega+1}=\frac{1}{\omega^2}=\omega

using ω3=1\omega^3=1. True.

Step 4. Option (3)

Let P=STP=ST. Trace 11, determinant 11:

P2−P+I=OP^2-P+I=O

Multiply by P+IP+I:

P3+I=O  ⟹  P3=−I,P6=IP^3+I=O\implies P^3=-I,\quad P^6=I

P≠±IP\ne\pm I and P2≠IP^2\ne I, so the powers of PP repeat with period exactly 66. Pm=P2P^m=P^2 needs m−2m-2 to be a multiple of 66, so m=8,14,20,…m=8,14,20,\ldots Since 1414 is not a multiple of 88, false.

Six points on a circle labelled P, P squared, up to P to the sixth equal to I, with arrows showing the cycle closing after six steps

Step 5. Option (4)

With z=x+iyz=x+iy,

az+bcz+d=−1z+1=−(x+1)+iy(x+1)2+y2\frac{az+b}{cz+d}=\frac{-1}{z+1}=\frac{-(x+1)+iy}{(x+1)^2+y^2}

Its imaginary part has the sign of yy, which is positive. True.

Answer: (2), (4)

Inverse of a matrix

A square matrix AA is invertible if there is a matrix BB with

AB=BA=IAB=BA=I

Then BB is unique and is written A−1A^{-1}. Not every square matrix has one: a matrix with determinant 00 never does. How to compute A−1A^{-1} through the adjoint belongs to the Determinants note; here are the rules that need no computation.

(A−1)−1=A,(kA)−1=1kA−1(A^{-1})^{-1}=A,\qquad (kA)^{-1}=\frac1kA^{-1} (AB)−1=B−1A−1(AB)^{-1}=B^{-1}A^{-1} (AT)−1=(A−1)T(A^T)^{-1}=(A^{-1})^T

If AB=IAB=I for square matrices of the same order, then BA=IBA=I automatically, so one side is enough.

Polynomials in the same matrix commute

I+AI+A, I−AI-A, A2A^2, (I+A)−1(I+A)^{-1} are all polynomials in AA or inverses of them, and any two of them commute. That lets you move factors past each other freely in questions built from I+AI+A and I−AI-A.

Example 13 (JEE Main 2026, 28 January Shift 1). Let AA, BB, CC be 2×22\times2 real matrices with B=(I+A)−1B=(I+A)^{-1} and A+C=IA+C=I. If

BC=[1−5−12],CB[x1x2]=[12−6]BC=\begin{bmatrix}1&-5\\-1&2\end{bmatrix},\quad CB\begin{bmatrix}x_1\\x_2\end{bmatrix}=\begin{bmatrix}12\\-6\end{bmatrix}

then x1+x2x_1+x_2 is

Tap an option to check your answer
(1)22
(2)00
(3)−2-2
(4)44
▸ SHOW SOLUTION

Step 1. Show CB = BC

C=I−AC=I-A. The products (I+A)(I−A)(I+A)(I-A) and (I−A)(I+A)(I-A)(I+A) both equal I−A2I-A^2. Multiply that equality by (I+A)−1(I+A)^{-1} on the left and on the right:

(I−A)(I+A)−1=(I+A)−1(I−A)(I-A)(I+A)^{-1}=(I+A)^{-1}(I-A)

That is CB=BCCB=BC.

Step 2. Solve

x1−5x2=12x_1-5x_2=12−x1+2x2=−6-x_1+2x_2=-6

Adding, −3x2=6-3x_2=6, so x2=−2x_2=-2 and x1=2x_1=2.

x1+x2=0x_1+x_2=0

Answer: (2) 00

Example 14 (JEE Main 2026, 23 January Shift 2). Let

A=[02−3−2013−10]A=\begin{bmatrix}0&2&-3\\-2&0&1\\3&-1&0\end{bmatrix}

and BB be a matrix such that B(I−A)=I+AB(I-A)=I+A. Then the sum of the diagonal elements of BTBB^TB is ______.

▸ SHOW SOLUTION

Step 1. A is skew-symmetric

AT=−AA^T=-A. Also I−AI-A and I+AI+A are invertible (each has determinant 1+4+9+1=151+4+9+1=15), so

B=(I+A)(I−A)−1B=(I+A)(I-A)^{-1}

Step 2. Transpose B

BT=((I−A)−1)T(I+A)TB^T=\big((I-A)^{-1}\big)^T(I+A)^TBT=(I+A)−1(I−A)B^T=(I+A)^{-1}(I-A)

using (I−A)T=I+A(I-A)^T=I+A and (I+A)T=I−A(I+A)^T=I-A.

Step 3. Multiply

Write P=I+AP=I+A and Q=I−AQ=I-A, so B=PQ−1B=PQ^{-1} and BT=P−1QB^T=P^{-1}Q:

BTB=P−1QPQ−1B^TB=P^{-1}QPQ^{-1}

PP and QQ commute, so QP=PQQP=PQ and everything cancels:

BTB=P−1PQQ−1B^TB=P^{-1}PQQ^{-1}BTB=IB^TB=I

Step 4. Trace

tr⁡(BTB)=tr⁡(I3)=3\operatorname{tr}(B^TB)=\operatorname{tr}(I_3)=3

Answer: 33

So BB is orthogonal. A skew-symmetric AA always gives an orthogonal (I+A)(I−A)−1(I+A)(I-A)^{-1}, and the entries of AA never mattered.

Example 15 (IITianForum). Let PP and QQ be invertible 2×22\times2 real matrices with

P−1+Q−1=(P+Q)−1P^{-1}+Q^{-1}=(P+Q)^{-1}

If ∣P∣=7\lvert P\rvert=7, then ∣Q∣\lvert Q\rvert is ______.

▸ SHOW SOLUTION

Step 1. Multiply out

(P+Q)(P−1+Q−1)=I(P+Q)(P^{-1}+Q^{-1})=II+PQ−1+QP−1+I=II+PQ^{-1}+QP^{-1}+I=I

Step 2. One matrix X

Put X=PQ−1X=PQ^{-1}, so QP−1=X−1QP^{-1}=X^{-1}:

X+X−1+I=OX+X^{-1}+I=O

Multiply by XX:

X2+X+I=OX^2+X+I=O

Step 3. Multiply by X − I

(X−I)(X2+X+I)=X3−I=O(X-I)(X^2+X+I)=X^3-I=OX3=IX^3=I

Step 4. Determinants

∣X∣3=1  ⟹  ∣X∣=1\lvert X\rvert^3=1\implies\lvert X\rvert=1

since ∣X∣\lvert X\rvert is real. And ∣X∣=∣P∣∣Q∣\lvert X\rvert=\dfrac{\lvert P\rvert}{\lvert Q\rvert}, so ∣Q∣=7\lvert Q\rvert=7.

Answer: 77

The order of the matrices was never used: for any order, the condition forces ∣P∣=∣Q∣\lvert P\rvert=\lvert Q\rvert.

Elementary row operations

Three operations on the rows of a matrix are called elementary:

  1. Ri↔RjR_i\leftrightarrow R_j, swap two rows.
  2. Ri→kRiR_i\to kR_i with k≠0k\ne0, multiply a row by a non-zero number.
  3. Ri→Ri+kRjR_i\to R_i+kR_j, add a multiple of another row.
The 3 by 3 identity matrix with three arrows to the three results: two rows swapped, one row multiplied by k, and k times row 3 added to row 1

Each one can be undone by an operation of the same kind, and their effect on a determinant is fixed: a swap changes the sign, scaling by kk multiplies it by kk, and adding a multiple of another row changes nothing. Starting from II, whose determinant is 11, the determinant can therefore never become 00.

Conversely, every matrix with non-zero determinant can be reduced to II by row operations, and running those operations backwards builds it from II. So:

reachable from I  ⟺  det⁡≠0\text{reachable from } I \iff \det\ne0

The same row operations, applied to [A∣I][A\mid I] until the left half becomes II, turn the right half into A−1A^{-1}. That is the elementary-operations method for the inverse.

Example 16 (JEE Advanced 2026, Paper 1). Which one of the following matrices can be obtained by performing elementary row transformations on the 3×33\times3 identity matrix?

(1) [111111111](2) [111234121](1)\ \begin{bmatrix}1&1&1\\1&1&1\\1&1&1\end{bmatrix}\quad(2)\ \begin{bmatrix}1&1&1\\2&3&4\\1&2&1\end{bmatrix} (3) [111234258](4) [111−112023](3)\ \begin{bmatrix}1&1&1\\2&3&4\\2&5&8\end{bmatrix}\quad(4)\ \begin{bmatrix}1&1&1\\-1&1&2\\0&2&3\end{bmatrix}
▸ SHOW SOLUTION

Step 1. Use the determinant test

Only a matrix with non-zero determinant can come from II.

Step 2. Check each option

(1): all rows equal, determinant 00.

(3): R3=3R2−4R1R_3=3R_2-4R_1, determinant 00.

(4): R3=R1+R2R_3=R_1+R_2, determinant 00.

(2):

1(3−8)−1(2−4)+1(4−3)1(3-8)-1(2-4)+1(4-3)=−5+2+1=−2≠0=-5+2+1=-2\ne0

Answer: (2)

Which result to use

A decision chart: from what the question gives, arrows lead to the column picture, trace of A transpose A, writing A as I plus N, the 2 by 2 identity, commuting polynomials in A, or the determinant test
The question gives youReach for
MM acting on e1,e2,e3e_1,e_2,e_3the column picture, MejMe_j is column jj
tr⁡(ATA)\operatorname{tr}(A^TA) or tr⁡(AAT)\operatorname{tr}(AA^T)sum of squares of all entries
AnA^{n} for a large nnsubtract II, square what is left
a triangular matrix with 11s on the diagonalI+NI+N, with N3=ON^3=O for order 33
A2−pA+qI=OA^2-pA+qI=O for a 2×22\times2 matrixtrace pp, determinant qq
a product with period, such as Pm=P2P^m=P^2the 2×22\times2 identity, then multiply up to Pk=±IP^k=\pm I
I+AI+A, I−AI-A and inverses togetherthey commute, rearrange freely
AA skew-symmetric with I±AI\pm A(I+A)(I−A)−1(I+A)(I-A)^{-1} is orthogonal
AAT=IAA^T=Irows and columns are perpendicular unit vectors
row operations on IIpossible exactly when det⁡≠0\det\ne0

Quick recall

ResultStatement
Number of matriceskmnk^{mn} for order m×nm\times n with kk choices per entry
Product definedcolumns of AA equal rows of BB
Transpose of product(AB)T=BTAT(AB)^T=B^TA^T
Trace of producttr⁡(AB)=tr⁡(BA)\operatorname{tr}(AB)=\operatorname{tr}(BA)
tr⁡(ATA)\operatorname{tr}(A^TA)sum of squares of all entries
Skew-symmetric diagonalall 00
SplitA=12(A+AT)+12(A−AT)A=\tfrac12(A+A^T)+\tfrac12(A-A^T)
OrthogonalAAT=ATA=IAA^T=A^TA=I
2×22\times2 identityA2−(tr⁡A)A+(det⁡A)I=OA^2-(\operatorname{tr}A)A+(\det A)I=O
Power with N2=ON^2=O(I+N)n=I+nN(I+N)^n=I+nN
Power with N3=ON^3=O(I+N)n=I+nN+(n2)N2(I+N)^n=I+nN+\binom n2N^2
Inverse of product(AB)−1=B−1A−1(AB)^{-1}=B^{-1}A^{-1}
Row operations on IIreach exactly the matrices with det⁡≠0\det\ne0
Before you leave this chapter

Take any 2×22\times2 matrix, write down its trace and determinant, and use A2−(tr⁡A)A+(det⁡A)I=OA^2-(\operatorname{tr}A)A+(\det A)I=O to find A5A^5 without multiplying five times. If you can do that in under two minutes, the powers section of JEE is under control.

Practise these methods on real exam questions in the doMath Matrices chapter, and continue with the Determinants note, which takes over from the inverse and builds the adjoint, Cramer's rule and systems of equations.

[ SHARE ] WhatsApp
[ practice these chapters ]
Reinforce this post with live problems on doMath.
Matrices & Determinants
← Back to all notes