MATHEMATICS FOR

ECONOMICS (AND BUSINESS)

Instructor: Dang Duc Long, Ph.D.

E-mail: [email protected]

Office hours: by appointment

Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.1. Introduc-on to Matrices
• A matrix is a set or group of numbers arranged in a square or rectangular form
enclosed by two brackets
Examples:

People usually denote matrices by capital letters as A,B, C etc

A is a matrix of order m x n.
ith row jth column element of the matrix denoted by aij
Remark: A matrix is not just a collec?on of elements but every element has
assigned a definite posi?on in a par?cular row and column.
Two numbers (rows x columns) describe the dimensions or size of the matrix
or we say order of the matrix
 types of matrices
Lesson 7: INEQUALITIES
1. column matrix or vector:& MATRIX ALGEBRA
types
types of of matrices
matrices
7.1.The
Introduction tomay
Matrices
1.
1. c
c number
olumn
olumn of rows
matrix
matrix or be
orvector
vector: : but the number of columns is always 1
any integer
• Special Types of Matrices
and order is 1 n
1. Column
The number of Matrix
rows or Vector:
may bebeanya The number
integer the of
butbut rows of
number may be any
columns integer
is al ways but the
1ways
The number1 of rows may
1 n is alwaysany
11 integer the number of columns is al 1
number
and orderofiscolumns
1 1 and order is 1x m
and4 order is 1 n a a21
1 3 11
a11
1
1 2 1 a 21
4 a21am1
42 3
3
2 am1
2. row matrix or am1vector
2. row matrix or vector
2. Row Matrix or Vector: Any number of columns but onlynone
2.Anyisrnownumber
matrixof columns but only one row and of order
or vector 1 row and of order
x1
Any number of columns but only one row and of order n 1
1 1 6 10 3 15 2 11 a 12 a a a
13 n 1 1n
Any number
3. of columns
1 1 r6ectangular
but only
10 3 15matrix
2 one row and of
a11 a12 a13 order
a1n
3. Rectangular
1Contains
1 6 moreMatrix:
than 3Contains
10 one 15 2 more
element than
a11 one
and number aof element aand
a13 is not
12 rows
number
1equal
n
of rows is
to the number
not equal toi.e.
of columns n of columns i.e. m ¹ n
themnumber
1 1
1 1 1 0 0
3 7
2 0 3 3 0
7 7
7 6
 a particular row and column.

Lesson 7: INEQUALITIES
1.2 Special Types of Matrices: & MATRIX ALGEBRA
7.1. Introduc-on to Matrices
1. Square matrix:
• Special Types of Matrices
That is and at least one element .
A matrix in which numbers of rows are equal to number of columns is called a sq
4. Square matrix: A matrix in which numbers of rows are equal to number of
matrix. Example:
That iscolumns is called and at least
a square one element
matrix .
Example:
Example:

3. Identity Matrix

5. Diagonal 2. Diagonal A square matrix AA is

matrix:matrix: calledmatrix
diagonal a diagonal matrixelements
whose diagonal if each are
of its
equal to
non-diagonal elementmatrix is zero.
and denoted by .
3. Identity = 0 if Ai ¹square
i.e., a Matrix
ij j andmatrix A=
at least is called a diagonal matrix if each of its non-diagon
one element a ¹ 0
ii
element is zero. That is
A diagonal matrix whose diagonal elements are equal to 1 is called ide
6. Unit or Identity Matrix: A diagonal matrix whose diagonal elements are equal
matrix and denoted by . Example:
to 1 is called identity matrix and denoted by In

That is

7. Null (Zero) Matrix: All4.elements

Example: matrix:are zero aij = 0 for all i,j
in the matrix
Upper Triangular

A square matrix said to be a Upper triangular matrix if

 0 0 0 0
