0% found this document useful (0 votes)
9 views

Linear Equations and Matrices (Week 1-3)

The document provides an overview of systems of linear equations, including definitions, solution sets, and methods for solving them such as substitution and elimination. It explains the characteristics of linear equations in n variables, the types of solutions (unique, infinite, or none), and introduces matrices and their operations. Additionally, it discusses practical applications and examples to illustrate the concepts.

Uploaded by

Jake Malabanan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

Linear Equations and Matrices (Week 1-3)

The document provides an overview of systems of linear equations, including definitions, solution sets, and methods for solving them such as substitution and elimination. It explains the characteristics of linear equations in n variables, the types of solutions (unique, infinite, or none), and introduces matrices and their operations. Additionally, it discusses practical applications and examples to illustrate the concepts.

Uploaded by

Jake Malabanan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 130

System of Linear

Equation
Learning Objectives
1. Write, recognize and to be familiarized with the
system of m linear equations in n variables.
2. State and define the linear equation in n variables.
3. Find the solution set of a linear equation.
4. Identify the solution of a system of linear
equations whether it is consistent or inconsistent.
5. Solve the system of linear equation using
substitution, elimination, elimination by
substitution, back-substitution and Gauss
elimination method.
In Analytical Geometry, we studied the
two-dimensional space demoted as .

Example:
Similarly, the equation of a
plane in three-dimensional
space denoted by .
Definition of
Linear
Equation in
n Variables
In general, the definition of a linear equation in
n-variables is that:
A linear equation in n
variables x1, x2, x3, …, xn is in the form of:

a1x1 + a2x2 + a3x3 + … + anxn = b.

The coefficients a1, a2, a3, …, an are real


numbers, and the constant term b is a real
number also. The number a1 is the leading
coefficient, and x1 is the leading variable.
Solutions and Solution Sets

A solution of a linear equation in n


variables is a sequence of n real
numbers s1, s2, s3, …, sn arranged to
satisfy the equation when you
substitute the values x1 = s1, x2 = s2,
x3 = s3, …, xn = sn into the equation.
Example :
In an equation x1 + 2x2 = 4 will be
satisfied if x1 = 2 and x2 =1 and the other
solution would be x1 = -4 and x2 = 4, or x2 =
2 and x1 = -2 and x2 = 3.

Note: The set of all solutions of a linear equation is called its solution
set, and when you have found this set, you have solved the equation. To
describe the entire solution set of a linear equation, use a parametric
representation.
Example 2:
Example for Parametric Representation of a Solution Set

Solve the linear equation x1 + 2x2 = 4.


Solution:
To find the solution set of an equation involving two variables,
solve for one of the variables in terms of the other variables. Say,
solving for x1 in terms of x2, we got,

x1 = 4 – 2x2, (by means of transposition)


Example for Parametric Representation of a Solution Set

Solve the linear equation x1 + 2x2 = 4.


x1 = 4 – 2x2, (by means of transposition)

To represent the infinitely many solutions of


this equation, it is convenient to introduce a third
variable t called a parameter.
By letting x2 = t, we can represent the
solution set as
x1 = 4 – 2t, x2 = t, t is any real number.
Example for Parametric Representation of a Solution Set

Solve the linear equation x1 + 2x2 = 4.


Another way to represent the solution set of the linear
equation in the previous example is that we could choose x 1 as
to be the free variable and the x2 would be the not free variable.
Now the parametric representation for this would be

x2 = 2 – 1/2x1. If x1 = s then
x2 = 2 – 1/2s where s is any real
number.
Note: For convenience, choose the variables that occur last in
a given equation to be free variables.
Example 3:
System of Linear
Equation
1.1 System of Linear Equations
A system of m linear equations in n variables
is written in the following form:

a11x1 + a12x2 + … + a1nxn = b1 Remark:


a21x1 + a22x2 + … + a2nxn = b2 The double-
subscript notation
. . indicates aij is the
. . coefficient of xj in
the ith equation.
. .
am1x1 + am2x2 + … + amnxn = bm

As for system of linear equations, there can


