telegram- Hmara college

Chapter 4
Linear Algebra

CHAPTER HIGHLIGHTS

☞ Introduction ☞ Systems of linear equations

☞ Determinants

IntroDuction Column Matrix A matrix which has only one column

A set of ‘mn’ elements arranged in the form of rectangular
 a1 
array having ‘m’ rows and ‘n’ columns is called an m × n  
matrix (read as ‘m by n matrix’) and is denoted by A = [aij] a2
A =   or [aij ]n×1
where 1 ≤ i ≤ m; 1 ≤ j ≤ n  
 
 a11 a12 a13  a1n   an 
 
a21 a22 a23  a2 n 
or A= Diagonal Matrix A square matrix is said to be a diagonal
     
  matrix if all its elements except those in the principal diago-
 am1 am 2 am3  amn  nal are zeros. That is, if
The element aij lies in the ith row and jth column.
1. m = n (A is a square matrix) and
2. aij = 0 if i ≠ j (The non-diagonal elements are zeros)
Type of Matrices
Square Matrix A matrix A = [aij]m×n is said to be a square A diagonal matrix of order ‘n’ with diagonal elements d1,
matrix, if m = n (i.e., Number of rows of A = Number of d2, . . . , dn is denoted by Diag [d1 d2 . . . dn].
columns of A) Scalar Matrix A diagonal matrix whose diagonal elements
The elements a11, a22, a33, . . . , ann are called ‘DIAGONAL are all equal is called a scalar matrix. That is, if
ELEMENTS’.
The line containing the diagonal elements is the 1. m = n
‘PRINCIPAL DIAGONAL’. 2. aij = 0 if i ≠ j
The sum of the diagonal elements of ‘A’ is the ‘TRACE’ 3. aij = k if i = j for some constant ‘k’.
of A.
Unit or Identity Matrix A scalar matrix of order ‘n’ in
Row Matrix A matrix A = [aij]m×n is said to be row matrix, which each diagonal element is ‘1’ (unity) is called a unit
if m = 1 (i.e., the matrix has only one row) matrix or identity matrix of order ‘n’ and is denoted by In.
General form is A = [a1, a2, . . ., an] or [aij]1×n That is,

Chapter 04.indd 71 5/19/2017 5:19:15 PM

 2.72 | Part II ■ Engineering Mathematics

1. m = n Properties of Transpose
2. aij = 0 if i ≠ j T − 1: (A′)′ = A, for any matrix A
3. aij = 1 if i = j T − 2: (A + B)′ = A′ + B′, for any two matrices A, B of
1 0 0 same order
1 0   T − 3: (KA)′ = KA′, for any matrix A
Example: I1 = [1], I 2 =   , I3 =  0 1 0 
0 1 0 0 1 T − 4: (AB)′ = B′A′, for any matrices A, B such that
  number of columns of A = number of rows of B
Null Matrix or Zero Matrix A matrix is a ‘null matrix’ or (REVERSAL LAW)
zero matrix if all its elements are zeros. T − 5: (An)′ = (A′)n, for any square matrix A
Upper Triangular Matrix A square matrix is said to be an Trace of a Matrix
upper triangular matrix, if each element below the principal
Let ‘A’ be a square matrix. The trace of A is defined as the
diagonal is zero. That is,
sum of elements of ‘A’ lying in the principal diagonal.
1. m = n Thus if A = [aij]n × n then trace of ‘A’ denoted by tr A = a11
2. aij = 0 if i > j + a22 + . . . + ann.
1 4 3 2 Properties of Trace of a Matrix Let A and B be any two
 
0 −1 6 1 square matrices and K any scalar then,
For example, 
0 0 3 2 1. tr(A + B) = trA + trB
 
0 0 0 9 4×4 2. tr(KA) = KtrA
Lower Triangular Matrix A square matrix is said to be a 3. tr(AB) = tr(BA)
lower triangular matrix, if each element above the principal
diagonal is zero, i.e., if Conjugate of a Matrix
A matrix obtained by replacing each element of a matrix ‘A’
1. m = n
by its complex conjugate is called the ‘conjugate matrix’ of
2. aij = 0 if i < j
1 0 0 0 A and is denoted by A. If A = [aij]m×n, then A =  aij  where
 −2 aij is the conjugate of ‘aij’.
1 0 0
For example,  
0 7 8 0 Properties of Conjugate of a Matrix
5 4 2 1 
 C − 1: (( A)) = Afor any matrix ‘A’
Horizontal Matrix If the number of rows of a matrix is less C − 2: ( A + B ) = A + B for any matrices A, B of same order.
than the number of columns, i.e., m < n, then the matrix is C - 3: ( KA) = K A for any matrix ‘A’ and any Scalar K.
called horizontal matrix.
C − 4: ( AB) = ( A) ⋅ Bfor any matrices A and B with the con-
Vertical Matrix If the number of columns in a matrix is dition that number of columns of A = number of
less than the number of rows, i.e., if m > n, then the matrix rows of B.
is called a vertical matrix. C − 5: ( A) n = ( An )for any square matrix ‘A’.
Comparable Matrices Two matrices A = [aij]m×n and B
= [bij]p×q are said to be comparable, if they are of same order, Tranjugate or Transposed Conjugate
i.e., m = p; n = q. of a Matrix
Equal Matrices Two comparable matrices are said to be Tranjugate of a matrix ‘A’ is obtained by transposing the
‘equal’, if the corresponding elements are equal, i.e., A conjugate of A and is denoted by Aq. Thus Aθ = ( A)T .
= [aij]m×n and B = [bij]p×q are equal if Properties of Tranjugate of a Matrix
1. m = p; n = q (i.e., they are of the same order) TC - 1: (Aq )q = A for any matrix A
2. aij = bij ∀ i, j (i.e., the corresponding elements are TC - 2: (A + B)q = Aq + Bq for any matrices A, B of the
equal) same order.
TC - 3: (KA)q = KAq for any matrix A and any scalar K.
Transpose of a Matrix TC - 4: (BA)q = BqAq for any matrix A, B with the condi-
tion that number of columns of A = number of
The matrix obtained by interchanging the rows and the col-
rows of B.
umns of a given matrix ‘A’ is called the ‘transpose’ of A
and is denoted by AT or A′. If A is an (m × n) matrix, AT will TC - 5: (An)q = (Aq)n for any square matrix ‘A’.
be an (n × m) matrix. Thus if A = [aij]m×n then AT = [uij]n×m, Symmetric Matrix A matrix A is said to be symmetric, if AT
where uij = aji. = A (i.e., transpose of A = A).

Chapter 04.indd 72 5/19/2017 5:19:16 PM

 Chapter 4 ■ Linear Algebra | 2.73

NOTE S - 3: a(bA) = (ab)A

A symmetric matrix must be a square matrix. S - 4: 1A = A

Skew-symmetric Matrix A matrix ‘A’ is said to be skew- Addition of Matrices

symmetric matrix, if AT = (-A), i.e., A = [aij]m×n is skew sym- If A and B are two matrices of the same order, then they are
metric if ‘conformable’ for addition and their sum ‘A + B’ is obtained
1. m = n by adding the corresponding elements of A and B, i.e., if
2. ajI = - aij ∀ i, j A = [aij]m×n; B = [bij]m×n, then A + B = [aij + bij]m×n.

NOTE Properties of Addition Let A, B and C be three matrices of

