Maths 2.1
Maths 2.1
Study Material
[Algebra and Vector Calculus (BBS00002)]
_____________________________________________________________________________________
Module I: [9H]
(Matrices)
Table of Contents
SL NO Topic Page number
1 The concept of matrix 1
2 Types of matrices 2-5
3 Algebric operations on matrices 5-10
4 Determinant 10-12
5 Rank of a matrix 12-15
6 Gauss elimination method 16-21
The concept of a matrix is a fundamental mathematical concept that is widely used in various fields,
including mathematics, physics, engineering, computer science, and more. A matrix is a rectangular array
of numbers or elements arranged in rows and columns. It is represented in the following form:
𝑎11 … … . 𝑎1𝑛
[ : : : ]
𝑎𝑚1 : 𝑎𝑚𝑛
where a₁₁, a₁₂, ..., a₁n are the elements of the first row, a₂₁, a₂₂, ..., a₂n are the elements of the second row,
and so on. The matrix has i rows and j columns, and we often refer to it
as an (i x j) matrix.
Matrices are used to represent and manipulate various types of data and mathematical objects. Some key
concepts related to matrices include:
➢ Entries/Elements: The individual numbers in a matrix are called entries or elements. For
example, a₁₂ refers to the element in the first row and second column.
➢ Order/Dimension: The order or dimension of a matrix refers to the number of rows and columns
it contains. For example, an (i x j) matrix has i rows and j columns.
➢ Row and Column Vectors: If a matrix has only one row (i = 1), it is called a row vector. If it has
only one column (j = 1), it is called a column vector.
➢ Square Matrix: A square matrix has the same number of rows and columns (i = j). For example,
a (3 x 3) matrix is a square matrix.
➢ Zero Matrix: A matrix where all the elements are zero is called a zero matrix and is denoted by
the symbol "0".
Identity Matrix: An identity matrix, denoted by "I", is a square matrix with ones on the main diagonal
(from the top left to the bottom right) and zeros elsewhere.
Matrix Operations: Matrices can be added, subtracted, and multiplied with each other following specific
rules. Matrix multiplication is not commutative (i.e., A * B ≠ B * A), but it is associative (i.e., A * (B *
C) = (A * B) * C).
Matrices are extensively used in solving systems of linear equations, representing linear transformations,
solving optimization problems, data analysis, graphics, and many other applications. They serve as
2. Types of Matrices
Rectangular Matrix
A matrix is said to be a rectangular matrix if the number of rows is not equal to the number of columns.
For example,
1 5 −2
3 −4 7
is a matrix of the order 2× 3 .
Diagonal Matrix
A 𝑚 × 𝑚 square matrix B = [bij] is said to be a diagonal matrix if all its non-diagonal elements are zero,
that is a matrix B =[bij]m×m is said to be a diagonal matrix if bij = 0, when i ≠ j.
For example,
1 0 0
−3 0
1 , 0
5
, 0 2
0 0 0 3
are diagonal matrices of order 1, 2, 3, respectively.
Scalar Matrix
A diagonal matrix is said to be a scalar matrix if all the elements in its principal diagonal are equal to
some non-zero constant. A diagonal matrix is said to be a scalar matrix if its diagonal elements are equal,
that is, a square matrix B = [bij]n × n is said to be a scalar matrix if
bij = 0, when i ≠ j
bij = k, when i = j, for some constant k.
For example,
5 0 0
−1 0
1 , , 0 5 0
0 −1
0 0 5
are scalar matrices of order 1, 2 and 3, respectively.
Zero/Null Matrix
A matrix is said to be zero matrix or null matrix if all its elements are zero.
For Example,
0 0 0
0 0
0 , , 0 0 0
0 0
0 0 0
are all zero matrices of the order 1, 2 and 3 respectively. We denote zero matrix by O.
Equal Matrices
Two matrices are said to be equal if they are of the same order and if their corresponding elements are
equal .
We denote the identity matrix of order n by In. When the order is clear from the context, we
simply write it as I. For example,
1 0 0
1 0
1 , , 0 1 0
0 1
0 0 1
are identity matrices of order 1, 2 and 3, respectively. Observe that a scalar matrix is an identity matrix
when k = 1. But every identity matrix is clearly a scalar matrix.
A square matrix in which all the elements below the diagonal are zero is known as the upper triangular
matrix. For example,
1 −4 5
0 2 7
0 0 8
1 0 0
−4 6 0
−9 3 5
Symmetric Matrix
A square matrix A is said to be symmetric if aij = aji for all i and j, where aij is an element present at (i,j)th
position (ith row and jth column in matrix A) and aji is an element present at (j,i)th position (jth row and
ith column in matrix A). In other words, we can say that matrix A is said to be symmetric if the
transpose of matrix A is equal to the matrix A itself (AT=A). Let’s take an example of a matrix,
1 3 8
3 8 −4
8 −4 6
Skew-symmetric Matrix
A square matrix A is said to be skew-symmetric if aij =−aji for all i and j. In other words, we can say that
matrix A is said to be skew-symmetric if transpose of the matrix A is equal to the negative of the matrix
A i.e (AT =−A). Note that all the main diagonal elements in the skew-symmetric matrix are zero. Let’s
take an example of a matrix
0 6
( )
−6 0
It is skew-symmetric matrix because aij =−aji for all i and j. Here, a12 = 6 and a21= -6 which
means a12= −a21. Similarly, this condition holds true for all other values of i and j.
• Theorem 1
For any square matrix A with real number entries, A + A′ is a symmetric matrix and A – A′ is a
skew-symmetric matrix.
• Theorem 2
Any Square matrix can be expressed as the sum of a symmetric and a skew-symmetric matrix.
Addition of Matrices
One of the basic operations that can be performed on matrices is the addition operation. Just as we add
two or more integers, two or more matrices can also be added in a similar fashion. This is known as
addition of matrices.
Matrix addition is the operation of adding two or matrices by adding the corresponding entry of each
matrix together.
The most important rule to know is that when adding two or more matrices, first make sure the matrices
have the same dimensions. In order words, you can add a 2 x 3 with a 2 x 3 or a 2 x 2 with a 2 x 2.
However, you cannot add a 3 x 2 with a 2 x 3 or a 2 x 2 with a 3 x 3. For example, the addition of two
given matrices with dimension 2 × 2,
Commutative Law
If A = [aij], B = [bij] are matrices of the same order, say m × n, then A + B = B + A.
Associative Law
For any three matrices A = [aij], B = [bij], C = [cij] of the same order, say m × n, (A + B) + C = A + (B +
C).
Two matrices A and B are said to be conformable for subtraction if they have the same order (i.e. same
number of rows and columns) and their difference A - B is defined to be the addition of A and (-B).
i.e., A – B = A + (-B)
• Matrix multiplication.
Scalar multiplication is easy. You just take a regular number (called a "scalar") and multiply it on every
entry in the matrix.
4 0
1 −9
We call the number ("2" in this case) a scalar, so this is called "scalar multiplication".
But to multiply a matrix by another matrix we need to do the "dot product" of rows and columns ... what
does that mean? Let us see with an example:
7 8
1 2 3 58 64
4 9 10 =
5 6 139 154
11 12
To work out the answer for the 1st row and 1st column:
The "Dot Product" is where we multiply matching members, then sum up:
Then we get:
7 8
1 2 3 58 64
4 9 10 =
6 154
11 12
5 139
When we do multiplication:
The number of columns of the 1st matrix must
In General:
To multiply an m×n matrix by an n×p matrix, the n must be the same, and the result is an m×p matrix.
4
1 2 3 = 1 4 + 2 5 + 3 6 = 32
5
6
4 4 1 4 2 4 3 4 8 12
5 1 2 3 = 5 1 5 2 5 3 = 5 10 15
6 6 1 6 2 6 3 6 12 18
Identity Matrix
The "Identity Matrix" is the matrix equivalent of the number "1":
• Example: A 3×3 Identity Matrix
1 0 0
I =
0 1 0
0 0 1
Order of Multiplication
• In arithmetic we are used to:
4. Determinant
Property-1
The value of the determinant remains unchanged if both rows and columns are interchanged.i.e. If A be a
square matrix then 𝑑𝑒𝑡(𝐴) = 𝑑𝑒𝑡(𝐴𝑇 ).
Property-2
If any two rows (or columns) of a determinant are interchanged, then the sign of determinant changes. i.e
If let A be a square matrix and det(A) be the determinant of this matrix. Now if we interchange two rows
and if det(B) be the new determinant then det(B)= - det(A).
Property-3
If any two rows (or columns) of a determinant are identical (all corresponding elements are same), then
the value of the determinant is zero.
If we interchange the identical rows (or columns) of the determinant Δ, then Δ does not change.
However, by Property 2, it follows that Δ has changed its sign, therefore Δ = – Δ or Δ = 0.
Property-4
If each element of a row (or a column) of a determinant is multiplied by a constant k, then its value gets
multiplied by k.
Let Δ1 be the determinant consequently obtained by multiplying the elements of the first row by
k. Then, Δ1= k Δ.
Property-5
If some or all elements of a row or column of a determinant are expressed as the sum of two (or more)
terms, then the determinant can be expressed as the sum of two (or more) determinants.
Property-6
If the equimultiples of corresponding elements of other rows (or columns) are added to every element of
any row or column of a determinant, then the value of determinant remains the same, i.e., the value of
determinant remain same if we apply the operation Ri → Ri + k Rj or Ci → Ci + k Cj .
Adjoint of a matrix
Given a square matrix A, the transpose of the matrix of the cofactor of A is called adjoint of A and is
denoted by adj A. An adjoint matrix is also called an adjugate matrix. In other words, we can say that
matrix A is another matrix formed by replacing each element of the current matrix by its corresponding
cofactor and then taking the transpose of the new matrix formed.
• Cof(2)= -3
• Cof(3)=-2
• Cof(4)=1
𝑡
4 −3 𝑡 4 −2
Therefore, adj A =(𝑐𝑜𝑓(𝑎𝑖𝑗 )) = [ ] =[ ]
−2 1 −3 1
When A is invertible, then it’s inverse can be obtained by the formula given below.
𝑎𝑑𝑗(𝐴)
𝐴−1 =
|𝐴|
The inverse is defined only for non-singular square matrices. The following relationship holds
between a matrix and its inverse:
AA-1 = A-1A = I, where I is the identity matrix.
Cramer’s Rule
Cramer’s rule will give us the unique solution to a system of equations, if it exists. However, if the system
has no solution or an infinite number of solutions, this will be indicated by a determinant of zero. To find
out if the system is inconsistent or dependent, another method, such as elimination, will have to be used.
To understand Cramer’s rule, let’s look closely at how we solve systems of linear equations using
basic row operations. Consider a system of two equations in two variables.
Exercises
• Solve the system with two variables by Cramer’s rule.
4x-3y=11
6x+5y=7
• Solve the following system of linear equations, using matrix inversion method:
5x + 2 y = 3
3x + 2 y = 5.
A × A-1 = A-1 × A = I
Because with matrices we don't divide! Seriously, there is no concept of dividing by a matrix . But we can
multiply by an inverse, which achieves the same thing. Say we want to find matrix X, and we know
matrix A and B where XA = B .
It would be nice to divide both sides by A (to get X=B/A), but remember we can't divide .
5. Rank of a Matrix
The rank of the matrix refers to the number of linearly independent rows or columns in the
matrix. ρ(A) is used to denote the rank of matrix A. A matrix is said to be of rank zero when all of its
elements become zero. The rank of the matrix is the dimension of the vector space obtained by its
Nullity of a Matrix
The nullity of a matrix is defined as the number of vectors present in the null space of a given matrix. In
other words, it can be defined as the dimension of the null space of matrix A called the nullity of A.
Rank(A) + Nullity(A) is the number of all columns in matrix A.
• Matrix A has at least one r-rowed minor which is different from zero
• Every (r + 1) row minor of matrix A is zero.
Let A = (aij)mxn be a matrix and B is its sub-matrix of order r, then ∣β∣ the determinant is
called an r-rowed minor of A.
Note: The rank of a matrix does not change if we perform the following elementary row
operations are applied to the matrix:
(c) A constant multiple of another row is added to a given row (Rᵢ ⟶ Rᵢ + kRⱼ), where i ≠ j.
Solved Problems:
1 2 3
Find the Rank of a Matrix Using the Echelon Form of A=[2 3 4]
3 5 7
Gauss elimination method is widely used in numerical linear algebra and is an important tool for
solving systems of linear equations in various scientific and engineering applications. However, it is
worth noting that in practical implementations, one should be aware of issues like numerical stability and
the possibility of division by small numbers, which can affect the accuracy of the solution.
Top of Form
Example:
Solve the equations by Gauss elimination method.
Solution:
From the third equation x3 = 1, from the second equations x2 = x3 = 1 and from
the first equation 2x1 = 4- x2 – x3 = 2 or, x1 = 1.
Therefore, the solution is x1 = 1, x2 = 1, x3 = 1.
In this method, the given matrix A is augmented with a unit matrix of same size, i.e.,
if the order of A is n × n then the order of the augmented matrix [A:I] will be n×2n.
The augmented matrix looks like
Then the inverse of A is computed in two stages. In the first stage, A is converted
into an upper triangular form, using only elementary row operations (using Gauss
elimination method). In the second stage, the upper triangular matrix (obtained in first stage)
is reduced to an identity matrix by row operations. All these operations are operated on the
augmented matrix [A:I]. After completion of these stages, the augmented matrix [A:I] is
turned to [I:A-1] i.e., the inverse of A is obtained from the right half of augmented matrix.
At the end of the operations the matrix shown in (1) reduces to the following form:
2 4 5
Example: Find the inverse of the following matrix A=[1 −1 2]
3 4 5
Solution:
The left hand becomes a unit matrix, thus the inverse of the given matrix is
c. The rank of a matrix is maximum number of d. The rank of a matrix is maximum number of
linearly dependent columns in the matrix linearly independent rows in the matrix
6. Identify the correct option:
The rank of a matrix is always:
a. greater than or equal to zero b. greater than or equal to one
c. greater than or equal to the number of rows d. greater than or equal to the number of
columns
7. Select the rank of the zero matrix:
a. 0 b. 1
c. depends on the order of the matrix d. cannot be determined
a. it’s rank is less than the number of rows b. it’s rank is less than the number of columns
c. it’s rank is equal to the number of rows d. none of the above
12. Identify if a matrix has rank equal to its number of rows, then:
13. For two matrices A and B of the same order, choose the correct statement
c. The matrix has three linearly independent d. The matrix is not valid as it should be a
columns square matrix
16. Choose the maximum possible rank of a matrix of order 4 X 5
a. 5 b. 4
c. 9 d. 8
17. Choose the correct option:
If the rank of a square matrix is less than the number of rows, then the matrix is
a. non-singular b. singular
c. square d. symmetric
c. A 2x3 matrix with two linearly independent d. A 3x3 diagonal matrix with all diagonal
rows elements non-zero
a. 0 b. 1
c. The order of the matrix d. Undefined
20. Choose the correct determinant of a 1x1 matrix [a] from the following given options
a. a b. 1
c. 0 d. -a
21. Choose the correct option:
a. 0 b. 1
c. The product of its diagonal elements d. The sum of its diagonal elements
22. Choose the correct option:
a. 1 b. 0
c. any real number d. non-zero
26. If a matrix A of order n×n is multiplied by a scalar k, the determinant of the resulting matrix is
a. kn|A| b. |A|/k
c. k|A| d. |A|/kn
a. 0 b. 1
c. -1 d. Not defined
a. 0 b. 1
c. -1 d. Not defined
29. Choose the correct option:
c. The product of its diagonal elements d. The difference of its diagonal elements
32. If A and B be two matrices such that AB is defined and c is a scalar, then which is not correct
6 1 3 2
−2 0 1 4
1. Without expansion, illustrate that | | = 0.
3 6 1 2
−4 0 2 8
𝑎1 𝑎2 𝑎3 2𝑎1 𝑎2 𝑎3
2. If det[𝑏1 𝑏2 𝑏3 ]=5, evaluate the determinant of the matrix [6𝑏1 3𝑏2 3𝑏3 ].
𝑐1 𝑐2 𝑐3 2𝑐1 𝑐2 𝑐3
3. Use Cramer’s rule to solve the given system of equations: x-y=2, x+4y=5.
4.Use Cramer’s rule to solve the given system of equations: x+y+z =0, 2x-y-4z=15, x-2y-z=7.
0 −2 −3
5.Calculate the inverse, if it exists, of the matrix ( 1 3 3 ).
−1 −2 −2
0 𝑏−𝑎 𝑐−𝑎
6.Without expanding illustrate that |𝑎 − 𝑏 𝑜 𝑐 − 𝑏 | = 0.
𝑎−𝑐 𝑏−𝑐 0
𝑥 2 3
7. If x= - 4 is a root of |1 𝑥 1| = 0, calculate the other roots.
3 2 𝑥
4−𝑥 4+𝑥 4+𝑥
8. If |4 + 𝑥 4 − 𝑥 4 + 𝑥 | = 0, then calculate values of x.
4+𝑥 4+𝑥 4−𝑥
𝑎 𝑏 𝑐
9. If a+b+c ≠ 0 and |𝑏 𝑐 𝑎| = 0, then illustrate that a = b = c.
𝑐 𝑎 𝑏
2 𝜆 −3
10. If A= (0 2 5 ), then calculate the value of 𝜆 for which A-1 exists.
1 1 3
1 𝑎 𝑏𝑐 1 𝑎 𝑎2
1. Establish that |1 𝑏 𝑐𝑎 | = |1 𝑏 𝑏 2 |.
1 𝑐 𝑎𝑏 1 𝑐 𝑐2
2
1 𝑎 𝑎
2. Show that |1 𝑏 𝑏 2 | = (𝑏 − 𝑐)(𝑐 − 𝑎)(𝑎 − 𝑏).
1 𝑐 𝑐2
T
3. Recall that a square matrix A is said to be skew-symmetric if A = −A. If A is a 5 × 5
skew-symmetric matrix, show that det(A) = 0.
2 −17 11
5. Calculate the inverse of the matrix [−1 11 −7].
0 3 −2
1 2 3
6. Calculate the rank of the matrix [1 4 2].
2 6 5
7. Show that every square matrix can be uniquely expressed as sum of a symmetric matrix and a
skew symmetric matrix.
𝑥 3 + 3𝑥 𝑥 − 1 𝑥 + 3
8. If | 𝑥 + 1 1 − 2𝑥 𝑥 − 4| = 𝑎𝑥 4 + 𝑏𝑥 3 + 𝑐𝑥 2 + 𝑑𝑥 + 𝑒 be an identity in 𝑥 where
𝑥−2 𝑥+4 3𝑥
𝑎, 𝑏, 𝑐, 𝑑, 𝑒 are constants, then calculate the value of 𝑒.
1 2 3
9. Using the Gauss-Jordan method, find the inverse of the matrix (0 1 2).
0 0 1