matrix and denoted by .
A0diagonal matrix whose
0 0diagonal
0 elements are equal to 1 is called identity
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
matrix 0 by .
That isand denoted 0 0 0
7.1. Introduction to Matrices
8.is tTypes
That
• Special riangular
Example: matrix
of Matrices
8. Triangular Matrix:
A square matrix A square
whose matrix
elements abovewhose elements
or below the mainabove or below
diagonal the main
are all zero.
Example:
diagonal are all zero
1 0 0 1 0 0 1 8 9
4. Upper Triangular
2 1 0 matrix: 2 1 0 0 1 6
5 2matrix
A square 3 said to be a5Upper
2 3triangular matrix if0 0 3 .
4. Upper Triangular matrix:
There are
Example: two types
A square matrixof Triangular
said Matices
to be a Upper triangular matrix if .
8a. There
Upperare two typesmatrix:
Triangular of Triangular
A squareMatices
matrix: said to be a Upper triangular
matrix if aij = 0 for all i > j
Example:

5. Lower Triangular Matrix:

A square matrix said to be a Lower triangular matrix if .

8b. LowerTriangular
5. Lower Triangular Matrix: A square matrix said to be a Lower triangular
Matrix:
matrix if aij = 0 for all i < j
Example:
A square matrix said to be a Lower triangular matrix if .

Example:
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.1. Introduc-on to Matrices
6. Symmetric Matrix:

• Special Types of Matrices

A square matrix A = said to be a symmetric if for all i and j.
9. Symmetric Matrix: A square matrix A = (a ij ) nxn said to be a symmetric
a ij = a ji for all i and j.
if Example:

7. Skew- Symmetric Matrix:

10. Skew- Symmetric Matrix:

A square matrix A = A square
said matrix A = (aij)nxn said
to be a skew-symmetric if to be a for all i and j.
symmetric if aij = - aji for all i and j.
Example:

8. Zero Matrix:

A matrix whose all elements are zero is called as Zero Matrix and order Zero
matrix denoted by .

Example:
 Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.1. Equality of two matrices:
Two matrices A and B are said to be equal if
(i) They are of same order
(ii) Their corresponding elements are equal.
That is if A = (aij)mxn and B = (bij)mxn and aij = bij for all i and j then A = B

• Some properties of Equality

o If A = B, then B = A for all A and B
2.2. ScalarIfmultiple of a matrix
A = B, and B = C, then A = C for all A, B and C
7.2.2.
LetScalar multiple
k be a scalar then of a matrix:
scalar product of matrix A = given denoted by kA and
Let k by
given be akA
scalar*
= then scalar
or product of matrix A = (aij)mxn denoted by kA and given by
kA = (kaij)mxn or

(a scalar: a scalar is a quantity that has only magnitude (or size) and no direction. It's a
2.3. Addition of two matrices:
single number that represents a measurable characteristic of something.)
Let A = and are two matrices with same order then sum of the
 2.2. Scalar multiple of a matrix
LessonLet7: INEQUALITIES & MATRIX ALGEBRA
k be a scalar then scalar product of matrix A = given denoted
2.3. Addition of two matrices:
7.2. Matrix Algebra (MatrixorOpera-ons)
given by kA =
7.2.3. Addi?on
Let of
A two
= matrices
and: are two matrices with same order
Let A = (aij)mxn and B = (bij)mxn are two matrices with same order then sum of the
two matrices are given by
two matrices are given by