same order say m × n, then
In a skew-symmetric matrix, all the elements of the prin-
cipal diagonal are zero. A - 1: A + B is also a m × n matrix (CLOSURE)
A - 2: (A + B) + C = A + (B + C) (ASSOCIATIVITY)
Orthogonal Matrix A square matrix ‘A’ of order n × n is
A - 3: If ‘O’ is the m × n zero (null) matrix, then A + O = O
said to be an orthogonal matrix, if AAT = ATA = In.
+ A = A (‘O’ is the ADDITIVE IDENTITY)
Involutory Matrix A square matrix ‘A’ is said to be involu-
A - 4: A + (-A) = (-A) + A = O (-A is the ADDITIVE
tory matrix, if A2 = I (where I is identity matrix).
INVERSE)
Idempotent Matrix A square matrix ‘A’ is said to be an
A - 5: A + B = B + A (COMMUTATIVITY)
idempotent matrix, if A2 = A.
Nilpotent Matrix A square matrix ‘A’ is said to be nilpotent NOTE
matrix, if there exists a natural number ‘n’ such that An = O. The set of matrices of same order form an ‘Abelian Group’
If ‘n’ is the least natural number such that An = O, then ‘n’ under addition.
is called the index of the nilpotent matrix ‘A’. (Where O is
the null matrix). Multiplication of Matrices
Unitary Matrix A square matrix ‘A’ is said to be a unitary Let A and B be two matrices. A and B are conformable for
matrix if, AAq = AqA = I. (Where Aq is the transposed con- multiplication, only if the number of columns of A is equal
jugate of A.) to the number of rows of B.
Hermitian Matrix A matrix ‘A’ is said to be a hermitian Let A = [aij] be an m × n matrix, B = [bjk] be an n × p
matrix, if Aq = A, i.e., A = [aij]m×n is hermitian if matrix. Then the product ‘AB’ is defined as the matrix C =
[cik] of order m × p where cik = ai1b1k + ai 2 b2 k +  + ain bnk
1. m = n n
2. aij = aij ∀i, j = ∑ aij b jk .
j =1
NOTE
cij calculated for i = 1, 2, . . . m and k = 1, 2, . . ., p will give
The diagonal elements in a hermitian matrix are real numbers. all the elements of the matrix C.
Skew-hermitian Matrix A matrix ‘A’ is said to be a skew- Properties of Multiplication
hermitian matrix, if Aq = -A. M - 1: If A, B, C be m × n, n × p, p × q matrices respec-
tively, then (AB)C = A(BC) (ASSOCIATIVITY).
Operations on Matrices M - 2: If A is a m × n matrix, then A In = A and Im A = A
and if A is a square matrix, i.e., m = n, then AI =
Scalar Multiplication of Matrices IA = A (I is the MULTIPLICATIVE IDENTITY).
If A is a matrix of order m × n and ‘K’ be any scalar (a M - 3: If A, B, C be m × n, n × p, p × q matrices respectively,
real or complex number), then KA is defined to be a m × then A(B + C) = AB + AC (DISTRIBUTIVE LAW).
n matrix whose elements are obtained by multiplying each M - 4: Matrix multiplication is NOT COMMUTATIVE
element of ‘A’ by K, i.e., if A = [aij]m×n then KA = [Kaij]m×n in in general.
particular if K = -1; then KA = -A is called the negative of M - 5: The INVERSE of a given matrix may not always exist.
A and is such that,
A + (-A) = [aij] + [-aij] = [aij - aij] = [0] = O (zero matrix) Determinants
(-A) + A = [-aij] + [aij] = [-aij + aij] = [0] = O
Let A = [aij] be a square matrix of order ‘n’. Then the deter-
That is, A + (-A) = (-A) + A = O.
minant of order ‘n’ associated with ‘A’ is denoted by | A | or
Properties of Scalar Multiplication |aij| or Det(A) or D.
Let A, B are two matrices of same order and a, b are any
NOTES
scalars, then
S - 1: a(A + B) = aA + aB 1. Determinant of a matrix exists, only if it is a square matrix.
S - 2: (a + b)A = aA + bA 2. The value of a determinant is a single number.

Chapter 04.indd 73 5/19/2017 5:19:16 PM

 2.74 | Part II ■ Engineering Mathematics @getstudyfeverbot
Determinant of Order 1 (or First a1 b1 c1
Order Determinant) Let ∆ = a2 b2 c2
If ‘a’ be any number, then determinant of ‘a’ is of order ‘1’ a3 b3 c3
and is denoted by |a|. The value of |a| = a.
Enter the first column and then the second column after the
Determinant of Order 2 (or Second Order third column and take the product of numbers as shown by
Determinant) the arrows, taking care of signs indicated
a1 b1 c1 a1 b1
If ‘A’ is a square matrix of order 2 given by
a b  a1 b1 a2 b2 c2 a2 b2
A =  1 1  then Det ( A) = is determinant of
 a2 b2  a2 b2
a3 b3 c3 a3 b3
order 2 and its value is D = a1b2 - a2b1
Then
Minor and Cofactor of a Matrix
D = a1b2c3 + b1c2a3 + c1a2b3 - a3b2c1 - b3c2a1 - c3a2b1
 a1 b1 c1  We can now define the cofactor of an element aij in a 4 × 4
 
Let A =  a2 b2 c2  be a 3 × 3 matrix matrix as (-1)i+j × (Determinant of the 3 × 3 matrix obtained
a b3 c3  by deleting the i-th row and j-th column) and determinant of
 3
a 4 × 4 matrix to be the sum of products of elements of any
Then the minor of an element aij of ‘A’ is the determinant of row (or column) by their corresponding cofactors. We can
the 2 × 2 matrix obtained after deleting the i-th row and j-th similarly define determinant of a square matrix of any order.
column of A and is denoted by Mij.
Properties of Determinant
The cofactor of aij is denoted by Aij and is defined as
(-1)i+j Mij, i.e., Aij = (-1)i+j Mij 1. If two rows (or columns) of a determinant are
interchanged, the value of the determinant is multiplied
Determinant of Order 3 (Third by (-1).
Order Determinant) 2. If the rows and columns of a determinant are
If A is a square matrix of order ‘3’, given by interchanged, the value of the determinant remains
 a1 b1 c1  unchanged, i.e., Det(A) = Det(AT).
  3. If all the elements of a row (or column) of a
A =  a2 b2 c2  . Then the determinant of ‘A’ is given by
a determinant are multiplied by a scalar (say ‘K’), the
 3 b3 c3  value of the new determinant is equal to ‘K’ times the
a1 b1 c1 value of the original determinant.
∆ = Det A = a2 b2 c2 is a determinant of order 3 and 4. If two rows (or columns) of a determinant are
identical, then the value of the determinant is zero.
a3 b3 c3
5. If the elements of a row (or a column) in a determinant
the value is obtained by taking the sum of the products of
are proportional to the elements of any other row (or
the elements of any row (or column) by their corresponding
column), then the determinant is ‘0’.
cofactors.
Thus for A, D = a1A1 + b1B1 + c1C1 6. If every element of any row (or column) is zero, then
determinant is ‘0’.
   b2 c2 a2 c2 a2 b2 7. If each element in a row (or column) of a determinant is
= a1 − b1 + c1
b3 c3 a3 c3 a3 b3 the sum of two terms, then its determinant can be
or also D = a1A1 + a2A2 + a3A3 expressed as the sum of two determinants of the same
order.
b2 c2 b1 c1 b c1
= a1 − a2 + a3 1 8. (The theorem of ‘false cofactor’) The sum of products
   b3 c3 b3 c3 b2 c2 of elements of a row (or column) with the cofactors of
(This is by expanding by C1) and so on. any other row (or column) is zero.
The sign to be used before a particular element can be  a1 b1 c1 
judged by using the following rule:  
Thus in A =  a2 b2 c2 
+-+ a b c 
 3 3 3
-+-
a1A2 + b1B2 + c1C2 = 0
+-+
The value of the determinants of order 3 can also be evalu- a2A1 + b2B1 + c2C1 = 0 and so on in general
ated by using ‘Sarrus’ method given as follows: arAs + brBs + crCs = 0 if r ≠ s

Chapter 04.indd 74 5/19/2017 5:19:17 PM

 Chapter 4 ■ Linear Algebra | 2.75

9. If the elements of a determinant are polynomials in x Results