be unique solution, many solutions, or no solution.
a11x1 + a12x2 + a13x3 = b1
a21x1 + a22x2 + a23x3 = b2
a31x1 + a32x2 + a33x3 = b2
A solution of a linear system is a
tuple (s1,s2, … , sn) of numbers that
makes each equation a true statement
when the values s1,s2, … , sn are
substituted for x1,x2, … , xn,
respectively. The set of all solutions of
a linear system is called the solution
set of the system.
Theorem 1.1.
Any system of linear equations has one of the
following exclusive conclusions.

(a) No solution.
(b) Unique solution.
(c) Infinitely many solutions

A linear system is said to be consistent if it has at


least one solution; and is said to be inconsistent if it has
no solution.

No solution Infinite Solution


Example 1: Unique
Solution

(eq. 1)
(eq. 2)
Example 2: Unique
Solution

(eq. 1)
(eq. 2)
(eq. 3)
Example 3: Infinite (Many)
Solution

(eq. 1)
(eq. 2)
Example 4: Infinite (Many)
Solution

(eq. 1)
(eq. 2)
Example 5: No
Solution

(eq. 1)
(eq. 2)
Example 6: No
Solution

(eq. 1)
(eq. 2)
(eq. 3)
Solving System of
Linear Equations
Using
Back-Substitution in
Row-Echelon Form
Another method in solving system of
linear equations is with the use of so called
“Back-substitution in Row-Echelon Form”. The
row-echelon form is as like as a “stair-step”
pattern with leading coefficients of 1.
Let us take a look two sets of system of
linear equation and try to analyse.

x – 2y + 3z = 9 x – 2y + 3z = 9
-x + 3y = -4 y + 3z = 5
2x – 5y + 5z = 17 z=2
Rewriting a system of linear equations in row-echelon
form usually involves a chain of equivalent systems, each of
which is obtained by using one of the three basic operations.
This process is called Gaussian elimination, after the
German mathematicians Carl Friedrich Gauss (1777-
1855).
What would be the operations that produce
equivalent system? Each of the following operations on a
system of linear equations produces an equivalent system.

1. Interchange two equations.


2. Multiply an equation by a nonzero constant.
3. Add a multiple of an equation to another equation.
x – 2y + 3z = 9
-x + 3y = -4
2x – 5y + 5z = 17
x – 2y + 3z = 9
y + 3z = 5
z=2
Application of System
Of Linear Equation
1. Read with understanding and correct analysis the problem. If
necessary to read it twice or thrice, please do so until you fully
understand the problem.

2. Usually, the constant served as the given in the problem and the
required quantities served as the unknown or the variables. Use
appropriate or meaningful variables for a particular worded
problems.
3. If necessary, draw the figures, diagrams or even tables so that
you could write the relevant information for the constant and
variables that could be translated into correct equation.
4. From 3, write the equations based on what is stated in the problem.
5. On this stage, solve the system of linear equations.
6. Last, you need to check the solved quantity or quantities if it will
match on the equations.
Example 1:

Twice a number minus a


second number equals 5. The
sum of the two numbers is 16.
Find the two numbers.
Example 2:

A homeowner sections off part of her


backyard for a vegetable garden. The
width of the garden is 4 ft shorter than
the length. The perimeter of the
garden is 52 ft. What are the
dimension of the garden?
Example 3:

A carpenter purchased 60 ft of
redwood and 80 ft of pine for a total
cost of Php 286. A second purchase,
at the same prices, included 100 ft of
redwood and 60 ft of pine for a total
cost of Php 396. Find the cost per
foot of redwood and of pine.
The given information may be tabulated as follows:

Type Type Type C Time Available (min)


A B
Machine 1 2 1 1 180
Machine 2 1 3 2 300
Machine 3 2 1 2 240
Matrices and
Its Operation
Learning Objectives

1. Define matrix.
2. Determine the size of a matrix.
3. Determine the different kinds
of a matrix.
4. Perform matrix operation.
A matrix is a rectangular array of numbers in the form
column 1 column 2 column n
a11 a12 … a1n Row 1

a21 a22 … a2n Row 2


A = . . … .
. . . .
. . . .
am1 am2 … amn . Row m

So, by the presentation above, we could say that if m and n


are positive integers, an m x n (read as m by n) matrix is a
rectangular array in which each entry aij, of the matrix is a number.
An m x n matrix has m rows and n columns. Matrices are usually
denoted by capital letters such as A, B, C, etc.
The entry aij is located in the ith row
and the jth column. The index i is called
the row subscript because it identifies
the row in which the entry lies, and the
index j is called the column subscript
because it identifies the column in which
the entry lies.

