0% found this document useful (0 votes)
2 views62 pages

Chapter Two Vector Spaces

Chapter Two discusses vector spaces, defining them as nonempty sets with operations of vector addition and scalar multiplication that satisfy specific axioms. It provides examples of vector spaces, including spaces of vectors, polynomials, matrices, and functions, and introduces concepts like linear combinations and spanning sets. The chapter also defines subspaces as subsets of vector spaces that themselves form vector spaces under the same operations.

Uploaded by

cherudawit
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views62 pages

Chapter Two Vector Spaces

Chapter Two discusses vector spaces, defining them as nonempty sets with operations of vector addition and scalar multiplication that satisfy specific axioms. It provides examples of vector spaces, including spaces of vectors, polynomials, matrices, and functions, and introduces concepts like linear combinations and spanning sets. The chapter also defines subspaces as subsets of vector spaces that themselves form vector spaces under the same operations.

Uploaded by

cherudawit
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Chapter Two:

Vector Spaces

Department of
Mathematics

Chapter Two: Vector Spaces

Department of Mathematics

Adama Science and Technology University

October 28, 2025


Chapter Two:
Vector Spaces

Department of
Mathematics
This chapter introduces the underlying structure of linear
algebra, that of a finite dimensional vector spaces.
The definition of a vector space V , whose elements are
called vectors, involves an arbitrary field, K , whose
elements are called scalars.
The following notations will be used (unless and otherwise
stated):
V the given vector space
u, v , w vectors in V
K the given number field
a, b, c or k ‘ scalars in K .
Chapter Two: 2.1 Definition and Examples The following defines the
Vector Spaces
notion of vector space V over a scalar field K :
Department of
Mathematics
Definition
Let V be nonempty set with two operations:
(i.) Vector addition : This assigns to any u, v ∈ V , their sum
u+v ∈v
(ii.) Scalar multiplication : this assigns to any u ∈ V , k ∈ K , a
product ku ∈ V
Then V is called a vector space (over a field K ) if the following
axioms hold for any vectors u, v , w ∈ v :
A1 . (u + v ) + w = u + (v + w )
A2 . There is a vector in V , denoted by 0 and called the zero
vector, such that for any vector u ∈ V ,

u+0=0+u =u
Chapter Two:
Vector Spaces

Department of Definition (cont 0 d)


Mathematics

A3 . for each u ∈ V , there is a vector in V , denoted by −u,


called the negative of u such that

u + (−u) = 0 = (−u) + u

A4 . u + v = v + u
A5 k(u + v ) = ku + kv for any scalar k ∈ K .
A6 . (a + b)u = au + bu for any scalars a, b, ∈ K
A7 . a(bu) = (ab)u, for any scalars a, b ∈ K
A8 . 1u = u, for the unit scalar 1 ∈ K .
Chapter Two:
Vector Spaces The above axioms naturally split in to two sets
Department of
Mathematics
Axioms A1 − A4 (concerned only on ” + ”)indicates that
(V , +) is an abelian group.
The remaining axioms A5 − A8 are the actions of the field
K on V .
Now, we have the following theorem
Theorem
Let V be a vector space over a field K .
(i.) For any scalar k ∈ K and 0 ∈ V , k0 = 0
(ii.) For 0 ∈ K and u ∈ V , 0u = 0
(iii.) If ku = 0 (k ∈ K , v ∈ V ), then k = 0 or u = 0.
(iv .) For any k ∈ k, and any u ∈ V , (−k)u = k(−u) = −ku
Chapter Two:
Vector Spaces

Department of
Proof:
Mathematics
(i.) Let k ∈ K and 0 ∈ V , then

k0 = k(0 + 0) = k0 + k0 =⇒ k0 = 0

(ii.) Let 0 ∈ K , v ∈ V , then

0v = (0 + 0)v = 0v + 0v =⇒ 0v = 0

(iii.) Suppose ku = 0 and k 6= 0, then k −1 ∈ K and


kk −1 = k −1 k = 1, hence

u = 1.u = (k −1 k)u = k −1 (ku) = k −1 0 = 0


Chapter Two:
Vector Spaces

Department of
Mathematics

(iv.) Let k ∈ K , u ∈ V . Using u + (−u) = 0 and k + (−k) = 0,


we have
0 = k0 = k(u + (−u)) = ku + k(−u) =⇒ k(−u) = −ku
0 = 0u = (k + (−k))u = ku + (−k)u =⇒ (−k)u = −ku
Hence
k(−u) = −ku = (−ku)
Chapter Two: Examples:
Vector Spaces

