Lecture 4
Office hour after lecture: Cupules I 109
Chapter II Finite Dimensional Subspaces
Span and Linear Independence 2A
Definition 2.2
Linear combination
Given a list (a finite list), of vectors . A linear combination of is a vector (Adding vectors with different weights)
Definition 2.4
Span
The set of all linear combinations of is called the span of
Span
Note: When there is a nonzero vector in , the span is a infinite set.
Example:
Consider , find the span of the vector ,
The span is
Theorem 2.6
The span of a list of vectors in is the smallest subspace of containing this list.
Proof:
-
Span is a subspace
- The zero vecor is inside the span by letting all the
- Closure under addition:
- Closure under multiplication:
-
Span is the smallest subspace containing the given list.
For each ,
If is a subspace of containing , then is closed under addition and scalar multiplication.
Thus for any . So
Definition 2.ex.1
Spanning set
If a vector space , then we say spans , which is the spanning set of .
A vector space is called finite dimensional if it spanned by a finite list.
Example:
is finite dimensional
Definition
Polynomial
A polynomial is a function such that
Let be the set of polynomials over , then has the structure of a vector space.
If we consider the degree of polynomials, then , with degree
is a infinite dimensional vector space.
Let be the set of polynomials of degree at mote , then is a finite dimensional vectro space.
Linear independence
How to find a "good" spaning set for a finite dimensional vector space.
Example:
Definition 2.15
A list of vector in is called linearly independent if the only choice for such that is
If not, then there must that can be expressed by other vectors in the set.