A matrix with m rows and n columns is


said to be size m x n.
Illustration:
a)
This is a 1 x 2 matrix since there is one row and two columns.
The a11 = 2 and the a12 = 4. This is known as a row matrix.

b)
This is a 3 x 1 matrix since there are 3-row and 1-column. The a 11 = 2, a21 = -4 and
the a31 = 3. This is known as a column matrix.

c) This is a 3 x 2 matrix. Why? What is a22 = ? How about a31 = ?

d) This is also a matrix. What is its size? What is a11?


The a22 is what? How about a32?
A row matrix can be expressed as 1xn matrix.

[ 𝐚 𝟏𝟏 𝐚 𝟏𝟐 𝐚 𝟏𝟑 … . 𝐚 𝟏 𝐧 ]

A column matrix can be expressed as mx1 matrix.


Kinds of Matrix
Square matrix
- an array of numbers having the
same number of columns and rows, i.e.
m = n. The numbers a11 , a22 , … , and
ann form the main diagonal. Its size can
be expressed as n x n matrix.
Illustration:

The size of this matrix is


3 x 3 hence this is a square
matrix since the number of row is
equal to the number of column.

This is also a square matrix


since the number of row is the same
as the number of column where this
matrix has a size of 2 x 2.
Diagonal matrix
– a square matrix for which every term
off the main diagonal is zero.

( ) ( )
𝟑 𝟎 𝟒 𝟎 𝟎
𝟎 𝟐 𝟎
𝟎 𝟓
𝟎 𝟎 −𝟑
Scalar matrix
– a diagonal matrix for which all terms
on the main diagonal are equal.

( ) ( )
𝟑 𝟎 𝟐 𝟎 𝟎
𝟎 𝟑 𝟎 𝟐 𝟎
𝟎 𝟎 𝟐
Equal matrix

- matrices having the corresponding


elements equal as well as its size otherwise
they are not equal. In other words, they have
the same number of rows and columns A (m ×
n) = B (m × n) and if the elements of the first
matrix are equal to the corresponding elements
in the second matrix a i j = b .
Illustration:
Let A = and B = .
Here, we could say that matrix A is equal to
matrix B.

Two matrices are equal, say

if x = 3, y = 0 and z = 3
Zero matrix
– any m x n matrix that all elements are
entirely having zero entries.

( ) ( )
𝟎 𝟎 𝟎 𝟎 𝟎
𝟎 𝟎 𝟎 𝟎 𝟎
𝟎 𝟎 𝟎
Identity matrix
– square matrix whose elements in the
main diagonal are all one and for which
every term off the main diagonal is
zero.

( ) ( )
𝟏 𝟎 𝟏 𝟎 𝟎
𝟎 𝟏 𝟎 𝟏 𝟎
𝟎 𝟎 𝟏
Coefficient matrix
-matrix containing only the coefficient of the system.

Illustration:
Let the system of linear equations would be:

2x – 3y + z = 5 (1)
-4x + 2y – 2z = 6 (2)
4x – 3y + 3z = -2 (3)

( )
Then the coefficient matrix is; 𝟐 −𝟑 𝟏
−𝟒 𝟐 −𝟐
𝟒 −𝟑 𝟑
Constant matrix
-a matrix in which all the entries are constants.
If all the entries are the same constant k,
multiplication by the matrix, when it can be done, is
equivalent to multiplication by the scalar k and by a
matrix of the same order in which all entries are 1.

Illustration:

=2
Leading matrix
-matrix where constant is adjoining to the coefficient matrix.

Illustration:

( )
𝟐 − 𝟑 𝟏
𝟎 𝟐 𝟎
𝟒 𝟎 𝟑

The leading entry for row 1 is 2.


The leading entry for row 2 is 2.
The leading entry for row 3 is 4
Coefficient matrix
-matrix containing only the coefficient of the system.

Illustration:
Let the system of linear equations would be:

2x – 3y + z = 5 (1)
-4x + 2y – 2z = 6 (2)
4x – 3y + 3z = -2 (3)

( )
Then the coefficient matrix is; 𝟐 −𝟑 𝟏
−𝟒 𝟐 −𝟐
𝟒 −𝟑 𝟑
Matrix
Operations
Matrix Addition and Subtraction