and the determinant vanishes for x = a, then x - a is a 1. If ‘A’ is of order 3 × 3 and K is any number, then
factor of the determinant. Adj(KA) = K ²(Adj A).
2. A(Adj A) = (Adj A)A = |A| I for any square matrix ‘A’.
Singular and Non-singular Matrices
3. Adj I = I; Adj O = O where I is the identity matrix and
A square matrix ‘A’ is said to be singular, if Det(A) = 0 and O is the null matrix.
is non-singular, if Det(A) ≠ 0.
4. Adj(AB) = (Adj B) (Adj A) if A, B are non-singular
and are of same type.
NOTES
5. If A = An ×n, then
1. A unit matrix is non-singular (since its Det = 1)
2. If A and B are non-singular matrices of the same det(Adj A) = (det A)n–1.
‘type’, then AB is non-singular of the same ‘type’. Adj(Adj A) = (det A)n–2(A).
2
|Adj(Adj A)| = (det A)(n–1)
Inverse of a Matrix
Evaluating Inverse of a Square Matrix
Let ‘A’ be a square matrix. A matrix ‘B’ is said to be an
inverse of ‘A’, if AB = BA = I. 1
If A is a square matrix, then A−1 = ( Adj A)
A
NOTE NOTES
If B is the inverse of ‘A’, then ‘A’ is the inverse of ‘B’. 1. The inverse of an identity matrix is itself.
1
Some Results of Inverse 2. ( Adj A) −1 = A
A
1. Inverse of a square matrix, when it exists, is unique.
3. If A is a non-singular square matrix (say of order 3)
2. The inverse of a square matrix exists, if and only if it and K is any non-zero number, then
is non-singular.
1 −1
3. If ‘A’ and ‘B’ are square matrices of the same order, ( KA) −1 = A
then ‘AB’ is invertible (i.e., inverse of AB exists) if ‘A’ K
and ‘B’ are both invertible.
4. If ‘A’ and ‘B’ are invertible matrices of the same
Rank and Nullity of a Matrix
order, then (AB)-1 = B-1 A-1. Rank of a Matrix The Matrix ‘A’ is said to be of rank ‘r’, if
5. If A is invertible, then so is AT and (AT)-1 = (A-1)T. and only if it has at least one non-singular square sub-matrix
of order ‘r’ and all square sub-matrices of order (r + 1) and
6. If A is invertible, then so is Aq and (Aq)-1 = (A-1)q.
higher orders are singular. The rank of a matrix A is denoted
by rank (A) or r(A).
Adjoint of a Matrix
Nullity of a Matrix If A is a square matrix of order ‘n’, then
The adjoint of a square matrix ‘A’ is the transpose of the
n - r(A), i.e., n - rank (A) is defined as nullity of matrix ‘A’
matrix obtained by replacing the elements of ‘A’ by their
and is denoted by N(A).
corresponding cofactors.
Remark 1: If there is a non-singular square sub-matrix of
NOTE order ‘K’, then r(A) ≥ K.
The adjoint is defined only for square matrices and Remark 2: If there is no non-singular square sub-matrix of
the adjoint of a matrix ‘A’ is denoted by Adj(A). If order ‘K’, then r(A) < K.
 a1 a2  an  Remark 3: If A′ is the transpose of A, then r(A) = r(A′).
  Remark 4: The rank of a null matrix is ‘0’.
b1 b2  bn 
A=
     Remark 5: The rank of a non-singular square matrix of
  order ‘n’ is ‘n’ and its nullity is ‘0’.
 l1 l2  l n 
T
Remark 6: Elementary operations do not change the rank
 A1 A2  An   A1 B1  L1  of a matrix.
   
B1 B2  Bn   A2 B2  L2  Remark 7: If the product of two matrices A and B is
Adj A =  =
            defined, then r(AB) ≤ r(A) and r(AB) ≤ r(B). That is, the
    rank of product of two matrices cannot exceed the rank of
 L1 L2  Ln   An Bn  Ln 
either of them.

Chapter 04.indd 75 5/19/2017 5:19:18 PM

 2.76 | Part II ■ Engineering Mathematics

Elementary Operations or Elementary 1 3 2 

Transformations Example: B = 3 4 −4 
1. Elementary row operations 1 1 6 
(a) Ri ↔ Rj: Interchanging of ith and jth rows
(b) Ri → KRi: Multiplication of every element of ith 1 0 1 
1
row with a non-zero scalar K C2 − 3C1 , C3 ∼ 3 −5 −2  = C (say )
2
(c) Ri → Ri + kRj: Addition of k times the elements of 1 −2 6 
jth row to the corresponding elements of ith row.
C is a column equivalent to B.
2. Elementary column operations
(a) Ci ↔ Cj: Interchanging of ith and jth columns Row Reduced Matrix A matrix A of order m × n is said to
be row reduced if,
(b) Ci → KCi: Multiplication of every element of ith
column with a non-zero scalar K. 1. The first non-zero element of a non-zero row is 1.
(c) Ci → Ci + KCj: Addition of K times the elements 2. Every other element in the column in which such 1’s
of jth column to the corresponding elements of occur is 0.
ith column.  2 3 −4 1  1 0 2
Example: Consider the matrix A =  3 0 1 5   
A =  0 1 3  is a row reduced matrix
 4 7 1 2  0 0 0
 
2 3 − 4 1  1 0 4
   
R2 → 2R2 ∼ 6 0 2 10  B =  0 5 0  is not a row reduced matrix.
 4 7 1 2  0 0 0
 
2 − 4 3 1 Row Reduced Echelon Matrix A matrix ‘X ’ is said to be
C 2 ↔ C3 ∼  3 1 0 5  row reduced echelon matrix if,
 
 4 1 7 2  1. X is row reduced.
2. There exists integer P(0 ≤ p ≤ m) such that first ‘p’
 0 − 4 3 1 rows of X are non-zero and all the remaining rows are
C1 → C1 - 2C4 ∼  −7 1 0 5  zero rows.
 0 1 7 2  3. For the ith non-zero row, if the first non-zero element
NOTE of the row (i.e., 1) occurs in the jth column then, j1 <
The rank of a matrix is invariant under elementary operations j2 < j3 < . . . < jp.

1 0 2
0
Row and Column Equivalence Matrices   0 1 2 0
0 1 0
3  
Example: P =  ; Q = 0 0 0 1 
Row Equivalence Matrix If B is a matrix obtained by 0 0 4
1
  0 0 0 0
applying a finite number of elementary row operations  
successively on matrix A, then matrix B is said to be row 0 0 0
0
equivalent to A (or a row equivalent matrix of A). are echelon matrices. The number of non-zero rows (i.e.,
value of P and Q) are 3 and 2 respectively. The value of i and
Column Equivalence Matrix If B is obtained by applying a j are tabulated below
finite number of elementary column operations successively
i 1 2 3 i 1 2
on matrix A, then matrix B is said to be column equivalent P: Q:
to A (or a column equivalent matrix of A ). j 1 2 3 j 2 4
  
1 3 4  Normal form of a Matrix
Example: A =  2 5 −2  By means of elementary transformations, every matrix ‘A’
1 4 −3 of order m × n and rank r (> 0) can be reduced to one of the
following forms.
1 3 4   I 0 Ir 
R2 − 2 R1 , R3 − R1 ∼ 0 −1 −10  = B (say )
 1.  r    2. [Ir/0]  3. [Ir]  4.  0 
 0 0  
0 1 −7  and these are called the normal forms. Ir is the unit matrix
B is a row equivalent matrix of A. of order ‘r’.

Chapter 04.indd 76 5/19/2017 5:19:19 PM

 Chapter 4 ■ Linear Algebra | 2.77

NOTE When the system of equations has one or more solutions,

the equations are said to be CONSISTENT and the system
If a m × n matrix ‘A’ has been reduced to the normal form
of equations are said to be INCONSISTENT if it does not
 I 0
say  r  then ‘r’ is the rank of A. admit any solution. The system of equations (1) is said to be
 0 0 HOMOGENEOUS, if B = 0