• Commuta?ve
2.3.
Law
Example 2.1:of
Addition lettwo matrices:
If A + B = B + A for all A and B
• Associa?ve
Let Law
A = and are two matrices with same order th
A + (B + C) = (A + B) + C = A + B + C and .
two matrices are given by
• Existence of Addi?ve Iden?ty
A+0=0+A Find (i) 5B (ii) A + B (iii) 4A 2B (iv) 0 A
• Existence of Addi?ve Inverse
2.4.
A Multiplication
+ (-A) = 0 (where of
–Atwo matrices:
is the matrix composed of –aij as elements)
Example 2.1: let
Example:
Two matrices A and B are said to be confirmable for product AB if num
A equals to the number of rows and
in matrix B. Let A = .
matrices the product matrix C= AB, is matrix of order m r where
Find (i) 5B (ii) A + B (iii) 4A 2B (iv) 0 A
 Find (i) 5B (ii) A + B (iii) 4A 2B (iv) 0 A
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2.2.4.
Matrix Algebra (Matrix
Multiplication of twoOperations)
matrices:
7.2.4. Multiplication of two matrices:
Two matricesTwoA andmatrices A to
B are said and
be B are said to
confirmable forbe confirmable
product for product
AB if number of A
columns in A equals
A equals to the number
to the number ofofrows matrixB.B. Let A =
rows in matrix
Let A = (aij)mxn and B = (bij)nxr are two matrices then the product matrix C= AB,
matrices the product matrix C= AB, is matrix of order m r where
is matrix of order mxr where

Example:

Example 2.2:aLet a b11 b12 andc

11 12 a13 11 c12
b21 b22
a21 a22 a 23 c21 c22
b31 b32
Calculate (i) AB (ii) BA
(a11 b11) ( a12 b21) (a13 b31) c11
(a11(iii)b12
is) (a12
AB b22 )?
= BA ( a13 b32 ) c12
(a 21 b11) (a 22 b21) ( a 23 b31) c21
(a 21 ofb12
2.5. Integral power ) ( a 22 b22 )
Matrices: ( a 23 b32 ) c22
 Two matrices A and B are said to be confirmable for product AB if number of columns in
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
A equals to the number of rows in matrix B. Let A = be two
matrices the product matrix C= AB, is matrix of order m r where
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.4. Mul?plica?on of two matrices:
Example:

Example 2.2: Let and

Calculate
Calculate (i) AB (ii) BA
(i) AB
(ii) BA (iii) is AB = BA ?
(iii) is AB = BA?
2.5. Integral power of Matrices:

Let A be a square matrix of order n, and m be positive integer then we define

(m times multiplication)

2.6. Properties of the Matrices

Let A, B and C are three matrices and are scalars then

(i) Associative Law

Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.4. Multiplication of two matrices:
Properties of Matrix Multiplication:
Assuming that matrices A, B and C are conformable for the operations indicated,
the following are true:
1. AI = IA = A (existence of multiplicative identity)
2. A(BC) = (AB)C = ABC (associative law)
3. A(B+C) = AB+AC (first distributive law)
4. (A+B)C = AC +BC (second distributive law)
Caution!
1. AB not generally equal to BA, BA may not be conformable
2. If AB = 0, neither A nor B necessarily = 0
3. If AB = AC, B not necessarily = C
 Lesson 7: (vi)
