Linear Algebra

Lesson 1: Introduction to Matrices and

System of Linear Equations (SLE)
Nguyen Chanh Tu, DUT
(Bài giảng trích xuất từ môi trường tương tác Maple12)
Dropbox link to download materials for the course:

1. Some definitions
1.1. Exams of Systems of Linear Equations
Exam1: dogs and chickens
Sol

1.2. Exam 2: Intersection points of planes

Exam 2.1: Two planes
O p1 d 2 x1 Cx2 Kx3 = 5; p2 d x1 K2 x2 Cx3 =K2
p1 := 2 x1 Cx2 Kx3 = 5
p2 := x1 K2 x2 Cx3 = K2 (1.2.1.1)
• Find out one intersection points.
• How many intersection points ?

Picture
O with(plots):implicitplot3d([2*x[1]+x[2]-x[3] = 5,x[1]
-2*x[2]+x[3] = -2],x[1]=-10..10,x[2]=-10..10,x[3]=-10.
.10);
O
Exam 2.2: Three planes
O p1 d 2 x1 Cx2 Kx3 = 5; p2 d x1 K2 x2 Cx3 =K2; p3 dK3 x1 Cx2 CK3 x3 = 10;
p1 := 2 x1 Cx2 Kx3 = 5
p2 := x1 K2 x2 Cx3 = K2
p3 := K3 x1 Cx2 K3 x3 = 10 (1.2.2.1)
O implicitplot3d 2 * x 1 Cx 2 Kx 3 = 5, x 1 K2 * x 2 Cx 3 = K2,K3 x1 Cx2 C
K3 x3 = 10 , x 1 =K10 ..10, x 2 =K10 ..10, x 3 =K10 ..10 ;
 How many intersection point of 3 planes?
O solve 2 * x 1 Cx 2 Kx 3 = 5, x 1 K2 * x 2 Cx 3 = K2,K3 x1 Cx2 CK3 x3
= 10 , x1, x2, x3 :

1.3. Questions:
1. Geometrically, how many intersection points of 2 planes in the space?
2. In general, how many intersection points of n planes in the space, for n R 3 ?

1.4. General form of a system of LE

a11x1 Ca12 x2 C...Ca1 n xn = b1,
a21x1 Ca22 x2 C...Ca2 n xn = b2,
....................................................
am1x1 Cam2 x2 C...Cam n xn = bm
where m, n are any positive integers;
the number aij 2 K , where K is one of Q, R, C are called the coefficients of SLE; b1,..., bm are
called free coefficients of the SLE.
x1, x2,..., xn are called the variables of SLE.

What is:
A solution of a SLE
T n
is an ordered set a1, a2,..., an consisting of n values, (considered as an element of K ),
satisfying all equations of the system.
O
Solving a SLE
is to find the set of solutions.
O
Two equivalent SLEs
if they have the same set of solutions.
O
An Equivalent Operation on SLE
is an operation that reduces a given SLE to another equivalent SLE.
O
Elementary Equivalent Operations on SLE
1) Interchange two equations (Ri 4 Rj
2) Multiply an equation by a nonzero constant (scalar) (aRi)
3) Add an constant multiple of equation i to equation j
(Rj CaRi
Exam: Use above 3 elementary operations to solve the system of dogs and chickens

1.5. Matrices
Definition:
An m # n -matrix is an array of m rows and n columns
a11 a12 ... a1 n

a21 a21 ... a2 n

A=
... .. .. ..
am1 am2 ... amn
aij 2 K, is the entry in ith row and jth column. Usually write A = aij , or simply
m# n
A = aij

Matrix of a system of linear equations

Given the SLE:
a11x1 Ca12 x2 C...Ca1 n xn = b1,
a21x1 Ca22 x2 C...Ca2 n xn = b2,
....................................................
am1x1 Cam2 x2 C...Cam n xn = bm
 Cofficient matrix (Ma trận hệ số)
a11 a12 ... a1 n

a21 a21 ... a2 n

A=
... .. .. ..
am1 am2 ... amn
O
Augmented matrix (Ma trận mở rộng)
a11 a12 ... a1 n b1

a21 a21 ... a2 n b2

AB =
... .. .. .. ..
am1 am2 ... amn bm

b1

b2
where B :=
...
bm

Elementary Operations on matrices

• Definition: Row/column Elementary Operations
1) Interchange two rows/columns. Denote Ri 4 Rj , Ci 4 Cj
2) Multiply a row/column by a nonzero constant (scalar). Denote kRi, kCi
3) Add an constant multiple of one row/column to another. Denote Rj CkRi, Cj CkCj
• Definition: Two matrices A and B are called row equivalent matrices if one can be obtained
from the other by a sequence of row elementary operations
Exam 1 again:
Let consider the augmented matrix of the system of dogs and chickens:
1 1 36
(1.5.4.1)
4 2 100
Reduce above matrix into a "nicer" matrix by elementary row operations in order to get the
solution of the SLE of dogs-chickens easily.
O
Exam 3. Practice (at home): Solve the SLE by operating on the augmented
matrix
O 2 x1 Cx2 Kx3 = 5; x1 K2 x2 C2 x3 =K2; 3 x1Kx2 C x3 = 3;
2 x1 Cx2 Kx3 = 5
x1 K2 x2 C2 x3 = K2
3 x1 Kx2 Cx3 = 3 (1.5.5.1)
1. Write down the augmented matrix
 2. Reduce above matrix by elementary row operations to a matrix such that you can write
down solutions easily

O Student LinearAlgebra GaussJordanEliminationTutor ;

2. Echelon Form and Gauss-Jordan Elimination

2.1. Echelon Form and Reduced Echelon Form
Def1
An m # n -matrix is in echelon form if
1) All rows that consist entirely of zeros are grouped together at the bottom of the matrix
2) In every nonzero row, the first nonzero entry (counting from left to right) is 1
3) If the i C1 Krow contains nonzero entries, then the first nonzero entry is in a column to
the right of the first nonzero entry in the i Krow.
Def2
4) A matrix in echelon form is called reduced echelon form if the first nonzero entry of any
row is the only nonzero entry in its column.
1. Each student write down 3 matrices with size 3 x 4, which are
relatively: non echelon form; echelon form but not reduced; reduced echelon
form.
2. How many types of 3 x 3 matrices which are in reduced echelon form
(teamwork)?

2.2. Properties
Theorem
Every matrix can be transformed to an unique matrix in reduced echelon form by row
elementary operations.
O
Q: Is it still true if echelon form used instead?
No! Explain, please.
O

Gauss-Jordan Elimination
Stratery
 Exam

3. Homework
Sec1.1.
I. 1-6, 15, 16-23
II. 7-10: at least 2; 11-14 at least 2; 24-29 at least 3; 30-36 at least 3
III. Team work: 37-42 at least 6.

Sec1.2.
I. 1-10, 41-42,44,45, 28
II. 11-20 at least 5; 22-35 at least 6; 36-40 at least 2
III. Teamwork 49-54 at least 6