Linear Algebra - Chapter 1

Contents
1. Solutions and Elementary Operations

2. Gaussian Elimination

3. Homogeneous Equations
 Objectives

• Using Gaussian elimination to solve system of linear

equations
• Using series of elementary row operations to carry a
matrix to row – echelon form, find the rank of a matrix.
• Condition for a homogeneous system to have nontrivial
solution
ax + by = c
ax + by + cz = d
1.1. Solutions and Elementary Operations
coefficients variables

• a1x1+a2x2+…+anxn=b is called a linear equation (phương

trình tuyến tính)
• A solution (nghiệm) to the equation is a sequence s1,s2,…,sn
such that a1s1+a2s2+…+ansn=b
• s1,s2,…,sn is called a solution to a system of linear equations
if s1,s2,…,sn is a solution to every equation of the system
• A system may have no solution, may have unique solution
(nghiệm duy nhất), or may have an infinite family of
solutions (vô số nghiệm)
• A system that has no solution is called inconsistent
(không tương thích)
• A system that has at least one solution is called
consistent (tương thích)

Inconsistent Consistent
(không (tương thích)
tương thích)
No solutions Unique solution Infinitely many
( vô nghiệm) (nghiệm duy nhất) solutions
(vô số nghiệm)
 Example 1

•
 x  2 y 1  x  y  z 1
 
 x  2 y 3  x  y  z 3
no solution (0,2,1), (2,0,1) (t,2-t,1)

Inconsistent Consistent
(infinitely many solutions)

(t,2-t,1) is called a general solution and

given in parametric form , t is parameter
( t is arbitrary)
 Algebraic Method

3 x1  2 x2  x3  x4  1 3 2  1 1  1
2 x1  x3  2 x4  0  
2 0 1 2 0 
3 x1  x2  2 x3  5 x4  2  3 1 2 5 2 
augmented matrix

coefficient matrix
constant matrix
 3 2  1 1   1
 2 0  1 2 0 
   
 3 1 2 5   2 
Algebraic Method
  1
0 
 
 2 
constant matrix
(ma trận cột tự do)

3 2 1 1
2 0 1 2
3 1 2 5
augmented matrix
(ma trận mở rộng) coefficients matrix
( ma trận hệ số)
 Elementary Operations
(biến đổi sơ cấp)

Equivalent
Difficult Easy
Two systems are said to be equivalent if
the have the same set of solutions
 Elementary Operations
(phép biến đổi sơ cấp)

• Interchange two equations (I)

• Multiply one equation by a nonzero number

(II)

• Add a multiple of one equation to a different

equation (III)
Example 2

 x  y 1
Consider the system 
 x  2 y  2

1 1 1
augmented matrix
1 2 2
Example 2

 x  y 1  x  y 1  x  y 1  x  0 y 0
     
 x  2 y  2 0 x  3 y  3 0 x  y  1 0 x  y  1
1  1 1 ( III ) 1  1 1 ( II ) 1  1 1 ( III ) 1 0 0
  
1 2 2 0 3 3 0 1 1 0 11

Solution (0,-1)
Theorem. Suppose an elementary operation is performed on a
system of linear equations. Then the resulting system has the
same set of solutions as the original system, so the two system
are equivalent (tương đương)
In this case,their augmented matrices are called row-equivalent
 Type I (interchange two rows)

 1 2  3 r  r  4 1 6 
2 5 0   2 5 0 
1 3

   
 4 1 6   1 2  3
Type II (multiply one row by a nonzero number)

 1 2  3 r  3 r  3 6  9 
2 5 0   2 5 0 
1 1

   
 4 1 6   4 1 6 
Type III (add a multiple of one row to another row)

 1 2  3 rr  rr  42rr  1 2  3
2 2 1

2 5 0   0 1 6 
3 3 1

   
 4 1 6   0  7 18 
 Elementary (row) Operations on matrix

In case of two equations in two variables, the

goal is to produce a matrix of the form
1 0*
0 1*
In case of three equations in three variables, the
goal matrix is
1 0 0*
0 1 0*
0 0 1*
1.2. Gaussian Elimination
(phép khử Gauss)
By using elementary row operations to carry the augmented
matrix to “nice” matrix such as

