Matrices

and System of
Linear Equations
 DHRUV MISTRY 160280106055
 DHRUVIL CHAVDA 160280106015
 SAVAN BARIA 160280106005
 DHARMIK DAVE 160280106022
 YASH JANI 160280106037
 ATRI BHATT 160280106007
 CHIRAG 160280106051
 VEDANT 160280106047
 YASH JAIN 160280106034
 AKHIL 160280106059
 SANDEEP 160280106046
 INTRODUCTION

• Definition
A matrix is a rectangular array of elements or
entries aij involving m rows and n columns
Columns, n

 a11 a12 a13  a1 j  Rows, m

a a22 a23  a2 j 
 21
A   a31 a32 a33   
a3 j   aij mn
 
    
 ai1 ai 2 ai 3  aij 

 INTRODUCTION

• Definition
i. 2 matrices A  aij  M mn and B  bij  M mn
are said to be equal iff m = r and n = s then A
= B.
ii. If aij for i = j, then the entries a11,a22,a33,…
are called the diagonal of matrix A
 TYPES OF MATRICES

Square Matrix
Matrix with order n x n
1 2 3
1 2
A  B  4 5 6
3 4  mn 7 8 9 33
 TYPES OF MATRICES

Diagonal Matrix
Matrix with order n x n with aij ≠ 0 and aij = 0
for i ≠ j
1 0 0
A  0 1 0
0 0 2
 TYPES OF MATRICES

Scalar Matrix
A diagonal matrix in which the diagonal
elements are equal, aii = k and aij = 0 for i ≠ j
where k is a scalar
2 0 0 1 0 0
   
A   0 2 0   2 0 1 0  , k  2
0 0 2 0 0 1
 TYPES OF MATRICES

Identity Matrix
A diagonal matrix in which the diagonal
elements are ‘1’, aii = 1 and aij ≠ 0 for i ≠ j

1 0 0 
  1 0
A  0 1 0  B 
0 0 1  0 1 
 TYPES OF MATRICES

Zero Matrix
A matrix which contains only zero elements,
aij = 0

0 0 0 
  0 0 
A  0 0 0  B 
0 0 0 0 0 
 TYPES OF MATRICES

Negative Matrix
A negative matrix of A =[aij] denoted by –A
where -A =[-aij]

1 0 2   1 0  2
  
A   0 0  3   A   0 0 3 
 4 6 1   4  6  1
 TYPES OF MATRICES

Upper Triangular Matrix

If every elements below the diagonal is zero or
aij = 0, i > j
1 2 2
A  0 1 3
0 0 1 
DIAGONAL
 TYPES OF MATRICES

Lower Triangular Matrix

If every elements above the diagonal is zero or
aij = 0, i < j
 1 0 0
 
A    2 1 0
 3 4 1
DIAGONAL
 TYPES OF MATRICES

Transpose of Matrix
If A =[aij] is an m x n matrix, then the
transpose of A, AT =[aij]T is the n x m matrix
defined by [aij] = [aji]T
 1 1 2 1  2 3 
 
A   2 1 5  
A  1 1 4 
T 
 3 4 1 2 5 1
 TYPES OF MATRICES

Properties Transposition Operation

• Let A and B matrices and k, k  R. Then,
i) A 
T T
A
ii) kA  kA
T T

iii)  A  B T  AT  BT
 TYPES OF MATRICES

Example 1: 1
1 2 3   
• If A    and B   3 , find
4  5 2  2 
i)  A
T

ii)  2 B 
T

iii)  AB
T
 TYPES OF MATRICES

Answer 1:
1 4 
 A  2  5
T
i)
3 2 
ii)  2 B    2 6
T
 4
iii)  AB  1 23
T
 TYPES OF MATRICES

Symmetric Matrix
If AT = A, where the elements obey the rule
aij = aji
5 1 4 5 1 4
A  1 2  2  AT  1 2  2
4  2 3  4  2 3 
 TYPES OF MATRICES

Skew Symmetric Matrix

If AT = - A, where the elements obey the rule
aij = - aji, so that the diagonal must contain
zeroes.
0 1  4

A   1 0 7
 4  7 0 
 TYPES OF MATRICES

Skew Symmetric Matrix

0 1  4

A   1 0 7
 4  7 0 
0 1 4  0 1  4
A  1
T   
0  7     1 0 
7   A
 4 7 0   4  7 0 
 TYPES OF MATRICES

Row Echelon Form (REF)

Matrix A is said to be in REF if it satisfies the
following properties:
• Rows consisting entirely zeroes occur at the bottom of the
matrix.
• For each row that doesn’t consist entirely of zeroes, the 1st
nonzero is 1.
• For each non zero row, number 1 appear to the right of the
leading 1 of the previous row.
 TYPES OF MATRICES
LEADING 1

1 1  4 

A  0 1 7  
0 0 0  ZERO ROW AT THE BOTTOM

1 2 4 
B  0 1 3 LEADING 1

