Matrix

Algebra

Prepared by:
Celine
Sarmiento

Introduction
Matrix Algebra
History

Linear
Systems Prepared by: Celine Sarmiento
Matrices

Matrix De La Salle University - Dasmarinas

Operations College of Science
Systems of MATHEMATICS DEPARTMENT
Linear City of Dasmarinas, Cavite
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
1 / 60
 Table of contents

Matrix
Algebra
1 Introduction
Prepared by:
Celine
Sarmiento 2 History
Introduction 3 Linear Systems
History

Linear 4 Matrices
Systems

Matrices 5 Matrix Operations

Matrix
Operations 6 Systems of Linear Equations
Systems of
Linear
Equations
7 Determinants and Cramer’s Rule
Determinants
and Cramer’s 8 Matrix Inversion
Rule

Matrix 9 References
Inversion

References
2 / 60
 Linear Algebra

Matrix
Algebra

Prepared by:
Celine
Sarmiento

Introduction Linear algebra is the branch of mathematics concerning finite

History
or countably infinite dimensional vector spaces, as well as linear
Linear
Systems mappings between such spaces. Such an investigation is
Matrices initially motivated by a system of linear equations in several
Matrix unknowns. Such equations are naturally represented using the
Operations
formalism of matrices and vectors.
Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
3 / 60
 Linear Algebra

Matrix
Algebra

Prepared by:
Celine Linear algebra is central to both pure and applied mathematics.
Sarmiento
For instance abstract algebra arises by relaxing the axioms
Introduction leading to a number of generalizations. Functional analysis
History studies the infinite-dimensional version of the theory of vector
Linear
Systems
spaces. Combined with calculus linear algebra facilitates the
Matrices solution of linear systems of differential equations. Techniques
Matrix from linear algebra are also used in analytic geometry,
Operations
engineering, physics, natural sciences, computer science, and
Systems of
Linear the social sciences (particularly in economics). Because linear
Equations
algebra is such a well-developed theory, nonlinear mathematical
Determinants
and Cramer’s models are sometimes approximated by linear ones.
Rule

Matrix
Inversion

References
4 / 60
 History

Matrix
Algebra

Prepared by:
Celine
Sarmiento

Introduction
The study of linear algebra and matrices first emerged from the
History study of determinants, which were used to solve systems of
Linear linear equations. Determinants were used by Leibniz in 1693,
Systems
and subsequently, Cramer devised the Cramer’s Rule for solving
Matrices
linear systems in 1750. Later, Gauss further developed the
Matrix
Operations theory of solving linear systems by using Gaussian elimination,
Systems of which was initially listed as an advancement in geodesy.
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
5 / 60
 History

Matrix
Algebra

Prepared by:
Celine
Sarmiento The study of matrix algebra first emerged in England in the
mid 1800s. In 1848, Sylvester introduced the term matrix,
Introduction
which is Latin for ”womb”. While studying compositions linear
History

Linear
transformations, Arthur Cayley was led to define matrix
Systems multiplication and inverses. Crucially, Cayley used a single
Matrices letter to denote a matrix, thus thinking of matrices as an
Matrix
Operations
aggregate object. He also realized the connection between
Systems of matrices and determinants and wrote that ”There would be
Linear
Equations many things to say about this theory of matrices which should,
Determinants it seems to me, precede the theory of determinants”.
and Cramer’s
Rule

Matrix
Inversion

References
6 / 60
 History

Matrix
Algebra

Prepared by: The first modern and more precise definition of a vector space
Celine
Sarmiento was introduced by Peano in 1888; by 1900, a theory of linear
Introduction
transformations of finite-dimensional vector spaces had
History emerged. Linear algebra first took its modern form in the first
Linear half of the twentieth century, when many ideas and methods of
Systems
previous centuries were generalized as abstract algebra. The
Matrices
use of matrices in quantum mechanics, special relativity, and
Matrix
Operations statistics helped spread the subject of linear algebra beyond
Systems of pure mathematics. The development of computers led to
Linear
Equations increased research in efficient algorithms for Gaussian
Determinants elimination and matrix decompositions, and linear algebra
and Cramer’s
Rule became an essential tool for modeling and simulations.
Matrix
Inversion

