Intro to Linear Algebra Lecture 1
Intro to Linear Algebra Lecture 1
Lecture 1
Search Engines
Image Processing
Information Theory
Signal Processing
Control Theory
Networks
etc...
Search Engines
Image Processing
Information Theory
Signal Processing
Control Theory
Networks
etc...
Search Engines
Image Processing
Information Theory
Signal Processing
Control Theory
Networks
etc...
develop a deeper
understanding of linear
equations/linear systems;
think more critically and use
logical reasoning; and
use precise mathematical
notations and statements.
X = {x1 , ..., xn }
X = {x1 , ..., xn }
X = {x1 , ..., xn }
X = {x1 , ..., xn }
A={ ...
|{z} | ...
|{z} }
|{z}
general description/form such that00 specific characteristics
X = {x1 , ..., xn }
A={ ...
|{z} | ...
|{z} }
|{z}
general description/form such that00 specific characteristics
Q = { ba | a, b Z, b 6= 0} (rational numbers)
X = {x1 , ..., xn }
A={ ...
|{z} | ...
|{z} }
|{z}
general description/form such that00 specific characteristics
Q = { ba | a, b Z, b 6= 0} (rational numbers)
C = {a + bi | a, b R, i = 1} (complex numbers)
EQUATION
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
SOLUTION
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
SOLUTION SET
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
3x 2 = 12 x 2 + y 2 = 1 x + 2y 4z = 0
a1x1 + a2x2 + . . . + an xn = b
(at least one of the ai s is nonzero)
a1x1 + a2x2 + . . . + an xn = b
(at least one of the ai s is nonzero)
a1x1 + a2x2 + . . . + an xn = b
(at least one of the ai s is nonzero)
a1x1 + a2x2 + . . . + an xn = b
(at least one of the ai s is nonzero)
a1x1 + a2x2 + . . . + an xn = b
(at least one of the ai s is nonzero)
a1x1 + a2x2 + . . . + an xn = b
(at least one of the ai s is nonzero)
2 ax + by = c Cart. plane
cax
2 ax + by = c Cart. plane {(x, b
) | x R} line
Euclidean
3 ax + by + cz = d
3D space
Euclidean daxby
3 ax + by + cz = d {(x, y , c
) | x, y R} plane
3D space
Euclidean daxby
3 ax + by + cz = d {(x, y , c
) | x, y R} plane
3D space
daxcz
{(x, b
, z) | x, z R}
Euclidean daxby
3 ax + by + cz = d {(x, y , c
) | x, y R} plane
3D space
daxcz
{(x, b
, z) | x, z R}
{( dbya cz , y , z) | y , z R}
Euclidean daxby
3 ax + by + cz = d {(x, y , c
) | x, y R} plane
3D space
daxcz
{(x, b
, z) | x, z R}
{( dbya cz , y , z) | y , z R}
Euclidean nD-plane
n a1 x1 + +an xn = b
nD-space (hyperplane)
aij
x +y +z
= 1
S3 = y + 2z = 2
z = 5
x +y +z
= 1
S3 = y + 2z = 2
z = 5
1 S 0 is equivalent to S
2 S 0 is easy to solve
x +y +z
= 1
Eq2 Eq3
x + 2y + 3z = 3
x + 4y + 9z = 3
x +y +z
= 1
Eq2 Eq3 x +y +z
= 1
x + 2y + 3z = 3 x + 4y + 9z = 3
x + 4y + 9z = 3 x + 2y + 3z = 3
x +y +z
= 1
Eq1 2Eq1
x + 2y + 3z = 3
x + 4y + 9z = 3
x +y +z
= 1
Eq1 2Eq1 2x + 2y + 2z
= 2
x + 2y + 3z = 3 x + 2y + 3z = 3
x + 4y + 9z = 3 x + 4y + 9z = 3
Theorem
Two systems have the same solution set if and only if one can be obtained
from the other via elementary operations.
E3 E3 E1
E3 E3 3E2
E3 12 E3
x +y +z
= 1
y + 2z = 2
z = 5
x +y +z
= 1
E2 E2 2E3
y + 2z = 2
z = 5
x +y +z
= 1
E2 E2 2E3 x +y +z
= 1
y + 2z = 2 y = 12
z = 5 z = 5
x +y +z
= 1
E2 E2 2E3 x +y +z
= 1
y + 2z = 2 y = 12
z = 5 z = 5
E1 E1 E2
x +y +z
= 1
E2 E2 2E3 x +y +z
= 1
y + 2z = 2 y = 12
z = 5 z = 5
x
+z = 11
E1 E1 E2
y = 12
z = 5
x +y +z
= 1
E2 E2 2E3 x +y +z
= 1
y + 2z = 2 y = 12
z = 5 z = 5
x
+z = 11
E1 E1 E2
y = 12
z = 5
E1 E1 E3
x +y +z
= 1
E2 E2 2E3 x +y +z
= 1
y + 2z = 2 y = 12
z = 5 z = 5
x
+z = 11
E1 E1 E2
y = 12
z = 5
x
= 6
E1 E1 E3
y = 12
z = 5
x +y +z
= 1
E2 E2 2E3 x +y +z
= 1
y + 2z = 2 y = 12
z = 5 z = 5
x
+z = 11
E1 E1 E2
y = 12
z = 5
x
= 6
E1 E1 E3
y = 12
z = 5
a11 x1 + a12 x2 + + a1n xn = b1 a11 a12 a1n
a21 x1 + a22 x2 + + a2n xn = b2 a21 a12 a2n
.. .. .. .. ..
..
. . . . . .
P
aij xj = bi a
i1 ai2 ain
.. .. .
.. .. .. ..
. . . . .
am1 x1 + am2 x2 + + amn xn = bm am1 am2 amn
a11 x1 + a12 x2 + + a1n xn = b1 a11 a12 a1n
a21 x1 + a22 x2 + + a2n xn = b2 a21 a12 a2n
.. .. .. .. ..
..
. . . . . .
P
aij xj = bi a
i1 ai2 ain
.. .. .
.. .. .. ..
. . . . .
am1 x1 + am2 x2 + + amn xn = bm am1 am2 amn
an m n matrix/array
a11 x1 + a12 x2 + + a1n xn = b1 a11 a12 a1n
a21 x1 + a22 x2 + + a2n xn = b2 a21 a12 a2n
.. .. .. .. ..
..
. . . . . .
P
aij xj = bi a
i1 ai2 ain
.. .. .
.. .. .. ..
. . . . .
am1 x1 + am2 x2 + + amn xn = bm am1 am2 amn
an m n matrix/array
rows - represent m equations
columns - represent n variables
a11 x1 + a12 x2 + + a1n xn = b1 a11 a12 a1n b1
a21 x1 + a22 x2 + + a2n xn = b2 a21 a22 a2n b2
.. .. .. .. .. ..
..
. . . . . . .
P
aij xj = bi a
i1 ai2 ain bi
.. .. .
.. .. .. .. ..
. . . . . .
am1 x1 + am2 x2 + + amn xn = bm am1 am2 amn bm
a11 x1 + a12 x2 + + a1n xn = b1 a11 a12 a1n b1
a21 x1 + a22 x2 + + a2n xn = b2 a21 a22 a2n b2
.. .. .. .. .. ..
..
. . . . . . .
P
aij xj = bi a
i1 ai2 ain bi
.. .. .
.. .. .. .. ..
. . . . . .
am1 x1 + am2 x2 + + amn xn = bm am1 am2 amn bm
an m (n + 1) matrix
x
= 6
S1 = y = 12
z = 5
x
= 6 1 0 0
S1 = y = 12 0 1 0
z = 5 0 0 1
x
= 6 1 0 0 1 0 0 6
S1 = y = 12 0 1 0 0 1 0 12
z = 5 0 0 1 0 0 1 5
x
= 6 1 0 0 1 0 0 6
S1 = y = 12 0 1 0 0 1 0 12
z = 5 0 0 1 0 0 1 5
x +y +z
= 1
S2 = x + 2y + 3z = 3
x + 4y + 9z = 3
x
= 6 1 0 0 1 0 0 6
S1 = y = 12 0 1 0 0 1 0 12
z = 5 0 0 1 0 0 1 5
x +y +z
= 1 1 1 1
S2 = x + 2y + 3z = 3 1 2 3
x + 4y + 9z = 3 1 4 9
x
= 6 1 0 0 1 0 0 6
S1 = y = 12 0 1 0 0 1 0 12
z = 5 0 0 1 0 0 1 5
x +y +z
= 1 1 1 1 1 1 1 1
S2 = x + 2y + 3z = 3 1 2 3 1 2 3 3
x + 4y + 9z = 3 1 4 9 1 4 9 3
x
= 6 1 0 0 1 0 0 6
S1 = y = 12 0 1 0 0 1 0 12
z = 5 0 0 1 0 0 1 5
x +y +z
= 1 1 1 1 1 1 1 1
S2 = x + 2y + 3z = 3 1 2 3 1 2 3 3
x + 4y + 9z = 3 1 4 9 1 4 9 3
x +y +z
= 1
S3 = y + 2z = 2
z = 5
x
= 6 1 0 0 1 0 0 6
S1 = y = 12 0 1 0 0 1 0 12
z = 5 0 0 1 0 0 1 5
x +y +z
= 1 1 1 1 1 1 1 1
S2 = x + 2y + 3z = 3 1 2 3 1 2 3 3
x + 4y + 9z = 3 1 4 9 1 4 9 3
x +y +z
= 1 1 1 1 1 1 1 1
S3 = y + 2z = 2 0 1 2 0 1 2 2
z = 5 0 0 1 0 0 1 5
1 1 1 1
R2 R3
1 2 3 3
1 4 9 3
1 1 1 1 1 1 1 1
R2 R3
1 2 3 3 1 4 9 3
1 4 9 3 1 2 3 3
1 1 1 1
R1 2R1
1 2 3 3
1 4 9 3
1 1 1 1 2 2 2 2
R1 2R1
1 2 3 3 1 2 3 3
1 4 9 3 1 4 9 3
1 4 9 3
1 4 9 3 3 0 5 7
Two matrices are row equivalent if one can be obtained from the other
via elementary row operations.
Notation: A B means A and B are row equivalent matrices.
Two matrices are row equivalent if one can be obtained from the other
via elementary row operations.
Notation: A B means A and B are row equivalent matrices.
Theorem
If two systems are equivalent, then their corresponding augmented
matrices are row equivalent.
To solve a system
1 find its augmented matrix
2 apply row operations to reduce to echelon form
A matrix is in ...
Row Reduced Form (RRF) if
A matrix is in ...
Row Reduced Form (RRF) if
1 All zero rows are at the bottom.
A matrix is in ...
Row Reduced Form (RRF) if
1 All zero rows are at the bottom.
2 The *leading entry of a nonzero row is strictly on the left of the
leading entry of any nonzero row below it.
A matrix is in ...
Row Reduced Form (RRF) if
1 All zero rows are at the bottom.
2 The *leading entry of a nonzero row is strictly on the left of the
leading entry of any nonzero row below it.
*leading entry of a nonzero row - first nonzero entry from the left
A matrix is in ...
Row Reduced Form (RRF) if
1 All zero rows are at the bottom.
2 The *leading entry of a nonzero row is strictly on the left of the
leading entry of any nonzero row below it.
*leading entry of a nonzero row - first nonzero entry from the left
A matrix is in ...
Row Reduced Form (RRF) if
1 All zero rows are at the bottom.
2 The *leading entry of a nonzero row is strictly on the left of the
leading entry of any nonzero row below it.
*leading entry of a nonzero row - first nonzero entry from the left
A matrix is in ...
Row Reduced Form (RRF) if
1 All zero rows are at the bottom.
2 The *leading entry of a nonzero row is strictly on the left of the
leading entry of any nonzero row below it.
*leading entry of a nonzero row - first nonzero entry from the left
RRF?
RRF? No.
RRF? No.
RREF?
RRF? No.
RREF? No.
0 1 0 1 1
RRF?
0 1 0 1 1
RRF? No.
0 1 0 1 1
RRF? No.
RREF?
0 1 0 1 1
RRF? No.
RREF? No.
0 0 0 1
RRF?
0 0 0 1
RRF? Yes.
0 0 0 1
RRF? Yes.
RREF?
0 0 0 1
RRF? Yes.
RREF? No.
0 0 0 1
RRF? Yes.
RREF? No.
pivot columns?
0 0 0 1
RRF? Yes.
RREF? No.
RRF?
RRF? Yes.
RRF? Yes.
RREF?
RRF? Yes.
RREF? No.
RRF? Yes.
RREF? No.
pivot columns?
RRF? Yes.
RREF? No.
0 0 0 1
RRF?
0 0 0 1
RRF? Yes.
0 0 0 1
RRF? Yes.
RREF?
0 0 0 1
RRF? Yes.
RREF? No.
0 0 0 1
RRF? Yes.
RREF? No.
pivot columns?
0 0 0 1
RRF? Yes.
RREF? No.
0 0 0 0 0
RRF?
0 0 0 0 0
RRF? Yes.
0 0 0 0 0
RRF? Yes.
RREF?
0 0 0 0 0
RRF? Yes.
RREF? Yes.
0 0 0 0 0
RRF? Yes.
RREF? Yes.
pivot columns?
0 0 0 0 0
RRF? Yes.
RREF? Yes.
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in in RREF. (B is unique).
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in in RREF. (B is unique).
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in in RREF. (B is unique).
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in in RREF. (B is unique).
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in in RREF. (B is unique).
Theorem
Any A is row equivalent to a matrix B that is in RRF. (B is not unique).
Theorem
Any A is row equivalent to a matrix B that is in in RREF. (B is unique).
(
x1 2x2 = 1
x1 + 3x2 = 3
(
x1 2x2 = 1
x1 + 3x2 = 3
Rule
If there is a pivot in the last column, then the system is inconsistent (no
solution). Otherwise, it is consistent.
Rule
If all columns, except the last, have a pivot, then the solution is unique.
Columns without a pivot correspond to free variables.
(
x1 2x2 = 1
1
x1 + 3x2 = 3
(
x1 + x2 + x3 = 6
2
2x1 + 2x2 + x3 = 8
Given the row reduced augmented matrix of the system, determine how
many solutions there are.
2 1 0 0
0 1 0 1
(a)
0 0 1 2
0 0 0 0
Given the row reduced augmented matrix of the system, determine how
many solutions there are.
2 1 0 0
0 1 0 1
(a)
one
0 0 1 2
0 0 0 0
Given the row reduced augmented matrix of the system, determine how
many solutions there are.
2 1 0 0
0 1 0 1
(a)
one
0 0 1 2
0 0 0 0
2 1 0 0
(b) 0 0 1 2
0 0 0 1
Given the row reduced augmented matrix of the system, determine how
many solutions there are.
2 1 0 0
0 1 0 1
(a)
one
0 0 1 2
0 0 0 0
2 1 0 0
(b) 0 0 1 2 none
0 0 0 1
Given the row reduced augmented matrix of the system, determine how
many solutions there are.
2 1 0 0
0 1 0 1
(a)
one
0 0 1 2
0 0 0 0
2 1 0 0
(b) 0 0 1 2 none
0 0 0 1
" #
2 1 0 1 0
(c)
0 1 0 1 1
Given the row reduced augmented matrix of the system, determine how
many solutions there are.
2 1 0 0
0 1 0 1
(a)
one
0 0 1 2
0 0 0 0
2 1 0 0
(b) 0 0 1 2 none
0 0 0 1
" #
2 1 0 1 0
(c) infinitely many
0 1 0 1 1
1 0 0 6
(b) 0 1 0 3
0 0 1 4
1 0 0 6
(b) 0 1 0 3 SS = {(6, 3, 4)}
0 0 1 4
1 0 0 6
(b) 0 1 0 3 SS = {(6, 3, 4)}
0 0 1 4
1 0 3 4
(c) 0 1 0 2
0 0 0 1
1 0 0 6
(b) 0 1 0 3 SS = {(6, 3, 4)}
0 0 1 4
1 0 3 4
(c) 0 1 0 2 SS =
0 0 0 1
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( , , x3 , x4 ) | x3 , x4 R}
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( x4 , , x3 , x4 ) | x3 , x4 R}
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( x4 , 1 + x3 3x4 , x3 , x4 ) | x3 , x4 R}
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( x4 , 1 + x3 3x4 , x3 , x4 ) | x3 , x4 R}
" #
1 0 0 0 4
2
0 1 0 0 11
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( x4 , 1 + x3 3x4 , x3 , x4 ) | x3 , x4 R}
" #
1 0 0 0 4
2 SS = {( , , x3 , x4 ) | y , z R}
0 1 0 0 11
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( x4 , 1 + x3 3x4 , x3 , x4 ) | x3 , x4 R}
" #
1 0 0 0 4
2 SS = {( 4, , x3 , x4 ) | y , z R}
0 1 0 0 11
Given the RREF of the augmented matrix of the system, write the solution
set explicitly (using free variables, if any).
" #
1 0 0 1 0
1
0 1 1 3 1
SS = {( x4 , 1 + x3 3x4 , x3 , x4 ) | x3 , x4 R}
" #
1 0 0 0 4
2 SS = {( 4, 11, x3 , x4 ) | y , z R}
0 1 0 0 11