JSS MAHAVIDYAPEETHA

JSS ACADEMY OF TECHNICAL EDUCATION, NOIDA

DEPARTMENT OF MATHEMATICS

Study Material with Question Bank

Subject: Engineering Mathematics-I (BAS 103)

Course Outcome (C103.1): Understand the concept of complex matrices, Eigen values,
Eigen vectors and apply the concept of rank to evaluate linear simultaneous equations.

INVERSE OF A MATRIX USING ELEMENTARY TRANSFORMATION

(Gauss Jordan Method)
The following transformations are called elementary transformation of a matrix:
a) Interchanging of rows (columns).
b) Multiplication of a row (column) by a non-zero scalar.
c) Adding or subtracting k multiple of a row (column) to another row (column).
Definition: A matrix B is said to be row (column) equivalent to a matrix A if it is
obtained from A by applying a finite number of elementary row (column)
transformations. In such case, we write B~A. In Gauss Jordan method, we perform
the sequence of elementary row transformations on A and I simultaneously, keeping
them side by side.

1. Employing elementary row transformations, find the inverse of the matrix

0 1 2
[1 2 3].
3 1 1
3 −3 4
2. Use elementary row transformation, find the inverse of the matrix [2 −3 4].
0 −1 1
1 2 6
3. Use elementary row transformation, find the inverse of the matrix [2 5 15].
6 15 46

4. Applying elementary row transformation, find the inverse of the matrix

1 3 5
𝐴 = [3 2 4] .
5 4 2
 1 0 4
5. Find the inverse of the matrix [ 2 −2 1 ] by using elementary row
−1 1 −1
transformation.

Rank of a Matrix
Definition: A matrix is said to be of rank r if it has at least one non-singular submatrix of
order r but has no non-singular submatrix of order more than r.
Rank of a matrix A is denoted by 𝜌(𝐴).
A matrix is said to be of rank zero if and only if all its elements are zero.
METHOD OF FINDING RANK
To determine the rank of a matrix A, we adopt the following different methods:
1. Normal form method: If A is an 𝑚 × 𝑛 matrix and by a series of elementary (row or
column or both) operations, it can be put into one of the following forms (called
normal or canonical forms):
𝑰𝒓 𝟎 𝑰
[ ], [ 𝒓 ], [𝑰𝒓 𝟎], [𝑰𝒓 ] where 𝐼𝑟 is the unit matrix of order r.
𝟎 𝟎 𝟎
This method is also called sweep out method or pivotal method.
2. Echelon Form Method: A matrix is said to be in row reduced echelon form if
(i) The first non-zero entry in each non-zero row is 1.
(ii) The rows containing only zeroes occur below all the non-zeroes rows.
(iii) The number of zeroes before the first non-zeroes element in a row is less than the
number of such zeroes in the next row.
The rank of a matrix in row reduced echelon form is equal to the number of non-zero
1 2 3
rows of the matrix. For example, the matrix [0 1 1] is in the row reduced echelon
0 0 0
form and its rank is 2 (the number of non-zero rows).
Corollary: If A is an 𝑚 × 𝑛 matrix of rank r, there exist non-singular matrices P and
𝐼 0
Q such that 𝑃𝐴𝑄 = [ 𝑟 ].
0 0
6. Use elementary transformation to reduce the following matrix A to triangular
2 3 −1 −1
1 −1 −2 −4
form and hence find the rank of A where 𝐴 = [ ].
3 1 3 −2
6 3 0 −7
7. Find the rank of the matrix A by reducing it to echelon form.
2 3 −2 4
3 −2 1 2
𝐴=[ ].
3 2 3 4
−2 4 0 5
8. Find the rank of the matrix A by reducing it to echelon form.
1 2 3 −1
−1 − 1 − 3 − 1
𝐴=[ ].
1 0 1 1
0 1 1 −1
9. Find the rank of the matrix A by reducing it to echelon form.
1 2 −1 4
𝐴=[ 2 4 3 5].
−1 −2 6 7
1 2 3
10. Find the rank of the matrix 𝐴 = [1 4 2] by reducing it to normal form.
2 6 5
11. Reduce the matrix A to its normal form and hence find its rank, where
2 1 −3 −6
𝐴 = [3 −3 1 2 ].
1 1 1 2
1 1 1
12. For the matrix 𝐴 = [1 −1 −1], find non-singular matrices P and Q such that
3 1 1
PAQ is in the normal form.
1 2 1 0
13. If 𝐴 = [−2 4 3 0 ], determine two non-singular matrices P and Q such that
1 0 2 −8
PAQ=I. Hence find rank of the matrix
1 1 1 2
14. If 𝐴 = [3 −3 1 2 ], determine two non-singular matrices P and Q such
2 1 −3 −6
that PAQ=I. Hence find rank of the matrix.