(vi) INEQUALITIES law Distributive
& MATRIX
Distributive law
ALGEBRA
7.2. Matrix
7. Transpose: 2.7. Algebra (Matrix
Transpose: Opera-ons)
7.2.5. Transpose of a matrix:
The transpose
AA= = (a )of matrix A= ( T , written is (the matrix obtained
is the m
ij mxn , wriOen as A or A’, is the matrix obtained
The
The transpose
transposeofofmatrix
matrix , written
bythe
writing wri?ng by
the
rows of Awriting
rows theArows
of as
in order in of A inas
order
columns. order as columns.
columns
That is
That is AT = That is. .

Proper?es of Properties
of Transpose:
transposed of Transpose:
matrices:
Properties
1. (A+B)T = AT + BT (i)
2. (AB)
(i) T = BT AT
(ii) =A
3. (kA)
(ii) = kA
T T =A
(iii) =k for scalar k.
4. (AT(iii)
)T = A =k for scalar k.
(iv)
(iv)
Example: Using the 2.3:
Example following
Usingmatrices A and
the following B, Verify
matrices theB,transpose
A and Verify the properties
transpose propert
xample 2.3: Using the following matrices A and B, Verify the transpose properties

,
,

Proof: (i) Let and are the element of the matrix A and B respect
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
SYMMETRIC
7.2.5. Transpose MATRICES
of a matrix:
SYMMETRIC MATRICES
A Square
Properties of matrix matrices:
transposed is symmetric if it is equal to its transpose:
A Square
oA Square matrix
matrix is symmetric
is symmetric if A
if it is equalitto=isits
Aequal to its transpose:
Ttranspose:

A = AT and A is square AT A is symmetric

then
aA = b a b
A AT
a b b dT a b b d
A A
b d
Skew symmetric matrix: b d
A square
oSkew matrix
symmetric is skew
matrix:
A square matrix is skew symmetricifif A = -AT
symmetric
A square matrix is skew symmetric if A = - AT
0 a A b= - AT 0 a b
0 Aa ba 0 c 0 AT a ab 0 c A
A a 0 bc c 0AT a 0 bc c A0
b c 0 b c 0
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.6. Inverse of a matrix:
Consider a scalar k. The inverse is the reciprocal or division of 1 by the scalar.
Example: k = 7 the inverse of k or k -1 = 1/k = 1/7
Division of matrices is not defined since there may be AB = AC while B ¹ C
Instead matrix inversion is used.
The inverse of a square matrix, A, if it exists, is the unique matrix A-1 where:
AA-1 = A-1A = I INVERSE OF M,ATRIX
Example:
2 3 1
A 2 A
2 1
1 1 1
A
2 3
Because:
1 1 3 1 1 0
2 3 2 1 0 1
3 1 1 1 1 0
2 1 2 3 0 1
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.6. Inverse of a matrix:
Properties of the inverse:
(AB)-1 = B-1A-1
(A-1)-1 = A
(AT)-1 = (A-1)T
(kA)-1 = k-1A-1
A square matrix that has an inverse is called a nonsingular matrix.
A matrix that does not have an inverse is called a singular matrix.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.6. Determinant of a matrix:
To compute the inverse of a matrix, the determinant is required. Each square
matrix A has a unit scalar value called the determinant of A, denoted by detA or
|A|
Let A= then = =
Let A= then = =
(ii) Determinant of 3 3 matrix

(ii) Determinant of 3 3 matrix

Let B =

Let B=
Then =

Then =
Exercise 3.1: Calculate the determinants of the following matrices

(i) (ii)
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.6. Determinant of a matrix:
If A is an nxn matrix and one row and one column are deleted, the resulting
matrix is an (n-1)x(n-1) submatrix of A.
The determinant of such a submatrix is called a minor of A and is designated by
mij , where i and j correspond to the deleted row and column, respectively.
mij is the minor of the element aij in A.

• Square matrices have inverses except when the determinant is zero.

• When the determinant of a matrix is zero the matrix is singular.
If A is square matrix of order n, the A is called singular matrix when |A| = 0
and non- singular otherwise.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.7. Minor and Cofactors of a Matrix:
Let A = (aij)nxn is a square matrix. Then Mij denote a sub matrix of A with order
(n-1)x(n-1) obtained by dele?ng its ith row and jth column.
The determinant |Mij| is called the minor of the element aij of A.
The cofactor of aij denoted by Cij and is equal to (-1)i+j |Mij|
So:
|A| = detA = a11C11 + a12C12 + … + a1nC1n
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.8. Adjoin Matrix:
The transpose of the matrix of cofactors of the element aij of A denoted by adj A
is called adjoin of matrix A.
So:
adj A = CijT

For any square matrix A: A(adjA) = (adjA)A = |A|I

where I is the identity matrix of same order.

If A and B are two square matrices of order n then

adj(AB) = (adjA)(adjB)
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.9. Elementary Transforma?ons of a Matrix:
Some opera?ons on matrices called as elementary transforma?ons. There are six
types of elementary transforma?ons, three of then are row transforma?ons and
other three of them are column transforma?ons. There are as follows:
(i) Interchange of any two rows or columns.
(ii) Mul?plica?on of the elements of any row (or column) by a non zero number k.
(iii) Mul?plica?on to elements of any row or column by a scalar k and addi?on of it
to the corresponding elements of any other row or column.
We adopt the following nota?ons for above transforma?ons
(i) Interchange of ith row and jth row is denoted by Ri « Rj
(ii) Mul?plica?on by k to all elements in the ith row Ri ® kRi
(iii) Mul?plica?on to elements of jth row by k and adding them to the
corresponding elements of ith row is denoted by Ri ® Ri + kRj.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.9. Elementary Transformations of a Matrix:
• Equivalent Matrix:
A matrix B is said to be equivalent to a matrix A if B can be obtained from A,
by for forming finitely many successive elementary transformations on a
matrix A. Denoted by A ~ B.

(i) Interchange of ith row and jth row is denoted by Ri « Rj

(ii) Multiplication (Scaling): by k to all elements in the ith row Ri ® kRi
(iii) Combining: Multiplication to elements of jth row by k and adding them to the
corresponding elements of ith row is denoted by Ri ® Ri + kRj.

• Ri « Ri + kRj Operation applied on row called row transformation

• 𝐶𝑖 « 𝐶𝑖 ± 𝑘𝐶𝑗 Operation applied on column is called column operation

Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.9. Elementary Transforma?ons of a Matrix:
• Rank of a Matrix:
RANK OF MATRIX
Defini?on:
A posi?ve
Theinteger
rank of‘r’matrix
is said Atoisbethe
theorder
rank of
of any
a non- order A if
zero matrix
highest
(i) There exists at leastdeterminant
non-vanishing one non-zeroofminor of order r of A and
the matrix.
(ii) Every minor of order greater 𝐴 than 𝑜 r of𝐴A is zero.
The rankMeans there is
of a matrix A isaldenoted r(A) = r
least onebydeterminant of order r is not
equal to zero and every determinant of order r+1 is zero
2 1 1 2 1 1
Ex: A 4 2 2 𝐴 4 2 2 0
1 2 2 1 2 2
So rank of A cannot be 3
4 2
Now 0 (nonzero determinant)
1 2

Thus 𝐴 2
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Operations)
7.2.9. Elementary Transformations of a Matrix:
• Methods for Finding Rank of a Matrix:
1. Finding the largest order non-vanishing determinant of matrix A.
2. Reducing Matrix A to Echelon Form.
3. Reducing Matrix A to Normal Form.
o Echelon Form:
- All the zero rows or any zero rows follows the nonzero rows.
- The number of zeros before the first non-zero element in first, second,
third row should be in increasing order.
• The rank of matrix in Echelon form is equal to the number of non zero rows of
the matrix.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.2. Matrix Algebra (Matrix Opera-ons)
7.2.9. Elementary Transforma?ons of a Matrix:
• Methods for Finding Rank of a Matrix:

Ex:
1 2 1 2
1 3 2 2
A R2 R2 R1 R3 R3 2 R1
2 4 3 4
3 7 4 6
and R4 R4 3R1

1 2 1 2
0 1 1 0
A R4 R4 R2
0 0 1 0
0 1 1 0
1 2 1 2
0 1 1 0
0 0 1 0
0 0 0 0 Hence 𝜌 𝐴 3
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equations
• Linear equations are common and important in Business and Economics
• Matrices can be used to express these linear equations and aid in the
computation of unknown values.
• System of equations has three types of solution:
1. Unique Solutions: consider the system of equations
𝑥 + 2𝑦 = 5
3𝑥 − 𝑦 = 1
which gives 𝑥 = 1, 𝑦 = 2 have a single solution or unique solution and
said to be consistent by nature.
2. Infinite solution: Consider
x + 2y = 5
2x + 4y = 10
which does not gives unique solution, but there are many solutions if
𝑥 = 𝑘 and 𝑦 = 5 − 2𝑘 ; k is arbitrary have infinite number of values, so
above equation have infinite solutions and said to be consistent.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equa-ons
• System of equations has three types of solution:
3. No Solutions: consider the system of equations
𝑥 + 2𝑦 = 5
2𝑥 + 4𝑦 = 7
We get 0 = −3 which absurd therefore equations are said to
inconsistent and have no solution.
.
• There are Two types of linear Equations:
1. Non Homogenous Linear Equation: AX = B
2. Homogenous Linear Equation: AX = 0
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equations
Example
n equations in n unknowns, the aij are numerical
coefficients, the bi are constants and the xj are
unknowns which is non-homogeneous equations

a11x1 a12 x2 a1n xn b1

a21x1 a22 x2 a 2 n xn b2

an1 x1 an 2 x2 ann xn bn

The equations may be expressed in the form

AX = B
 bn
an1Lesson ann n x n xn n&xMATRIX
an1 7: INEQUALITIES 1 nx1
ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equa-ons
mber of unknowns = number of equations = n
• Augmented
gmented Matrix: TheMatrix: The matrix
matrix composed
composed mxn elements
of mnof elements of of coefficient
A plus one addition column whose elements are constant 𝑏𝑖 is
fficient matrix
matrix A plus one addition column whose elements
called augmented matrix of the system and denoted [A, B]
constant 𝑏 is called augmented matrix of the system and
oted [A, B]
a11 a12 ... a1n b1
a21 a22 ... a2n b2
[ A, B]
... ... ... ... ...
am1 am 2 ... amn bm
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix
Solution Of nonAlgebra to Solve
Homogenous Linear Equations
Equation:
• Solution of Non
If There are n Homogenous Equation:
Equations in n Variables
If There
a) 𝜌 𝐴n Variables
Ifare 𝜌 𝐴, 𝐵 in𝑟n Equations
𝑛(number of variables), the system will have
a) If 𝜌(𝐴Unique ,𝐵] = 𝑟 = 𝑛 (number of variables), the system will have
) = 𝜌[𝐴solution.
Unique
b) solution.
If 𝜌 𝐴 𝜌 𝐴, 𝐵 𝑟 𝑛, the system will have infinite solution.
𝐴 𝐴,𝐵𝜌] =
b) Ifc)𝜌(𝐴If) 𝜌= 𝜌[ 𝑛, the
𝐴,𝑟𝐵< the system
system willno
will have have infinite solution.
solution.
c) If 𝜌(𝐴) ¹ 𝜌[𝐴,𝐵] the system will have no solution.
• Example:
Example: solve the
solve thesystem
system ofofequation
equation
2𝑥 + 𝑦 − 2𝑧 = 2 2𝑥 + 𝑦 − 2𝑧 2
𝑥+𝑦+𝑧=4 𝑥+𝑦+𝑧 4
3𝑥 − 𝑦 + 𝑧 2
3𝑥 − 𝑦 + 𝑧 = 2 𝑥 + 2𝑦 + 2𝑧 7
𝑥 + 2𝑦 + 2𝑧 = 7
Here
2 1 2 2
x
1 1 1 4 AX=B
y
3 1 1 2
z
1 2 2 7
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equa-ons
• Solution of Non Homogenous Equation:

