Matrices

A Matrix is an organized rectangular array comprising numbers, symbols,

or expressions that are systematically arranged in rows and columns.

Types of Matrices
1. Column Matrix: A matrix that contains only one column. Example: 3
× 1 column matrix

[]
2
5 2. Row Matrix: A matrix that consists of only one row. Example A = [1
7
5 7]
3. Horizontal Matrix: a rectangular matrix where the number of
columns (n) exceeds the number of rows (m) , i.e. n > m. Example:
A=[ 3 5 7 9 ]

4. Vertical Matrix: A vertical matrix is a rectangular matrix where

number of rows (m) exceed the number of columns (n) , i.e. m > n.
Example:

[]
2
B= 4
6
8
5. Square Matrix: where the number of rows equals the number of

[ ]
2 4 1
columns. Example: a square 3 x 3 matrix: A= 0 5 3
7 8 6

6. Diagonal Matrix: A square matrix is a diagonal matrix if all the non-

[ ]
3 0 0
diagonal elements are zero. Ex: A= 0 5 0 . Diagonal elements are the
0 0 7
aii elements only, i.e. a11; a22; a33, here 3,5,7 are the diagonal elements in
given 3 x 3 matrix.

7. Upper Triangular Matrix: A square matrix in which all elements

[ ]
2 3 1
below the principal diagonal are zero. Ex: A= 0 5 4 . Here, all entries
0 0 7
below the main diagonal are 0.
7. Lower Triangular Matrix: A square matrix in which all elements

[ ]
4 0 0
above the principal diagonal are zero. Ex: A= 6 3 0 . Here, all entries
2 5 1
above the main diagonal are 0.

8. Tridiagonal Matrix: A square matrix in which all elements are zero

except those on the main diagonal , the diagonal just above it (super

[ ]
a b 0
diagonal) & the diagonal just below it (sub diagonal). Ex: A= c d e .
0 f g
9. Scalar Matrix: A Scalar Matrix is a square matrix where all diagonal
elements are equal (scalar), and all non-diagonal elements are zero.

10. Identity Matrix: An identity matrix is a special diagonal matrix

[ ]
1 0 0
where all diagonal elements are 1. Example: I = 0 1 0 . Acts like “1” in
0 0 1
matrix multiplication i.e. AI = A
11. Zero Matrix: a matrix in which all elements are zero. Example:
O=
[ 0 0 0
0 0 0 ]
It can be of any order (m ×n)
12. Orthogonal Matrix: A matrix A is orthogonal if AT A = I . Example: If
A=
[
0 −1
1 0 ] T
then A = [
0 1
−1 0 ]
and AT A = [ ]
1 0
0 1
=I

Operation on Matrices
1. Addition of two Matrices
To add two matrices, add corresponding elements in the same position in
each matrix.
Properties of Addition:
 Commutative Law: A + B = B + A
 Associative Law: (A + B) + C = A + (B + C)
 Additive Identity: 0 (Zero Matrix) is the Additive Identity for
matrix addition.
 Additive Inverse: If A + B = 0 = B + A , then B is called the
additive inverse of A. In other words –A is the additive inverse of
A.

2. Multiplication of a matrix by a scalar

Multiplying a matrix by a scalar involves multiplying each element of the
matrix by the scalar value. Example: k(A +B) = k A + kB

3. Multiplication of Matrices
For matrix multiplication to be defined the number of columns in matrix A
= the number of rows in matrix B.

To multiply A and B, resulting matrix C is obtained by taking the scalar

c11 = a11⋅b11 + a12⋅b21 ; c12 = a11⋅b12 + a12⋅b22 ; c13 = a11⋅b13 + a12⋅b23 and so
product of the ith row of A and the jth column of B:

on

Properties of Multiplication
 Multiplication is not Commutative : AB BA
 Associative: (AB)C = A(BC) or (AB)CD = A(BC)D = AB(CD)
 Distributive: A(B + C) = AB + BC and (A +B) C = AC + BC
 Failure of Zero Property: If AB = 0 it is not necessary that either A
= 0 or B = 0
 Few Important Multiplication Results:
2 2 2 2
 (A + B) = A + AB + BA + B ; (A + B) A2 + 2AB +
B2
 (AB)2 = (AB)(AB) = A(BA)B
 I A = A I = I and I2 = I = In
Transpose of Matrice: The transpose of a matrix is generated by
interchanging its rows and columns matrix. ( AT)ij = Aji .
Properties of Transpose:
 (AT)T = A
 (An)T = (AT)n
 (kA)T = k(AT )
 (A+B) T =AT + BT
 (AB)T = BTAT (Reversal Law)

Trace of Matrice: The sum of main diagonal elements of a square matrix

is called the trace of matrix . It is denoted by

Properties of Trace:

Symmetric and Skew Symmetric Matrices

1. Symmetric Matrix
A square matrix A = [aij] is said to be, symmetric if, a ij =aij ∀ i and j
(conjugate elements are equal).Hence for symmetric matrix A = A T

2. Skew Symmetric Matrix