NON-HOMOGENEOUS, if B ≠ 0
Let the system of equations be
Systems of Linear Equations a11x1 + a12x2 + . . . + a1nxn = b1
Let a11 x1 + a12 x2 +  + a1n X n = b1  
a12x1 + a22x2 + . . . + a2nxn = b2
a21 x1 + a22 x2 +  + a2 n X n = b2  ................................
. . .  ................................

. . .  am1x1 + am2x2 + . . . + amnxn = bm
. . . 
 This is a system of ‘m’ equations in ‘n’ variables x1, x2, . . . ,
an1 x1 + an 2 x2 +  ann xn = bn  (1) xn. The system of equations can be written as AX = B where
be a system of ‘n’ linear equations in ‘n’ variables x1, x2, . . . ,
xn. The above system of equations can be written as  a11 a12  a1n   x1   b1 
     
 a21 a22  a2 n   x2  b2
 a11 a12  a1n   x1   b1  A= ,X = , B= 
          
          
 a21 a22  a2 n   x2  =  b2  or AX = B  am1 am 2 amn   xn   bm 
         
    
 an1 an 2  ann   xn   bn   a11 a12  a1n b1 
 
a a  a2 n b2 
where The matrix  21 22 is called the augmented
    
 
 a11 a12  a1n   x1   b1   am1 am 2  amn bm 
     
a21 a22  a2 n  x2 b2 matrix of the system of equations and is denoted by [A : B].
A= , X =  , B =  
         Let AX = B represents ‘m’ linear equations with ‘n’
      variables. Let rank of A = r and rank (A, B) = r1 [where (A,
 an1 an 2  ann   xn   bn 
B) is an augmented matrix]. If r1 ≠ r, then the system of
A is called the co-efficient matrix. equations are inconsistent.
If r1 = r, the table follows:
Any set of values of x1, x2, x3, . . . which simultaneously
satisfy these equations is called a solution of the system.

m=n m>n m<n

r=n r<n r=n r<n r=m r<m
Homo-
Only trivial solution Infinite solutions Only trivial solution Infinite solutions Infinite solutions Infinite solutions
geneous
Non-homo
Unique solution Infinite solutions Unique solution Infinite solutions Infinite solutions Infinite solutions
geneous

Solving System of Linear Equations x1 = D1/D; x2 = D2/D; x3

The following methods of solving system of linear equa- = D3/D; . . .; xn = Dn/D.
tions (1) is applicable only when the co-efficient matrix ‘A’
is non singular, i.e., | A | ≠ 0.
Inverse Method
Cramers Method
Let the system of linear equations be AX = B, where A, X, B
Let AX = B represent the system of equations (1) where A, X
are as defined earlier.
and B are as defined earlier.
If |A| ≠ 0 then pre-multiplying with A-1, we get A-1 (AX)
Let D be | A | and D1, D2, . . . , Dn be the determinants obtained
= A-1B.
by replacing the elements of 1st, 2nd, . . . , nth column of A
⇒ X = A-1B which gives the values of the variables.
by the elements of B. Then if D ≠ 0, we have

Chapter 04.indd 77 5/19/2017 5:19:20 PM

 2.78 | Part II ■ Engineering Mathematics

Gauss-Jordan Method NOTE

Consider the augmented matrix [A : B] of the system of ‘n’ The maximum number of linearly independent rows or
non-homogeneous equations (1) in n-variables columns of a matrix is called the rank of the matrix.
 a11 a12  a1n b1 
  LU Decomposition Method of Factorisation
 a21 a22  a2 n b2  or Method of Triangularization
    
  Consider the system of equations
 an1 an 2  ann bn 
a11 x1 + a12 x2 + a13 x3 = b1 
Reduce this augmented matrix to the standard form 
a21 x1 + a22 x2 + a23 x3 = b2  (1)
1 0  0 d1  a31 x1 + a32 x2 + a33 x3 = b3 
0 1  0 d2 
 In matrix notation, Eq. (1) can be written as AX = B(2)
    
 
0 0  1 dn   a11 a12 a13   x1   b1 
where A =  a21 a22 a23  , X =  x2  and B = b2 
By applying the elementary operations, the solution of the
 a31 a32 a33   x3   b3 
equations is x1 = d1, x2 = d2, . . . , xn = dn.
Step 1: Write A = LU, where L → Lower triangular matrix
Gauss Elimination Method with principal diagonal elements being equal to 1 and U →
Let the system of linear equations given by Upper triangular matrix.
a11 x1 + a12 x2 +  + a1n xn = c1   1 0 0 u11 u12 u13 
a21 x1 + a22 x2 +  + a2 n xn = c2  That is, L = l21 1 0  and U =  0 u22 u23 
 

a31 x1 + a32 x2 +  + a3n xn = c3   l31 l32 1   0 0 u33 


. . . .  (1)
 Step 2: Now Eq. (2) becomes LUX = B(3)
. . . .
 Step 3: Let UX = Y(4)
. . . . 
  y1 
an1 x1 + an 2 x2 +  + ann xn = cn 
where Y =  y2 
Let a11≠ 0 write the above equations in the matrix form AX
 y3 
=B
Write the augmented matrix [A B].
Step 4: Combining Eqs. (3) and (4), we get LY = B(5)
Using elementary row operations, eliminate the unknown On solving Eq. (5) we get y1, y2, y3.
x1 from all the equations except the first. Eliminate the
Step 5: Substituting Y in Eq. (4), we get UX = Y
unknown x2 from all the equations except from first and
On solving, we get X, i.e., x1, x2, x3.
second rows, continuing in this way we finally get the fol-
lowing equivalent system of equations at the (n - 1)th step.
The Characteristic Equation of a Matrix
a′11x1 + a′12x2 + a′13x3 + . . . + a′1nxn = c′1
Characteristic Matrix If A is any square matrix, the matrix
a′22x2 + . . . + a′2nxn = c′2
A - lI where l is a scalar, is called the characteristic matrix
a′33x3 + . . . + a′3nxn = c′3 of A.
a′nnxn = c′n
Characteristic Polynomial If A is any square matrix of
From the above system of equations we can find the values order n, then the determinant | A- lI | yields a polynomial
of the unknowns. f(l) of degree n in l which is known as the characteristic
polynomial of the matrix A.
Linear Dependence Characteristic Equation If f(l) is the characteristic
A set of vectors of n dimensions is said to be linearly polynomial of a matrix A, then f(l) = 0, is called the
dependent if one of these vectors can be expressed as a lin- characteristic equation of A.
ear combination of some other vectors in the set. And the roots of this equation, say l1, l2, . . . , ln are called
If no vector can be expressed as a linear combination the characteristic roots or latent roots or eigen values. If l is
of the others, then the set of vectors is said to be linearly a characteristic root of ordert, then t is called the algebraic
independent. multiplicity of l.

Chapter 04.indd 78 5/19/2017 5:19:21 PM

 Chapter 4 ■ Linear Algebra | 2.79

Characteristic Vectors Corresponding to each characteristic Procedure to Reduce a Square Matrix

root l, there is a non-zero vector which satisfies the character- into Diagonal Form
istic equation | A - lI | = 0. These non-zero vectors are called
Let A be a square matrix of order n that can be reduced to
the characteristic vectors or eigen vectors or latent vectors.
diagonal form
NOTES 1. Find the eigen values and their corresponding eigen
1. The characteristic roots of a matrix and its transpose vectors of A. Let l1, l2, l3, . . . , ln be the eigen values
are the same. and let X1, X2, X3, . . ., Xn be their corresponding eigen
2. 0 is a characteristic roots of a matrix, if the matrix is vectors that are linearly independent.
singular. 2. Form the matrix P with X1, X2, X3, . . ., Xn as its columns
3. The characteristic roots of a triangular matrix are just i.e., P = [X1 X2 X3 … Xn] it can be easily observed that
the diagonal elements of the matrix. P is invertible.
4. If K is any scalar, the characteristic roots of matrix KA 3. Find the inverse of P (i.e., find P-1)
are K times the characteristic roots of matrix A. 4. The diagonal form of A is given by D = P-1 AP.
5. If a1, a2, a3, . . ., an are characteristic roots of matrix λ1 0 0  0 
A and K is a scalar, then the characteristic roots of 0 λ 0  0 
Where D =   is a diagonal matrix
2
matrix A - KI are a1 - K, a2 - K, . . ., an - K.
     
