Linear Algebra - Chapter 1

OUR GOAL
• Elementary Operations

• Gaussian Elimination

• Homogeneous Equations
ax + by = c
ax + by + cz = d
1.1. Solutions and Elementary Operations
coefficients variables = unknowns
• a1x1+ a2x2+…+anxn=b
is called a linear equation (phương trình tuyến tính)

• If a1s1+a2s2+…+ansn= b
 (s1,s2,…,sn) is called solution of the equation

• A system may have:

no solution 0
unique solution 1
an infinite family of solutions 
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

3x1  2 x2  x3  x4  1 3 2 1 1 1
 x3  2 x4  0  
2 x1 2 0 1 2 0 
3x1  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 
 Example 2

• Consider the system

x  y  1

 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 1 1 1 1 1 1 1 0 0
  
1 2 2 0 3 3 0 1 1 0 1 1

Solution (0,-1)
A row-echelon matrix has 3 properties

• All the zero rows are at the

bottom
0 1 * * * * *
• The first nonzero entry
0 0 0 1 * * *  from the left in each
  nonzero row is a 1, called
0 0 0 0 1 * * the leading 1 for that row
0 0 0 0 0 0 1  • Each leading 1 is to the
  right of all leading 1’s in
0 0 0 0 0 0 0  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 )

 Which is a row-echelon matrix?

1 * *
1 * * 0 2 *
 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
(ma trận bậc thang theo dòng thu gọn) has the properties

• It is a row-echelon matrix
• Each leading 1 is the only 1 0 * 0 
nonzero entry in its column 0 1 * 0
 
0 0 0 1 
 Which is a 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 
 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 creat 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

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

 
1 2
 0 0 1 3
0 3 0 6 0 3 0 6 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  1 r  1 3 1 1  23r rr r 1 3 1 1 
1 2

 2 3 11 4    2 3 11 4    0 3 9 6 
1
2 1 3

     
 3 11 3 0   3 11 3 0   0 2 6 3

1 1 3 1 1  2 r  r
r2 1 3 1 1   1 r 1 3 1 1 
  0 1 3 2   0 1 3 2 
3
3 2 3 7
 0 1 3 2      
0 2 6 3 0 0 0 7  0 0 0 1 

row-echelon matrix
1 3 1 1  2 r  r 3 2 1 3 1 0 
 r r
0 1 3 2  3 1
0 1 3 0 
   
0 0 0 1  0 0 0 1 
 1 0 10 0 
3 r  r
2

 0
1
 1 3 0 
 
0 0 0 1 
reduced row-echelon matrix
 The rank of a matrix
• The rank of the matrix A, rankA = the number of
leading ones in the reduced row-echelon form of A.

1 0 * 0 
0 1 * 0 
  Rank 2
0 0 0 1 
 Gauss-Jordan Elimination
(for solving a system of linear equations)

• Step 1.Using elementary row

operations, augmented matrix  1 0 10 0  x  0 y  10 z  0
reduced row-echelon matrix  0 1 3 0   0 x  1 y  3 z  0
 0 0 0 1  0 x  0 y  0 z  1
• Step 2. If a row [0 0 0…0 1] occurs,
the system is inconsistent reduced row echelon matrix

• Step 3. Otherwise, assign the

nonleading variables as
parameters, solve for the leading
variables in terms of parameters
1 0 10 0  1x  0 y  10 z  0
  
 0 1 3 0   0 x  1 y  3 z  0
 0 0 0 0  0 x  0 y  0 z  0

z=t (parameter) z is nonleading variable

Solve the following system of equations
x  2y  3
2x  3y  2z  5
3x  7 y  2 z  10
Solution.
Carry the augmented matrix to reduced row-echelon form
 1 2 0 3  2 r  r 1 2 0 3  1 2 0 3 
  3r  r 1 2
  r r  
 2 3 2 5   0 1 2 1   0 1 2 1
1 3 2 3

 3 7 2 10  0 1 2 19  0 0 0 20 

1
1 2 0 3 
r  
  0 1 2 1
3
20

0 0 0 1 
inconsistent
  1 2 1 3 1  1 2 1 3 1
   
 2 4 1 0 5 
  0 0 3 6 3  leading one
 1 2 2 3 4  0 0 3 6 3
1 2 1 3 1  1 2 0 1 2 
   
  0 0 1 2 1   0 0 1 2 1 
 0 0 0 0 0  0 0 0 0 0 
reduced row echelon matrix
x2,x4 are nonleading
variables, so we set x1 = 2 + 2t - s
x2=t and x4=s x2 = t
(parameters) and then x3 = 1 + 2s
compute x1, x3 x4 = s
 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)
Hệ thuần nhất mà số ẩn
nhiều hơn số pt
Chắc chắn 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

 System of equations Summary

System of Inconsistent Cosistent

( no Unique solution Infinitely many
solutions) (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