Department of
1. [Space K n ] Let K be any field and consider
Mathematics
K n = {(a1 , a2 , · · · , an ) : ai ∈ K ∀i}
Then K n is a vector space over K with addition and scalar
multiplication defined by :
Vector addition:

(a1 , a2 , · · · , an ) + (b1 , b2 , · · · , bn ) = (a1 + b1 , , · · · , an + bn )

Scalar Multiplication:

k(a1 , a2 , · · · , an ) = (ka1 , ka2 , · · · , kan )

Here, we have
the zero vector is 0 = (0, 0, · · · , 0)
the negative of the vector −(a1 , a2 , · · · , an ) is
(−a1 , −a2 , · · · , −an )
Chapter Two:
Vector Spaces

Department of
Mathematics 2. [Polynomial Space P(t)] Let P(t) dnote the set of all
polynomials of the form

p(t) = a0 + a1 t + a2 t 2 + · · · + an t n , n = 1, 2,

where the coefficients ai ∈ K . Then P(t) is a vector space


with the following operations
Vector Addition: Here p(t) + q(t) ∈ P(t) is the usual
addition of polynomials
Scalar Multiplication: Here kp(t) in P(t) is the usual
product of a scalar k and a polynomial p(t).
The zero polynomial 0 is the zero vector in P(t).
Chapter Two:
Vector Spaces 3. [Matrix space Mn×m ]
Department of
Mathematics Mn×m = the set of all n × m matrices with entries
n the filed K

with the usual matrix addition and scalar multiplication of


matrices is a vector space.
4. [Function Space F (X )]
Let X be anon empty set and K be arbitrary field. Put

F (X ) = set of all functions X → K

with
Vector addition: (f + g )(x) = f (x) + g (x)
Scalar multiplication : (kf )(x) = kf (x)
is a vector space.
Chapter Two:
Vector Spaces

Department of
Mathematics 5 [Polynomial Space Pn (t)]
Let

Pn (t) = the set of polynomials p(t) over a field K , whose


degree less than or equal to n

i.e
p(t) = a0 + a1 t + a2 t 2 + · · · + as t s , s ≤ n
Then, Pn (t) is a vector space over K with the usual
operation of addition of polynomials and multiplication of
polynomials by a constant.
Chapter Two:
Vector Spaces 2.2 Linear combinations, Spanning Set
Department of
Mathematics Definition
Let V be a vector space over a field K . A vector v in V is said
to be a linear combination of vectors u1 , u2 , · · · , un in V , if
there exist scalars a1 , a2 , · · · , an in K such that

v = a1 u1 + a2 u2 + · · · + an un

Alternatively, v is called a linear combination of the vectors


u1 , u2 , · · · , un if there is a solution to the vector equation

v = x1 u1 + x2 u2 + · · · + xn vn

where x1 , x + 2, · · · , xn are unknown scalars.


Chapter Two: Examples:
Vector Spaces
1. Write v = (3, 7, −4) in R3 asa linear combination of
Department of
Mathematics u1 = (1, 2, 3), u2 = (2, 3, 7), u3 = (3, 5, 6)
Solution: We seek scalars x, y , z such that
v = xu1 + yu2 + zu3
       
3 1 2 3
i.e  7  = x 2 + y 3 + z 5 or
    
−4 3 7 6
x + 2y + 3z = 3
2x + 3y + 5z = 7
3x + 7y + 6z = −4
Solving simultaneously yields x = 2, y = −4, z = 3 Thus,
v = 2u1 − 4u2 + 3u3
Chapter Two:
Vector Spaces

Department of 2. Let V = P(t) (The Polynomial Space) . Write the


Mathematics
polynomial v = 3t 2 + 5t − 5 as a linear combination of

p1 = t 2 + 2t + 1, p2 = 2t 2 + 5t + 4, p3 = t 2 + 3t + 6

Solution: We seek scalars x, y , z such that

v = xp1 + yp2 + zp3

i.e