- Two or more matrices can added


and subtracted provided that those
matrices have the same number of rows
and the same number of columns, i.e. only
matrices of the same size.
Illustration:

Let A, B, C and D are matrices; say


A=B= C= and
D=
Find the following if possible.
1. A + C 2. B + D 3. D – B 4. C – A
5. A + B 6. C – B
Matrix Multiplication

- The product of two matrices is


possible if and only if the number of
columns of the first matrix is exactly the
same as the number of rows of the
second. Say A is an m x p matrix while B
is a p x n matrix, hence the size of the
product of AB is an m x n matrix.
Illustration:

Let A, B, C and D are matrices; say


A= B= C= and D =
Find the following if possible.
1. AB 2. BD 3. AD 4. CA
Scalar Multiplication

- If r is any real number and A is an m x n


matrix, then the scalar multiple of A by r is rA. Hence, rA
is obtained by multiplying each element of A by r.

Illustration:

Let scalar c = 3 and a


matrix A be
What is cA?
Transpose of a matrix

- If A is an m x n matrix, then the transpose of A


is determined by interchanging rows and columns of A.
In symbol, the transpose of A is written as AT.

Illustration:

Let matrix A be . Find AT.


Algebraic
Properties of
Matrix
Operation
Properties of Matrix
Addition and Scalar
Multiplication
Property 1. Commutative Property of Addition
Let A and B are two matrices where A and B has the same size,
then A + B = B + A

Illustration:
Let A = and B =
A+B = B +A

+ = +
=
Property 2. Associative Property of Addition
Let A, B and C are matrices with the same size, then (A + B) + C
= A + (B + C)

Illustration:
Let A = , B = and C =
A + (B + C) = (A + B) + C
= +
+ = +
=
Property 3. Associative Property of Scalar Multiplication
Let A be a matrix and c and d are scalars then (cd)A = c(dA).

Illustration:
Let matrix A be and scalar a and b be 2 and 3 respectively.
(ab)A = a(bA)
(23) = 2  3
6 = 2 =
Property 4. Multiplicative Identity
Let A be a matrix and 1 be an Identity Matrix, then 1A = A.
Illustration:
Let matrix A be a square matrix and I be the identity
matrix.
Say A = and I = .
IA = A
=
=
=
Property 5. Distributive Property
Let A and B are two matrices with the same size and c is a scalar,
then c(A + B) = cA + cB.
Illustration:

Let matrix A and B be and respectively and scalar c = 2.


c(A + B) = cA + cB
2=2+2
2=+
=
Property 5.1. Distributive Property
Let A be a matrix and c and d are scalars, then (c + d)A = cA + dA.

Illustration:
Let c and d be two scalars whose value is 3 and 2 respectively and a
matrix A = . Show that (c + d)A = cA + dA.

(c + d)A = cA + dA

(3 + 2) = 3 + 2
5 = +
Properties of Zero
Matrix
Property 1
Let A be an m x n matrix and O be an m x n zero matrix, then A + 0mn = A.
Note that any given matrix added to zero matrix, they must be on the same size.

Illustration:

Let A = and O = , so

A+O= + = =A
Property 2
Let A be an m x n matrix ,then A + (-A) = 0mn.
Illustration:

Let A = and –A = -1 =

A + (-A) = +

= =O
Property 3
Let A be an m x n matrix and c is a scalar. If cA = 0mn, then
c = 0 or A = 0mn

Illustration:

Let c = 0 and A = .

Using scalar multiplication, we can see that;

0 =
Properties of Matrix
Multiplication
Property 1. Associative Property of Multiplication
Let A, B and C are matrices (with sizes such that the given matrix products are defined),
then A(BC) = (AB)C.

Illustration:
Let A be a 3 x 2 matrix, B is 2 x 3 and C is 3 x3

A = ; B = and C = .

We need to show that A(BC) = (AB)C.


A(BC) = (AB)C
=

=
=

=
Property 2. Distributive Property
Let A, B and C are matrices (with sizes such that the given matrix products are defined),
then A(B + C) = AB + AC and (A + B)C = AC + BC.

Illustration:
Let A = , B = and C = ,

show that A(B + C) = AB + AC.