0 0 1 
 TYPES OF MATRICES

Reduced Row Echelon Form (RREF)

Matrix A is said to be in REF if it satisfies the
following properties:
• Rows consisting entirely zeroes occur at the bottom of the
matrix.
• For each row that doesn’t consist entirely of zeroes, the 1st
nonzero is 1.
• For each non zero row, number 1 appear to the right of the
leading 1 of the previous row.
• If a column contains a leading 1, then all other entries in
the column are zero
TYPES OF MATRICES
LEADING 1

1 0  4 

A  0 1 7  
0 0 0  ZERO ROW AT THE BOTTOM

1 0 0 
B  0 1 0 LEADING 1

0 0 1
 Types of Solutions
Consistent System Consistent System Inconsistent System
One solution Infinite solutions No solution
A linear equation is an equation that can be written in the form:

a1x1  a2x2    anxn  b

The coefficients ai and the constant b can be real or complex numbers.

A Linear System is a collection of one or more linear equations in the

same variables. Here are a few examples of linear systems:

xyz 1 x1  2x2  x 4  1 3x  4y  7z  7
2x  3y  z  2 x2  2x3  x 4  x5  2 x  2y  z  1
x  2y  2z  4 x2  4x3  x5  4

 
Any system of linear equations can be put into matrix form: Ax  b

The matrix A contains the coefficients of the variables, and the vector x has
the variables as its components.
For example, for the first system above the matrix version would be:

1 1 1  x  1
     
 2 3  1   y   2
1 2  2  z  4
      
A x b
Here is the next system. The basic pattern is to start at the upper left corner, then use row
operations to get zeroes below, then work counterclockwise until the matrix is in REF.

xyz 1  1 1 1 1 1 1 1 1
    
2x  3y  z  2   2 3  1 2 R *
2  R 2  2R1  0 1  3 0
x  2y  2z  4 1 2  2 4 R *
  3  R 3  R1
0 1  3 3
 

1 1 1 1 1 1 1 1
   
0 1  3 0  0 1  3 0
0 1  3 3 R * 0 0 0 3
  3  R3  R2  

At this point you might notice a problem. That last row doesn’t make sense. It might help to
write out the equation that the last row represents.
It says 0x+0y+0z=3.
Are there any values of x, y and z that make this equation work? (the answer is NO!)
This system is called INCONSISTENT because we arrive at a contradiction during the
solution procedure. This means that the system has no solution.

Prepared by Vince Zaccone

For Campus Learning Assistance
Services at UCSB
1 1 1 1 This is the reduced matrix (actually we could go one step further and get a
 
0 1  3 0  zero up in row 1). Notice that we got a row of zeroes in the left part of the
0 0 0 3 augmented matrix. When this happens the system will either be inconsistent,
  like this one, or we will have a free variable (infinite # of solutions).

No Solution
xyz 1
If the system is inconsistent there will be no solutions. 2x  3y  z  2
In this case there will be a contradiction that appears x  2y  2z  4
during the solution process.

This line is the

intersection of a pair of
the planes

This line is the intersection

of a different pair of the
planes
Prepared by Vince Zaccone
For Campus Learning Assistance
Services at UCSB
Consistent or Inconsistent System?
1 0 0 1 𝑥=1
0 1 0 5 𝑦=5
0 0 1 2 𝑧=2

1 0 0 4 𝑥=4
0 1 0 7 𝑦=7 𝑁𝑜 𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛: 𝐼𝑛𝑐𝑜𝑛𝑠𝑖𝑠𝑡𝑒𝑛𝑡 𝑠𝑦𝑠𝑡𝑒𝑚
0 0 0 2 0=2

1 0 5 2 𝑥 + 5𝑧 = 2
𝐼𝑛𝑓𝑖𝑛𝑖𝑡𝑒 𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛𝑠: 𝐶𝑜𝑛𝑠𝑖𝑠𝑡𝑒𝑛𝑡 𝑠𝑦𝑠𝑡𝑒𝑚
0 1 3 2 𝑦 + 3𝑧 = 2
0 0 0 0 𝑧 = 𝑎𝑛𝑦 𝑟𝑒𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟

(𝑥 = 2 − 5𝑧, 𝑦 = 2 − 3𝑧, 𝑧 = 𝑎𝑛𝑦 𝑟𝑒𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟)

𝑜𝑟
{(𝑥, 𝑦, 𝑧)|𝑥 = 2 − 5𝑧, 𝑦 = 2 − 3𝑧, 𝑧 = 𝑎𝑛𝑦 𝑟𝑒𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟}
 Inverse Matrix Method
Given a set of linear equations
x + 2y = 4
3x − 5y = 1
It can be written in matrix form as…

( )( ) ( )
1 2
3 −5
x
y
= 4
1
AX = B
This is the matrix form of the linear equations
Given that…
AX = B
A-1AX = A-1B
(A−1A = I, the identity matrix and multiplying any matrix
by I leaves the matrix unchanged)

X = A−1B
Thank
You