(3t 2 + 5t − 5) = x(t 2 + 2t + 1) + y (2t 2 + 5t + 4) + z(t 2 + 3


= (x + 2y + z)t 2 + (2x + 5y + 3z)t + (x + 4y
Chapter Two:
Vector Spaces

Department of
Set coffecients of the same powers of t equal to each other
Mathematics
which yields the linear system

x + 2y + z = 3
2x + 5y + 3z = 5
x + 4y + 6z = −5

Solving these simultaneous equation, we obtain

x = 3, y = 1, z = −2

And hence
v = 3p! + p2 − 2p3
Chapter Two:
Vector Spaces

Department of
Mathematics
Spanning Set
Definition
Let V be a vector space over a field K . Vectors u1 , u2 , · · · , un
in V are siad to be span V or to form a spanning set(set of
generators) if every v in V is a linear combination of the
vectors u1 , u2 , · · · , un -that is , there exist scalars a1 , a2 , · · · , an
such that
v = a1 u1 + a2 u2 + · · · + an un
Chapter Two:
Vector Spaces

Department of The following remarks follow directly from the definition:


Mathematics

Remark

1 Suppose u1 , u2 , · · · , un span V , then for any vector w , the


set w , u1 , u2 , · · · , un also span V .
2 Suppose u1 , u2 , · · · , un span V and suppose uk is a linear
combination of the other u 0 s. Then the u 0 s without the uk
also span V .
3 Suppose u1 , u2 , · · · , un span V and suppose that one of
the u 0 s is the zero vector, the the u 0 s without the zero
vector also span V .
Chapter Two: Examples:
Vector Spaces
1. Consider V = R3 . then the vectors
Department of
Mathematics
e1 = (1, 0, 0), e2 = (0, 1, 0), e3 = (0, 0, 1)
Span V .
Solution: Here, let v = (a, b, c) be any vector in R3 , then
v = (a, b, c) = ae1 + be2 + ce3
Hence , {e1 , e2 , e3 } span V .
2. Consider V = R3 and let
w1 = (1, 1, 1), w2 = (1, 1, 0), w3 = (1, 0, 0)
Then , w1 , w2 , w3 span V .
Solution: Let v = (a, b, c) ∈ R3 , then
v = cw1 + (b − c)w2 + (a − b)w3
Hence, {w1 , w2 , w3 } span V .
Chapter Two:
Vector Spaces
3. Let V = R3 and consider
Department of
Mathematics
v1 = (1, 2, 3), v2 = (1, 3, 5), v3 = (1, 5, 9)
Then, {v1 , v2 , v3 } do not span V .
In fact, here, the vector v = (2, 7, 8) cannot be written as
a linear combination of v1 , v2 , v3 .
4. consider the vector space V = Pn (t) consisting of all
polynomials of degree ≤ n. Then, clearly
a. Clearly, every polynomial in Pn (t) can be written as a
linear combination of
1, t, t 2 , · · · , t n
Hence, 1, t, t 2 , · · · , t n forms a spanning set for Pn (t).
b. Moreover, the set of vectors
1, 1 − c, (1 − c)2 , · · · , (1 − c)n , c any scalar
is also a spanning set for Pn (t).
Chapter Two:
Vector Spaces

Department of
5. Consider the vector space V = M2×2 (R) consisting of the
Mathematics set of all 2 × 2 matrices whose entries from R, and
consider the following four matrices
   
1 0 0 1
E11 = , E12 = ,
0 0 0 0
   
0 0 0 0
E21 = , E22 =
1 0 0 1
 
a b
Then, clearly every matrix A = can be written as
c d

A = aE11 + bE12 + cE21 + dE22

Hence, E11 , E12 , E21 , E22 is a spanning set for M2×2 (R)
Chapter Two:
Vector Spaces
2.3 Subspaces
Department of
Mathematics This section introduces the important notion of a subspace.
Definition
Let V be a vector space over a field K and let W be a subset
of V . Then W is a subspace of V if W itself is a vector space
over K with respect to the operation of vector addition and
vector scalar multiplication on V .

So, to show that W is a vector space


One has to show that all the eight axioms holds for
elements of W
In fact, some of the axioms automatically holds in w , since
they are true in V , (A1 , A4 − A8 )
Chapter Two:
Vector Spaces A simple criteria to show that W is a subspace is given by the
Department of following theorem.
Mathematics
Theorem
Suppose W ⊆ V . Then W is a subspace of V if the following
two conditions hold:
(a.) The zero vector 0 ∈ W .
(b.) For any u, v ∈ W , k ∈ K , then
(i.) u + v ∈ W
(ii.) ku ∈ W

That means, W is a subspace if it contains the zero vector and


closed under vector addition and scalar multiplication. We can
combine these two properties to a single statement as follows:
(b’.) For any u, v ∈ W , a, b ∈ K , au + bv ∈ W .
Chapter Two: Examples:
Vector Spaces

Department of
1. For any vector space V , then {0} and V itself are
Mathematics subspace of V .
2. Consider the vector soace V = R3
(a.) Let U = {(a, b, c) ∈ R3 : a = b = c}. Show that U is a
subspace of V .
Solution: Let u = (a, b, c) and v = (a0 , b 0 , c 0 ) belongs to
U, then
a = b = c, and a0 = b 0 = c 0
For any k, k 0 ∈ K

ku + k 0 v = (ka + k 0 a0 , kb + k 0 b 0 , kc + k 0 c 0 )

and
ka + k 0 a0 = kb + k 0 b 0 = ck + c 0 k 0
Clearly, 0 = (0, 0, 0) ∈ U.
Hence, U is a subspace of V .
Chapter Two:
Vector Spaces

Department of
Mathematics

(b.) Let W be any plane in R3 passing through the origin, then

The origin ) = (0, 0, 0) ∈ W , since it passes through the


origin.
Let u and v be vectors in W ,the sum u + v and a scalar
multiple ku also belongs to W .
Hence, W is a subspace of R3 .
Chapter Two:
Vector Spaces
3. Let V = Mn×n be the vector spaces of n × n matrices.
Department of
Mathematics Let W1 be the subset of (all) uper triangular matrices and
W2 be the subset of all symmetric matrices,
then W1 and W2 are subspaces of V . [Verify!]
4. Let V = P(t), the vector space P(t) of polynomials. Then

the space Pn (t) of polynomials of degree at most n


let Q(t) be the set of polynomials of with only even
powers of t
are subspaces of V .[Verify!]
5. Let V be the vector space of real valued functions, then
W1 = the subset of all continous functions
W2 = the subset of all differentiable functions
are subspsces of V .
Chapter Two:
Vector Spaces

Department of
Mathematics Intersection of Subspace
Let U and V be subspaces of a vetor space V . We will show
that the intersection U ∩ V is a subspace of V . In fact, here
0 ∈ U and 0 ∈ W , hence 0 ∈ U ∩ W .
Let u, w ∈ U ∩ W , a, b ∈ K =⇒ U, w ∈ U, W , hence

au + bw ∈ U, W and au ∈ U, W

Hence
au + bw , au ∈ U ∩ W
The above result yields the following thorem.
Chapter Two:
Vector Spaces

Department of
Theorem
Mathematics
The intersection of any number of subspaces of a vector space
V is a subspace of V .

Linear Spans
Recall that, For any vectors u1 , u2 , · · · , un , any vector of the
form
a1 u1 + a2 u2 + · · · + an un
where ai are scalars is called the linear combination of
u1 , u2 , · · · , un
The collection of such linear combinations is denoted by

Span{u1 , u2 , · · ·n } or Span{ui }
Chapter Two: Regarding Span{ui } , we have
Vector Spaces

Department of
The zero vector is written as
Mathematics

0 = 0u1 + 0u2 + · · · + 0un ∈ Span{ui }

Furthermore,suppose v , v 0 ∈ Span{ui }, then

v = a1 u1 +a2 u2 +· · ·+an un and v 0 = b1 u1 +b2 u2 +· · ·+bn un

Then

v + v 0 = (a + 1 + b1 )u1 + (a2 + b2 )u2 + · · · + (an + bn )un

and
kv = (ka1 )u1 + (ka2 )u2 + (kan )un
Hence, v + v 0 , kv ∈ Span{ui }. Accordingly, Span{ui } is a
subspace of V .
Chapter Two:
Vector Spaces

Department of More generally, for any subset S of V


Mathematics
Span(S) contains the set of all linear combination of
members of S.
If S = ∅, then Span(S) = {0}.
In particular, S is a spanning set of Span(S).
Now, we have the following theorem
Theorem
Let S be a subset of a vector space V , then
(a.) Then Span(S) is a subspace of V that contain S.
(b.) If W is a subspace of V containing S, then Span(S) ⊆ W .
Chapter Two:
Vector Spaces
2.4. Linear Dependence and Independence of Vectors
Department of
Mathematics Let V be a vector space over a field K . The following defines
the notion of linear dependence and linear independence of
vectors:
Definition
We say that the vectors v1 , v2 , · · · , vm in V are linearly
dependent if there exist scalars a1 , a2 , · · · , am in K , not all of
them 0, such that

a1 v1 + a2 v2 + · · · + am vm = 0

Otherwise, we say that the vectors are linearly independent.

We are interested in linearly independent vectors


Chapter Two:
Vector Spaces

Department of
Mathematics

In other words, a set of vectors v1 , v2 , · · · , vn in V are said


to be linearly independent if

a1 v1 + a2 v2 + · · · + an vn = 0 =⇒ a1 = a2 = · · · = an = 0

A set S = {v1 , v2 , · · · , vn } of vectors in V is linearly


independent or dependent according to whether the
vectors v1 , v2 , · · · , vm (for 1 < m ≤ n) are linearly
independent or independent.
Chapter Two: From the definition, we have the following remarks:
Vector Spaces

Department of 1. Suppose 0 is one of the vectors v1 , v2 , · · · , vm , say v1 = 0,


Mathematics
then the vectors must be linearly dependent, because put
a1 = 1 and ai = 0 ∀2 ≤ i ≤ m, then

1.v1 + 0.v2 + · · · + [Link] = 0

2. Suppose v is nonzero vector. Then v , by itself, is linearly


indepedent, since

kv = 0, v 6= 0, =⇒ k = 0

3. Two vectors v1 and v2 are linearly dependent if one of


them is a scalar multiple of the other. i.e

v2 = kv1 (∃k ∈ K )
Chapter Two:
Vector Spaces
3. Suppose two of the vectors v1 , v2 , · · · , vm are equal or one
Department of
Mathematics of them is a scalar multiple of the other, say v1 = kv2 ,
then the vectors are linearly dependent. (here we put
a1 = 1, a2 = −k, aj = 0 for all 3 ≤ j ≤ m) and

v1 − kv2 + 0.v3 + · · · + [Link] = 0

4. If the set {v1 , v2 , · · · , vm } is linearly independent, then


any rearrangment of the vectors {vi1 , vi2 , · · · , vin } is also
linearly independent.
5. If a set S of vectors is linearly independent, then any
subset of S is linearly independent. Alternatively, if S
contains a linearly dependent subset, then S is linearly
dependent.
Chapter Two:
Vector Spaces

Department of
Mathematics
Example
Let u = (1, 1, 0), v = (1, 3, 2) and w = (4, 9, 5). Then u, v , w
are linearly dependent.

Solution
Here,

3u + 5v − 2w = 3(1, 1, 0) + 5(1, 3, 2) − 2(4, 9, 5)


= (0, 0, 0) = 0
Chapter Two:
Vector Spaces

Department of Example
Mathematics

The vectors u = (1, 2, 3), v = (2, 5, 7), w = (1, 3, 5) are


linearly independent.

Solution:
Consider the equation

xu + yv + zw = 0

Hence        
1 2 1 0
x 2 + y 5 + z 3 = 0
      
3 7 5 0
Chapter Two:
Vector Spaces

Department of
Mathematics
This yields the system

x + 2y + z = 0
2x + 5y + 3z = 0
3x + 7y + 5z = 0

Solving the system, we obtain the solution

x =y =z =0

Hence, u, v , w are linearly independent


Chapter Two:
Vector Spaces
Example
Department of
Mathematics Let V = space of functions from R → R. The vectors

v1 (t) = sin t, v2 (t) = e t , v3 (t) = t 2

are linearly independent.

Solution: Let x, y , z be unknown variables and consider the


vector equation
xv1 + yv2 + zv3 = 0
This means that

x sin t + ye t + zt 2 = 0 for any t ∈ R

Now, we substitute different values of t to obtain x, y , z :


Chapter Two:
Vector Spaces

Department of
Now put
Mathematics
t = 0, we have

x sin 0 + ye 0 + z02 = 0 =⇒ y = 0

t = π, we have

x sin π + 0e π + zπ 2 = 0 =⇒ z = 0

Finally, t = π2 , we have
π π π
x sin + 0.e 2 + 0.( )2 = 0 =⇒ x = 0
2 2
Hence, v1 , v2 , v3 are linearly independent.
Chapter Two:
Vector Spaces Exercises:
Department of 1 Check whether the following vecctors in R3 are linearly
Mathematics
independent or linearly dependent.
a. u = (2, 0, 0), v = (3, 2, 0), w = (4, 2, 1)
b. u = (1, 1, 2), v = (2, 3, 1), w = (4, 5, 5)
2 Let V = P(t) set of polynomials, determine whether the
following are linearly dependent or linearly independent.
a. u = 2t 2 + 4t − 3, v = 4t 2 + 8t − 6
b. u = 2t 2 + 3t − 4, v = 4t 2 − 3t + 2
3 Let V = set of all functions R → R. Show that the
functions

f (t) = sin t, g (t) = cos t, h(t) = t

are linearly independent.


Chapter Two: Linear Dependence and Linear Combination:
Vector Spaces
The notions of linear dependence and linear combinations are
Department of
Mathematics closely related. Specifically, for more than one vector, we show
that the vectors v1 , v2 , · · · , vm are linearly dependent if and
only if one of them is a linear combination of the others.
Suppose v1 , v2 , · · · , vm are linearly dependent, say

b1 v1 + b2 v2 + · · · + bm vm = 0 with bj 6= 0 for some j

Then

vj = bj−1 (b1 v1 ) + bj−1 (b2 v2 ) + bj−1 (bj−1 vj−1 )


+ bj−1 (bj+1 vj+1 ) + bj−1 (bm vm )

Hence, vj is a linear combination of


v1 , v2 , · · · , vj−1 , vj+1 , · · · , vm
Chapter Two:
Vector Spaces

Department of
Mathematics
On the other hand, Suppose vi is a linear combination of
the others,say

vi = b1 v1 + b2 v2 + · · · + bi−1 vi−1 + bi+1 vi+1 + · · · bm vm

Then, by adding −vi on both sides yields

b1 v1 + b2 v2 + · · · bi−1 vi−1 − vi + bi+1 vi+1 + · · · + bm vm = 0

where the coefficient of vi 6= 0 is not 0.


Hence, v1 , v2 , · · · , vm are linearly dependent.
Chapter Two:
Vector Spaces
2.5 Basis and Dimension of Vector Spaces
Department of
Mathematics
First we state two equivalent ways to define a basis of a vector
space V .
Definition
A set S = {u1 , u2 , · · · , un } of vectors is a basis of V if it has
the following properties:
(i.) S span V .
(ii.) S is linearly independent

Definition
A set S = {u1 , u2 , · · · , un } of vectors is a basis of V if every
v ∈ V can be uniquely written as a linear combination of the
basis vectors u1 , u2 , · · · , un .
Chapter Two:
Vector Spaces

Department of
Mathematics The following is a fundamental result in linear algebra
Theorem
Let V be a vector space such that one basis has m elements
and another basis has n elements. Then m = n.

Call a vector space V has a finite dimension n (written


Dim(V ) = n)(or n − dimesional) if V has a basis of
n − elements.
The above thorem tells us that all basis of a vector space
has the same number of elements.
Chapter Two:
Vector Spaces

Department of Examples:
Mathematics
1. Let V = R3 , then the following are bases of V .
(a.) {e1 = (1, 0, 0), e2 = (0, 1, 0), e3 = (0, 0, 1)}
(b.) {v1 = (1, 1, 1), v2 = (2, 3, 0), v3 = (4, 0, 0)}
2. Let V = M2×3 , the the vectors
     
1 0 0 0 1 0 0 0 1
, , ,
0 0 0 0 0 0 0 0 0
     
0 0 0 0 0 0 0 0 0
, ,
1 0 0 0 1 0 0 0 1
forms a basis of V .
Chapter Two:
Vector Spaces

Department of
Mathematics
3. Let V = P(t) the vector space of polynomials, then the
vectors
1, t, t 2 , · · · ,
forms a basis of V .
4. Consider the vector space Pn (t) of all polynomials of
degree ≤ n, then the vectors

1, t, t 2 , · · · , t n

of n + 1 vectors forms a basis of V .


Chapter Two:
Vector Spaces
Suppose a vector space V does not have a finite basis,
Department of
Mathematics then V is said to have of infinte dimension or infinite
dimensional.
The vector space {0} has dimension 0.

Lemma
Suppose v1 , v2 , · · · , vn span V , and suppose w1 , w2 , · · · , wm is
a linearly independent set. Then m ≤ n and V is spanned by a
set of the form

w1 , w2 , · · · , wm , vi1 , vi2 , · · · , vin−m

Thus, in particular, any n + 1 vectors in V are linearly


dependent.
Chapter Two:
Vector Spaces Examples on Bases
Department of
Mathematics
1. The Vector Space V = K n .
Consider the vectors

e1 = (1, 0, · · · , 0), e2 = (0, 1, · · · , 0), · · · , en = (0, 0, · · · , 1)

Now,
The vectors e1 , e2 , · · · , en are linearly independent.
For any vector v = (a1 , a2 , · · · , an ), we have

v = a1 e1 + a2 e2 + · · · + an en

i.e e1 , e2 , · · · , en span V
Hence, {e1 , e2 , · · · , en } is a basis of V . In particular

Dim(K n ) = n
Chapter Two:
Vector Spaces
2. The vector space V = Mr ×s of all r × s matrices. The
Department of
Mathematics following six matrices form a basis of the vector space
V = M2×3 :
     
1 0 0 0 1 0 0 0 1
e1 = , e2 = , e3 =
0 0 0 0 0 0 0 0 0
     
0 0 0 0 0 0 0 0 0
e4 = , e5 = , e6 =
1 0 0 0 1 0 0 0 1
In fact,here
{e1 , e2 , · · · , en } is linearly independent set and,
{e1 , e2 , · · · , en } span M2×3
Thus,
Dim(M2×3 ) = 6 = 2 × 3
Chapter Two:
Vector Spaces

Department of
Mathematics

3. The vector space V = Pn (t) of all polynomials of


degree ≤ n
Here
the set S = {1, t, t 2 , · · · , t n } of n + 1 vectors are linearly
independent and span the space Pn (t)
Hence, {1, t, t 2 , · · · , t n } is a basis of Pn (t)
Hence,
Dim(Pn (t)) = n + 1
Chapter Two:
Vector Spaces

Department of
Mathematics

4. The vector space V = P(t) of all polynomials over a


field K .
Here, the set S = {1, t, t 2 , · · · , } is linearly independent
and span P(t)
Hence, 1, t, t 2 , · · · , is a basis of P(t). Thus,

Dim(P(t)) = ∞
Chapter Two:
Vector Spaces

Department of
Mathematics
Now, we have the following theorems on Bases
Theorem
Let V be a vector space of finite dimension n, then
1 Any n + 1 or more vectors are linearly dependent.
2 Any linearly independent set S = {u1 , u2 , · · · , un } with
n − elements is a basis of V .
3 Any spanning set T = {v1 , v2 , · · · , vn } of n − vectors in V
is a basis of V .
Chapter Two:
Vector Spaces

Department of Theorem
Mathematics
Suppose S span a vector space V , then
1 Any maximum number of linearly independent vectors in S
forms a basis of V .
2 Suppose one deletes from S every vector that is a linear
combination of preceding vectors in S, then the remaining
vectors forms a basis of V .

Theorem
Let V be a vector space of finite dimension and let
S = {u1 , u2 , · · · , ur } be a set of linearly independent vectors in
V , then S can be extended to a basis of V .
Chapter Two:
Vector Spaces
Examples:
Department of
Mathematics 1. The following vectors

(1, 1, 1, 1), (0, 1, 1, 1), (0, 0, 1, 1), (0, 0, 0, 1)

are linearly independent in R4 . Hence, they are a basis of


R4 .
2. Consider the following n + 1 polynomials

1, t − 1, (t − 1)2 , · · · , (t − 1)n

Here, no polynomial is a linear combinations of the


preceding polynomials and hence, the polynomials are
linearly independent. Hence, they form the basis of Pn (t).
Chapter Two:
Vector Spaces

Department of
Mathematics

3. The vectors

(1, 2, 3), (−2, 1, 0), (1, 5, 6), (3, 4, 5)

are linearly dependent, since

Dim(R3 ) = 3
Chapter Two:
Vector Spaces

Department of
Mathematics

Dimension and Subspace


The following theorem provides the relationship between the
dimension of a vector space and its subspace.
Theorem
Let W be a subspace of an n − dimensional vector space V .
Then Dim(W ) ≤ n. In particular, if Dim(W ) = n, then
W = V.
Chapter Two:
Vector Spaces

Department of
Mathematics
Example: Consider V = R3 and w be a subspace of V . Then,
Dim(R)3 = 3, hence Dim(W ) will be either of 0, 1, 2, or 3.
Hence
If Dim(W ) = 0, then W = {0}
If Dim(W ) = 1, then W is a line which passes through the
origin.
If Dim(W ) = 2, then w is a plane which passes through
the origin.
If Dim(W ) = 3, then W = R3 .
Chapter Two: Chapter Two: Vector Spaces- Worksheet Two
Vector Spaces
1. Let V be a vector space and u, v ∈ V . Simplify each of
Department of
Mathematics the following expressions:
a. 2(4u − 5v ) + 3v + 6u
b. 2u − 3(5v − 4u) + 6v − u
c. 3uv + 2(u + v )
d. v2 + 3u − 2(u − v )
2. Let V be a vector space and u ∈ U, show that u + u = 2u.
3. Express the vector v = (1, −2, 5) as a linear combination
of the vectors
u1 = (1, 1, 1), u2 = (1, 2, 3), u3 = (2, −1, 1)
4. Express as a linear combination of the following vectors
a. v = 2, −5, 3 as
u1 = (1, −3, 2), u2 = (2, −4, −1), u3 = (1, −5, 7)
b. v = t 2 + 4t − 3 ∈ P(t) as
p1 (t) = t 2 − 2t + 5, p2 (t) = 2t 2 − 3t, p3 (t) = t + 1
Chapter Two:
Vector Spaces  
4 7
Department of c. M = as the matrices
Mathematics 7 9
     
1 1 1 2 1 1
A= ,B = ,C =
1 1 3 4 4 5

5. Let V = R3 . Show that


a. W = {(a, b, c) : a ≥ 0} is not a subspace of V
b. W = {(a, b, c) : a2 + b 2 + c 2 ≤ 1} is not a subspace of V .
6. Let V = P(t) be the space of polynomials. Determine
whether or not the following are subspace of v .
a. W consists of all polynomials with integer coefficients.
b. W consists of all polynomials of degree ≥ 6 and the zero
polynomial.
c. W consists of all polynomials with only even poers of t.
Chapter Two:
Vector Spaces
7. Let V be the vector space of functions f : R → R. Show
Department of
Mathematics
that the following are subspace of V .
a. W = {f (x) : f (1) = 0}, all functions whose value at 1 is 0.
b. W = f (x) : f (3) = f (1), all functions assigning the same
value to 3 and 1.
c. W = {f (x) : f (x) = f (−x)}, the set of all odd functions.
8. Show that the following vectors span R3 .
a. u1 = (1, 1, 1), u2 = (1, 2, 3), u3 = (1, 5, 8)
b. u1 = (2, 1, 3), u2 = (3, 2, 0), u3 ()4, 0, 0)
9. Determine whether u and v are linearly dependent or
independent
a. u = (1, 2), v = (3, −5)
b. u = (1, −3), v = (−2, 6)
c. u = (1, 2, −3), v = (4, 5, −6)
d. u = (2, 4, −8), v = (3, 6, −12)
Chapter Two:
Vector Spaces