Solution:
= +

= +

Similarly, we need to show that (A + B)C = AC + BC.


= +

= +

=
Property 3
Let A and B are matrices (with sizes such that the given matrix products are defined) and c is
scalar then c(AB) = (cA)(B) = A(cB).

Illustration:
Let A = and B = where scalar c = 2.
We need to show that c(AB) = (cA)(B) = A(cB).

c(AB) = (cA)(B) = A(cB)


2= =

2= =

= =
Properties of
Transpose
Property 1. Transpose of a Matrix

Let A be an m x n matrix, then (AT)T = A.

Illustration:
Let a matrix A be .
AT = .

(AT)T = = A.
Property 1. Transpose of a Sum
Let A and B are two matrices with the same size, then (A + B) T = AT + BT.

Illustration:
Let matrix A and B be and . We need to show that (A + B)T = AT + BT.

On the left side of an equation, you need to determine the sum of A and B, thus

+ =.
Taking the transpose of this,
(A + B)T =
Performing the right side of an equation, taking the transpose of A and B. And following
the property of a transpose of a matrix, we get
AT = and BT = .
Adding this two, we get
+=.
Property 3. Transpose of a Scalar Multiple

Let A be an m x n matrix and c is scalar, then (cA) T = c(AT).

Illustration:

Given matrix A = and scalar c = 5.


Based on the given property above, we need to show that
(cA)T = c(AT).

=5

=
Property 4. Transpose of a Product
Let A and B are matrices (with sizes such that the given matrix operations
are defined), then (AB)T = BTAT.

Illustration:
Let A = and B = .
We need to show that (AB)T = BTAT.
(AB)T = = = .
Then working onthe right member of an equation for BTAT, we
have;
BT = and AT = .
Now, the product of these two transpose of a matrix is
=.
=
Reduced Row
Echelon Form
Definition:
In order to say that an m x n matrix is in what we
called an echelon form, the following properties must be
satisfied:

1. All nonzero rows should above of any rows of all zeros.


2. In any nonzero row, the first non-zero entry is one (1).
This is known as the leading one (1).
3. The other element or entries in a column below leading
entry are zeros.
4. The leading entry in each row should be 1 and each
leading 1 is the only nonzero entry in its column.
 A reduced row echelon form of a matrix is another important
lesson in Linear Algebra. This topic is also known as Row
Reduction and Echelon Forms. The word echelon is also known
as the row canonical form which is looks like as a stair-case form
of a matrix.
 Gaussian elimination is the main use of the row echelon form.
Systems of linear equations can be solved in linear algebra by
using the Gaussian elimination technique on coefficient
matrices. The values of the variables given the coefficients are
clear when matrices are transformed into row echelon form.
 Reduced row echelon form or sometimes called as the Gaussian
elimination is the main use of the row echelon form as what stated
in the previous slide to be able to solve the systems of linear
equations. However, this method is not just for solving the system
of linear equation but it can be used also for the computation of
determinants, the inversion of matrices, cryptography, in statistics
and many others.
Introduction to Linear Algebra for Computing Sciences by Mr. Joel Bacay, MAEd
Transforming given matrix into its equivalent echelon form
needs patient since the student will be experiencing a lengthy
mathematical computation using four basic fundamental operations
in mathematics. In able to do this, the allowable operation which are
called the elementary row operations are as follows:

1. Interchanging the two rows.


2. Dividing the row by a nonzero number.
3. Subtract or add row by another row.
4. Multiply row by a number to make a leading entry into 1.
Illustration:
Transform the given matrix, say A = .

Solution:

( )
1/2R1  R1 1 -4R2 + 4
R1 R1 2
0 1 1
6R2 + R3 R3
0 − 6 −9

( ) )
1 0 − 2

(
1 4 2
-2R1 + R2 R2 0 -1/3R3 1
 R3 1
2 5
-4R1 + R3 R3
1
0 0 − 3

( ) )
4 10 −1 1 R1 R1
2R3 + 0 − 2