1 0 0*
0 1 0*
0 0 1*

( and it is said to be in row- echelon form

(dạng bậc thang theo dòng))
 A row-echelon matrix has 3 properties

• All the zero rows are at the

bottom
0 1 * * ** *
0 • The first nonzero entry
0 0 1 * * * from the left in each
 
0 0 0 0 1 * * nonzero row is a 1, called
0 0 0 0 0 0 1
the leading 1 for that row
  • Each leading 1 is to the
 0 0 0 0 0 0 0  right of all leading 1’s in
the rows above it
Row-echelon matrix
The row-echelon matrix has the “staircase” form

0 1 * * ** *
0 0 0 1 * * * 

0 0 0 0 1 * *
 
leading ones 0 0 0 0 0 0 1
 0 0 0 0 0 0 0

(for any choice in *-position )

 Row-echelon matrix

 1 * *
 1 * *  0 1 *
 0 0 1  
 
 0 0 1

 1 * * *  0 1 * *  1 * *
 0 1 * *  0 0 0 1  0 0 0
     
 0 1 * *  0 0 0 0   0 0 1 
 A reduced row-echelon matrix
has the properties

• It is a row-echelon matrix  1 0 * 0
• Each leading 1 is the only  0 1 * 0
nonzero entry in its  
column  0 0 0 1 
 Reduced row- echelon matrix

 1 * 0
 1 * 0  0 1 0
 0 0 1  
 
 0 0 1 

 1 0 * 0  0 1 * 0  1 * 0
 0 1 * 0  0 0 0 1  0 0 0
     
 0 0 0 1   0 0 0 0   0 0 1 
 Find x,y so that the matrix

 1 x y
 0 x 1
 
• is row-echelon matrix
• is reduced row-echelon matrix
 How to carry a matrix to
(reduced) row-echelon form?
 Elementary Operations
(phép biến đổi sơ cấp)
• Interchange two equations (type I)

• Multiply one equation by a nonzero number (type II)

• Add a multiple of one equation to a different equation

(type III)
Elementary row operations
 Gaussian Algorithm
Theorem. Every matrix can be brought to (reduced) row-
echelon form by a series of elementary row operations

Step 1. If all row are zeros, stop

Step 2. Otherwise, find the first column from the left
containing a nonzero entry (call it a) and move the row
containing a to the top position
Step 3. Multiply that row by 1/a to create the leading 1
Step 4. By subtracting multiples of that row from the rows
below it, make each entry below the leading 1 zero
Step 5. Repeat step 1-4 on the matrix consisting of the
remaining rows
 Gaussian Algorithm
0 0 0 0
0 0 0 0
step 1:    stop
0 0 0 0
  leading one
0 0 0 0
 1 
0 0 1 3 2 2 1 0   1 
 1 1  0 
2 1 1  2 0  2
 2  1 0  0 0 1 3 
1 0 0 1  r  r  4r  0 0 1 3

r" 1  r2  r1  r1  3 "4 4 1 
0 3 0 6 0 3 0 6 " 2 0 3 0 6
0 3 0 6
       
4 7 5  1 4 7 5  1  4 7 5  1  0 3 7  1

step 2 step 3 step 4 step 5

 Example

Carry the matrix

 2 6  2 2
  2  3 11 4 
 
 3 11 3 0 
to row-echelon matrix
to reduced row-echelon matrix
 2 6  2 2 r  1 r  1 3  1 1 
1 1
r2  r2  2 r1
r3  r3  3 r1
1 3  1 1 
  2  3 11 4  2   2  3 11 4   0 3 9 6 
     
 3 11 3 0   3 11 3 0   0 2 6  3

 1 3  1 1  r  r  2r  1 3
1
r2  r2
 1 1  r   1r  1 3  1 1
0 1 
3 3
3
 0 1 3 2  3


3 2

3 2    0 1 3 2 
7

  
 0 2 6  3  0 0 0  7   0 0 0 1 

row-echelon matrix
1 3  1 2  1 3  1 0
1  r  r  2r
2
rr r
3