CONSISTENCY OF A SYSTEM OF SIMULTANEOUS LINEAR EQUATIONS

When the system of linear equations has one or more solutions, the system is said to
be consistent, otherwise it is inconsistent.
Consider the system of equation 𝐴𝑋 = 𝐵.
If 𝐵 = 0,i.e 𝐴𝑋 = 0, the system of equation is called homogeneous linear equations.
If 𝐵 ≠ 0,i.e 𝐴𝑋 = 𝐵, the system of equation is called non-homogeneous linear
equations.
Conditions for consistency for non-homogeneous linear equations 𝐴𝑋 = 𝐵
1. If 𝜌(𝐴: 𝐵) ≠ 𝜌(𝐴), the system is inconsistent.
 2. If 𝜌(𝐴: 𝐵) = 𝜌(𝐴) = 𝑛𝑜. 𝑜𝑓 𝑢𝑛𝑘𝑛𝑜𝑤𝑛𝑠, the system has a unique solution.
3. If 𝜌(𝐴: 𝐵) = 𝜌(𝐴) < 𝑛𝑜. 𝑜𝑓 𝑢𝑛𝑘𝑛𝑜𝑤𝑛𝑠, the system has a infinite number of
solutions.
Conditions for consistency for homogeneous linear equations 𝐴𝑋 = 0
𝑋 = 0 is always a solution in which each unknown has the value zero called null
solution or trivial solution.
It has either the trivial solution or an infinite number of solutions.
1. If 𝜌(𝐴) = 𝑛𝑜. 𝑜𝑓 𝑢𝑛𝑘𝑛𝑜𝑤𝑛𝑠, the system has only the trivial solution.
2. If 𝜌(𝐴) < 𝑛𝑜. 𝑜𝑓 𝑢𝑛𝑘𝑛𝑜𝑤𝑛𝑠, the system has infinite number of non-trivial
solution.

15. Show that the system of equations 𝑥 + 𝑦 + 𝑧 = −3, 3𝑥 + 𝑦 − 2𝑧 = −2,

2𝑥 + 4𝑦 + 7𝑧 = 7 is not consistent?
16. Apply Matrix method to solve system of equations 𝑥 + 2𝑦 − 𝑧 = 3,
3𝑥 − 𝑦 + 2𝑧 = 1, 2𝑥 − 2𝑦 + 3𝑧 = 2, 𝑥 − 𝑦 + 𝑧 = −1 .
17. Investigate for what values of λ and 𝜇 do the system of equations 𝑥 + 𝑦 + 𝑧 = 6,
𝑥 + 2𝑦 + 3𝑧 = 10, 𝑥 + 2𝑦 + λz = μ have (i) no solution, (ii) unique solution, (iii)
infinite solution?
18. Investigate for what values of λ and µ the equations 𝑥 + 2𝑦 + 𝑧 = 8, 2𝑥 + 2𝑦 +
2𝑧 = 13, 3𝑥 + 4𝑦 + λz = μ have (i) no solution, (ii) unique solution and (iii)
many solutions.
19. Find the values of k for which the system of equations
(3𝑘 − 8)𝑥 + 3𝑦 + 3𝑧 = 0, 3𝑥 + (3𝑘 − 8)𝑦 + 3𝑧 = 0, 3𝑥 + 3𝑦 + (3𝑘 − 8)𝑧 = 0
has non-trivial solution.
20. Discuss for all values of k, the system of equations 2𝑥 + 3𝑘𝑦 + (3𝑘 + 4)𝑧 = 0,
𝑥 + (𝑘 + 4)𝑦 + (4𝑘 + 2)𝑧 = 0, 𝑥 + 2(𝑘 + 1)𝑦 + (3𝑘 + 4)𝑧 = 0
21. Solve the following system of equations:
3𝑥 − 𝑦 − 𝑧 = 0, 𝑥 + 𝑦 + 2𝑧 = 0, 5𝑥 + 𝑦 + 3𝑧 = 0
22. Solve the following system of equations:
𝑥 + 𝑦 − 𝑧 + 𝑤 = 0, 𝑥 − 𝑦 + 2𝑧 − 𝑤 = 0, 3𝑥 + 𝑦 + 𝑤 = 0