6. If l is a characteristic root of a non-singular matrix,  
then l-1 is a characteristic root of A-1. 0 0 0  λn 
7. If the eigen values of A are l1, l2, . . ., ln then the eigen with eigen values of A as its principal diagonal elements.
values of A² are l12, l22, . . ., ln2. NOTE
Here P is called the modal matrix and D is the spectral
Cayley-Hamilton Theorem matrix of the matrix A
Every square matrix satisfies its characteristic equation. Power of a Matrix by Using its Diagonal Form
Inverse by Cayley-Hamilton Theorem If D is the diagonal form of a square matrix A, then for any
Let A be non-singular square matrix of order n positive integer n, we have An = P Dn P-1.
Let the characteristic equation of A be Where P is the modal matrix of A.

|A - lI| = (-1)n ln + C1ln–1 + C2ln–2 + . . . + Cn–1 l + Cn = 0 SOLVED EXAMPLES

Where C1, C2, . . ., Cn are all scalar constants Example 1
Then by Cayley-Hamilton theorem Find the value of
(-1)nAn + C An–1 + C An–2 + . . . + C A + C I = O(1)
1 2 n–1 n a + b + 2c a b
Multiplying Eq. (1) throughout by A-1, we have c b + c + 2a b .
c a c + a + 2b
A-1[(-1)n An –1 + C1 An–1 + C2 An–2 + . . . + Cn–1 A+ CnI ] = A-1 . 0
Solution
⇒ (-1)nAn–1 + C1 An–2 + C2 An–3 + . . . + Cn–1 I + Cn A-1 c1 → c1 + c2 + c3
−1
⇒ A−1 = [( −1) n An −1 + C1 An − 2 + C2 An −3 +  + Cn −1 I ] 2( a + b + c) a b
Cn
2( a + b + c) b + c + 2a b
NOTE 2( a + b + c) a c + a + 2b
Similarly, we can find A-2, A-3, . . . for the matrix Ax pro-
vided A is non-singular. 1 a b
= 2( a + b + c) 1 b + c + 2a b
Power of a Matrix by 1 a c + a + 2b
Cayley-Hamilton Theorem R2 → R2 - R1  R3 → R3 - R1
Cayley-Hamilton theorem is also helpful in finding higher 1 a b
powers of a square matrix with least possible number of matrix
2( a + b + c) 0 a + b + c 0
multiplications. This is explained in Examples 11 and 12.
0 0 a+b+c
Reduction to Diagonal Form 1 a b
If A is a square matrix of order n with n linearly independent = 2( a + b + c)3 0 1 0 = 2( a + b + c)3 .
eigen vectors, then A can be reduced to a diagonal matrix,
called diagonal form of A. 0 0 1

Chapter 04.indd 79 5/19/2017 5:19:22 PM

 2.80 | Part II ■ Engineering Mathematics

Example 2 ⇒ x(1, 3, 2) + y(1, -4, 1) + z(-1, 2, 5)

 3 1 −2  = (0, 0, 0) only when x = 0, y = 0, z = 0.
Find the rank of the matrix  2 0 −1 . \ The set of vectors are linearly independent.
1 4 1  Example 4
Show that the set of vectors {(2, 3, 9), (3, -2, -6), (-1, 5,
Solution 15)} are linearly dependent.
Given
Solution
 3 1 −2  1 4 1 
 2 0 −1 R ↔ R  2 0 −1 Let x, y, z e R such that
  1 3  x(2, 3, 9) + y(3, -2, -6) + z(-1, 5, 15) = (0, 0, 0)
1 4 1   3 1 −2 
2x + 3y − z = 0
R2 → R2 - 2R1 and R3 → R3 - 3R1 ⇒ 3x − 2 y + 5 z = 0
1 4 1 9 x − 6 y + 15 z = 0
∼ 0 −8 −3 The above system when expressed in matrix form we have
0 −11 −5 the coefficient matrix
   2 3 −1
1 4 1  A =  3 −2 5 
−11  
R3 → R3 + R2 ∼ 0 −8 −3   9 −6 15 
8  −7 
0 0  2 3 −1
 8 
3 −2 5 = 0
which is a row echelon form. The number of non zero rows
= 3. 9 −6 15
The rank of the matrix = The number of non-zero rows in 2 3
it = 3 as R3 = 3R2 and ≠0
3 −2
\ Rank of the matrix = 3.
\ Rank of A = 2 < the number of variables which is 3.
Example 3 \ The system will possess a non-zero solution, i.e.,
Find whether the vectors given below are linearly dependent 2x + 3y − z = 0
or independent {(1, 3, 2), (1, -4, 1), (-1, 2, 5)}.
3x − 2 y + 5 z = 0
Solution x y z
= = = k (say )
Let x, y, z ∈ R such that x(1, 3, 2) + y(1, - 4, 1) + z(-1, 2, 15 − 2 −3 − 10 −4 − 9
5) = (0, 0, 0) ⇒ x = 13k, y = -13k and z = -13k
x+ y−z =0 Let k = 1 ⇒ x = 13, y = -13, z = -13
⇒ 3x − 4 y + 2 z = 0 } (1) \ There exists a non-zero solution such that x, y, z e R
2 x + y + 5z = 0 x(2, 3, 9) + y(3, -2, -6) + z(-1, 5, 15) = (0, 0, 0)
The above system of equations when expressed in \ The set of given vectors are linearly dependent.
determinant form, we have
Example 5
1 1 −1 1 1 −1 How many solutions are there for the system of linear equa-
R 2 −3 R1 , R 3 − 2 R1
3 −4 2  → 0 −7 5 tions x + 2y + z = 0, 3x + 2y - z = 0 and 4x + y - 3z = 0?
2 1 5 0 −1 7
Solution
Determinant of the co-efficient matrix of the given e­ quations
1 1 1 −1
R3 − R 2 1 2 1

7 → 0 −7 5
is 3 2 −1
44
0 0 4 1 −3
7
\ Rank = 3 = number of unknowns = 1(-6 + 1) -2(-9 + 4) +1(3 - 8) = 0
\ There exists a unique solution x = 0, y = 0 and z = 0 \ The system has infinite number of solutions.

Chapter 04.indd 80 5/19/2017 5:19:23 PM

 Chapter 4 ■ Linear Algebra | 2.81

Example 6 Augmented matrix,

Solve the system of equations 1 1 1 6
x1 + x2 + x3 = 1, 3x1 + x2 - 3x3 = 5 and x1 - 2x2 - 5x3 = 10 by [ AB ] is  3 −2 −1 −4 
LU decomposition method.  2 3 −2 2 
Solution R2 → R2 -3R1, and R3 → R3 - 2R1
1 1 1   x1   1   1 1 1 6 
AX = B ⇒ 3 1 −3  x2  =  5  ∼  0 −5 −4 −22 
1 −2 −5  x3  10   0 1 −4 −10 
1 1
Step 1: LU = A R1 → R1 + R and R3 → R3 + R2
5 2 5
1 0 0  u11 u12 u13  1 1 1   1 8 
⇒ l21 1 0   0 u22 u23  = 3 1 −3  1 0
5 5 
 
 l31 l32 1   0 0 u33  1 −2 −5 ∼ 0 −5 −4 −22 
 24 72 
Expanding and on solving we get, u11 = 1, u12 = 1, u13 = 1,  0 0 − − 
 5 5
3
u22 = -2, u23 = -6, u33 = 3,
= l21 3=
, l31 1, l32 = −5 −5
2 R2 → R3 + R2 ; R3 → R3
6 24
Step 2: Now LUX = B
 1 8 