(
1 4 20 -1R3 + 1R2 R2 1
0 1/3R
− 2  R
3 −0 3
2
0 1
0 − 6 −𝟏 9
( )
𝟎 𝟎
𝟎 𝟏 𝟎
𝟎 𝟎 𝟏
Transform the given matrix, say A = . Row 1
Row 2
Row 3
Row 4
Gauss-Jordan
Reduction
Special method that involves systematically
eliminating variables from equations.
Procedures in solving linear system by Gauss-Jordan
Reduction
1. Write the linear system in augmented matrix.
2. Obtain the reduced row echelon form of the
augmented matrix by applying the elementary
row operations.
3. The reduced row echelon form of the augmented
matrix gives the solution to the linear
system.
A matrix is considered in reduced row echelon form if it
satisfies the following properties:

P1: All rows consisting entirely of zeros are grouped at


the bottom of the matrix.
P2: The first nonzero element of each other row is 1 and
called this as leading entry of its row.
P3: The leading entry (1) of each row after the first is
positioned to the right of the leading entry (1) of
the previous row.
P4: Elements in a column that contains a leading entry
(1) are all zeros.
Example 1:

Find all solutions of the linear


system by Gauss-Jordan Reduction.

2x – y = -1
2x + y = -7

The linear system has solution, x = -2 and y = -3.


Example 2:

Use Gauss-Jordan Reduction


to solve the linear system
x + 2y + z = 7
x + 2y + 2z = 11
2x + 3y + 2z = 10.

The unique solution of the linear system is x = -5, y = 4 and z = 4.


Example 3:

Use Gauss-Jordan Reduction


to solve the linear system
3x - y + z = 8
x + 2y - z = 4
2x + 3y - 4z = 10

The unique solution of the linear system is x = 3, y = 0 and z = -1.


Example 4:

Use Gauss-Jordan Reduction to


solve all solutions of the linear system
x + y + 2z + 3w = 13
x – 2y + z + w = 8
3x + y + z – w = 1.

Answer:
x – w = -14, y = -1 and z + 2w = 8
Example 5:

Find all solutions of the linear


system by Gauss-Jordan Reduction.

2x – 3y = 1
-4x + 6y = 8

The linear system has solution no solution.


Homogenous
Systems
Homogenous System (HS) is a system of linear
equations where all the constant terms are zeros.

Conditions that are extended to any homogenous system


of equations.

1. If the solution x1 = x2 = ... = xn = 0, then the HS may


have trivial solution.
2. If the solution x1 , x2 , ... , xn in which not all zero or
in which at least one variable has a nonzero value,
then the HS may have nontrivial solution.
Properties of Homogeneous System

• It always has at least one solution that is called a trivial


solution where the value of each variable is 0.
• If a and b are two solutions of a homogeneous system, then
their sum a + b is also a solution.
• If a is a solution, then ka is also a solution, where k is a
scalar.
• A zero vector is always a solution of the homogeneous
system.
Example 1:

Find all solutions to the


homogenous system.

x + 2y + 3z = 0
-x + 3y + 2z = 0
2x + y – 2z = 0

x=y=z=0
The HS has trivial solution
Example 2:

Solve all solutions to the homogenous


system.
x + 2y + 3z = 0
x+ y+ z =0
5x + 7y + 9z = 0

x–z=0
y + 2z = 0
The HS has nontrivial solution.
The Inverse of
a Matrix
The inverse of a square n × n matrix A, is another
n × n matrix denoted by A−1 such that AA−1 = A−1A =
I where I is the n × n identity matrix. That is,
multiplying a matrix by its inverse produces an
identity matrix. Note that not all square matrices
have an inverse matrix.

If the determinant of the matrix is zero, then it


will not have an inverse, and the matrix is said to be
singular. Only non-singular matrices have
inverses.
1. Finding the inverse of a 2 x 2 matrix
Theorem: For any 2 x 2 matrix,

is invertible if and only if det(A) = ad – bc  0.


When ad – bc  0, the inverse is

𝐴
−1
=
1 𝑑
𝑎𝑑 − 𝑏𝑐 − 𝑐 ( −𝑏
𝑎 )
Note: The ad – bc is the determinants of the matrix A and is the adjugate adj A of the
matrix A. Lesson about determinants will be discussed on our next module.
Illustration:

Find the inverse of a matrix:

A=
B=
2. Finding the inverse of a 2 x 2 matrix
can be done using this matrix equation:

−1
𝐴 𝐴 =𝐼
Where:

A is the given matrix

A-1 is the inverse of a given matrix

I is the identity matrix


Illustration:

Find the inverse of a matrix:

A=
B=
3. Gauss Jordan Reduction for finding the
inverse of a matrix.
Let A be a n x n matrix.

a) Adjoin the identity n x n matrix In to A to form the matrix [A : In ].