LINEAR DEPENDENCE AND INDEPENDENCE OF VECTORS

Linear Dependence – A set of r n-vectors 𝑋1 , 𝑋2 , 𝑋3 … … 𝑋𝑟 is said to be linearly
dependent if there exists 𝑟 scalars 𝑘1 , 𝑘2 , 𝑘3 … … 𝑘𝑟 not all zero such that
𝑘1 𝑋1 + 𝑘2 𝑋2 + 𝑘3 𝑋3 + ⋯ … . +𝑘𝑟 𝑋𝑟 = 0 (linear combination)
Linear Independence – A set of r n-vectors 𝑋1 , 𝑋2 , 𝑋3 … … 𝑋𝑟 is said to be linearly
independent if every relation of the type 𝑘1 𝑋1 + 𝑘2 𝑋2 + 𝑘3 𝑋3 + ⋯ … . +𝑘𝑟 𝑋𝑟 = 0
implies 𝑘1 = 𝑘2 = 𝑘3 = ⋯ … = 𝑘𝑟 = 0.
 Note:
1. If rank of a matrix =no. of vectors, then given set of vectors is L.I.
2. If rank of a matrix<no. of vectors, then given set of vectors is L.D.
3. If a set of vectors is L.D. then at least one vector of the set can be expressed as
a linear combination of the remaining vectors.
4. If a set of vectors is L.I. then no vector of the set can be expressed as a linear
combination of the remaining vectors.

23. Examine whether following vectors are linearly independent or dependent:

𝑋1 = (2,2,1)𝑇 , 𝑋2 = (1,3,1)𝑇 , 𝑋3 = (1,2,2)𝑇
24. Show that the rows of the following matrix are linearly dependent and find the
relationship between them.
1 0 2 1
3 1 2 1
A  
 4 6 2 4 
 
 6 0 3 4 
25. Find the value of λ for which the vectors (1,-2, λ), (2,-1,5) and (3,-5,7λ) are
linearly dependent.
26. Show that the vectors (3,1,-4), (2,2,-3) and (0,-4,1) are linearly dependent.
27. Show that the vectors [2,-1,3,2], [3,-5,2,2], [1,3,4,2] are linearly dependent.
Express one of the vector as a linear combination of the other.

EIGEN VALUES AND EIGEN VECTORS

Eigen values and eigen vectors are important concepts in linear algebra. The are
derived from German word ‘eigen’ which means proper or characteristic. Eigen
vectors are non-zero vectors that get mapped into scalar multiples of themselves
under a linear operator. Any non-zero vector 𝑋 is said to be a characteristic
vector or eigen vector of a matrix 𝐴 if there exists a number λ such that𝐴𝑋 = λX
𝑥1
𝑥2
where 𝐴 = [𝑎𝑖𝑗 ]𝑛×𝑛 is an n- rowed square matrix and 𝑋 = [ .. ] is a column
.
𝑥𝑛
vector.
The matrix 𝐴 − 𝜆𝐼 is called characteristic matrix of A where I is the unit matrix of
order n.
The |𝐴 − 𝜆𝐼 | is called characteristic polynomial of A.
 The equation |𝐴 − 𝜆𝐼| = 0 is called characteristic equation of A and the roots of
this equation are called eigenvalues of the matrix A. The set of all eigenvectors is
called the eigenspace of A corresponding to λ. The set of all eigenvalues of A is
called the spectrum of A.
Properties of Eigenvalues
1. If λ is an eigenvalue of the matrix A then λ is also an eigenvector of 𝐴𝑇 .
1
2. If λ is an eigenvalue of the matrix A then λis an eigenvector of 𝐴−1.

3. If λ is an eigenvalue of the matrix A then 𝜆𝑘 is an eigenvector of 𝐴𝑘 .

