1.1 Vector spaces
1.1 Vector spaces
Main Reference:
Main Reference:
Main Reference:
1 Vector spaces
2 Normed spaces
3 Banach spaces
x +y = y +x
x + (y + z) = (x + y ) + z
α(βx) = (αβ)x
1x = x
α(x + y ) = αx + αy
(α + β)x = αx + βx
x + θ = x (θ is called the zero vector)
x + (−x) = θ
Example 1
1) Space Rn : The n-dimensional Euclidean space
* Minkowski inequality:
∞
X 1/p ∞
X 1/p ∞
X 1/p
|xk + yk |p ≤ |xk |p + |yk |p .
k =1 k =1 k =1
Example 1
n o
3) Space `∞ = x = (x1 , x2 , . . .) : sup |xk | < ∞ .
k
4) Space C[a, b]: the set of all continuous functions on [a, b].
Definition 2 (Subspace)
A subspace Y of a vector space X is a nonempty subset such that for
all y1 , y2 ∈ Y and all scalars α, β ∈ R, we have αx + βy ∈ Y .
Remark
Y is itself a vector space.
α1 x1 + α2 x2 + . . . + αn xn
where α1 , . . . , αn ∈ R.
Definition 2 (Subspace)
A subspace Y of a vector space X is a nonempty subset such that for
all y1 , y2 ∈ Y and all scalars α, β ∈ R, we have αx + βy ∈ Y .
Remark
Y is itself a vector space.
α1 x1 + α2 x2 + . . . + αn xn
where α1 , . . . , αn ∈ R.
Definition 2 (Subspace)
A subspace Y of a vector space X is a nonempty subset such that for
all y1 , y2 ∈ Y and all scalars α, β ∈ R, we have αx + βy ∈ Y .
Remark
Y is itself a vector space.
α1 x1 + α2 x2 + . . . + αn xn
where α1 , . . . , αn ∈ R.
Definition 4 (Span)
For any nonempty subset M of X , the set of all linear combinations of
vectors of M is called the span of M, written span M. Thus
Remark
Obviously Y = span M is a subspace of X and we say that Y is
spanned or generated by M.
Definition 4 (Span)
For any nonempty subset M of X , the set of all linear combinations of
vectors of M is called the span of M, written span M. Thus
Remark
Obviously Y = span M is a subspace of X and we say that Y is
spanned or generated by M.
Example 2
Prove that the vectors x1 = (1, 0, 0), x2 = (0, 2, 0), x3 = (0, 0, 3) are
linearly independent in R3 .
Example 2
Prove that the vectors x1 = (1, 0, 0), x2 = (0, 2, 0), x3 = (0, 0, 3) are
linearly independent in R3 .
Remark
If X = {0} then dim(X ) = 0.
Example 3
Prove that dim(Rn ) = n.
Le Ba Khiet, Phd. Faculty of Mathematics & Statistics, TDTU January 8, 2025 9 / 12
1.1 Vector spaces
Definition 6 (Dimension of a space)
A vector space X has its dimension n ∈ N, if X contains a linearly
independent subset of n vectors, whereas any subset of n + 1 or more
vectors is linearly dependent.
Remark
If X = {0} then dim(X ) = 0.
Example 3
Prove that dim(Rn ) = n.
Le Ba Khiet, Phd. Faculty of Mathematics & Statistics, TDTU January 8, 2025 9 / 12
1.1 Vector spaces
Definition 6 (Dimension of a space)
A vector space X has its dimension n ∈ N, if X contains a linearly
independent subset of n vectors, whereas any subset of n + 1 or more
vectors is linearly dependent.
Remark
If X = {0} then dim(X ) = 0.
Example 3
Prove that dim(Rn ) = n.
Le Ba Khiet, Phd. Faculty of Mathematics & Statistics, TDTU January 8, 2025 9 / 12
1.1 Vector spaces
Remark
If B is a basis for X , then every nonzero vector x ∈ X has a unique
representation as a linear combination of elements of B.
Example 4
Find a basis of Rn .
Theorem 1
Let X be an n-dimensional vector space. Then any proper subspace Y
of X has dimension less than n.
Remark
If B is a basis for X , then every nonzero vector x ∈ X has a unique
representation as a linear combination of elements of B.
Example 4
Find a basis of Rn .
Theorem 1
Let X be an n-dimensional vector space. Then any proper subspace Y
of X has dimension less than n.
Remark
If B is a basis for X , then every nonzero vector x ∈ X has a unique
representation as a linear combination of elements of B.
Example 4
Find a basis of Rn .
Theorem 1
Let X be an n-dimensional vector space. Then any proper subspace Y
of X has dimension less than n.
Remark
If B is a basis for X , then every nonzero vector x ∈ X has a unique
representation as a linear combination of elements of B.
Example 4
Find a basis of Rn .
Theorem 1
Let X be an n-dimensional vector space. Then any proper subspace Y
of X has dimension less than n.