Linear Algebra I (2020 Fall)
Linear Algebra I (2020 Fall)
Lecture 4.
Recall : Let be a vector space over a field and let be a nonempty subset of .
if and only if ∈ ;
∈ for any ∈ ;
an elementary but very useful method to construct subspaces of a given vector space.
Example : Let ℝ ∈ℝ .
(3) We can find all elements in . Indeed, let ∈ . Then and .
So, we have
.
the set of all “ -linear combinations” of the two vectors and .
Definition : Let be a vector space over a field .
⋯ for some … ∈ .
The set span the set consisting of all linear combinations of the vectors in
⋯ … ∈
is called the span of .
The set span the set consisting of all linear combinations of the vectors in
⋯ ≥ … ∈ … ∈
is called the span of .
Theorem 1.5. : Let be a non-empty subset of a vector space .
(1) For … , we have to check the following three conditions of span .
∈ span ;
⋯ if ⋯ . Thus ∈ span .
Then ⋯ ∈ span .
※ Note that
⇒ span ⊂ span
∈
(1) is a subspace of .
(2) If ∈ , then and . Therefore we have
.
the set
of two vectors.
※ ∈
∈ℝ .
◎ Relationship to Systems of Linear Equations
⇒ How to determine
.
Now, our problem is equivalent to find … ∈ℝ such that (⋆) .
Example 1. : (Continued)
To solve the system of linear equations (⋆) ,
⇒ ⇒
⇒ ⇒
⇒ is a solution of (⋆).
.
Summary : , , ,
is a linear combination of …
⇔ (⋆) has at least one solution.
Remark : To solve a “system of linear equations”, which kind of operations are allowed?
⇒ ⇒
⇒ ⇒
Type 2 : Adding a constant multiple of any equation to another equation in the system
(1) ∈ ℝ
and hence
.
Thus .
Example 2. : ∈ ℝ
(2) ∈ ℝ
and hence
.
(Equivalently, ℝ is generated by . )
.