b) Compute the reduced row echelon form of [A : In ].

Notes:
 If the reduced row echelon form is not of the type
[In : A-1 ], then A-1 is the inverse of A.
 If the reduced row echelon form is not of the type
[In : A-1 ] and the first n x n sub-matrix is not In , then A has no inverse.

We could also use this method if the size of a matrix is more than 2 x 2
Illustration:

Find the inverse of a matrix:

A=
B=
Properties of
Matrix Inverse
Let A and B be invertible matrices and
r be a nonzero scalar. Then

1. (A-1)-1 = A
2. (rA)-1 = (1/r)A-1 ; where r  0
3. (AB)-1 = B-1A-1
4. AA-1 = A-1A = In
5. (AT)-1 = (A-1)T
6. (In)-1 =In
Illustration:

Let ;
B and
I
Application of
Matrix
Operations
PROBLEM 1.
The A-Plus auto parts store chain has two outlets, one in
Vancouver and one in Quebec. Among other things, it sells wiper blades,
windshield cleaning fluid, and floor mats. Use matrix arithmetic to calculate the
changes in sales of each product in each store from January to February. The
monthly sales of these items at the two stores for two months are given in the
following tables:
PROBLEM 2.
The revenue generated by sales in the Vancouver and Quebec
branches of the A-Plus auto parts store was as follows:

If the Canadian dollar was worth $0.65 U.S. at the time, compute the
revenue in U.S. dollars.
PROBLEM 3.
The A-Plus auto parts store mentioned in examples in the previous
section had the following sales in its Vancouver store:
PROBLEM 4.
January sales at the A-Plus auto parts stores in Vancouver and Quebec are
given in the following table.

The usual selling prices for these items are $7.00 each for wiper
blades, $3.00 per bottle for cleaning fluid, and $12.00 each for floor
mats. The discount prices for A-Plus Club members are $6.00 each for
wiper blades, $2.00 per bottle for cleaning fluid, and $10.00 each for
floor mats. Use matrix multiplication to compute the total revenue at
each store, assuming first that all items were sold at the usual prices,
and then that they were all sold at the discount prices.
CRYPTOGRAPHY
Cryptography is a method of protecting information
and communications through the use of codes, so that only
those for whom the information is intended can read and
process it.

In computer science, cryptography refers to secure


information and communication techniques derived from
mathematical concepts and a set of rule-based calculations
called algorithms, to transform messages in ways that are
hard to decipher. These deterministic algorithms are used for
cryptographic key generation, digital signing, verification to
protect data privacy, web browsing on the internet and
confidential communications such as credit card transactions
and email.
SOURCE: https://www.techtarget.com/searchsecurity/definition/cryptography
How to code the plaintext into a secret code and decrypt the
encrypted messages using matrix and the inverse matrix?

1. First, let us assign number on the respective letters of an English


alphabet.

Note that the number 27 is for the space if the message is composed of more
that one word.
2. We will assign respective number for the letter of a word or words
which correspond on the given table below.
Example for the word “LOVE”, L is 12, O is 15, V is 22 and E is 5.

Then, we will divide the letter of a word into group of letters you
desired. Say, you will be divided the word LOVE into two groups with
two letters for each group. LO and VE and this will make us a 2 x1
size of matrix.
Example: Let A = . This would be our key to
encrypt the word and the matrix of divided word
would be; = and
( )( ) (
3
1
5
2
12
15
=
)( )
( 3 ) ( 12 )+(5)(15)
( 1 ) (12 )+(2)(15)
=
111
42

( 1 2 )( 5 ) (( 1 ) ( 22 ) +(2)(5)) ( 32 )
3 5 22
=
( 3 ) ( 22 ) +(5)(5)
=
91

So, the desired encrypted message would be:

( 1 11
42 (
) 91
32 )
To decrypt the secret message, we will be using
the same process but this time, the inverse matrix
would be our key matrix.

The inverse matrix of is A-1 =

Multiplying the inverse matrix that is A -1 = into our


coded message such as and ,
= =

= =

You might also like