Académique Documents
Professionnel Documents
Culture Documents
Matrix Algebra
S YNOPSIS
1. M ATRIX
A matrix is a rectangular array of numbers. The numbers may be real or complex. It may be
represented as
A= .
..
..
.
.
..
OF
M ATRICES
Rectangular matrix if m 6= n
Square matrix if m = n
Row matrix if m = 1
Column matrix if n = 1
Null or zero matrix if aij = 0, i and j
Diagonal matrix if m = n and aij = 0, i 6= j
Scalar matrix if m = n and aij = 0, i 6= j and aii = (scalar) i
3
OF
M ATRICES
(i) Equality of Matrices: Two matrices are said to be equal provided they are of the
same order and corresponding elements are equal.
(ii) Addition of Matrices: Two matrices A and B can be added if and only if they are
of the same order and the matrix (A + B) is obtained by adding the corresponding
elements of A and B. Addition is not dened for matrices of different sizes. The
additive inverse of A, denoted by A.
If A and B are two matrices of the same order, then the differences between A and B
is dened by A B = A + (B).
Properties of Addition: If A, B and C are three matrices of the same size, then
A + B = B + A (commutative law)
(A + B) + C = A + (B + C) (Associative law)
A = A + O = O + A (Additive property of zero)
A + (A) = O (Additive inverse)
A + B = A + C B = C (Left cancellation law)
Matrix Algebra
(Am )n = Amn m, n N
4. T RACE
OF A
M ATRIX
n
X
i=1
tr(kA) = k tr(A)
5. I NVOLUTORY
MATRIX
OF A MATRIX
The matrix obtained by interchanging the rows and columns of a matrix A is called transpose
of A denoted by AT or A .
Properties of Transpose of a Matrix:
(i)
(A + B)T = AT + B T
8. D ETERMINANT O F
A SQUARE
M ATRIX
Let A = [aij ]nn be a square matrix. Then the determinant of A is denoted by det A or |A|
and dened as
Matrix Algebra
detA =
a11
a21
..
.
a12
a22
..
.
a13
a23
..
.
. . . a1n
. . . a2n
..
.
nn
The determinant has always a real nite value. If we dene a 3 3 determinant, then it has
three rows and three columns and its value is given as follows.
a
a
a
11 12 13
|A| = a21 a22 a23
a31 a32 a33
nn
= a11 (a22 a33 a23 a32 ) a12 (a21 a33 a23 a31 ) + a13 (a21 a32 a22 a31 )
This is called expanding the determinant by rst row. A determinant can be expanded in terms
of any row or column.
N OTE :
1. If A is a square matrix of order n, then |A| = |AT | .
2. If A and B are two square matrices of the same order, then |AB| = |A||B|
3. If A is a square matrix of order n, then |kA| = kn |A|, for any scalar k.
4. |An | = (|A|)n
Minors and Cofactors
The minor of an element in a determinant is the determinant obtained by deleting the row and
column containing that element.
The cofactor of any element in a determinant is its minor with the proper sign. The sign
of an element in the ith row and jth column is (1)i+j . The cofactor of an element is usally
denoted by the corresponding capital letter.
Thus a determinant is the sum of the products of the elements of any row (or column) by
the corresponding cofactors. This is known as Laplaces expansion.
Properties of Derterminants
(i) A determinant remains unaltered if its rows and columns are interchanged.
(ii) If any two rows (or columns) of a determinant are interchanged, the determinant
changes its sign.
(iii) A determinant vanishes if two of its rows (or columns) are identical or proportional.
(iv) If each element of a row (or column) is multiplied by a scalar, then the determinant is
multiplied by that scalar.
(v) If to each element of a row (or column) be added equi-multiples of the corresponding
elements of two or more rows (or columns), the determinant remains unaltered.
9. S INGULAR
AND
N ONSINGULAR
MATRICES
A square matrix is said to be singular matrix if determinant of the matrix is zero. Otherwise,
it is called non-singular matrix.
10. A DJOINT
OF A MATRIX
The transpose of the matrix of cofactors of A is known as adjoint of a matrix and denoted by
adj.(A).
Thus adj.A = (Cofactor matrix)T
T
A
A11 A12 A13
11 A21 A31
adj(A) = A21 A22 A23 = A12 A22 A32
A13 A23 A33
A31 A32 A33
Properties of Adjont
(i)
(ii)
(iii)
adj(AB) = (adjB)(adjA)
adj(A)
|A|
Matrix Algebra
(ii)
AA1 = A1 A = I
(iii)
(AB)1 = B 1 A1
(iv)
(v)
2 (A A ).
(iv) If A is symmetric (or skew-symmetric) then kA is also symmetric(or skew-symmetric)
for any scalar k.
(ii) Orthogonal Matrix
A square matrix A is said to be orthogonal if AA = A A = I. In other words, A is orthogonal
matrix if and only if A = A1 .
R ESULTS :
(i) If A is an orthogonal matrix, then |A| =
6 0. Infact |A| = 1
10
(ii) (A + B) = A + B
where k is a scalar
(iii) (kA) = kA,
(iv) AB = AB
n
(v) (An ) = (A)
(vi) A = A if and only if A is purely real matrix
(g) A = A if and only if A is purely imaginary matrix.
(iv) Transposed of Conjugate of a Matrix
) and denoted by A .
or (A
)
= (A
A = (A)
Thus
Properties:
(i)
(A ) =
(ii)
(iii)
(A + B) = A + B
(KA) = kA
(iv)
(AB) = B .A
(v)
(An ) = (A )n
Matrix Algebra
11
2 (A A ).
(ii) If A is Hermitian matrix, then iA is skew-Hermitian and if A is Skew-Hermitian then
iA is Hermitian
(iii) If A is a Hermitian (or Skew-Hermitian), then kA is also Hermitian (or SkewHermitian) for any scalar k.
12. S UB
MATRIX
A matrix obtained fram a given matrix by deleting some rows or columns or both is called a
submatrix.
If A = [aij ]mn is a matrix and B is its submatrix of order r, then |B|, the determinant is
called the minor of A of order r. Clearly there will be a number of different minors of the
same order, got by deleting different rows and columns from the same matrix.
13. R ANK
OF A MATRIX
(i) The rank of a matrix doesnot change when the following elementary row operations are
applied to the matrix.
(a) The interchange of any two rows (Ri Rj )
(c) A constant multiple of another row is added to the corresponding elements of any
other row (Ri Ri + KRj , where i 6= j)
12
N OTE :
1. The arrow means replaced by
2. When the above three operations are applied to columns, then they are called elementary column operations.
(ii) If A = [aij ]mn , then (A) min{m, n}
Thus (A) m and (A) n.
Matrix Algebra
1
0
0
..
.
1
0
..
.
1
..
.
..
.
0 0 0
13
where stands for zero or non-zero element. That is, we shall try to make aii as 1 and all the
elements below aii as zero.
Definition:
OR
C ANONICAL F ORM
By applying elementary row and column operations, any non-zero matrix A can be reduced
to one of the following four forms, called the Normal form of A:
"
#
"
#
Ir
Ir O
(i) Ir
(ii) [Ir O]
(iii)
(iv)
O
O O
The number
r so
"
# obtained from above is called the rank of A and we write (A) = r. The
I O
form
is called rst canonical form of A.
O O
17. D ETERMINATION OF L INEARLY D EPENDENT
OF V ECTORS BY R ANK M ETHOD
AND
L INEARLY I NDEPENDENT
SETS
Let X1 , X2 , . . ., Xn be the given vectors. Construct a matrix with the given vectors as its
rows.
1. If the rank of the matrix of the given vectors is equal to number of vectors, then the vectors
are linearly independent.
2. If the rank of the matrix of the given vectors is lessthan the number of vectors, then the
vectors are linearly dependent.
18. O RTHOGONALITY
OF
V ECTORS
(i) Two non-zero vectors X1 and X2 are orthogonal if and only if X1T X2 = 0.
(ii) Three non-zero vectors x1 , X2 , X3 are orthogonal if and only if they are pairwise orthogonal.
14
(B) n
(C) mn
(D) None
A or B or C
S OLUTION :
(B) 5
(C) 1
(D) zero
Ans. (C)
S OLUTION :
A=
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
(Applying R2 R2 R1 , R3 R3 R1 , R4 R4 R1 , R5 R5 R1 )
This is in Echelon form.
rank of A = number of non-zero rows = 1
0 0 3
Ans. (C)
(B) 1
[GATE 1994(CS)]
(C) 2
(D) 3
Matrix Algebra
15
0 0 3
Let A = 9 3
5 . Then
3 1
1
0 0 3
[Expand by R1 ]
|A| = 9 3
5
3 1
1
S OLUTION :
= 0 + 0 3(9 9) = 0
4. If A and B are real symmetric matrices of order n then which of the following is true
[GATE 1994(CS)]
(A) A AT = I
(C) AB = BA
(B) A = A1
(D) (AB)T = BA
Ans. (D)
S OLUTION : Since A and B are symmetric, we have AT = A and B T = B. By the properties of transpose of matrices, we have (AB)T = B T AT = BA
0 2
2
True
(B)
False
Ans. (B)
S OLUTION :
0
|A| = 7
7
0 2
2
Let A = 7 4
8 . Then
7 0 4
2
2
4
8 . [Expand by R1 ]
0 4
16
(A)
True
(B)
False
Ans. (A)
S OLUTION :
Let A =
adjA
1
=
=
|A|
5 + 4
Alternate Method:
"
"
1 4
1 5
"
#"
5 4
1 1
(A) 8
"
1 4
1 5
"
. Then
"
1 4
1 5
5 4 4 + 4
5 5 4 + 5
#
1 4
Hence
=
1 5
1 4 9
7. The value of the determinant 4 9
16 is
9 16 25
5 4
1 1
#1
"
5 4
1 1
(B) 12
Ans. (D)
S OLUTION :
1 4 9
Let = 4 9 16
9 16 25
#
"
1 0
0 1
(C) 12
=I
[GATE 1994(PI)]
(D) 8
Matrix Algebra
17
[GATE 1994(PI)]
is called
(A) non-singular
(B) Singular
(C) Transpose
(D) Minor
Ans. (B)
S OLUTION :
It is given that
1 1 0
1 0 1
0
1 1
(B) 1 1 1
(A) 0 0 0
1
0 1
0 1 1
2 2 2
1/2 1/2
(C) 2 2 2
(D) 1/2 1/2
0 2
2
0
0
Ans: (D)
S OLUTION :
[GATE 1995(EE)]
1/2
1/2
1
adj S
|S|
Alternate Method
An easier method for nding S 1 is by multiplying S with each of the choices (A), (B), (C)
and (D) and nding out which one gives the product as Identity matrix. For examples, we
multiply S with the option (D).
1 1 0
1/2 1/2 1/2
18
1 0 0
0 1 0 =I
0 0 1
1 1 0
1/2
1/2 1/2
Hence 1 1
= 1/2 1/2 1/2
1
0 0
1
0
0
1
1
1
...
1
(A) 1
a
a
...
a
a2
a2
...
a2
(B) 2
...
...
...
...
an
an
...
an
(C) n
Ans. (A)
1
a
a2 . . . an
0
0
0
... 0
All the rows of the given matrix is same. So the matrix has only one
independent row. Rank of the matrix = No. of independent rows of the matrix = 1.
Matrix Algebra
19
"
#
2 1
3 2
8 1
6 5
1 8
6 2
(A) 13 2
(B) 9 8
(C) 2 13
(D) 9 4
22 5
12 13
5 22
0 5
Ans. (B)
S OLUTION :
"
#
2 1
6+0 4+1
6 5
3 2
LM = 3 2
= 9+0 6+2 = 9 8
0 1
22
4 5 32
12 + 0 8 + 5
12 13
12. The matrices
"
cos sin
sin cos
and
"
a 0
0 b
(B) always
(D) If a cos 6= b sin
Ans. (A)
S OLUTION :
Let A =
"
cos sin
sin
cos
AB =
"
cos sin
sin
cos
#"
BA =
"
a 0
0 b
AB = BA
"
#"
and B =
"
a 0
0 b
cos sin
sin
cos
a cos b sin
a sin
b cos
"
a 0
0 b
. Then
"
a cos b sin
a sin
b cos
"
a cos a sin
b sin
b cos
a cos a sin
b sin
b cos
and
or sin = 0 a = b
or = n
20
"
1 0
1 1
S OLUTION : We have A =
"
a11 a12
a21 a22
and B =
Given CD = I D = C 1
"
#
1 0
C =A
1 1
"
b11 b12
b21 b22
. . . (1)
. . . (2)
and AB = I B = A1
. . . (3)
"
1
0
1 1
#"
b11 b12
b22 b22
(A) 11
(B) 48
"
6
0
0
0
b11
b12
b11 + b21 b12 + b22
8
2
0
0
1
4
4
0
1
6
8
1
is
(C) 0
Ans. (D)
S OLUTION :
[GATE 1997(CS)]
(D) 24
Matrix Algebra
21
15. Let Ann be matrix of order n and I12 be the matrix obtained by interchanging the rst
and second rows of In . Then AI12 is such that its rst
[GATE 1997 (CS)]
(A)
(B)
(C)
(D)
Ans. (C)
S OLUTION :
Now I12 =
AI12 =
"
"
1 0
0 1
1 2
3 4
"
1 2
3 4
and I =
"
1 0
0 1
(by R1 R2 )
#"
0 1
1 0
"
0+2 1+0
0+4 3+0
"
2 1
4 3
1 3
2
16. If the determinant of the matrix 0 5 6 is 26 then the determinant of the matrix
2 7
8
2 7
8
(B) 26
(C) 0
(D) 52
Ans. (B)
1 3
S OLUTION : Let = 0 5
2 7
2
Given = 26 26 = (1)
1 3
2
8
= (1) 2 7
0 5 6
2 7
8
1 3
2 (Applying R1
0 5 6
2
6
8
(Applying R2 R3 )
2 7
8
R2 ) = 1 3
2
0 5 6
22
(A)
(B)
(C)
(D)
Ans. (A)
S OLUTION :
0 1 0
0 0 1
1 0 0
1 0 0
S OLUTION : Let A = 0
1
0 1 0
Then |A| = 0 0 1
1 0 0
1 0
0 1
0 0
[Expand by C1 ]
= 0 0 + 1(1 0) = 1 6= 0
0 0 1
0 0 1
adjA
Hence A1 =
= 1 0 0
|A|
0 1 0
0 0 1
(D) 0 1 0
1 0 0
Matrix Algebra
5 0 2
1
0 2
5
0 2
(A) 0 1/3
(B)
0
0 1/3 0
2
0
5
2
0 1
1/5 0
1/2
1/5
0
(C) 0
(D)
1/3 0
0 1/3
1/2 0
1
1/2
0
Ans. (A)
23
1/2
0
1
S OLUTION :
Method 1:
1
0 2
5 + 0 4 0 + 0 + 0 10 + 0 + 10
5 0 2
0 = 0+0+0 0+1+0
0+0+0
0 3 0 0 1/3
2
0
5
2+02 0+0+0
4 + 0 + 5
2 0 1
1 0 0
= 0 1 0 =I
0 0 1
5 0 2
Hence 0 3 0
2 0 1
1 a
20. If = 1 b
1 c
(A) a + b
1
0 2
0
= 0 1/3
2
0
5
bc
ca then which of the following is a factor of
ab
(B) a b
(C) abc
[GATE 1998(CS)]
(D) a + b + c
24
Ans. (B)
(B) 1
(a b) is a factor of .
7
0
is
1
2
(C) 2
[GATE 1998(CS)]
(D) 4
Ans. (D)
S OLUTION
Let A =
1
0
4
3
4
0
2
12
8
3
3
24
7
0
1
2
1
4
8
7
0
0
3
0
0 14 29 27
0
0
0 19
1
4
8
7
0 14 29 27
0
0
3
0
0
0
0 19
(Applying R2 R3 )
Matrix Algebra
25
1
4
8
Now |A| = (19) 0 14 29 [Expanded by R4 ]
0
0
3
[GATE 1998(CE)]
(B) always symmetric
(D) sometimes symmetric
Ans. (B)
S OLUTION : We are given A is a real square matrix. We know that the matrix A is symmetric
if AAT = A.
Now (AAT )T = (AT )T AT [ (AB)T = B T AT (Reversal Law)]
= AAT [ (AT )T = A]
Hence AAT is symmetric.
23. In matrix algebra AS = AT (A, S, T are matrices of appropriate order) implies S = T
only if
[GATE 1998(CE)]
(A) A is symmetric
(C) A is non-singular
(B) A is singular
(D) A is skew-symmetric
Ans. (C)
S OLUTION :
1 2 1
11 9
1
24. If A = 2
3
1 and adjA =
4 2 3 then k = [GATE 1999(CS)]
0
5 2
10
k
7
(A) 5
(B) 3
(C) 3
(D) 5
26
Ans. (A)
S OLUTION : We know that if A = [aij ]nn then adj(A) = [bij ]nn where bij = Aij where
Aij is the cofactor of (j, i)th element of A.
1 2
2+3
K = b32 = A23 = (1)
= (1)(5 0) = 5
0 5
25. If A is any n n matrix and K is a scalar then |KA| = |A| where is
[GATE 1999(CE)]
(B) nk
(A) kn
(C) kn
(D)
k
n
Ans. (C)
S OLUTION :
|KA| = K n |A|
[ A is n n matrix]
= K n where k is a scalar
(B) n!
(C) n
(D) (n + 1)2
Ans. (B)
S OLUTION : We know that the number of terms in the expansion of a determinant of order
2 is 2(= 2!) and of order 3 is 6(= 3!).
Similarly the number of terms in the expansion of a determinant of order n is n!.
2 1
1
Ans. (B)
S OLUTION :
2 1 1
We have 1 1 1
y x2 x
= 0 [Expand by R1 ]
Matrix Algebra
27
(A) 0
(D) n(n + 1)
Ans. (A)
S OLUTION :
We have V [i, j] = i j, 1 i, j n
i.e., For i = 1, j = 1, 2, . . ., n
For i = 2, j = 1, 2, . . ., n
For i = 3, j = 1, 2, . . ., n.
... ... ...
For i = n, j = 1, 2, . . ., n
0
1
1
0
2
1
V =
..
..
.
.
3 . . . 1 n
2 . . . 2 n
1 . . . 3 n
..
..
..
.
.
.
n1 n2 n3 n4 ...
0 nn
2
1
0
..
.
Here V is a skew-symmetric matrix since all main diagonal elements are zeros.
(i, j) th element of V = (j, i) th element of V .
Hence sum of all the elements of V = 0.
28
(A) 4
2
8
2
9
0
1
0
0
0
7
2
6
(B) 0
0
2
0
1
is
(C) 15
[GATE 2000(CS)]
(D) 20
Ans. (A)
S OLUTION : Let A =
2
8
2
9
0
1
0
0
0
7
2
6
1 7 2
= 2 0 2 0
0 6 1
0
2
0
1
[Expand by R1 ]
= 2[1(2 0) 0 + 0] (By C1 ) = 4
30. If A,B,C are square matrices of the same order then (ABC)1 is equal to
[GATE 2000(CE)]
(A) C 1 B 1 A1
(C) A1 B 1 C 1
(B) B 1 C 1 A1
(D) A1 C 1 B 1
Ans. (A)
S OLUTION : By the property of the reversal law of inverse of product of three matrices
A,B,C, we have (ABC)1 = C 1 B 1 A1 [ (AB)1 = B 1 A1 ]
31. Consider the following two statements:
(I) The maximum number of linearly independent column vectors of a matrix A is called the
rank of A.
(II) If A is n n square matrix then it will be non-singular if rank of A = n.
[GATE 2000(CE)
(A) Both the statements are false
(C) (I) is true but (II) is false
Ans. (B)
Matrix Algebra
29
S OLUTION : We know that rank of a matrix is same as the number of linearly independent
row vectors in the matrix as well as the number of linearly independent column vectors in the
matrix.
Hence (I) is true
Also Rank of A = n = order of the square matrix |A| =
6 0
A is a non-singular.
1 2 3
(B) 1
(C) 2
(D) 3
Ans. (C)
S OLUTION :
1 2 3
|A| = 3 4 5
4 6 8
1
2
= 0 2
0 2
1
2
= 0 2
0
0
=0
3
4
4
3
4
0
(Applying R2 R2 3R1 , R3 R3 4R1 )
(Applying R3 R3 R2 )
Rank of A 6= 3. So (A) 2
"
#
1 2
Since the submatrix
is non-singular, the rank of A = 2.
3 4
[GATE 2001(CS)]
30
Ans. (A)
S OLUTION :
S1:
(1)
Let A =
"
Then A + B =
S2:
1 0
1 0
"
1 1
0 0
(2) Let A =
"
1 0
0 0
Let A =
"
1 2
0 3
(1)
Then A + B =
(2) Let A =
"
"
Then A + B =
"
0 2
0 0
"
, B=
0 1
0 0
"
1 1
2 3
where |A| =
6 0, & |B| =
6 0.
|A + B| =
6 0
, B=
#
(B) 200
"
1 1
0
3
where |A| =
6 0, |B| =
6 0.
|A + B| = 0
(A) 100
0 1
0 3
|A + B| = 0
, B=
2 3
2 6
1 1
0 3
, B=
"
1
100
100
100
0
1
200
200
0
0
1
300
0
0
0
1
(C) 1
is
[GATE 2002(EE)]
(D) 300
Ans. (C)
S OLUTION :
Matrix Algebra
"
1 1
0 0
(B) 2
31
GATE 2002(CS)]
is
(C) 1
(D) 0
Ans. (C)
S OLUTION :
Let A =
"
1 1
0 0
(A) = 1
Alternate Method:
(A) = 1.
4 2 1 3
(B) 3
(C) 2
[GATE 2003(CE)]
(D) 1
Ans. (C)
S OLUTION : Since A is 3 4 matrix, therefore, the rank cannot exceed 3. Also each of the
minor of order 3 is zero. Hence the rank is lessthan 3. Consider the minors of order 3.
2 1 3
3 4 7 = 2(4 0) 1(3 7) + 3(0 4) = 8 + 4 12 = 0
1 0 1
4 2 1
6 3 4 = 4(0 4) 2(0 8) + 1(6 6) = 16 + 16 = 0
2 1 0
4 1 3 4 2 3
Similarly 6 4 3 = 6 3 4 = 0
2 0 7 2 1 1
2 1
Since
6= 0, the rank of A is 2.
3 4
32
Alternate Method:
4 2 1 3
A= 6 3 4 7
2 1 0 1
4 2
1
0 0 10
0 0 1
4 2 1
0 0 10
0 0 0
10 (Applying R3 10R3 + R2 )
0
"
a
1
2
a + a 1 1 a
(D)
"
a2 a + 1 a
1
1a
Ans. (B)
S OLUTION :
We have X 2 X + I = O
. . . (1)
IX I + X 1 = O X 1 = I X
"
# "
#"
#
1
0
a
1
1
a
1
X 1 =
0 1
a2 + a 1 1 a
a2 a + 1 a
38. The number of different n n symmetric matrices with each element being either 0 or 1
is
[GATE 2004(CS)]
Matrix Algebra
2
(A) 2n
(B) 2n
(C) 2
n2 +n
2
(D) 2
33
n2 n
2
Ans. (C)
S OLUTION : Let A =
a11
a21
..
.
a12
a22
..
.
...
...
..
.
a1n
a2n
..
.
n2 + n
and each element can be lled in
2
2 +n)/2
(B) CDA
(C) ADC
Ans. (B)
S OLUTION :
We have ABCD = I
(B) max(a, b)
(C) min[m a, n b]
(D) min{a, b}
Ans.(D)
S OLUTION :
Every entry will remove one row and one column from further consideration
34
of availability, since no two entries should be in same row or column. Proceeding in this way
we can add a maximum of either a entries or b entries depending on which is lesser.
If a < b we will run out of rows rst and if b < a we will run out of columns rst and if a = b
then we run out of both rows and columns. Therefore maximum entries that can be added
min{a, b}.
41. For which value of x will the matrix given below become singular?
8 x 0
[GATE 2004(ME)]
4 0 2
12 6 0
(A) 4
(B) 6
(C) 8
(D) 12
Ans. (A)
S OLUTION :
8 x 0
For singular matrix A, we have |A| = 0 4 0 2 = 0
12 6 0
x = 4.
42. Real matrices [A]31 , [B]33 ,[C]35 , [D]53, [E]55, and [F ]51 are given. Matrices [B]
and [E] are symmetric. Following statements are made with respect to these matrices.
(I) Matrix product [F ]T [C]T [B][C][F ] is scalar.
(II) Matrix product [D]T [F ][D] is always symmetric with reference to above statements,
which of the following applies?
[GATE 2004(CE)]
(A) Statement (I) is true but (II) is false
(B) Statement (I) is false but (II) is true
(C) Both statements are true
(D) Both statements are false.
Ans.(D)
S OLUTION : Both the statements are false. Statement(I) is false because the product of two
or more matrices is always a matrix and not a scalar. Statement(II) is also false since the
matrix product DT F D doesnot exist because the matrices DT , F and D are not compatible
for matrix multiplication.
Matrix Algebra
43. Let A =
(A)
"
2 0.1
0 3
7
10
and A1 =
(B)
"
1/2 a
0
b
3
20
. Then a + b =
19
60
(C)
35
[GATE 2005(EC)]
(D)
11
120
Ans. (A)
S OLUTION :
But given A1 =
1
=
6
"
A1
1/2 a
0
b
2 0.1
0 3
#
3 0.1
0 2
Given A =
"
"
"
A1
1
2
1
=
6
3
6
"
3 0.1
0 2
0.1
1
6 = 2
2
0
6
2
0.1
and b =
6
6
0.1 2
2.1
21
7
a+b=
+ =
=
=
6
6
6
60
20
1
1
1
1
1
1
1
1
0
0
0
0
0
0
4
2
0 1 0 0
0 1 0 0
4
2
(A)
(B)
0 0 21 0
0 0 12 0
0 0 0 12
0 0 0 12
1 0 0 0
4 0 0 0
0 1 0 0
0 1 0 0
4
(C)
(D)
1
0 0 1 0
0 0 4 0
0 0 0 1
0 0 0 14
a
b
a=
Ans. (C)
36
1 0 1
Ans. (B)
S OLUTION :
4]
(B) [5
3 1]
(C) [2 0 1]
[GATE 2005(EE)]
(D) [2
1 1/2]
1 0 1
|R| = 2 1 1 = 1(2 + 3) 0 1(6 2) = 5 4 = 1
2 3
2
We know that R1 =
adj(R)
|A|
= adj(R)
[ |R| = 1]
= [cofactor(R)]T .
Since we need only the top row of R1 , we need to nd only cofactors of rst column of (R)
which after transpose will become the rst row of adj(R).
1+1 1 1
Now cofactor of 1 = (1)
= 2+3 = 5
3
2
0 1
cofactor of 2 = (1)1+2
= (1)5 (0 + 3) = 3
3
2
0 1
cofactor of 2 = (1)1+3
=0+1=1
1 1
Top row of R1 is [5
3 1]
1
1 1
Ans.(C)
S OLUTION :
(B) 1
1
1 1
Let A = 1 1 0
1
1 1
[GATE 2006(EC)]
(C) 2
(D) 3
Matrix Algebra
37
1
1
1
0 2 1 (Applying R2 R2 R1 , R3 R3 R1 )
0
0
0
"
1
1
1 1
6= 0
(A) = 2
cos sin 0
1 0 0
E = sin
cos 0 and G = 0 1 0 .
0
0 1
0 0 1
What is the matrix F ?
cos sin 0
(A) sin
cos 0
0
0 1
[GATE 2006(ME)]
cos sin 0
cos sin 0
Ans. (C)
S OLUTION:
sin cos 0
(D) cos
sin 0
0
0 1
1 0 0
Given that EF = G = 0 1 0
0 0 1
i.e., EF = I F = E 1 ( AA1 = I)
1
cos sin 0
cos sin 0
1
adjA
1
i.e.,F = sin
=
A
=
cos 0
cos 0
sin
|A|
cos2 +sin2
0
0 1
0
0 1
cos sin 0
= sin cos 0
0 0
1
38
Alternate Method:
An easier method for nding F is by multiplying E with each of the options (A),(B),(C) and
(D) and nding out which one gives the product as identity matrix G.
Statement for Linked Questions 48 and 49.
T
10
2
2
48. An orthogonal set of vectors having a span that contains P, Q, R is [GATE 2006 (EE)]
6
4
4
5
8
(A) 3 , 2
(B) 2 , 7 , 2
6
3
4
1
3
6
3
3
4
1
5
(C) 7 , 2 , 9 (D)
3 , 31 , 3
1
2
4
1
3
4
Ans. (A)
S OLUTION : An easier method to nd the orthogonal vectors having a span than contains
P, Q, R is rst determine whether the siven vectors are orthogonal or not with each of the
choices (A), (B), (C) and (D).
6
4
X1T X2 = 24 + 6 + 18 = 0
Notice that the choices (B), (C), (D) are not orthogonal.
49. The following vector is linearly dependent upon the solution to the previous problems
8
(A) 9
3
Ans. (B)
(B) 17
30
4
(C) 4
5
13
(D) 2
3
Matrix Algebra
39
S OLUTION : We know taht the vectors are linearly dependent if the rank of the matrix of the
given vectors is less than the number of vectors.
The choice (B): [2 17 30]T is linearly dependent upon the solution obtained in previous
question namely [6 3 6]T and [4 2 3]T since
6 3 6
4 2 3 = 6(60 + 51) + 3(120 + 6) + 6(68 + 4) = 0
2 17 30
50. q1 , q2 , q3 , . . . , qn are n-dimensional vectors with m < n. This set of vectors is linearly
dependent. Q is the matrix with q1 , q2 , . . . , qm as the columns. The rank of Q is
[GATE 2007]
(A) lessthan m
(B) m
(D) n
Ans. (A)
S OLUTION We know that if the rank of the matrix of the given vectors is less than the number of vectors then the vectors are linearly dependent. We are given Q = [q1 , q2 , q3 , . . . , qm]
where q1 , q2 , . . . , qm are dependent vectors.
Hence rank of Q < m(= no. of vectors).
51. It is given that X1 , X2 , . . ., XM are M non-zero orthogonal vectors. The dimension of the
vector space spanned by the 2M vectors X1 , X2, . . . , XM , X1 , X2, . . . , XM is
[GATE 2007(EC)]
(A) 2M
(C) M
(B) M + 1
(D) dependent on the choice of X1 , X2, . . . , XM
Ans. (C)
S OLUTION :
sion M.
Since (X1 , X2, . . . , XM ) are orthogonal, they span a vector space of dimen-
40
[1, 1, 0]T , [1, 0, 1]T is a linearly independent set, but it does not span X and
therefore is not a basis of X.
(C) X is not a subspace of R3 .
(D) None of the above.
(B)
Ans. (A)
k1 k2
k
k
X = 0 or X = k
k
0
Now the set spans X, since both of these can be generated by linear combinations of
[1, 1, 0]T and [1, 0, 1]T , Hence the set is a basis for the subspace X.
53. X = [x1 , x2 , . . ., xn ]T is an n-tuple non-zero vector. The n n matrix V = XX T
[GATE 2007(EE)]
(A)
(B)
has rank 1
Ans. (B)
SO LUTION : We have V = XX =
x1
x2
..
.
xn
(C)
n1
is orthogonal
(D)
[x1 x2 . . . xn ]1n
has rank n
Matrix Algebra
(Applying R2
R2
x2
R1
x1 , R 3
R3
x3
x21
x2 x1
..
.
x1 x2
x22
..
.
x1 x3
x2 x3
..
.
. . . x1 xn
. . . x2 xn
.
. . . ..
xn x1 xn x2 xn x3 . . . x2n
x21
0
0
...
0
x1 x2
0
0
...
0
x1 x3
0
0
...
0
R1
x1 , . . . , R n
Rn
xn
...
...
...
...
...
x1 xn
0
0
...
0
R1
x1 )
41
nn
"
7
2
5 1
1
(B)
3
"
7 2
5 1
[GATE 2007(CE)]
1
(C)
3
"
7 2
5
1
1
=
ad bc
"
d b
c
a
"
7 2
5
1
1
(D)
3
"
7 2
5 1
Ans.(A)
"
1 2
5 7
#1
"
a b
c d
1
=
7 10
"
#1
7 2
5 1
1
=
3
1
=
3
"
7
2
5 1
55. Let A = [aij ], 1 i, j n with n 3 and aij = i.j. Then the rank of A is
[GATE 2007(IN)]
(A) 0
Ans. (B)
(B) 1
(C) n 1
(D) n
42
1
2
3
... n
2
4
6
. . . 2n
A= 3
6
9
. . . 3n
2n 3n . . . n2
(A) 0
[GATE 2007(PI)]
(D) 3b(1 + b)
Ans. (A)
1+b
S OLUTION : Let = b
1
2 + 2b
= 2 + 2b
2 + 2b
b
1
1+b 1
2b
1
= (2 + 2b)
b
1
1 + b 1 (ApplyingC1 C1 + C2 + C3 )
2b
1
1 b
1
1 1+b 1
1 2b
1
= (2 + 2b)(0) [
=0
57. A is m n full rank matrix with m > n and I is an identity matrix. let matrix
A+ = (AT A)1 AT . Then which one of the following statement is FALSE?
[GATE 2008 (EE)]
(A) AA+ A = A
Ans. (D)
(C) A+ A = I
(D) AA+ A = A+
Matrix Algebra
43
Q will have four linearly independent rows and four linearly independent columns.
Q will have four linearly independent rows and ve linearly independent columns.
QQT will be invertible.
QT Q will be invertible.
Ans. (A)
S OLUTION : We know that the rank of a matrix is equal to the maximum number of its linearly
independent rows and also to the maximum number of its linearly independent columns.
Since (Q) = 4, therefore, Q will have four linearly independent rows and four linearly
independent columns.
59. Let P be 2 2 real orthogonal matrix and x
is a real vector [x1 , x2]T with length
||x|| = (x21 + x22 )1/2 . Then which one of the following statement is correct? [GATE 2008]
(A)
(B)
(C)
(D)
||P x
|| ||
x|| where atleast one vector satises ||P x
|| < ||
x||
||P x
|| ||
x|| for all vectors x
||P x
|| = ||
x|| when atleast one vector satises ||P x
|| < ||
x||.
No relationship can be established between ||
x|| and ||P x
||.
Ans.(B)
S OLUTION :
P x =
"
cos
sin
sin cos
Now ||P x
|| =
#"
x1
x2
"
"
x1 cos + x2 sin
x1 sin + x2 cos
cos
sin
sin cos
#
p
(x1 cos + x2 sin )2 + (x1 sin + x2 cos )2
. Then
44
Hence ||P x
|| = ||
x|| for every vector.
(B) Q1
(D) P QP 1
Ans.(B)
0 1 0
0 1 0
0 1
0
(A) 1 0 0
(B) 1
0
0
0 0 1
0
0 1
0 1 0
0 1
0
(D) 0
(C) 0 0 1
0 1
1
0
0
1 0 0
Ans. (A)
S OLUTION : We can nd the inverse of the given matrix A by using the formula A1 =
adjA
|A|
Alternate Method: The given matrix A is an elementary matrix since it can be obtained from
the unit matrix I3 by interchanging R1 and R2 . Hence the inverse matrix corresponding to the
elementary matrix A is itself.
62. A square matrix B is skew-symmetric if
(A) B T = B
(B) B T = B
(D) B 1 = B T
Ans.(A)
S OLUTION :
Matrix Algebra
45
4
5
, the transpose of the matrix is equal to the inverse of the
3
5
matrix [M ]T = [M ]1 . The value of x is given by
[GATE 2009(ME)]
3
5
63. For a matrix [M ] =
x
(A)
4
5
(B)
3
5
(C)
3
5
4
5
(D)
Ans.(A)
S OLUTION :
3 4
5 5
[M ]=
3
x
5
Given that
and [M ]T =[M ]1
MMT =I 5
x
4
3
5 5
3
4
5
5
12
3
12
12 5
4
3
x+
=0 x=
x=
=
5
25
5
25
25
3
5
1 3 2
64. The value of the determinant 4 1 1 is
2 1 3
(A) 28
(B) 24
(C) 32
"
#
1 0
=
3
0 1
5
[GATE 2009(PI)]
(D) 36
Ans. (B)
S OLUTION :
1 3 2
Let = 4 1 1
2 1 3
. Then
"
3 + 2i
i
i
3 2i
1
(B)
12
"
3 2i
i
i
3 + 2i
[GATE 2010(CE)]
#
46
1
(C)
14
"
3 2i
i
i
3 + 2i
"
3 + 2i
i
i
3 2i
1
(D)
14
"
Ans.(B)
S OLUTION :
"
a b
c d
#1
1
=
ad bc
"
d b
c
a
a b
c d
is given by
Hence
"
#
"
#1
3 + 2i
i
1
3 2i
i
=
(3 + 2i)(3 2i) + i2 i
i
3 2i
3 + 2i
1
=
9+41
"
3 2i
i
i
3 + 2i
1
=
12
"
3 2i
i
i
3 + 2i
(B) |X| =
6 0 and |Y | = 0
(D) |X| =
6 0 and |Y | =
6 0
Ans. (C)
S OLUTION :
are singular.
If product of two non-zero square matrices is zero matrix, then both matrices
(B) orthogonal
!
1
3
+j
are [GATE 2011(EE)]
2
2
(C) parallel
(D) collinear
Ans.(B)
1 h
i
1
3 2 1
T
2
2
X1 X2 = 1 1 a a
= 1+a+a = 0
a=
+j
,a =
j 23
2
2
2
1
S OLUTION :
Matrix Algebra
47
S OLUTION : We know that every square matric can be expressed as the sum of symmetric
matrix and skew-symmetric matrix.
1
1
A = (A + AT ) + (A AT ) = [S] + [D].
2
2
= symmetric matrix + skew-symmetric matrix.
5 3 1
6 2 4
14 10
0
(A) 0
(B) 1
(C) 2
[GATE2012(BT)]
(D) 3
Ans. (C)
S OLUTION :
Let A =
5 3 1
|A| = 6 2 4
14 10
0
5 3 1
6 2 4 . Then
14 10
0
[Expand by R1 ]
48
5 3
Since
6 2
= 10 18 = 8 6= 0
rank (A) = 2
[GATE 1987]
(B) The columns are linearly independent
(D) None of the above
Ans. (C)
S OLUTION : If the rows of a square matrix are linearly dependent, then the determinant of
matrix becomes zero. Therefore, the matrix is singular if the rows are linearly dependent.
71. Let A be an m n matrix and B an n m matrix. It is given that
determinant (Im +AB) = determinant (In +BA), where Ik is the k k identity matrix. Using
the above property, the determinant of the matrix given below is
2 1 1 1
1 2 1 1
1 1 2 1
1 1 1 2
(A) 2
(B) 5
(C) 8
(D) 16
Ans.(B)
Here
1 1 1 1
and B =
14
m = 1 and n = 4
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Given det (Im + AB) = det(In + BA) det(I1 + AB) = det(I4 + BA)
1
1
1
1
41
Matrix Algebra
det([5]) = det
Hence
2
1
1
1
1
2
1
1
1
1
2
1
1
1
1
2
2
1
1
1
1
2
1
1
=5
1
0
0
0
1
1
2
1
0
1
0
0
1
1
1
2
0
0
0
0
0
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
49
1 x x2
[GATE 2013(CS)]
72. Which one of the following does NOT equal 1 y y 2 ?
1 z z2
1 x(x + 1) x + 1
1 (x + 1) x2 + 1
(A) 1 y(y + 1) y + 1
(B) 1 (y + 1) y 2 + 1
1 z(z + 1) z + 1
1 (z + 1) z 2 + 1
0 x y x2 y 2
2 x + y x2 + y 2
(C) 0 y z y 2 z 2
(D) 2 y + z y 2 + z 2
1 z
1 z
z2
z2
Ans.(A)
0
1
1
50
(A) 0
(B) 1
(C) 2
(D) 3
Ans.(B)
0
1
1
S OLUTION : |A| = 1
1 0
1 0
1
(A) 3.
1
1
Since
1 0
6= 0, (A) = 2
= 0 1(1 + 0) + 1(0 1) = 1 1 = 0
Ans. (D)
76. For matrices of same dimension M, N and scalar C, which one of these properties DOES
NOT ALWAYS hold?
[GATE 2014(EC-Set 1)]
(A) (M T )T = M
(C) (M + N )T = M T + N T
(D) M N = N M
Ans. (D)
Matrix Algebra
51
Ans. 200
1 3 0
78. Given that the deterninant of tha matrix 2 6 4 is 12, the determinant of the
1 0 2
2 6 0
matrix 4 12 8 is
[GATE 2014(ME-Set 1)]
2 0 4
(A) 96
(B) 24
(C) 24
(D)
1 3 0
2 6 0
96
. Then
3 2 1
1
S OLUTION :
3 2 1
1
K T JK = [1 2 1]13 2 4 2
2
1 2 6 33 1 31
= [3 + 4 1 2 + 8 2 1 + 4 6]13 2
1 31
= [6 8 1]13 2
= [6 + 16 + 1] = [23]
1 31
52
Ans. 88
0
1
2
3
1
0
3
0
0
1
2
3
3
0
1 2 3
|A| = (1) 3 0 1 + 0 3
0 1 2
2
3
0
1
3
0
1
2
2
3
0
1
is
3
0
1
2
is symmetric
0 1 3
2 3 1 [Expanding by R2 ]
3 0 2
6
0 4
4
Ans. 2
Matrix Algebra
53
Ans. 0
S OLUTION :A = 4
[1 9
7 31
2
18
10 2
|A| = 4 36 20 = 0
7
63
35 7
=0
0
0
0
0
0
1
2
18
10
5]13 = 4 36 20
7
63
35
18 10
0 0 (Applying R2 R2 + 2R1 )
63 35
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
which is obtained by reversing the order of the columns of the identity matrix I6 . Let
P = I6 + J6 , where is a non-negative real number. The value of for which det(P ) = 0
is
[GATE 2014(EC-Set 1)]
Ans. 1
(ii) Let P = I4 + J4 =
1
0
0
0
0
1
0
0
0
0
1
0
"
0
0
0
1
1 0
0 1
0
0
0
1
"
0
0
1
0
0 1
1 0
0
1
0
0
1
0
0
0
"
1
1
1 0 0
0 1 0
0 1 0
0 0 1
54
0 1
1 0
|P | = 1 0 0 1
0 0 1
0 0
= (1 2 ) 2 (1 2 ) = (1 2 )(1 2 ) = (1 2 )2
(B) (P Q)2 = P 2 2P Q + Q2
(D) (P +Q)2 = P 2 +P Q+QP +Q2
Ans. (D)
(B) N 1
(C) N
Ans. (C)
S OLUTION : We know that rank of a matrix is unaltered by applying the elementary Row
(or column) operations. Here the matrix B is obtained from the matrix A by applying the
elementary operations. (C1 C1 p + C2 q and C2 C1 r + C2 s). Since the rank of A is N ,
therefore, the rank of B is also N .
86. If V1 and V2 are 4-dimensional subspaces of a 6-dimensional vector space V , then the
smallest possible dimension of V1 V2 is
[GATE 2014(CS - Set 3)]
Ans. 2
S OLUTION :