References
7 / 60
 Linear Equation

Matrix
Algebra

Prepared by:
Celine An equation of the type ax = b, expressing the variable b in
Sarmiento
terms of the variable x and a constant a, is called a linear
Introduction equation. The word linear is used here because the graph of
History the given equation is a straight line. Similarly, the equation
Linear
Systems
a1 x1 + a2 x2 + · · · + an xn = b (1), expressing b in terms of the
Matrices variables x1 , x2 , · · · , xn and the known constants
Matrix a1 , a2 , · · · , an is called a linear equation.
Operations

Systems of
Linear A solution to a linear equation (1) is a sequence of n numbers
Equations
s1 , s2 , · · · , sn , which has the property that (1) is satisfied when
Determinants
and Cramer’s x1 = s1 , x2 = s2 , . . . , xn = sn are substituted in (1).
Rule

Matrix
Inversion

References
8 / 60
 Linear System

Matrix
Algebra

Prepared by:
A system of m linear equations in n unknowns x1 , x2 , · · · , xn ,
Celine
Sarmiento
or simply a linear system, is a set of m linear equations in n
unknowns. A linear system can be conveniently denoted by
Introduction

History a11 x1 + a12 x2 + ··· + a1n xn = b1

Linear
Systems
a21 x1 + a22 x2 + ··· + a2n xn = b2
.. .. .. ..
Matrices . + + . + = (2) . .
Matrix
Operations
am1 x1 + am2 x2 + · · · + amn xn = bm
Systems of
Linear A solution to a linear system (2) is a sequence of n numbers
Equations

Determinants
s1 , s2 , · · · , sn , which has the property that each equation in (2)
and Cramer’s is satisfied when x1 = s1 , x2 = s2 , . . . , xn = sn are substituted
Rule

Matrix
in (2).
Inversion

References
9 / 60
 Linear System

Matrix
Algebra
A linear system may have one solution (a unique solution), no
Prepared by:
Celine solution, or infinitely many solutions. For a linear system of two
Sarmiento
equations in two unknowns, we have the following graph.
Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
10 / 60
 Linear System

Matrix
Algebra
Similarly, for a system with 3 equations in 3 unknowns we have
Prepared by:
the following diagram.
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
11 / 60
 Matrices

Matrix
Algebra

Prepared by:
Celine We might think of looking for a way of writing a linear system
Sarmiento
without having to carry along the unknowns. We will define an
Introduction object, a matrix, that enables us to write a linear system in a
History compact form that makes it easier to automate the elimination
Linear
Systems
method on a computer in order to obtain a fast and efficient
Matrices procedure for finding solutions. The use of matrix is not,
Matrix however, merely that of a convenient notation. We not develop
Operations
operations on matrices (plural of matrix) and will work with
Systems of
Linear matrices according to the rules they obey; this will enable us to
Equations
solve systems of linear equations and solve other computational
Determinants
and Cramer’s problems in a fast and efficient manner.
Rule

Matrix
Inversion

References
12 / 60
 Matrices

Matrix
Algebra Definition: Matrix
Prepared by:
Celine An m × n matrix A is a rectangular array of mn real (or
Sarmiento
complex) numbers arranged in m horizontal rows and n vertical
Introduction columns:
History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations We shall say that A is m by n (written as m × n). If m = n,
Determinants we say that A is a square matrix of order n, and the numbers
and Cramer’s
Rule a11 , a22 , · · · , ann form the main diagonal of A. We refer to the
Matrix
Inversion
number aij , which is the ith row and the jth column of A, as
References
the ijth element or entry of A.
13 / 60
 Matrices

Matrix
Algebra It is standard mathematical convention to represent matrices in
Prepared by: any one of the following three ways.
Celine
Sarmiento
Notations and forms of matrices
Introduction 1 A matrix can be denoted by an upper-case letter such as
History
A, B, C, . . . .
Linear
Systems 2 A matrix can be denoted by a representative element in
Matrices brackets, such as [aij ], [bij ], [cij ], . . . .
Matrix
Operations 3 A matrix can be denoted by a rectangular array of numbers
Systems of  
Linear
Equations
a11 a12 · · · a1n
 a21 a22 · · · a2n 