Square Matrix A = [aij] is said to be skew symmetric if, a ij = – aij ∀ i & j
(the pair of conjugate elements are additive inverse of each other). For a
skew symmetric matrix, A = – AT.
Invertible Matrices
A square matrix is A = [aij] is said to be invertible if |A| ≠ 0, and AA –1 = A–
1
A=I
If ∣ A ∣=0 , then A is not invertible (singular)

Adjoint of Matrix

NOTE: Very Important for MCQ

Important Formula of Matrices

 A(adj.A) = | A | In = (adj A) A
 | adj A | = | A |n–1 [ A (adj A) is always a scalar matrix ]
 adj (adj.A) = | A | n–2 A, where |A| ≠ 0
 |adj (adj.A)| = A, where |A| ≠ 0
 adj (AB) = (adj B) (adj A)
 adj (Am) = (adj A) m,
 adj (KA) = Kn–1 (adj A), K is scalar
 adj (In) = In,
 adj (0) = 0
 A is symmetric ⇒ adj A is also symmetric
 A is diagonal ⇒ adj A is also diagonal
 A is triangular ⇒ adj A is also triangular
 A is singular ⇒ | adj A | = 0
👉 Use this to rearrange matrices into easier forms.

✅ 3. Transpose doesn’t change trace

T
tr (A )=tr ( A)

✅ 4. Your main trick

T
tr (A A)=∑ ¿

Also:
T
tr (A A )=same value

✅ 5. Linearity (split easily)

tr (A + B)=tr (A )+ tr(B)tr (kA )=k tr ( A)

⚡ High-Speed JEE Patterns

🔹 Pattern 1: Symmetric / Skew-symmetric
If AT = A (symmetric) → normal
If AT =− A (skew-symmetric):
tr (A )=0

🔹 Pattern 2: Identity matrix

tr (I n)=n
🔹 Pattern 3: Diagonal matrices
Trace = sum of diagonal → no work needed

🔹 Pattern 4: Similar matrices

If:
−1
B=P APtr (A )=tr (B)

👉 Trace is invariant under similarity

🔹 Pattern 5: Eigenvalue shortcut

tr (A )=sum of eigenvalues

👉 Useful in MCQs (no matrix expansion needed)

⚡ Killer Combo Tricks (JEE Level)

🔸 Trick 1:
2
tr (A )=∑ aij a ji

👉 Useful when matrix is partially given

🔸 Trick 2:
tr ¿

👉 Use cyclic property:

tr (AB)=tr (BA)

🔸 Trick 3:
If AB=BA :
👉 treat like algebra:
tr ¿
Q1. (JEE Advanced 2017 type — you already saw)

Question:
Number of 3 ×3 matrices with entries from { 0 , 1 ,2 }such that
T
tr ( M M )=5

⚡ Fast way (2–3 min saved)

T
tr (M M )=∑ (squares of entries)

👉 Convert to combinatorics → Answer = 198

🔥 Q2. (JEE Main PYQ pattern)

If A and Bare 3 ×3 matrices, find:

tr (AB−BA )

❌ Slow approach:

Matrix multiplication 😵

✅ Fast trick:

tr (AB)=tr (BA)⇒tr ( AB−BA)=0

👉 Answer: 0 (instant)

🔥 Q3. (Repeated concept)

Given:

tr (A )=5 , tr(B)=3

Find:

tr (2 A +3 B)

⚡ Fast:
¿ 2 ⋅5+3 ⋅3=10+ 9=19

👉 No matrices needed

🔥 Q4. (JEE Advanced pattern)

Find:
tr ¿
❌ Normal expansion = messy

✅ Trick:

( A+ B ¿2= A 2+ B 2+ AB+ BA
So:

tr=tr ( AB+ BA)

Using cyclic:

tr (AB)=tr (BA)¿ 2 tr (AB)

👉 Final answer: 2 tr (AB)

🔥 Q5. (Eigenvalue shortcut)

If eigenvalues of A are 2 , 3 ,5 , find tr (A )

⚡ Direct:

tr (A )=2+3+5=10

👉 No matrix required

🔥 Q6. (JEE Main PYQ type)

If A is skew-symmetric, find tr (A )

⚡ Trick:
T
A =− A

Diagonal elements ⇒ always 0

👉 Answer: 0

🔥 Q7. (Similarity trick)

If B=P−1 AP, find relation between traces

⚡ Direct:

tr (A )=tr (B)

👉 No calculation
🔥 Q8. (Hidden trace trick)

Find:
T
tr (A A )

⚡ Direct:

¿ ∑ (squares of all entries)

👉 Same trick as M T M

🔥 Q9. (Mixed concept – very common)

Find:
T
tr (A + A)

⚡ Trick:
T
tr (A )=tr ( A)¿ 2 tr (A )

🔥 Q10. (JEE Advanced thinking)

Find:

tr (ABC −CBA )

⚡ Trick:

Use cyclic property:

tr (ABC )=tr(BCA )=tr (CAB)tr (CBA )=tr(BAC )

👉 Both equal → subtraction = 0

21. Use:
2
A =(trace) A−(det ⁡) I