Augmented Matrix 2 1 2 ... 2

1 1 1 ... 4
[ A, B ] R1 R2
3 1 1 ... 2
1 2 2 ... 7
1 1 1 ... 4
2 1 2 ... 2
[R 2 R2 2R1, R 3 R3 3R1
3 1 1 ... 2
1 2 2 ... 7
R4 R4 R1]
[R 2 R 4 ] [R 3 R3 4R 2 , R 4 R4 R2]
1 1
[R 4 R 4, R3 R3]
3 2
[R 4 R 4 R3]
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equations
• Solution of Non Homogenous Equation:

1 1 1 ... 4
0 1 1 ... 3
0 0 1 ... 1
0 0 0 ... 0
Which is Echelon form of Matrix [A,B]
𝜌 𝐴 𝜌 𝐴, 𝐵 therefore equations are consistent.
Now 𝜌 𝐴 𝜌 𝐴, 𝐵 3 𝑛(number of variables), the system will have
Unique solution.
1 1 1 4
x
0 1 1 3
y
0 0 1 1
z
0 0 0 0

𝑥+𝑦+𝑧 4
 Unique solution.
1 1 &1 MATRIX
Lesson 7: INEQUALITIES 4 ALGEBRA
x
0 1 Linear
7.3. Using Matrix Algebra to Solve 1 3
Equa-ons
y
• 0 0 1
Solution of Non Homogenous Equation: 1
z
0 0 0 0