Department of
Mathematics
10. Determine whether or not the following vectors in R3 are
linearly dependent or not.
a. u = (1, 1, 2), v = (2, 3, 1), w = (4, 5, 5)
b. u1 = (1, 2, 5), u2 = (1, 3, 1), u3 = (2, 5, 7), u4 = (3, 1, 4)
c. u1 = (1, 2, 5), u2 = (1, 5, 2), u3 = (2, 5, 1)
d. u = (1, 2, 3), v = (0, 0, 0), w = (1, 5, 6)
11. Show that the functions f (t) = cos t, g (t) = sin t, h(t) = t
from R → R are linearly independent.
12. Suppose u, v , w are linearly independent. Then show that
u + v , u − v , u − 2v + w are also linearly independent.
Chapter Two:
Vector Spaces

Department of 13. Determine whether or not each of the following form a


Mathematics
basis of R3 :
a. (1, 1, 1), (1, 0, 1)
b. (1, 1, 1), (1, 2, 3), (2, −1, 1)
c. (1, 2, 3), (1, 3, 5), (1, 0, 1), (2, 3, 0)
d. (1, 1, 2), (1, 2, 5), (5, 3, 4)
14 Determine whether
(1, 1, 1, 1), (1, 2, 3, 2), (2, 5, 6, 4), (2, 6, 8, 5) form a basis of
R4 . If not, find the dimension of the subspace they span.
15. Find a basis and dimension of the subspace W of R3
where
a. W = {(a, b, c) : a + b + c = 0}
b. W = {(a, b, c) : (a = b = c)}
Chapter Two:
Vector Spaces

Department of
16. Let W be the subspace of R4 spanned by the vectors
Mathematics

u1 = (1, −2, 5, −3), u2 = (2, 3, 1, −4), u3 = (3, 8, −3, −5)

Then find the basis and dimension of W .


17. Let V be the vector space of 2 × 2 matrices over field K .
Let W be the subspace of symmetric matrices. Show that
Dim(W ) = 3 [Hint: Find the basis.]
18. Consider the vector space P3 (t) of polynomials of degree
≤ 3. Show that

S = {(t − 1)3 , (t − 1)2 , t − 1, 1}

is a basis of P3 (t).

You might also like