Step 3: Let UX = Y  1 0
5 5 
Step 4: \ LY = B  
∼ 0 −5 0 −10 
 0 0 1 3 
  
1 0 0   y1   1 
  1 −1
⇒ 3 1 0   y2  =  5  R1 → − R3 and R2 → R2
5 5
 3   y  10 
1 1  3    1 0 0 1 
 2  1
R2 → − R2 ∼ 0 1 0 2 
On solving, y1 = 1, y2 = 2 and y3 = 6. 5
0 0 1 3 
Step 5: UX = Y
\ Solution is x = 1, y = 2 and z = 3.
1 1 1   x1  1 
⇒ 0 −2 −6   x2  =  2  Example 8
0 0 3   x3  6  Solve 3x + 2y - z = 0, 4x + y + 2z = 0 and x - 5y + 7z = 0.

On solving we get x1 = 6, x2 = -7 and x3 = 2 Solution

\ The solution is (6, -7, 2).
Determinant of the co-efficient matrix of the equations
Example 7 3 2 −1
Solve: x + y + z = 6, 3x - 2y - z = -4 and 2x + 3y -2z = 2. when written in matrix form is 4 1 2
1 −5 7
Solution = 3(7 + 10) -2(28 - 2) -1(-20 - 1)
1 1 1 = 51 - 52 + 21 = 20
A = 3 −2 −1 = 1(7) − 1( − 4) + 1(9 + 4) ≠ 0 \ The given system of equations have only one solution,
i.e., x = y = z = 0.
2 3 −2
Example 9
\ The set of given equations are non-homogeneous and the
Determine the eigen values and eigen vectors of
number of equations is equal to the number of variables.
\ The given system of equations is consistent and has a 2 4
A= .
unique solution. 3 3

Chapter 04.indd 81 5/19/2017 5:19:24 PM

 2.82 | Part II ■ Engineering Mathematics
telegram- Hmara college
Solution ⇒ l3 - 12l2 + 36l - 32 = 0
Characteristic equation of the given matrix is | A - l | = 0 l = 2, 2, 8
2−λ 4 \ Eigen values are 2, 2, 8.
⇒ =0
3 3−λ
Example 11
⇒ l2 - 5l - 6 = 0 4 2
(l - 6)(l + 1) = 0 If A =   , then find A by using Cayley-Hamilton
16

 −7 −4 
⇒ l = -1 and l = 6 are the eigen values. Eigen vector theorem.
corresponding to l = -1 is obtained as follows:
Solution
 2 4   1 0    x1   0  The characteristic equation of
  + 1    =  
  3 3   0 1    x2   0  4 2
A=   is | A − λ I | = 0
 3 4   x1   0   −7 − 4 
⇒    =  
 3 4   x2   0  4 − λ 2 
⇒  =0
⇒ 3x1 + 4x2 = 0  −7 −4 − λ 
4 ⇒ (4 - l)(- 4 - l) + 14 = 0
3x1 + 4x2 = 0 ⇒ x1 = − x2
3 ⇒ -16 - 4l + 4l + l2 + 14 = 0
\ Eigen vector corresponding to l = -1 is, ⇒ l2 - 2 = 0 (1)
 −4   −4  By Cayley-Hamilton theorem, the matrix A satisfies its
x  x
X =  1  =  3 2  = x2  3  characteristic equation (1).
 x2   x    \ A2 - 2I = O
 2   1 
1 0  0 0 
Similarly eigen vector corresponding to l = 6 is obtained where I =   and O =  
as follows: 0 1  0 0 
⇒ A2 = 2I(2)
 2 4   1 0    x1   0 
  − 6    =   Now A16 = (A2)8 = (2I)8 (From Eq. (2))
  3 3   0 1    x2   0 
1 0 
= 28 I 8 = 256 I = 256  
 −4 4   x1   0  0 1 
⇒    =  
 3 −3   x2   0 
 256 0 
⇒ - 4x1 + 4x2 = 0 and 3x1 - 3x2 = 0 \ A16 =  
 0 256 
⇒ x1 = x2
Eigen vector corresponding to l = 6 is, Example 12

 x  x  1 2 0 3 
X =  1  =  2  = x2   .
x
 2  2x 1 If A = 0 4 −5 ; then find the value of the
0 1 0 
Example 10 matrix polynomial 3A9 - 18A8 + 39A7 - 32A6 + 12A5
Find the eigen values of the matrix - 26A4 + 16A3 + 24A2 - 50A + 40I.
6 2 2
  Solution
A =  2 3 1 .
 2 1 3 The characteristic equation of
 
2 0 3 
Solution A = 0 4 −5 is | A - l I | = 0
Characteristic equation of the given matrix is A − λ = 0 0 1 0 

6−λ 2 2 2−λ 0 3
⇒ 2 3−λ 1 =0 ⇒ 0 4−λ −5 = 0
2 1 3−λ 0 1 −λ

Chapter 04.indd 82 5/19/2017 5:19:26 PM

 Chapter 4 ■ Linear Algebra | 2.83

⇒ (2 - l) {(4 - l)(-l) + 5} =

 0 Now consider the given matrix polynomial
⇒ (2 - l) {(l2 - 4l + 5)} = 0 3A9 - 18A8 + 39A7 - 32A6 + 12A5 - 26A4 + 16A3 + 24A2 -
⇒ 2l2 - 8l + 10 - l3 + 4l2 - 5l = 0. 50A + 40I
⇒ - l3 + 6l2 - 13l + 10 = 0 = 3A9 - 18A8 + 39A7 - 30A6 - 2A6 + 12A5 - 26A4 + 20A3
⇒ l3 - 6l2 + 13l - 10 = 0 (1) - 4A3 + 24A2 - 52A + 2A + 40I
= 3A6 (A3 - 6A2 + 13A - 10I ) - 2A3(A3 - 6A2 + 13A - 10I)
By Cayley-Hamilton theorem, the matrix A will satisfy its - 4(A3 - 6A2 + 13A - 10I) + 2A
characteristic Eq. (1)
= 3A6 × 0 - 2A3 × 0 - 4 × 0 + 2A
\ A3 - 6A2 + 13A - 10I = O,
(From Eq. (2))
1 0 0  0 0 0 
    2 0 3  4 0 6 
where l = 0 1 0  and O = 0 0 0 
0 0 1  0 0 0  = 2 A = 2 0 4 −5 =  0 8 −10  .
\ A - 6A + 13A - 10I = 0
3 2
(2) 0 1 0   0 2 0 

Exercises
1. Which of the following is false? a11 a12 a13
(A) Every diagonal matrix is a square matrix.
(B) Every unit matrix is a scalar matrix. 6. If D = a21 a22 a23 , then which of the following is
(C) Every square matrix is a diagonal matrix. a31 a32 a33
(D) Every scalar matrix is a diagonal matrix. true? (Here, Aij is the cofactor of the element aij)
 1 a12  a1n 
  (A) a11 A11 + a21 A12 + a23 A32 = D
a21 2  a2 n 
2. If the trace of the matrix  is 55 (B) a11 A11 + a12 A12 + a13 A13 = D
      (C) a21 A12 + a23 A32 + a12 A21 = D
 
 an1 an 2  n  (D) a12 A21 + a21 A12 + a31 A13 = D
then the value of n is
(A) 10 (B) 11  2 3 −3 
 
(C) 9 (D) Cannot be determined 7. The determinant value of  1 −2 2  is
3. Which of the following statement is/are false?  7 4 −4 
 