𝑥+𝑦+𝑧 4
𝑦+𝑧 3
𝑧 1
which gives 𝑥 1, 𝑦 2 𝑎𝑛𝑑 𝑧 1.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equations
• Solution of Non Homogenous Equation:
Example: Solve the equations such that equations have (i) no Solution (ii) a
Unique solution (iii) a Infinite solution
𝑥 6
𝑥 2 3 10
𝑥 2 𝑎 𝑏
1 1 1 𝑥 6
Here 1 2 3 10
1 2 𝑎 𝑏
Then augmented matrix
1 1 1 ... 6
[ A, B ] 1 2 3 ... 10
1 2 a ... b
R2 R2 R1, R3 R3 R2
1 1 1 ... 6
0 1 2 ... 4
0 0 a 3 ... b 10
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equa-ons
• Solution of Non Homogenous Equation:

Case I: when 𝑎 3, 𝑏 10 we get

𝐴 2 𝐴, 𝐵 3
Thus system is inconsistent and have no solution.

Case II: when 𝑎 3, 𝑏 10 we get

𝐴 𝐴, 𝐵 2 3 𝑁 . 𝑓 𝑎 𝑖𝑎𝑏𝑙𝑒
Thus system is consistent and infinite solution.

Case III: when 𝑎 3 we get

