4.1 Vector Spaces and Subspaces
4.1 Vector Spaces and Subspaces
4.1 Vector Spaces and Subspaces
Vector Space
Geometric Representation of :
a+b
a
b
Algebraic Representation of :
Let S be the space of all vectors of the form (2a, 0, a) in R3 :
S = {(2a, 0, a) | a in R}.
The set of all polynomials of degree at most n is a vector space
denoted by Pn . In other words, Pn consists of all polynomials of the form
an xn + an−1 xn−1 + · · · + a1 x + a0 ,
Fact
Null Space
Theorem
Theorem
Fact
If A is an m × n matrix, then:
Linear Transformation
The range of T is the set of all vectors b in W such that T x = b for some x
in V .
Z 1
T (p(x)) = p(x) dx.
0
Show that T is a linear transformation and compute the kernel and the range
of T .
4.3 LINEARLY INDEPENDENT SETS; BASES
Linearly Independent Set
c1 v1 + c2 v2 + · · · + ck vk = 0 (1)
Facts
2. A set of two vectors is linearly dependent if and only if one of the vectors
is a multiple of the other.
Theorem
Example 1: The set {sin t, cos t} is a linearly independent set in the vector
space C[0, 2π].
Example 2: The set {sin 2t, sin t cos t} is linearly dependent in the vector
space C[0, 2π].
Example 3: Is the set {1, t, 3 − 5t} linearly independent in the vector space
C[0, 1]?
B = {1, x, x2 , . . . , xn }.
Theorem
Theorem
Example 7:
1 2 0 −4
0
0 0 0 0 0
A=
0 0 −1 2 0
0 0 0 0 5
0 0 0 0 1
Remark