0 1 3 
2 
1
 0 1 3 0
1 3

  
 0 0 0 1   0 0 0 1 
 1 0  10 0 
r  r  3r
1 1 2

 0 1  3 0 
 0 0 0 1 

reduced row-echelon matrix

 Gauss-Jordan Elimination
(for solving a system of linear equations)

Step 1. Using elementary row  1 0  10 0   x  0 y  10 z 0

operations, augmented  0 1 3 0   0 x  1 y  3 z 0
  
matrixreduced row-echelon  0 0 0 1  0 x  0 y  0 z 1

matrix reduced row echelon matrix
Step 2. If a row [0 0 0…0 1] occurs,
the system is inconsistent
Step 3. Otherwise, assign the  1 0  10 0  1x  0 y  10 z 0

nonleading variables as parameters,  0 1 3 0  0 x 1 y  3z 0
solve for the leading variables in  0 0 0 0  0 x  0 y  0 z 0

terms of parameters

z=t (parameter) z is nonleading variable

 1 0  10 0  1x  0 y  10 z 0
 0 1 3 0   0 x  1 y  3 z 0
  
 0 0 0 1  0 x  0 y  0 z 1


reduced row echelon matrix

 1 0 10 5   1 0 10 5   1 0 10 5 
 3 1  4  1   0 1  34  16    0 1  34  16 
     
 4 1 6 1   0 1  34  19   0 0 0 1 
row echelon matrix
inconsistent
 leading one

 1  2  1 3 1  1  2  1 3 1  1  2  1 3 1
     
 2  4 1 0 5    0 0 3  6 3    0 0 1  2 1 
 1  2 2  3 4   0 0 3  6 3  0 0 0 0 0 

row echelon matrix

x2,x4 are nonleading variables, so we set
x2=t and x4=s (parameters) and then
compute x1, x3
Example
Which condition on the numbers a,b,c is the system

3 x  y  z a

 x  y  2 z b
5 x  3 y  4 z c


consistent ? unique solution?

 The rank of a matrix

• The reduced row-echelon form of a matrix A is uniquely

determined by A, but the row-echelon form of A is not
unique
• The number r of leading 1’s is the same in each of the
different row-echelon matrices
• As r depends only on A and not on the row-echelon forms,
it is called the rank of the matrix A, and written r=rankA
 The rank of a matrix

• If the a matrix A has the row-echelon matrix is

0 1 * * * * *
0 0 0 1 * * * 

0 0 0 0 1 * *
 
0 0 0 0 0 0 1
 0 0 0 0 0 0 0
then rankA=4
 Theorem 2

Suppose a system of m equations in n variables has a solution.

If the rank of the augment matrix is r then the set of solutions
involves exactly n-r parameters
leading one

 1  2  1 3 1  1  2  1 3 1  1  2  1 3 1
     
 2  4 1 0 5    0 0 3  6 3    0 0 1  2 1 
 1  2 2  3 4   0 0 3  6 3  0 0 0 0 0 

rankA=2
4(number of variables)- 2(rankA) =2
(two parameters : x2=t, x4=s)
 1.3.Homogeneous Equations
(phương trình thuần nhất)

• The system is called homogeneous (thuần nhất) if the constant matrix

has all the entry are zeros

• Note that every homogeneous system has at least one solution (0,0,
…,0), called trivial solution (nghiệm tầm thường)

• If a homogeneous system of linear equations has nontrivial solution

(nghiệm không tầm thường) then it has infinite family of solutions (vô
số nghiệm)
 Theorem 1
If a homogeneous system of linear equations has
more variables than equations, then it has nontrivial
solution (in fact, infinitely many)

Note that the converse of theorem 1 is not true

 Summary
System of Inconsistent Consistent
( no solutions) Unique solution Infinitely many
(exactly one solutions
solution)
linear equations yes yes yes
linear equations that Yes no yes
has more variables
than equations

homogeneous linear No yes yes

equations
homogeneous linear No no yes
equations that has
more variables than
equations
 Summary

Elementary Operations

Gaussian Elimination

Homogeneous Equations
THANKS