Lecture Notes Mathematics1 Matrices
Lecture Notes Mathematics1 Matrices
Matrices
ENGINEERING MATHEMATICS
Subject code: BT-102
Semester: I
1.1 Introduction
Matrices provide a very powerful tool for dealing with linear models. In this lesson we give a method of
elementary row transformations and evaluation of inverse of matrices are discussed. Some examples are
also provided.
1.2 Matrix: The arrangement of set of elements in the form of rows and columns is called as Matrix.
The elements of the matrix being Real (or) Complex Numbers.
1.3 Order of the Matrix The number of rows and columns represents the order of the matrix. It is
denoted by m x n , where m is number of rows and n is number of columns.
Note: Matrix is a system of representation and it does not have any Numerical value.
1.4 Types of Matrices :
Rectangular Matrix: A matrix is said to be rectangular, if the number of rows and number of columns are
not equal.
3 4 1
Example: A = is a rectangular matrix
6 2 9
1.5 Square Matrix : A matrix is said to be square, if the number of rows and number of columns are
equal.
1 2
Example: A = is a 2 x 2 Square matrix
6 8
1.6 Row Matrix : A matrix is said to be row matrix, if it contains only one row.
Example: A = 1 5 4 5 is a row matrix
1.7 Column Matrix : A matrix is said to be column m atrix, if it contains only one column
4
Example: A = 5 is a column matrix
2
1.8 Diagonal Matrix : A Square matrix is said to be diagonal matrix, if all the elements except
principle diagonal elements are zeros.
The elements on the diagonal are known as principle diagonal elements.
The diagonal matrix is represented by D = dia {a11,a22,a33,…an n} its diagonal elements.
I 0 I
But I r r Ir 0 r , hence It is of rank = 2 .
0 0 0
1.10 The elementary operations for matrices. The following operations, performed on a matrix, do not
change either its order or its rank.
1. Interchanging any two rows or any two columns.
2. Multiplying any row or column by a non-zero constant.
3. Adding to any row a constant times another row or adding to any column a constant times another
column.
We denote the different operations as follows:
1. Rij ( Or Ri Rj) interchange of the ith and jth rows
2. Cij ( Or Ci Cj) interchange of the ith and jth columns
3. Ri(k) multiplication of the ith row by the non-zero constant k .
4. Ci(k) multiplication of the ith column by the non-zero constant k
5. Rij(k) ( Or Ri +k Rj) addition to the ith row the product of k times the jth row
In above example, the key to solve a system of linear equations is to transform the original augmented
matrix to some matrix with some properties via a few elementary row operations. As a matter of fact, we
can solve any system of linear equations by transforming the associate augmented matrix to a matrix in
some form. The form is referred to as the reduced row echelon form.
Definition: A matrix in reduced row echelon form has the following properties:
1 2 0 0 2 1 0 0 3 0
0 0 0
0 1 0 1 0 1 0
Example:
0 0 0 1
0 and 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
1 2 3 4
0 1 2 5
The matrix is not in reduced row echelon form but in row echelon form , since the
0 0 1 2
0 0 0 0
matrix has the first 3 properties and all the other entries above the leading 1 in the third column are not 0.
1 0 3 4
0 1 2 5
The matrix
are not in row echelon form (also not in reduced row echelon form)
0 1 2 2
0 0 0 0
since the leading 1 in the second row is not in the left of the leading 1 in the third row and all the other
entries above the leading 1 in the third column are not 0.
1.15 Definition of elementary row operation: There are 3 elementary row operations:
In above motivating example, the key to solve a system of linear equations is to transform the original
augmented matrix to some matrix with some properties via a few elementary row operations. As a matter
of fact, we can solve any system of linear equations by transforming the associate augmented matrix to a
matrix in some form. The form is referred to as the reduced row echelon form.
Definition: A matrix in reduced row echelon form has the following properties:
1 2 0 0 2 1 0 0 3 0
0 0 0
0 1 0 1 0 1 0
Example : The matrix 0 0 0 1 0 and 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0
0
0 0 0 0
0 0 0 0 0
are the matrices in reduced row echelon form.
1 2 3 4
2 5
The matrix 0 1 is not in reduced row echelon form but in row echelon form , since the
0 0 1 2
0 0 0 0
matrix has the first 3 properties and all the other entries above the leading 1 in the third column are not 0.
1 0 3 4
0 1 2 5
The matrix are not in row echelon form (also not in reduced row
0 1 2 2
0 0 0 0
echelon form) since the leading 1 in the second row is not in the left of the leading 1 in the third row and all
the other entries above the leading 1 in the third column are not 0.
1.17 Important results:
Every nonzero m n matrix can be transformed to a unique matrix in reduced row echelon form
via elementary row operations.
If the augmented matrix Ab can be transformed to the matrix in reduced row echelon form C d
via elementary row operations, then the solutions for the linear system corresponding to C d is exactly
3 1 2
Example: What is the rank of A 2 0 5 ?
1 2 3
Solution: The largest square sub matrix possible is of order 3 and that is [ A] itself. Since
det( A) 23 0, the rank of [ A] 3.
3 1 2
Example: What is the rank of A 2 0 5 ?
5 1 7
Solution: The largest square sub matrix of [ A] is of order 3 and that is [ A] itself. Since det( A) 0 , the
rank of [ A] is less than 3. The next largest square sub matrix would be a 2 2 matrix. One of the square
B
3 1
sub matrices of [ A] is
2 0
and det(B) 2 0 . Hence the rank of [ A] is 2. There is no need to look at other 2 2 sub matrices to
establish that the rank of [ A] is 2.
1 2 3
Q1.
Find rank of matrix A 1 4 2
Ans. ρ(A)=2 [Jan.03,Jan. 06, Dec. 07]
2 6 5
1 2 3
Q2.
Find the rank & nullity of the matrix A 2 3 4
Ans. ρ(A)=2 ,N(A)=1 [Jan. 2007]
3 4 5
1 1 1
Q3.
Find the rank & nullity of the matrix A b c c a a b
bc ca ab
Remarks :
1. If (A) = n, then A is non-singular.
2. If A is a square matrix of order n, then (A) n.
3. If A is an m n matrix then (A) min. {m, n}.
4. If In is the unit matrix of order n, then (In) = n.
5. A matrix and its transpose have the same rank.
6. If (A) = 0 then A is a Null matrix.
7. If all minors of order r are equal to zero, then (A) < r.
8. If A is not a null matrix, then (A) 1.
Nullity of a square matrix = Rank of the matrix – Order of the Matrix
1 3 4 3
9. Find the rank & nullity of the matrix A 3 9 12 9 Ans. ρ(A)=3 & nullity=1
1 3 4 1
[June 2004, June 2014, Nov. 2018]
1 2 3 2
Find the rank & nullity of the matrix A 2 3 5 1 Ans. ρ(A)=2 & nullity is not defined.
10.
1 3 4 5
[June 2006 , May 18 may19]
2 1 3 6
Find the rank & nullity of A 3 3 1 2 Ans. ρ(A)=3 & nullity is not defined.
11.
1 1 1 2
[June 2009, March 2010]
1 a b 0
0 c d 1
12. Find the rank of the matrix A Ans. ρ(A)=2 [Jan. 2007,June 2015]
1 a b 0
0 c d 1
2 1 3 1
1 2 3 1
13. Reduce matrix A to its normal form and then find its rank A Ans. ρ(A)=2
1 0 1 1
0 1 1 1
[Dec .04]
1 1 2
15.
Find the normal form and rank of the matrix A 1 2 3 [June 2017(CBCS)]
0 1 1
8 1 3 6
16.
Find the normal form and rank of the matrix A 0 3 2 2 Ans. ρ(A)=3.
8 1 3 4
[June 2006, June 16(CBCS)]
2 3 4 5
3 4 5 6
17. Reduce matrix A in normal form and find its rank A Ans. ρ(A)=2
4 5 6 7
9 10 11 12
[June 03, April 09,Dec.2011]
1 2
2 2
32
4
2
2
2 32 42 52
Find the rank of the matrix A 2 Ans. ρ(A)=3 [Jan 08,June2011, June 2013]
3 42 52 62
2
4 52 62 72
1.19 Row rank of a Matrix : The number of non-zero rows in the row reduced form of a matrix is
called the row-rank of the matrix.
By the very definition, it is clear that row-equivalent matrices have the same row-rank. For a matrix A we
write “ row rank A “ to denote the row-rank of A .
EXAMPLES
1 2 1
1. Determine the row-rank of the matrix 2 3 1
1 1 2
Solution: To determine the row-rank of A we proceed as follows.
The last matrix in Step 1d is the row reduced form of which has non-zero rows. Thus, row rank A = 3 .
1 2 1
2. Determine the row-rank of the matrix 2 3 1
1 1 0
Solution: Here we have
AX C , where A is called the coefficient matrix, C is called the right hand side vector and X is
called the solution vector.
Sometimes AX C systems of equations are written in the augmented form. That is
[A][X]= [B]
(A)= (A:B)= n
(A)= (A:B) < n number of unknowns
2 4 x 6
b) The system of equations is also a consistent system of equations but it has infinite
1 2 y 3
solutions as given as follows.
we can see that they are the same equation( Parallel Equations). Hence, any combination of x, y that
satisfies 2 x 4 y 6
is a solution. For example x, y 1,1 is a solution. Other solutions include x, y (0.5,1.25) ,
x, y (0, 1.5) , and so on.
2 4 x 6
c) The system of equations is inconsistent as no solution exists.
1 2 y 4
106.8
C 177.2
279.2
25 5 1 106.8
B 64 8 1 177.2
144 12 1 279.2
Since there are no square sub matrices of order 4 as [B] is a 3 4 matrix, the rank of [B] is at most 3. So
let us look at the square sub matrices of [B] of order 3; if any of these square sub matrices have
determinant not equal to zero, then the rank is 3. For example, a sub matrix of the augmented matrix [B]
is
25 5 1
[D] 64 8 1
144 12 1
Hence the rank of the augmented matrix [B] is 3. Since [ A] [ D] , the rank of [ A] is 3. Since the rank of
the augmented matrix [B] equals the rank of the coefficient matrix [ A] , the system of equations is
consistent.
is consistent or inconsistent?
106.8
and the right hand side B 177.2
284.0
25 5 1 :106.8
The augmented matrix is A : B 64 8 1 :177.2
89 13 2 : 284.0
Since there are no square sub matrices of order 4 as [A:B] is a 4 3 matrix, the rank of the augmented
[A:B] is at most 3. So let us look at square sub matrices of the augmented matrix [A:B] of order 3 and
see if any of these have determinants not equal to zero. For example, a square sub matrix of the augmented
matrix [A:B] is
25 5 1
A 64 8 1
89 13 2
has det(A) 0 . This means, we need to explore other square sub matrices of order 3 of the augmented
matrix [A:B] and find their determinants.
5 1 106.8
That is, E 8 1 177.2
13 2 284.0
det(E ) 0
25 5 106.8
F 64 8 177.2
89 13 284.0
det(F ) 0
25 1 106.8
G 64 1 177.2
89 2 284.0
det(G) 0
H
25 5
64 8
and
det(H ) 120 0
25 5 1
A 64 8 1
89 13 2
And det( A) 0
So the rank of the coefficient matrix [ A] is less than 3. A square sub matrix of the coefficient matrix [ A]
J
5 1
is , det( J ) 3 0
8 1
Hence, rank of the coefficient matrix [ A] equals the rank of the augmented matrix [A:B] . So the system
of equations [ A][ X ] [C ] is consistent.
25 5 1 x1 106.8
Example 7 : Use the concept of rank to find the solution , if 64 8 1 x 177.2 is
2
89 13 2 x3 280.0
consistent or inconsistent.
25 5 1 :106.8
Solution : The augmented matrix is A : B 64 8 1 :177.2
89 13 2 : 280.0
Since there are no square sub matrices of order 4 4 as the augmented matrix [A:B] is a 4 3 matrix, the
rank of the augmented matrix[A:B] is at most 3. So let us look at square sub matrices of the augmented
matrix [A:B] of order 3 and see if any of the 3 3 sub matrices have a determinant not equal to zero. For
example, a square sub matrix of order 3 3 of [A:B]
det(D) = 0 , So it means, we need to explore other square sub matrices of the augmented matrix [B]
5 1 106.8
E 8 1 177.2
13 2 280.0
det(E ) 12.0 0 .
Since the rank of the coefficient matrix [ A] is less than the rank of the augmented matrix [A:B] , the
system of equations is inconsistent. Hence, no solution exists for [ A][ X ] [C ] .
is a consistent system of equations. Does the system of equations have a unique solution or does it have
infinite solutions?
25 5 1 106.8
Solution: The coefficient matrix is A 64 8 1 and the right hand side is C 177.2
144 12 1 279.2
While finding out whether the above equations were consistent in an earlier example, we found that the
rank of the coefficient matrix (A) equals rank of augmented matrix AC equals 3.
25 5 1 x1 106.8
Example : Prove that the following system of equations 64 8 1 x 2 177.2
89 13 2 x3 284.0
is a consistent system of equations. Is the solution unique or does it have infinite solutions?
Solution: While finding out whether the above equations were consistent, we found that the rank of the
coefficient matrix [ A] equals the rank of augmented matrix AC equals 2
Since the rank of [ A] 2 < number of unknowns = 3, infinite solutions exist.
Example: If we have more equations than unknowns in [A] [X] = [C], does it mean the system is
inconsistent?
Solution: No, it depends on the rank of the augmented matrix AC and the rank of [ A] .
25 5 1 106.8
64 8 1 x1 177.2
a) For example x2
144 12 1 279.2
x3
89 13 2 284.0
is consistent, since
Now since the rank of (A) = 3 = number of unknowns, the solution is not only consistent but also unique.
25 5 1 106.8
64 8 1 x1 177.2
b) For example x is inconsistent, since
144 12 1 2 279.2
x3
89 13 2 280.0
25 5 1 106.8
64 8 1 x1 177.2
c) For example x2 is consistent, since
50 10 2 213.6
x3
89 13 2 280.0
But since the rank of [ A] = 2 < the number of unknowns = 3, infinite solutions exist.
The word eigenvalue comes from the German word Eigenwert where Eigen means characteristic and Wert
means value.
You need to thoroughly know how to evaluate determinants to understand this chapter.
where is a scalar and [ X ] 0 . The scalar is called the eigenvalue of [ A] and [X ] is called the
eigenvector corresponding to the eigenvalue .
Eigenvectors are not unique in the sense that any eigenvector can be multiplied by a constant to form
another eigenvector. For each eigenvector there is only one associated eigenvalue, however.
In order to find the eigenvectors of a matrix we must start by finding the eigenvalues. To do this we take
everything over to the LHS of the Characteristic equation ( Eigen equation) :
Ax x 0,
A I x 0.
The only way this can be solved is if A I does not have an inverse1, therefore we find values of such
that the determinant of A I is zero:
A I 0.
Once we have a set of eigenvalues we can substitute them back into the original equation to find the
eigenvectors. As always, the procedure becomes clearer when we try some examples:
1 0 4
Example : Determine the eigenvalues of A 0 4 0
3 5 3
4 5 3 0
Solving this gives the eigenvalues 1 4, 2 5 and 3 3 .
1 0 4
Example : Determine the eigenvectors associated with 3 3 for the matrix A 0 4 0
3 5 3
1 0 4
Solution. Substituting the eigenvalue 3 3 and the matrix A 0 4 0 into A I X O
3 5 3
(subtract 3 from the leading diagonal) gives:
1 3 0 4
A 3I X 0 4 3 0 X O
3 3 3
5
0 x
Remember this zero vector is O 0 and also let X y . Substituting these into the above and
0 z
simplifying gives
2 x 0 4 z 0 1
0 y0 0 2
3x 5 y 6 z 0 3
From the middle equation (2) we have y 0 . From the top equation (1) we have
2 x 4 z which gives x 2 z
x 2t 2
The general eigenvector X y 0 t 0 where t and corresponds to 3 3 .
z t 1
Theorem 5: Eigenvectors of a symmetric matrix are orthogonal, but only for distinct eigenvalue.
EXERCISE
Q1. If A is non singular matrix . Show that the Eigen value of A-1 , are the reciprocal of Eigen values of
A. [June 14]
Q2. Prove that the Eigen values of a symmetric matrix are real.
Q3. Prove that the Eigen values of a hermitian matrix are real.
Q4. Prove that the Eigen values of an idempotent matrix are either zero or unity. [June 2007]
Q5. Prove that the sum of the Eigen values of a square matrix is equal to the sum of its principal
21 Prof. Akhilesh Jain, [email protected], Mob. 98630451272
(Department of Engineering Mathematics, Corporate Institute of Science and Technology, Bhopal)
CORPORATE INSTITUTE OF SCIENCE AND TECHNOLOGY, BHOPAL
Lecture Notes: Matrix, Name of the Faculty : Prof. Akhilesh Jain
diagonal.
Q6. Prove that the product of all Eigen values of A is equal to its determinants. [Dec. 2014]
3 2
Q7. Find the Eigen values & Eigen vector of the matrix A Ans .λ=1,2
1 0
1 2
Q8. Find the Eigen values & Eigen vector of the matrix A Ans .λ=6,-1,
5 4
6 2 2
Q9. Find the sum and product of Eigen values of the matrix A 2 3 1
2 1 3
Ans: Sum=12, Product=36 [Dec.14, ]
3 4 4
Q10. Find the Eigen values of A 1 2 4 . Also find the Eigen values of A-1 and A2.
1 1 3
Ans := -1,2,3 (ii) for A-1: = -1, 1/2,1/3 (iii) for A2: = 1,4,9 [June 2012]
cos sin
Q11. Find the Eigen values & Eigen vector of the matrix A
sin cos
Ans .λ=1,-1 [June 2006]
8 6 2
Q12. If 3 and 15 are two Eigen values of A 6 7 4 . Find the remaining Eigen value and A.
2 4 3
Ans: =0 , A=0 [June 08]
8 6 2
Q13. Find the Eigen values & Eigen vector of the matrix A 6 7 4
2 4 3
Ans .λ=0,3,15 [Dec.04, Jan. 08, Dec.12]
3 1 4
Q14. Find the Eigen values & Eigen vector of the matrix A 0 2 6 Ans .λ=2,3,5 [Dec. 2010]
0 0 5
1 2 2
Q15. Find the Eigen values & Eigen vector of the matrix A 0 2 1 [June 17 CBCS]
1 2 2
6 2 2
Q16. Find the Eigen values & Eigen vector of the matrix A 2 3 1 Ans [May 2019]
2 1 3
This result gives the inverse of A in terms of (n-1) powers of A and is considered as a practical
method for the computation of the inverse of the large matrices
If m is a positive integer such that m > n then any positive integral power Am of A is linearly expressible in
terms of those of lower degree.
EXAMPLES
2 1 1
Example: Verify Cayley – Hamilton theorem for the matrix A = 1 2 1 . Hence compute A-1 .
1 1 2
[ Nov. 2018]
2-λ -1 1
A - λI =0 i.e., -1 2-λ -1 =0
1 -1 2-λ
or 3 6 2 9 4 0 (on simplification)
To verify Cayley – Hamilton theorem, we have to show that A3 – 6A2 +9A – 4I = 0 … (1)
2 1 1 2 1 1 6 5 5
Now A 1 2 1 1 2 1 5 6 5
2
1 1 2 1 1 2 5 5 6
6 5 5 2 1 1 22 22 21
A A A 5 6 5 1 2 1 21 22 21
3 2
5 5 6 1 1 2 21 21 22
A3 -6A2 +9A – 4I = 0
To find A-1 : Now, pre – multiplying both sides of (1) by A-1 , we have A2 – 6A +9I – 4 A-1 = 0
6 5 5 2 1 1 1 0 0 3 1 1
4 A1 5 6 5 6 1 2 1 9 0 1 0 1 3 1
5 5 6 1 1 2 0 0 1 1 1 3
3 1 1
A1 1 3 1
1
4
1 1 3
EXERCISE
35
6 1 10
0 0 1
Q28. Find the characteristic equation of matrix A 3 1 0 verify Cayley –Hamilton theorem and find
2 1 4
A1
4 1 1
1
Ans: A3 5 A2 6 A 11I 0 , A
1 12 2 3 [June 2013]
5
5 0 0
1 2 1
Q29. Find the characteristic equation of matrix A 0 1 1 verify Cayley –Hamilton theorem and find
3 1 1
A1
0 1 1
1
3 2 1
Ans. A 3 A 5 A 3I 0 , A 3 4
1 [June09, Dec. 2011]
3
3 7 1