Determinants  
and Cramer’s  .. .. .. 
Rule  . . . 
Matrix
Inversion
am1 am2 · · · amn
References
14 / 60
 Exercises (Matrices)

Matrix
Algebra Given:
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion Determine the value of a11 , b21 , b12 , e32 , g23 , h13 , and f22 .
References
15 / 60
 Matrices

Matrix
Algebra

Prepared by:
Celine Definition: Diagonal matrix
Sarmiento
A square matrix A = [aij ] for which every term off the main
Introduction
diagonal is zero that is, aij = 0 for i 6= j, is called a diagonal
History
matrix.
Linear
Systems

Matrices
Examples:
Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
16 / 60
 Matrices

Matrix
Algebra Definition: Scalar matrix
Prepared by:
Celine
A diagonal matrix A = [aij ] for which all terms on the main
Sarmiento diagonal are equal that is, aij = c for i = j and aij = 0 for
Introduction i 6= j, is called a scalar matrix.
History

Linear
Example:
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations
Definition: Equal matrices
Determinants
and Cramer’s
Rule
Two m × n matrices A = [aij ] and B = [bij ] are said to be
Matrix
equal if aij = bij , 1 ≤ i ≤ m, 1 ≤ j ≤ n, that is, if the
Inversion corresponding elements are equal.
References
17 / 60
 Matrices

Matrix
Algebra

Prepared by:
Celine
Sarmiento Definition: Identity matrix
Introduction The n × n scalar matrix, denoted by In , all of whose diagonal
History entries are 1, is called the identity matrix of order n.
Linear
Systems Examples:
Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
18 / 60
 Augmented Matrix

Matrix
Algebra Consider the linear system of m equations in n unknowns,
Prepared by:
Celine
Sarmiento a11 x1 + a12 x2 + ··· + a1n xn = b1
a21 x1 + a22 x2 + ··· + a2n xn = b2
Introduction
.. .. .. ..
History . + .
+ + = . .
Linear
Systems
am1 x1 + am2 x2 + · · · + amn xn = bm
Matrices
The augmented matrix [A|b] of the system is
Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
19 / 60
 Exercises (Augmented Matrix)

Matrix
Algebra

