Contents:

Chap 1 Linear system and matrices

Chap 2 Determinants

Chap 3 Vector space

Chap 4 Eigenvalues and eigenvectors

LINEAR EQUATION
• A linear equation in the variables x1 , , xnis an equation
that can be written in the form
a1 x1  a2 x2   an xn  b
where b and the coefficientsa1 , , anare real or complex
numbers, usually known in advance.

• A system of linear equations (or a linear system) is a

collection of one or more linear equations involving the
same variables — say, x1,…., xn.
• A solution of the system is a list (s1, s2,…, sn) of
numbers that makes each equation a true statement
when the values s1,…, sn are substituted for x1,…, xn,
respectively.

• The set of all possible solutions is called the solution

set of the linear system.

• Two linear systems are called equivalent if they have

the same solution set.
• A system of linear equations has
1. no solution, or
2. exactly one solution, or
3. infinitely many solutions.
• A system of linear equations is said to be
consistent if it has either one solution or infinitely
many solutions.
• A system is inconsistent if it has no solution.
The essential information of a linear system can be recorded compactly in a rectangular array called a matrix.
Given the system,
x1  2 x2  x3  0
2 x2  8 x3  8
with the coefficients of each variable aligned in columns, the matrix
4 x1  5 x2  9 x3  9,

Is called the coefficient matrix (or matrix of coefficients) of the system  1 2 1

 0 2 8
 
 4 5 9 

is called the coefficient matrix of the system.

 MATRIX NOTATION
• An augmented matrix of a system consists of the x1  2 x2  x3  0
coefficient matrix with an added column containing
the constants from the right sides of the equations. 2 x2  8 x3  8
4 x1  5 x2  9 x3  9,
• For the given system of equations,
 1 2 1 0
 0 2 8 8
is called the augmented matrix of the system.  
 4 5 9 9 
MATRIX SIZE
• The size of a matrix tells how many rows and columns it has. If m
and n are positive integers, an m*n matrix is a rectangular array of
numbers with m rows and n columns. (The number of rows always
comes first.)
 SOLVING SYSTEM OF EQUATIONS
• Example 1: Solve the given system of equations.
x1  2 x2  x3  0 ----(1)
2 x2  8 x3  8 ----(2)
4 x  5 x  9 x  9 ----(3)
1 2 3
 SOLVING SYSTEM OF EQUATIONS
x1  2 x2  x3  0  1 2 1 0
2 x2  8 x3  8  0 2 8 8
 
4 x1  5 x2  9 x3  9  4 5 9 9 
Elementary row operations include the following:
1. (Replacement) Replace one row by the sum of itself and a multiple
of another row.
2. (Interchange) Interchange two rows.
3. (Scaling) Multiply all entries in a row by a nonzero constant.
 x1  2 x2  x3  0  1 2 1 0
2 x2  8 x3  8  0 2 8 8
 
4 x1  5 x2  9 x3  9  4 5 9 9 
SOLVING SYSTEM OF EQUATIONS
 1 0 0 29  x1  29
0 1 0 16  x2  16
 
0 0 1 3 x3  3
Two matrices are called row equivalent if there is a sequence of
elementary row operations that transforms one matrix into the other.

If the augmented matrices of two linear systems are row equivalent,

then the two systems have the same solution set.
• Example 2: Determine if the following system is consistent:
x2  4 x3  8
2 x1  3 x2  2 x3  1
0 1 4 8
5 x1  8 x2  7 x3  1  2 3 2 1
• Solution: The augmented matrix is  
 5 8 7 1
• To obtain an x1 in in the first equation, interchange rows
1 and 2:  2 3 2 1
0 1 4 8 
 
 5 8 7 1
A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties:
1. All nonzero rows are above any rows of all zeros.
2. Each leading entry of a row is in a column to the right of the leading entry of the row above it.
3. All entries in a column below a leading entry are zeros.
If a matrix in echelon form satisfies the following additional conditions, then it is in reduced echelon form (or reduced row echelon
form):
4. The leading entry in each nonzero row is 1.
5. Each leading 1 is the only nonzero entry in its column.
ROW REDUCTION ALGORITHM
ex
0 3 6 6 4 5
 3 7 8 5 8 9 
 
 3 9 12 9 6 15
STEP 1: Locate the leftmost nonzero column and bring a nonzero element to the top of This column. To simplify next steps,
transform this leading element to 1
STEP 2: Use row replacement operations to create zeros in all positions below the leading 1.
STEP 3: Cover (or ignore) the row containing the Leading one and cover all rows, if any, above it. Apply steps 1–2 to the
submatrix that remains. Repeat the process until there are no more nonzero rows to modify.
Back substitution method: use the matrix in echelon form to solve the system. Locate the free variables then start with the
last leading variable and finish by the first variable
Gauss-Jordan Method : transform the augmented matrix to the reduced row echelon form
STEP 4: Beginning with the rightmost leading one and working upward and to the left, create zeros above each leading one.
ex1
ex2
 Solve each of the following systems by Gauss-Jordan Elimination or back substitution method:
 2 3
x  2 y  z  3

 2 1
2 x  y   1
 z
 4
 2 x  2 y  z  2
2
2 sin   cos   3 tan   3
 0    2 ; 0    2 ; 0    
4 sin   2 cos   2 tan   2
6 sin   3 cos   tan   9

 x  y  2 z  w  1
2 x  y  2 z  2w  2


 x  2 y  4 z  w  1
3x  3w  3
1.2 Homogeneous System
1.3. MATRIX OPERATIONS
A diagonal matrix is a square nxn matrix whose nondiagonal entries are zero.

An nxm matrix whose entries are all zero is a zero matrix and is written as 0.

two matrices are equal if they have the same size and if their corresponding entries are equal.

If A and B are 2 matrices of the same size, then the sum or the difference A+B or A-B is the matrix whose
columns are the sums(or diff) of the corresponding columns in A and B.

If k is a scalar and A is a matrix, then the scalar multiple kA is the matrix whose columns are k times the corresponding columns in A
proprieties
A B  B  A
( A  B)  C  A  ( B  C )
A0  A
r ( A  B)  rA  rB
(r  s ) A  rA  sA
r ( sA)  (rs) A
MATRIX MULTIPLICATION
PROPERTIES OF MATRIX MULTIPLICATION
A( BC )  ( AB)C

A( B  C )  AB  AC
( B  C ) A  BA  CA
r ( AB)  (rA) B  A(rB)
I m A  A  AI n

AB  BA
POWERS OF A MATRIX
If A is an nxn matrix and if k is a positive integer, then
Ak denotes the product of k copies of A:

A A
k
A
k
THE TRANSPOSE OF A MATRIX
Given an nxm matrix A, the transpose of A is the mxn matrix, denoted by AT, whose columns are formed from the corresponding rows of A.

(A )  A
T T

( A  B)  A  B
T T T

(rA)  rA
T T

( AB)  B A
T T T
Inverse matrix
An nxn matrix A is said to be invertible if there is an nxn matrix C such that
CA=AC=In
An nxn matrix A is invertible if and only if A is row equivalent to In, and in this case, any sequence of
elementary row operations that reduces A to In also transforms In into A-1 .
Ex: Find the inverse of the matrix, if it exists.

0 1 0
A   1 0 3
 
 4 3 8
PROPERTIES OF Inverse

(A )  A
1 1

( AB)  B A
1 1 1

( AT ) 1  ( A1 )T
If A is an invertible nxn matrix, then for each b in ℝ𝑛 , the
equation AX=b has the unique solution X = A-1b