4. If λ is an eigenvalue of the matrix A then 𝜆 ± 𝑘 is an eigenvector of 𝐴 ± 𝑘𝐼.
5. If λ is an eigenvalue of the matrix A then 𝑘λ is an eigenvector of 𝑘𝐴.
6. The eigenvalues of a triangular matrix are the diagonal elements of the
matrix.
7. The eigenvalues of a real symmetric matrix are real.
Working rule for finding Eigenvalues and Eigenvectors
1. Write the characteristic equation |𝐴 − 𝜆𝐼| = 0 for the given square matrix.
2. Find the eigenvalues of the matrix by solving characteristic equation.
3. Find eigenvectors corresponding to each eigenvalues from the equation
(𝐴 − 𝜆𝐼)𝑋 = 0.
2 −2 2
28. If 2 is an eigenvalue of the matrix 𝐴 = [1 1 1 ], find the other two eigen
1 3 −1
values.
2 0 1
29. If 2, 3 are the eigenvalues of [0 2 0], find the value of 𝑎.
𝑎 0 2
8 −6 2
30. Find the eigenvalues and eigenvectors of the matrix [−6 7 −4].
2 −4 3
−2 2 −3
31. Find the eigenvalues and eigenvectors of the matrix [ 2 1 −6].
−1 −2 0
0 1 0
32. Find the eigenvalues and eigenvectors of the matrix [0 0 1].
1 −3 3
𝑎 4
33. Find 𝑎 and 𝑏 such that 𝐴 = [ ] has 3 and -2 as eigenvalues.
1 𝑏
3 −1 1
34. Two of the eigenvalues of the matrix 𝐴 = [−1 5 −1] are 3 and 6. Find the
1 −1 3
−1 3
eigen values of 𝐴 and 𝐴 .
 35. Form the matrix whose eigenvalues are 𝛼 − 5, 𝛽 − 5, 𝛾 − 5 where 𝛼, 𝛽, 𝛾 are the
−1 −2 −3
eigen values of [ 4 5 −6].
7 −8 9

CAYLEY HAMILTON THEOREM

Definition: Every square matrix satisfies its own characteristic equation.
1 2
36. Apply Cayley Hamilton theorem to 𝐴 = [ ] and deduce that 𝐴8 = 625𝐼.
2 −1
2 1 1
37. Find the characteristic equation of the matrix 𝐴 = [0 1 0] and hence find the
1 1 2
matrix represented by 𝐴 − 5𝐴 + 7𝐴 − 3𝐴 + 𝐴 − 5𝐴3 + 8𝐴2 − 2𝐴 + 𝐼.
8 7 6 5 4

1 4
38. Find the characteristic roots of the matrix 𝐴 = [ ] and verify Cayley
2 3
Hamilton theorem for this matrix. Find 𝐴−1 and also express 𝐴5 − 4𝐴4 − 7𝐴3 +
11𝐴2 − 𝐴 − 10𝐼 as a linear polynomial in 𝐴.
0 𝑐 −𝑏
39. Show that the matrix 𝐴 = [−𝑐 0 𝑎 ] satisfies Cayley Hamilton theoremand
𝑏 −𝑎 0
hence find 𝐴−1 , if it exists.
1 2 −2
40. Verify Cayley Hamilton theorem for the matrix 𝐴 = [−1 3 0 ] and hence
0 −2 1
use it to find 𝐴−1 and 𝐴4 .

Complex Matrices, Hermitian and skew Hermitian Matrices, unitary Matrices

Complex Matrix - If at least one element of a matrix is a complex number 𝑎 + 𝑖𝑏 ,where
a,b are real and 𝑖 = √−1, then the matrix is called a complex matrix.
Conjugate of a matrix - The matrix obtained by replacing the elements of a complex
matrix A by the corresponding conjugate complex numbers is called conjugate of the
matrix A and is denoted by 𝐴̅. e.g.
1 + 3𝑖 2 + 5𝑖 8 1 − 3𝑖 2 − 5𝑖 8
𝐴=[ ], 𝐴̅ = [ ]
−𝑖 6 9−𝑖 𝑖 6 9+𝑖
Transposed conjugate of the matrix -
The conjugate of the transpose of a matrix 𝐴 is called the conjugate transpose or
̅̅̅̅̅̅
transposed conjugate of 𝐴 and is denoted by 𝐴𝜃 , e.g 𝐴𝜃 = (𝐴̅)𝑇 = (𝐴 𝑇)