Prepared by: Construct the augmented matrix of the following linear system.
Celine
Sarmiento (
Introduction
4x + 3y = 1
1
History 3x − 2y = 8
Linear

Systems 2x − 2y + z = 0

Matrices 2 x + 5y − 7z = 3
Matrix 
x − y − 3z = −7

Operations

Systems of 
Linear
Equations
x + 4y + z = 5

Determinants
3 2x + y − 4z = 0
and Cramer’s

3x − 3y + z = −1

Rule

Matrix
Inversion

References
20 / 60
 Basic Matrix Operations

Matrix
Algebra
Definition: Matrix addition
Prepared by:
Celine If A = [aij ] and B = [bij ] are m × n matrices, then the sum of
Sarmiento
A and B is the m × n matrix C = [cij ], defined by
Introduction

History cij = aij + bij (1 ≤ i ≤ m, 1 ≤ j ≤ n)

Linear
Systems
That is, C is obtained by adding corresponding elements of A
Matrices
and B.
Matrix
Operations

Systems of
Example:
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
21 / 60
 Properties of Matrix Addition

Matrix
Algebra

Prepared by:
Celine Let A, B, C, and D be m × n matrices.
Sarmiento
1 A+B =B+A
Introduction
2 A + (B + C) = (A + B) + C
History

Linear 3 There is a unique m × n matrix O such that A + O = A,

Systems
for any m × n matrix A. The matirx O is called the m × n
Matrices
additive identity or zero matrix.
Matrix
Operations 4 For each m × n matrix A, there is a unique m × n matrix
Systems of
Linear
D such that A + D = 0 (3). We share write D as (−A),
Equations
so that (3) can be written as A + (−A) = O. The matrix
Determinants
and Cramer’s (−A) is called the additive inverse or negative of A.
Rule

Matrix
Inversion

References
22 / 60
 Exercises (Matrix Addition)

Matrix
Algebra Given:
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion Solve: (1) A + B, (2) C + D, (3) E + F , (4) G + H
References
23 / 60
 Basic Matrix Operations

Matrix
Algebra
Definition: Scalar multiplication
Prepared by:
Celine If A = [aij ] is m × n matrix and r is a real number, then the
Sarmiento
scalar multiple of A by r, rA, is the m × n matrix B = [bij ],
Introduction where
History
bij = raij (1 ≤ i ≤ m, 1 ≤ j ≤ n)
Linear
Systems
That is, B is obtained multiplying each element of A by r.
Matrices

Matrix
Operations
Example:
Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix Note: If A and B are m × n matrices, we write A + (−1)B as

Inversion
A − B and call this the difference of A and B.
References
24 / 60
 Properties of Scalar Multiplication

Matrix
Algebra

Prepared by:
Celine
Sarmiento

Introduction If r and s are real numbers and A and B are matrices, then
History
1 r(sA) = (rs)A
Linear
Systems 2 (r + s)A = rA + sA
Matrices
3 r(A + B) = rA + rB
Matrix
Operations 4 A(rB) = r(AB) = (rA)B
Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
25 / 60
 Exercises (Scalar Multiplication)

Matrix
Algebra
Given:
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix Solve: (1) −2A, (2) 4G, (3) 2A − B, (4) 9F − 2E,

Inversion

References
(5) −2G + 7H
26 / 60
 Basic Matrix Operations

Matrix
Algebra Definition: Matrix multiplication
Prepared by:
Celine If A = [aij ] is an m × p matrix and B = [bij ] is a p × n matrix,
Sarmiento
then the product of A and B, denoted by AB, is the m × n
Introduction matrix C = [cij ], defined by
History

Linear cij = ai1 b1j + ai2 b2j + · · · + aip bpj (1 ≤ i ≤ m, 1 ≤ j ≤ n)

Systems

Matrices
Example:
Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
27 / 60
 Properties of Matrix Multiplication

Matrix
Algebra

Prepared by:
Celine
Sarmiento
1 If A, B, and C are of the appropriate sizes, then
Introduction
A(BC) = (AB)C
History

Linear
Systems
2 If A, B, and C are of the appropriate sizes, then
Matrices

Matrix
A(B + C) = AB + AC
Operations

Systems of 3 If A, B, and C are of the appropriate sizes, then

Linear
Equations

Determinants (A + B)C = AC + BC
and Cramer’s
Rule

Matrix
Inversion

References
28 / 60
 Exercises (Matrix Multiplication)

Matrix
Algebra Given:
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion Solve: (1) AB, (2) CF , (3) ED, (4) GH, (5) GF , (6) DH
References
29 / 60
 Basic Matrix Operations

Matrix
Algebra Definition: Transpose of a matrix
Prepared by:
Celine
If A = [aij ] is an m × n matrix, then the n × m matrix
Sarmiento AT = [aTij ] where
Introduction

History aTij = aji (1 ≤ i ≤ n, 1 ≤ j ≤ m)

Linear
Systems is called the transpose of A. Thus the transpose of A is
Matrices
obtained by interchanging the rows and columns of A.
Matrix
Operations
Example:
Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
30 / 60
 Transpose of a Matrix

Matrix
Algebra
Properties: If r is a scalar and A and B are matrices, then
Prepared by:
Celine 1 (AT )T = A
Sarmiento
2 (A + B)T = AT + B T
Introduction

History
3 (AB)T = B T AT
Linear 4 (rA)T = rAT
Systems

Matrices
Definition: Symmetric and skew symmetric matrices
Matrix
Operations
• A matrix A = [aij ] is called symmetric if AT = A. That
Systems of
Linear is, A is symmetric if it is a square matrix for which
Equations
aij = aji .
Determinants
and Cramer’s • A matrix A = [aij ] is called skew symmetric if
Rule

Matrix
AT = −A.
Inversion

References
31 / 60
 Exercises (Transpose of a Matrix)

Matrix
Algebra
Determine the transpose of the following matrices.
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
32 / 60
 Exercises (Basic Matrix Operations)

Matrix
Algebra
Let
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
If possible, compute the following combinations:
Linear
Equations
(1) 2(D + F ) (2) 3(B + D) (3) 3C − 4E
Determinants
(4) (2D + 3F )T (5) D − DT (6) 2AT + B
and Cramer’s
Rule
(7) (AB)D (8) A(C + E) (9) BA + F D
Matrix
(10)(A − B)T (11) (3B T − 2A)T (12) (C + E + E T )T
Inversion

References
33 / 60
 Row Echelon Form of a Matrix

Matrix
Algebra
Definition: Reduced row echelon form
Prepared by:
Celine An m × n matrix A is said to be in reduced row echelon
Sarmiento
form if it satisfies the following properties:
Introduction
1 All zero rows, if there are any, appear at the bottom of the
History
matrix.
Linear
Systems 2 The first nonzero entry from the left of a nonzero row is a
Matrices
1. This entry is called a leading one of its row.
Matrix
Operations 3 For each nonzero row, the leading one appears to the right
Systems of and below any leading one’s in preceding rows.
Linear
Equations
4 If a column contains a leading one, then all other entries
Determinants
and Cramer’s in the column are zero.
Rule

Matrix An m × n matrix satisfying properties (1), (2), and (3) is said

Inversion
to be in row echelon form.
References
34 / 60
 Echelon and Reduced Row Echelon Form

Matrix
Algebra

Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
35 / 60
 Elementary Row Operation

Matrix
Algebra

Prepared by: Definition: Elementary row operation

Celine
Sarmiento
An elementary row operation on an m × n matrix A = [ai j]
Introduction is any of the following operations:
History
1 Interchange rows r and s of A.
Linear
Systems 2 Multiply row r of A by c 6= 0.
Matrices
3 Add d times row r of A to row s of A, r 6= s.
Matrix
Operations

Systems of
Observe that when a matrix is viewed as the augmented matrix
Linear
Equations
of a linear system, the elementary row operations are
Determinants
equivalent, respectively, to interchanging two equations,
and Cramer’s
Rule
multiplying an equation by a nonzero constant, and adding a
Matrix
multiple of one equation to another equation.
Inversion

References
36 / 60
 Exercise (Elementary Row Operation)

Matrix
Algebra
Transform the matrix below to reduced row echelon form.
Prepared by:
Celine
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
37 / 60
 Exercise (Elementary Row Operation)

Matrix
Algebra

Prepared by:
Celine Transform the matrix below to reduced row echelon form.
Sarmiento

Introduction

History

Linear
Systems

Matrices

Matrix
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
38 / 60
 Gauss-Jordan Reduction

Matrix
Algebra

Prepared by:
Celine The Gauss-Jordan reduction procedure for solving the linear
Sarmiento
system Ax = b is as follows:
Introduction
1 Form the augmented matrix [A|b].
History

Linear
2 Transform [A|b] to reduced row echelon form [C|d] by
Systems
using elementary row operations.
Matrices
3 For each nonzero row of the matrix [C|d], solve the
Matrix
Operations corresponding equation for the unknown associated with
Systems of
Linear
the leading one in that row. The rows consisting entirely
Equations of zeros can be ignored, because the corresponding
Determinants
and Cramer’s
equation will be satisfied for any values of the unknowns.
Rule

Matrix
Inversion

References
39 / 60
 Exercises (Gauss-Jordan Reduction)

Matrix
Algebra

Prepared by:
Use Gauss-Jordan reduction to find the solution set of the
Celine
Sarmiento
system:
(
2x − 3y = 4
Introduction 1
History 3x − y = 1
Linear
(
Systems x+y =6
2
Matrices 3x − 5y = −16
Matrix (
Operations
2x + 6y = 3
Systems of 3
Linear 8x − 3y = −6
Equations (
Determinants 6x + y = 6
and Cramer’s 4
Rule
2x − 2y = −5
Matrix
Inversion

References
40 / 60
 Exercises (Gauss-Jordan Reduction)

Matrix
Algebra
Use Gauss-Jordan reduction to find the solution set of the
Prepared by:
Celine system:
Sarmiento 
4x + 3y + z = 1

Introduction
1 3x − 2y − 3z = −2
History 
5x + 4y + 2z = 3

Linear
Systems 
Matrices 2x − 2y + z = 0

Matrix 2 x + 5y − 7z = 3
Operations 
x − y − 3z = −7

Systems of
Linear 
Equations

Determinants
x + 4y + z = 5

and Cramer’s 3 2x + y − 4z = 0
Rule 
3x − 3y + z = −1

Matrix
Inversion

References
41 / 60
 Gaussian Elimination

Matrix
Algebra

Prepared by:
Celine
Sarmiento The Gaussian elimination procedure for solving the linear
system Ax = b is as follows:
Introduction

History 1 Form the augmented matrix [A|b].

Linear
Systems
2 Transform [A|b] to (some) row echelon form [C|d] by
Matrices
using elementary row operations.
Matrix 3 Solve the linear system corresponding to [C|d] by back
Operations
substitution. The rows consisting entirely of zeros can be
Systems of
Linear ignored, because the corresponding equation will be
Equations
satisfied for any values of the unknowns.
Determinants
and Cramer’s
Rule

Matrix
Inversion

References
42 / 60
 Exercises (Gaussian Elimination)

Matrix
Algebra

Prepared by: Use Gaussian elimination to find the solution set of the system:
Celine (
Sarmiento
2x − 3y = 4
1
Introduction 3x − y = 1
History (
Linear x+y =6
Systems 2
Matrices
3x − 5y = −16
(
Matrix
Operations
2x + 6y = 3
3
Systems of 8x − 3y = −6
Linear (
Equations
6x + y = 6
Determinants 4
and Cramer’s
Rule
2x − 2y = −5
Matrix
Inversion

References
43 / 60
 Exercises (Gaussian Elimination)

Matrix
Algebra

Prepared by:
Use Gaussian elimination to find the solution set of the system:
Celine

Sarmiento 4x + 3y + z = 1

Introduction 1 3x − 2y − 3z = −2

5x + 4y + 2z = 3
History

Linear 
Systems
2x − 2y + z = 0

Matrices
2 x + 5y − 7z = 3
Matrix 
x − y − 3z = −7
Operations

Systems of 
x + 4y + z = 5
Linear
Equations

Determinants 3 2x + y − 4z = 0
and Cramer’s 
3x − 3y + z = −1
Rule

Matrix
Inversion

References
44 / 60
 Determinants and Cramer’s Rule

Matrix
Algebra

Prepared by:
Celine
Sarmiento

Introduction

History Associated with each square matrix is a number called the

Linear determinant. Determinants can be used to solve systems of
Systems
linear equations by formulas known as Cramer’s rule, named
Matrices

Matrix
after the Swiss mathematician Gabriel Cramer (1704-1752).
Operations

Systems of
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
45 / 60
 Determinants and Cramer’s Rule

Matrix
Algebra

Prepared by:
Definition: Second-order determinant
Celine
Sarmiento
If H is the square matrix of order two
 
Introduction a1 b1
History
a2 b2
Linear
Systems

Matrices then the determinant

 of H, denoted by det H or |H| or
 a1 b1 
 a2 b2  is defined by
Matrix  
Operations

Systems of
Linear  
Equations  a1 b1 
 a2 b2  = a1 b2 − a2 b1
 
Determinants
and Cramer’s
Rule

Matrix and is of the second order.

Inversion

References
46 / 60
 Exercises (Determinants)

Matrix
Algebra

Prepared by:
Celine
Sarmiento
Evaluate the given determinant. Solve for the value of x.
  
Introduction  3 −1   x 2 
1 
  1  =7
History
2 5  −1 5 
Linear    
Systems  −2 4   x −2 
2 
  2   = 14
Matrices
3 7  5 x 
Matrix    
Operations  −1 3   4 −2 
3 
  3  =6
Systems of
Linear
9 0  x 3 
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
47 / 60
 Cramer’s Rule for a System of Two Linear
Equations
Matrix
Algebra
Suppose we have the system of two linear equations in two
Prepared by:
Celine variables x and y (
Sarmiento
a1 x + b1 y = c1
Introduction
a2 x + b2 y = c2
History

Linear where either a1 6= 0 or b1 6= 0, and either a2 6= 0 or bc =

6 0. Let
Systems

Matrices
     
 a1 b1   c1 b1   a1 c1 
Matrix D=   Dx =    Dy =   
Operations a2 b2  c2 b2  a2 c2 
Systems of
Linear
Equations
If D 6= 0, then the system has a unique solution given by
Determinants
and Cramer’s
Dx Dy
Rule x= and y =
D D
Matrix
Inversion

References
48 / 60
 Exercises (Cramer’s Rule)

Matrix
Algebra

Prepared by: Use Cramer’s rule to find the solution set of the system:
Celine (
Sarmiento
2x − 3y = 4
1
Introduction 3x − y = 1
History (
Linear x+y =6
Systems 2
Matrices
3x − 5y = −16
(
Matrix
Operations
2x + 6y = 3
3
Systems of 8x − 3y = −6
Linear (
Equations
6x + y = 6
Determinants 4
and Cramer’s
Rule
2x − 2y = −5
Matrix
Inversion

References
49 / 60
 Determinants and Cramer’s Rule

Matrix
Algebra
Definition: Third-order determinant
Prepared by:
Celine If H is the square matrix of order three
Sarmiento
 
Introduction
a1 b1 c1
History
 a2 b2 c2 
Linear a3 b3 c3
Systems

Matrices
then the determinant
 of H, denoted by det H or |H| or
Matrix  a1
Operations  b1 c1 
Systems of
 a2 b2 c2  is defined by
Linear

 a3 b3 c3 
Equations

Determinants
and Cramer’s
Rule
|H| = a1 b2 c3 − a1 b3 c2 + a3 b1 c2 − a2 b1 c3 + a2 b3 c1 − a3 b2 c1
Matrix
Inversion and is of the third order.
References
50 / 60
 Exercises (Determinants)

Matrix
Algebra

Prepared by:
Evaluate the given determinant. Solve for the value of
Celine
Sarmiento
   x.
 −1 6 4   x 0 0 
   
Introduction 1  −1 2 1  1  3 −1 5  = 8
History  −2 7 4   2 2 −6 
Linear    
Systems  1 2 0   x 0 −1 
  
Matrices 2  2 −1 3  2  3 x 4  = 10
Matrix  1 5 −4   2 2 1 
Operations  
 
Systems of  −6 −3 2   x 1 0 
Linear   
Equations 3  3 2 0  3  3 −2 −2  = 5
Determinants  4 2 −1   −4 4 −5 
and Cramer’s
Rule

Matrix
Inversion

References
51 / 60
 Cramer’s Rule for a System of Three Linear
Equations
Matrix
Algebra
Suppose we have the  system of three linear equations in three
Prepared by: a1 x + b1 y + c1 z = d1

Celine
Sarmiento variables x, y and z, a2 x + b2 y + c2 z = d2

a3 x + b3 y + c3 z = d3

Introduction

History where in each equation at least one of the coefficients

 of the
Linear
 a1 b1 c1 
Systems
 
variables is nonzero. Let D =  a2 b2 c2 
Matrices  a3 b3 c3 
Matrix
Operations
     
 d1 b1 c1   a1 d1 c1   a1 b1 d1 
Systems of      
Linear Dx =  d2 b2 c2  Dy =  a2 d2 c2  Dz =  a2 b2 d2
    

Equations  d3 b3 c3   a3 d3 c3   a3 b3 d3 
Determinants
and Cramer’s
Rule
If D 6= 0, then the system has a unique solution given by
Matrix Dx Dy Dz
Inversion x= y= z=
References
D D D
52 / 60
 Exercises (Cramer’s Rule)

Matrix
Algebra

Prepared by:
Use Cramer’s rule to find the solution set of the system:
Celine

Sarmiento 4x + 3y + z = 1

Introduction 1 3x − 2y − 3z = −2

5x + 4y + 2z = 3
History

Linear 
Systems
2x − 2y + z = 0

Matrices
2 x + 5y − 7z = 3
Matrix 
x − y − 3z = −7
Operations

Systems of 
x + 4y + z = 5
Linear
Equations

Determinants 3 2x + y − 4z = 0
and Cramer’s 
3x − 3y + z = −1
Rule

Matrix
Inversion

References
53 / 60
 Matrix Inversion

Matrix
Algebra
Definition: Inverse of a matrix
Prepared by:
Celine An n × n matrix A is called nonsingular (or invertible) if
Sarmiento
there exists an n × n matrix B such that
Introduction

History AB = BA = In
Linear
Systems
The matrix B is called an inverse of A. If there exists no such
Matrices

Matrix
matrix B, then A is called singular (or noninvertible).
Operations

Systems of Remark: If a matrix has an inverse, then the inverse is unique.

Linear
Equations

Determinants We shall write the inverse of A, if it exists, as A−1 . Thus

and Cramer’s
Rule

Matrix AA−1 = A−1 A = In

Inversion

References
54 / 60
 Matrix Inversion

Matrix
Algebra

Prepared by:
Celine Example 1
Sarmiento
Show that B is the inverse of A when
Introduction
   
History 2 3 −1 3/2
A= and B =
Linear 2 2 1 −1
Systems

Matrices

Matrix Example 2
Operations

Systems of
Find A−1 and B −1 when
Linear    
Equations
1 2 1 2
Determinants A= and B =
and Cramer’s 3 4 2 4
Rule

Matrix
Inversion

References
55 / 60
 Properties of the Inverse

Matrix
Algebra

Prepared by:
Celine 1 If A is a nonsingular matrix, then A−1 is nonsingular and
Sarmiento

Introduction (A−1 )−1 = A

History

Linear 2 If A and B are nonsingular matrices, then AB is

Systems
nonsingular and
Matrices

Matrix
Operations
(AB)−1 = B −1 A−1
Systems of
Linear 3 If A is a nonsingular matrix, then
Equations

(AT )−1 = (A−1 )T

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
56 / 60
 A Practical Method for Finding A−1

Matrix
Algebra
The practical procedure for computing the inverse of matrix A
Prepared by:
Celine is as follows.
Sarmiento
1 Form the n × 2n matrix [A|In ] obtained by adjoining the
Introduction
identity matrix In to the given matrix A.
History

Linear
2 Transform the matrix obtained in (1) to reduced row
Systems echelon form by using elementary row operations.
Matrices
Remember that whatever we do to a row of A we also do
Matrix
Operations to the corresponding row of In .
Systems of 3 Suppose that (2) has produced the matrix [C|D] is
Linear
Equations reduced row echelon form.
Determinants • If C = In , then D = A−1 .
and Cramer’s
Rule • If C 6= In , then C has a row of zeros. In this case A is
Matrix
singular and A−1 does not exist.
Inversion

References
57 / 60
 Matrix Inversion

Matrix
Algebra

Prepared by:
Example 1
Celine
Sarmiento Find the inverse of the matrix
 
Introduction 1 1 1
History A= 0 2 3 
Linear
Systems
5 5 1
Matrices

Matrix Example 2
Operations

Systems of If possible, find the inverse of the matrix

Linear
Equations  
1 2 −3
Determinants
and Cramer’s B =  1 −2 1 
Rule

Matrix
5 −2 −3
Inversion

References
58 / 60
 Exercises (Matrix Inversion)

Matrix
Algebra

Prepared by:
Celine
Sarmiento
Find the inverses of the given matrices, if possible
Introduction      
History 2 1 1 3 2 3
(1) (2) (3)
Linear −2 3 −2 6 1 4
Systems

Matrices      
1 2 −3 1 2 3 1 2 1
Matrix
Operations (4)  1 −1 2  (5)  0 2 3  (6)  1 3 2 
Systems of 0 1 2 1 2 4 1 0 1
Linear
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
59 / 60
 References

Matrix
Algebra

Prepared by:
Celine
Sarmiento

• Kolman, B. and Hill, D. (2002). Introductory Linear

Introduction

History
Algebra w/ Applications, 7th Edition. Prentice-Hall, Inc.,
Linear
Singapore.
Systems
• Larson, R. and Falvo, D. (2011). Linear Algebra. Cengage
Matrices

Matrix
Learning Asia Pte. Ltd. Philippines.
Operations
• Leithold, L. (2002). College Algebra and Trigonometry.
Systems of
Linear Pearson Education Asia Pte. Ltd. Singapore.
Equations

Determinants
and Cramer’s
Rule

Matrix
Inversion

References
60 / 60