𝐴 𝐴, 𝐵 3 𝑁 . 𝑓 𝑎 𝑖𝑎𝑏𝑙𝑒
Thus system is consistent and have unique solution.
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. SOLUTION
Using IF HOMOGENOUS
Matrix Algebra LINEAR
to Solve Linear Equations
EQUATION
• Solution of Homogenous Equation:
when the system has n Equations in n variables
The equation AX=0 will always have unique solution if rank of A is always
equal to number of variables, but it is zero solution also Known as Trivial
solution. In this case A is non singular matrix i.e. 𝐴 0.

When rank of matrix A is r less than number of variables then there will be
infinite solutions
In this case 𝐴 0 and we have non zero solution called non trivial solution.

Example: Solve
𝑥 𝑦 𝑧 0
𝑥 2𝑦 𝑧 0
2𝑥 𝑦 3𝑧 0
1 1 1 𝑥 0
matrix equation becomes 1 2 1 𝑦 0 AX=0
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equa-ons
• Solution of Homogenous Equation:

The Coefficient matrix

1 −1 1
𝐴 1 2 −1
2 1 −3

[𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 2 𝑅1 and then

[𝑅3 → 𝑅3 − 𝑅2

1 −1 1
𝐴 0 3 −2
0 0 3
This is Echelon form and rank of A =3 (No. of variables). Therfore zero
solution is the only solution.
Now matrix equation
𝑥−𝑦+𝑧 0
3𝑦 − 2𝑧 0
Lesson 7: INEQUALITIES & MATRIX ALGEBRA
7.3. Using Matrix Algebra to Solve Linear Equations
• SolutionLofINEAR EQUATIONS
Linear Equations by Matrix Inversion Method:

When A-1 is computed the equation becomes

0.5 0.5 0.5 2 2

X A 1B 1.0 2.0 1.0 1 3
1.5 3.5 2.5 3 7

Therefore
x1 2,
x2 3,
x3 7