(A) AT . BT always defined for square matrices of same (A) 0 (B) 10
order. (C) -10 (D) 15
(B) AT ⋅ B is defined for matrices of the same order.
(C) tr(AT) + tr(BT) is always defined for matrices A, B of n! ( n + 1)! ( n + 2)!
same order. 8. The value of ( n + 1)! ( n + 2 )! ( n + 3)! is
(D) AT + BT is always defined for matrices A, B of same ( n + 2)! ( n + 3)! ( n + 4)!
order.
(A) 2n! (n + 1)!
4. Consider the following statements about two square
(B) 2n! (n + 1)! (n + 2)!
matrices A and B of the same order:
(C) (2n)! (n + 1)! (n + 2)!
P: (A + B)2 = A2 + 2AB + B2
(D) 2n! (n + 3)!
Q: (A + B) (A - B) = A2 - B2
xC xC x +1 C
Then, 0 1 1
(A) both P and Q are true. 9. If f(x) = 2 x C1 x
2 C2 2( x +1) C , then f (200) is
2
(B) both P and Q are false
6 x C2 6 x C3 6( x +1) C3
(C) both P and Q are true if A and B commute
(D) P is true but Q is false. (A) 200 (B) -200
(C) 0 (D) -2001
 2 1 2   −2 x 3 x 
   2 3+i −1
5. If  1 0 1   x −2 0  = I3 ×3, then x =
 2 2 1   2 −2 x − x  10. The determinant 3 − i 0 −1 + i is
  
−1 −1 − i 1
(A) -1 (B) 1
1 (A) purely imaginary (B) zero
(C) (D) 2
2 (C) real (D) 10

Chapter 04.indd 83 5/19/2017 5:19:27 PM

 2.84 | Part II ■ Engineering Mathematics

 x y z 1 2 3 4 5
  2
2x y 3z  3 4 5 6 
11. If A =  , then |A| = ______. 
 x y z 18.   I. If A = 3 4 5 6 7  , then A-1 is symmetric.
   
 2 2 2 4 5 6 7 8
5 6 7 8 9 
(A) 10xyz (B) 1
1 II. If a non-singular matrix A is symmetric, then A-1 is
(C) 0 (D) (x3 + y3 + z3 - 3xyz) also symmetric.
2
Which of the following is correct?
12. If the elements of a row or column of a given square
matrix is multiplied by 2, then the value of determinant (A) Both I and II true. (B) Both I and II false.
is ______ times the original determinant. (C) I is true, II is false. (D) I is false, II is true.
1 19. A is a third order matrix. If the value of the square of the
(A) (B) 1
2 determinant of the matrix of co-factors of A is 28561,
(C) 2 (D) 4 then |A| equals
(A) 25 (B) ±13
13. If A is a square matrix of order k and det(kA) = 27
(C) 120 (D) ±169
det(A), then k = ______.
(A) 9 (B) 1 20. If A is a square matrix of order 3, then the product of A
(C) 2 (D) 3 and its transpose is
(A) unit matrix. (B) zero matrix.
14. If A and B are two square matrices of order 4 such that
(C) identity matrix. (D) symmetric matrix.
|A| = -2 and |B| = 5, then |4AB| is
(A) -80 (B) -160 21. If A and B are two skew symmetric matrices of the
(C) -2560 (D) -256 same order then AB is skew symmetric if and only if
15. I. (a - b), (b - c), (c - a) are factors of the determinant (A) AB + BA = O (B) AB - BA = O
1 1 1 (C) AB + BA = I (D) AB - BA = I
a b c . 1 2 3 
22. Rank of the matrix A =   is
a2 b2 c2 4 5 6
II. If the elements of a determinant are functions of x (A) 1 (B) 2
and its two rows or columns become identical (i.e., (C) 3 (D) 4
determinant equals zero,) when we substitute x = k,  2 −1 −3 
then (x - k) is a factor of the determinant.  
23. The rank of the matrix  −4 2 6  is
Which of the following is correct?  −10 5 15 
(A) Both I and II true. (B) Both I and II false.  
(C) I is true, II is false (D) I is false, II is true (A) 0 (B) 1
16. A lower triangular matrix A = (aij)n × n is singular if and (C) 2 (D) 3
only if 1
(A) aii = 0 for all i = 1, 2, … n  
24. If A = (1 2 3) and B =  2  then r(AB) is
(B) aii = 0 for atleast one i = 1, 2, … n  3
(C) aii ≠ 0 for all i = 1, 2, … n  
(D) aii ≠ 0 for atleast one i, i = 1, 2, … n (A) 0 (B) 1
(C) 2 (D) 4
 2 −1 0 
  25. Which of the following matrix is row echelon form?
17. Inverse of the matrix  1 2 3  is
 −4 1 −1 1 0 −1 2 
  0 1 0 3  0 1 2 
   
 −5 −11 9   −5 −1 −3  (A) (B) 1 0 −1
0 0 1 −2 
      0 1 0 
(A)  −1 −2 2  (B)  −11 −2 −6 
 −3 −6 5   9 0 0 0 0 
   2 5 
1 0 0 0 0 0 0 1
 5 11 9  5 1 3 0
    2 −1 3  0 0 1 0 
(C)  1 2 −2  (D) 11 2 6  (C)  (D) 
0 0 −1 4  0 1 0 0
 3 6 −5   9 −2 −5     
   
0 0 0 0 1 0 0 2

Chapter 04.indd 84 5/19/2017 5:19:29 PM

 Chapter 4 ■ Linear Algebra | 2.85

26. Which of the following set of vectors are linearly 35. The sum and product of the eigen values of the matrix
dependent?  2 0 −1
(A) (2, 3, 3), (3, -1, 3), (4, -2, 5) 0 4 −2 
(B) (3, 4, -1), (-1, 3, 1), (-2, -7, -2)   is respectively
(C) (2, 1, 4), (1, -2, 2), (-3, 1, -6) 1 3 −5 
(D) (1, 3, -5), (-5, -1, 3), (4, -2, -2) (A) 0, 24 (B) 1, -24
27. The system of equations 2x - y + 3z = 9, x + y + z = 0 (C) 2, 20 (D) 4, -24
and x - y + z = 0 has/is 2 0 1 
36. The eigen values of a matrix A = 0 2 p  are 1, 2,
(A) unique solution.
(B) infinite solutions.
(C) only zero solution. 1 0 q 
(D) inconsistent. and 3. Then the values of p and q are ______.
28. The system of equations 6x + 7y + 8z = 1, 13x + 14y + (A) p = 0, q = 0
15z = 2 and x + 2y + 3z = 2 is (B) p = any real number, q = 2
(A) consistent with unique solution. (C) p = 2, q = 0
(B) consistent with infinite solutions. (D) p = 2, q = 2
(C) inconsistent.  0 −1 2 −3
1 0 4 6
(D) None of these
37. The eigen values of the matrix   is
29. The value of l for which the following system of equa-  −2 −4 0 5 
 
tion does not have a solution is  3 −6 −5 0 
x+y+z=6
(A) real only (B) imaginary
4x + ly - lz = 0
3x + 2y - 4z = -8 (C) zero only (D) imaginary or zero
(A) 3 (B) -3 38. The number of linearly independent eigen vectors of
(C) 0 (D) 1  5 2
 −2 1  is ______.
30. If the number of variables in the linear homogeneous  
system AX = O is n, then the system will have exactly (A) 0   (B) 1   (C) 2   (D) infinite
one solution X = O, if the rank of the matrix A is 39. Which of the following is an eigen vector for the matrix
(A) 1 (B) < n
1 4 
(C) ≤ n (D) n  ?
31. If the equations 2x - y - z = 0, kx - 3y + 2z = 0 and -3x  2 −1
+ 2y + kz = 0 have a non-zero solution, then the value 1  −1
of k is (A)   (B)  
 3 1
(A) 2 (B) 1
(C) 7 (D) Both 1 and 7  3  −2 
(C)   (D)  
32. The system of equations a + 3y + 5z = 0, 2x - 4ay + a 1  −2 
z = 0, -4x + 18y + 7z = 0 has only trivial solution if a is
 6 −6 2   −2 
(A) -1 or -3 (B) 1 or -3  −6 5 −4   
(C) not equal to 1, -3 (D) not equal to -1 and 3 40. For a matrix A =   , X =  2  is an eigen
 2 −4 1   −1
 2 −1 0 
33. The eigen values of  0 1 −1 is vector. The corresponding eigen value is ______.
  (A) -2 (B) 1
