Lecture 2 LinAlg
Lecture 2 LinAlg
Lecture 2 LinAlg
∗
based on slides kindly provided by Dr. Francesca Bianchi and Dr. Martin Djukanović
a11 x1 + · · · + a1n xn = b1
a21 x1 + · · · + a2n xn = b2
..
.
am1 x1 + · · · + amn xn = bm
Theorem
Applying elementary row operations to the augmented matrix does not
change the solution set of the corresponding linear system.
Theorem
The reduced (row) echelon form of a matrix can be obtained by applying
elementary row operations and it is unique.
We can use the reduced echelon form of the augmented matrix to easily
determine the solution set of the linear system.
The vector all of whose entries are zero is called the zero vector and
denoted by 0.
Vectors in Rn can be thought of as two pieces of information:
1) a direction
2) a magnitude or length
This concept can be depicted with the standard arrows when n ≤ 3.
√ √
v = 3, − 3v v
x
√ 0
− 3v = −3
v = (−2, 1) x
v
1
v
v = (3, 1) 2
− 21 v x
1 3 1
v= ,
2 2 2
1 3 1
− v = − ,−
2 2 2
v1
Here −u = (−1) · u.
Example
On slide 14, v and 12 v have the same direction and v and − 21 v have
opposite directions.
i.e.
(α1 + 6α2 , 2α1 + 4α2 , −α1 + 2α2 ) = (9, 2, 7).
In other words, we need to solve the following linear system in α1 , α2 :
α1 + 6α2 = 9
2α1 + 4α2 = 2
−α1 + 2α2 = 7
We conclude that
Definition
If A is an m × n matrix, with columns a1 , · · · , an , and if x ∈ Rn , then the
product of A and x, denoted by Ax, is the linear combination of the
columns of A using the corresponding entries in x as coefficients; that is,
x1
..
Ax = [a1 a2 . . . an ] . = x1 a1 + x2 a2 + · · · + xn an .
xn
Example
−2
2 5 0 1 1 = −2 2 + 1 5 + 0 0 + −1 1 = 0
3 −1 1 −3 0 3 −1 1 −3 −4
−1
Vectors and Linear Systems Linear algebra for IEM 24 / 32
For a given m × n matrix A and a given b vector in Rm find x ∈ Rn such
that Ax = b. The equation Ax = b is called a matrix equation.
Theorem
If A is an m × n matrix, with columns a1 , · · · , an , and if b ∈ Rm , the
matrix equation
Ax = b,
that is
x1 a1 + x2 a2 + · · · + xn an = b
has the same solution set as the system of linear equations whose
augmented matrix is [a1 a2 . . . an b].
Note: The theorem says that the matrix equation Ax = b has at least one
solution if and only if b is a linear combination of the columns of A; that
is, b ∈ Span{a1 , . . . , an }.
Example
Let α be any scalar. Then:
2 1 0
=2 +α
4 2 0
3 1 1 0
−4 = α 0 + (3 − α) −2 + (1 − α) 2
5 1 2 −1
Example
The following vectors in Rm :
v = v1 e1 + v2 e2 + · · · + vn em .
or, equivalently,
or, again,
Ax = b,
1 1 −3
where x = (x1 , x2 , x3 ) and A = 0 2 −2.
1 1 −3