Vector Spaces

Ms. Do Thi Phuong Thao

Fall 2012
Vector Spaces 1
Vector Spaces
Subspaces
Basis and Dimensions
Vector spaces 2
Coordinates (reading)
Summary of Row-equivalence (reading)
Computations Concerning Subspaces
(reading)

Example
Vector OP, a directed line segment from the
origin O to P : P(x
1
, y
1
)

P
x
y
x
1
y
1
O
Example
The sum of two vectors OP and OQ
P
x
y
x
1
y
1
O
x
2
x
1
+x
2
y
2
y
1
+y
2
Q
T
Example
Scalar multiplication
P
x
y
x
1
y
1
O
cx
1
cy
1
Q
Example
Addition is commutative
Addition is associative
Vector 0
1 =
(c
1
c
2
) = c
1
(c
2
)
c( + ) = c + c
(c
1
+ c
2
) = c
1
+ c
2

Definition
A vector space V is a set that is closed under
vector addition and scalar multiplication.
Addition:
Commutativity: X + Y = Y + X
Associativity: (X + Y) + Z = X + (Y + Z)
Vector 0 is unique: 0 + X = X
Vector X is unique: X + (-X) = 0
Definition
Scalar multiplication:
Associativity: r(sX) = (rs)X
Distributivity: (r + s)X = rX + sX
Distributivity: r(X + Y) = rX + rY
Scalar multiplication identity: 1X = X
Examples
R
2
set of vectors in plane
R
3
set of vectors in space
The n-tuple space F
n
The space of m x n matrices, F
m x n
The space of polynomial functions:

Definition
vector in V is said to be a linear
combination of the vectors 1,,n in V
provided there exist scalars c1,,cn in F
such that:
Example
P(x
1
, y
1
) , X(1,0), Y(0,1):


P
x
y
x
1
y
1
O
Y
X
OY y OX x OP . .
1 1

Content
Vector Spaces
Subspaces
Basis and Dimensions
Coordinates (reading)
Summary of Row-equivalence (reading)
Computations Concerning Subspaces
(reading)
Definition
Let V be a vector space over the field F.
A subspace of V is a subset W of V which is
itself a vector space over F with the
operations of vector addition and scalar
multiplication on V.
Theorem
A non-empty subset W of V is a subspace of
V if and only if for each pair of vectors , in
W and each scalar c in F the vector c + is
again in W.
Examples
If V is any vector space, V is a subspace of V; the subset
consisting of the zero vector alone is a subspace of V,
called the zero subspace of V.
In F
n
, the set of n-tuples (x
1
, . . . , x
n
) with x
1
= 0 is a
subspace; however, the set of n-tuples with x
1
= 1 + x
2
is
not a subspace (n > 1).
The space of polynomial functions over the field F is a
subspace of the space of all functions from F into F.
An n x n (square) matrix A over the field F is symmetric if
A
ij
= A
ji
for each i and j. The symmetric matrices form a
subspace of the space of all n X n matrices over F.
Theorem

Definition
Let S be a set of vectors in a vector space V.
The subspace spanned by S is defined to be
the intersection W of all subspaces of V
which contain S.
When S is a finite set of vectors, S =
{1,,n}, we shall simply call W the subspace
spanned by the vectors 1,,n.
Theorem
The subspace spanned by a non-empty
subset S of a vector space V is the set of all
linear combinations of vectors in S.
Content
Vector Spaces
Subspaces
Basis and Dimensions
Coordinates (reading)
Summary of Row-equivalence (reading)
Computations Concerning Subspaces
(reading)
Linearly Independent
Let V be a vector space over F. A subset S of
V is said to be linearly dependent (or simply,
dependent) if there exist distinct vectors
1
,

2
, . . . ,
n
in S and scalars c
1
, c
2
, . . . , c
n
in
F, not all of which are 0, such that:
c
1

1
+ c
2

2
+ +c
n

n
= 0
A set which is not linearly dependent is called
linearly independent.
Example of linearly dependent

Example of linearly independent

Some consequences of definition
Any set which contains a linearly
dependent set is linearly dependent.
Any subset of a linearly independent set is
linearly independent.
Any set which contains the 0 vector is
linearly dependent; for 1 * 0 = 0.
A set X of vectors is linearly independent if
and only if each finite subset of S is
linearly independent, i.e., if and only if for
any distinct vectors
1
,
2
, . . . ,
n
, of X,
c
1

1
+ c
2

2
+ +c
n

n
= 0 implies each c
i
= 0
Basis and dimension
A basis of a vector space V is defined as a
subset of vectors in that are linearly
independent and span vector space V.
The space V is finite-dimensional if it has
a finite basis.
We define the dimension of a finite-
dimensional vector spaces as the number of
elements in a basis for V . We shall denote
the dimension of space V by dimV.
Theorem
Let V be a vector space which is
spanned by a finite set of vectors
1
,
2
. . ,

n
. Then any independent set of vectors in
V is finite and contains no more than n
elements.
Summary of Vector space 1

Vector spaces
Subspaces
Span
Linearly
independent
Basis and
dimensions
Thats all for today.
Thank you for your attention.