1 − 2𝑖 2 + 3𝑖 3 + 4𝑖 1 − 2𝑖 4 − 5𝑖 8
𝑇
e.g. If 𝐴 = [4 − 5𝑖 5 + 6𝑖 6 − 7𝑖 ] , 𝐴 = [2 + 3𝑖 5 + 6𝑖 7 + 8𝑖 ]
8 7 + 8𝑖 7 3 + 4𝑖 6 − 7𝑖 7
 1 + 2𝑖 4 + 5𝑖 8
Then 𝐴𝜃 = [2 − 3𝑖 5 − 6𝑖 7 − 8𝑖 ]
3 − 4𝑖 6 + 7𝑖 7
Hermitian Matrix – A square matrix 𝐴 = [𝑎𝑖𝑗 ] is called Hermitian if 𝑎𝑖𝑗 = ̅̅̅
𝑎𝑗𝑖 for all
1 2 + 3𝑖 3 − 4𝑖
𝜃
𝑖 𝑎𝑛𝑑 𝑗, i.e 𝐴 = 𝐴 , eg. [2 − 3𝑖 0 2 − 7𝑖 ]
3 + 4𝑖 2 + 7𝑖 2
Skew Hermitian Matrix – A square matrix 𝐴 = [𝑎𝑖𝑗 ] is called skew Hermitian if 𝑎𝑖𝑗 = −𝑎
̅̅̅
𝑗𝑖

for all 𝑖 𝑎𝑛𝑑 𝑗, i.e 𝐴 = −𝐴𝜃 . Hence diagonal elements of a skew Hermitian matrix must
𝑖 2 + 3𝑖
be either purely imaginary or zero, eg. [ ]
2 − 3𝑖 0
Unitary Matrix – A square matrix 𝐴 is called unitary if 𝐴𝐴𝜃 = 𝐼.
2 + 3𝑖 0 4𝑖
41. Express the matrix 𝐴 = [ 5 𝑖 8 ] as the sum of a Hermitian and a
1 − 𝑖 −3 + 𝑖 6
skew Hermitian matrix.
1+𝑖 2 5 − 5𝑖
42. Express the matrix 𝐴 = [ 2𝑖 2 + 𝑖 4 + 2𝑖 ] as the sum of a Hermitian and a
−1 + 𝑖 −4 7
skew Hermitian matrix.
√2 −𝑖√2 0
43. Prove that 𝑈 = [𝑖√2 −√2 0] is a unitary matrix. Hence find 𝐴−1 .
0 0 2
  i    i 
44. Show that the matrix   is unitary if  2   2   2   2  1 .
   i   i 
45. Every square matrix can be uniquely expressed as P + iQ, where P and Q are
Hermitian.
46. If 𝐴 and 𝐵 are unitary matrices, show that 𝐴𝐵 is a unitary matrix.
47. Show that every Hermitian matrix can be written as 𝑃 + 𝑖𝑄 where P is a real
symmetric matrix and Q is a real skew symmetric matrix.
0 1 + 2𝑖
48. Define a unitary matrix. If 𝑁 = [ ] is a matrix, then show that
−1 + 2𝑖 0
(𝐼 − 𝑁)(𝐼 + 𝑁)−1 is a unitary matrix where 𝐼 is an identity matrix.

APPLICATION OF MATRICES TO ENGINEERING PROBLEM

Matrix inverse can provide a simple and effective procedure for encoding and
decoding messages. Assign the numbers 1-26 to the letters in the alphabet. Assign
27 to blank (space). (A more sophisticated code could include both capital and lower
case letters and punctuation symbols)
A B C D E …………. ……….. X Y Z Blank
1 2 3 4 5 ………….. ……….. 24 25 26 27
Any matrix ‘A’ whose elements are positive integers and whose inverse exists can be
used as an ‘encoding matrix’.
A message can be decoded by multiplying with 𝐴−1 , the ‘decoding matrix’.

49. The message SECRET CODE correspondence to the sequence

19 5 3 18 5 20 27 3 15 4 5
4 3
Encoding matrix 𝐴 = [ ].
1 1
1 2
50. Encode the message ‘THE SUN ALSO RISES’ using 𝐴 = [ ].
1 3
51. The message 46 84 85 55 101 100 31 59 64 57 102 99 29 57
38 65 111 122 was encoded with the matrix A. Decode this message. Here
1 1 1
𝐴 = [2 1 2].
2 3 1

Note: Solution of some selected question is provided.