0 0 3 
  (C) 2 (D) 13
(A) 0, 0, 0 (B) 0, 1, 0 41. Let A be a 2 × 2 square matrix with l1 = -2 and l2 =
(C) 2, 1, 3 (D) -2, -1, -3
 −4  6 
34. The characteristic roots of the inverse of the matrix -3 as its eigen values and x1 =   , x 2 =   as its
2 2 1  −4  7 
  eigen vectors then A is given by
1 3 1  are
1 0 2   4 −6 
 2 2  (A)   (B)  
 4 −5  7 −9 
(A) -1, -1, 5 (B) 1, 1, 5
1 1  −2 6   2 6
(C) 1, 1, (D) -1, -1, (C)   (D)  
5 5  7 −3  −4 3 

Chapter 04.indd 85 5/19/2017 5:19:31 PM

 2.86 | Part II ■ Engineering Mathematics

2 5 4   3 −1 −1
42. Consider the matrix A = 0 1 0  let B = A-1, then 45. For the matrix A =  −1 3 −1 , consider the fol-
0 −3 −2   1 1 −1
B = ______ lowing statements
−1 2 1 2 (P) The characteristic equation of A is l3 - 5l2 + 4l = 0
(A) [A - A - 4I] (B) [A - A - 4I] (Q) A-1 exists
4 4
(R) The matrix A is diagonalizable
1 2 −1 2
(C) [A + A - 4I] (D) [A - A + 4I] Which of the above statements are TRUE?
4 4 (A) P, Q and R
 2 3 (B) P and R but not Q
43. If A =   , then A =
15
(C) P and Q but not R
4 6
(D) Q and R but not P
(A) 814A (B) 815A
(C) 816A (D) 15A 46. If P is a modal matrix and D is a spectral matrix of a
diagonalizable matrix A, then which of the following
2 0 0 relations is NOT TRUE among A, P and D?
44. If A =  3 6 7  , then the value of the matrix poly- (A) PD = AP (B) DP-1 = P-1A
 9 0 1  (C) A2P = PD2 (D) DP = PA
nomial 2A10 - 18A9 + 40A8 - 25A7 + 9A6 - 20A5 + 13A4 47. If A is a 3 × 3 square matrix with eigen values 0, 2, 3
- 9A3 + 20A2 - 10A is ______. with P as its modal matrix, then the eigen values of the
2 0 0 4 0 0 matrix P-1 AP are _______.
    (A) 0, 2, 3
(A)  3 6 7  (B)  6 12 14  (B) 0, 4, 6
 9 7 1  18 0 2 
1 1
(C) 0, ,
1 0 0  0 0 0  2 3
   
(C) 0 1 0  (D) 0 0 0  1 1
(D) 1, ,
0 0 1  0 0 0  2 3

telegram- Hmara college

Previous Years’ Questions
1. For what value of a and b, the following simultaneous 3 + 2i i 
equations have an infinite number of solutions? 5. The inverse of the matrix  is 
 −i 3 − 2i 
x + y + z = 5; x + 3y + 3z = 9; x + zy + az = b
 [GATE, 2007]  [GATE, 2010]
(A) 2, 7 (B) 3, 8
1 3 + 2i −i 
(C) 8, 3 (D) 7, 2 (A)  −i
12  3 − 2i 
2. The product of matrices (PQ)-1P is [GATE, 2008]
(A) P-1 (B) Q-1 1 3 − 2i −i 
-1 -1
(D) PQP-1 (B)
12  i 3 + 2i 
(C) P Q P
3. The following simultaneous equations
x+y+z=3 1 3 + 2i −i 
x + 2y + 3z = 4 (C) 
14  i 3 − 2i 
x + 4y + kz = 6
will NOT have a unique solution for k equal to 1 3 − 2i −i 
(D)  3 + 2i 
 [GATE, 2008]
14  i
(A) 0 (B) 5
(C) 6 (D) 7 6. [A] is a square matrix which is neither symmetric nor
4. A square matrix B is skew-symmetric if skew-symmetric and [A]T is its transpose. The sum
 [GATE, 2009] and difference of these matrices are defined as [S] =
(A) B = -B
T
(B) B = B
T [A] + [A]T and [D] = [A] - [A]T, respectively. Which of
(C) B-1 = B (D) B-1 = BT the following statements is TRUE? [GATE, 2011]

Chapter 04.indd 86 5/19/2017 5:19:33 PM

 Chapter 4 ■ Linear Algebra | 2.87

(A) Both [S] and [D] are symmetric. 13. Let A = [aij], 1 ≤ i, j ≤ n with n ≥ 3 and aij = i ⋅ j. The
(B) Both [S] and [D] are skew-symmetric. rank of A is [GATE, 2015]
(C) [S] is skew-symmetric and [D] is symmetric. (A) 0 (B) 1
(D) [S] is symmetric and [D] is skew-symmetric. (C) n - 1 (D) n
9 5 14. For what value of p the following set of equations will
7. The eigen vales of matrix   are  [GATE, 2012] have no solution?
5 8 2x + 3y = 5
(A) -2.42 and 6.86 (B) 3.48 and 13.53 3x + py = 10
(C) 4.70 and 6.86 (D) 6.86 and 9.50  [GATE, 2015]
8. What is the minimum number of multiplications 15. The smallest and largest eigen values of the following
involved in computing the matrix product PQR?  3 −2 2 
Matrix P has 4 rows and 2 columns, matrix Q has  
matrix are:  4 −4 6   [GATE, 2015]
2 rows and 4 columns, a matrix R has 4 rows and 1
 2 −3 5 
column?
 [GATE, 2013] (A) 1.5 and 2.5 (B) 0.5 and 2.5
3 2 1 1 (C) 1.0 and 3.0 (D) 1.0 and 2.0
    2 1 
9. Given the matrices J =  2 4 2  and K =  2 
16. The two eigen values of the matrix   have a
1 2 6   −1 1 p 
the product KT JK is. [GATE, 2014] ratio of 3 : 1 for p = 2. What is another value of p for
0 1 2 3 which the eigen values have the same ratio of 3 : 1?
1 0 3 0   [GATE, 2015]
10. The determinant of matrix  is.  (A) -2 (B) 1
2 3 0 1
  7 14
3 0 1 2 (C) (D)
3 3
 [GATE, 2014]
17. Consider the following linear systems:
6 0 4 4  x + 2y - 3z = a
 −2 14 8 18 
11. The rank of the matrix   is. 2x + 3y + 3z = b
14 −14 0 −10  5x + 9y - 6z = c
 [GATE, 2014] This system is consistent if a, b and c satisfy the
equation [GATE, 2016]
12. The sum of Eigen values of the matrix [M] is.
(A) 7a - b - c = 0 (B) 3a + b - c = 0
 215 650 795 
(C) 3a - b + c = 0 (D) 7a - b + c = 0
Where [M] = 655 150 835   [GATE, 2014]
18. If the entries in each column of a square matrix M add
 485 355 550 
up to 1, then an eigen value of M is [GATE, 2016]
(A) 915 (B) 1355 (A) 4 (B) 3
(C) 1640 (D) 2180 (C) 2 (D) 1

@getstudyfeverbot
Answer Keys

Exercises
1. C 2. A 3. C 4. C 5. B 6. B 7. A 8. B 9. C 10. C
11. C 12. C 13. D 14. C 15. A 16. B 17. B 18. D 19. B 20. D
21. A 22. B 23. B 24. B 25. A 26. C 27. A 28. C 29. A 30. D
31. D 32. C 33. C 34. C 35. B 36. B 37. B 38. B 39. B 40. D
41. B 42. A 43. A 44. B 45. B 46. D 47. A

Previous Years’ Questions

1. A 2. B 3. D 4. A 5. B 6. D 7. B 8. 16 9. 23 10. 88
11. 2 12. A 13. B 14. 4.49 to 4.51 15. D 16. D 17. B 18. D

Chapter 04.indd 87 5/19/2017 5:19:34 PM