Chp 5: Vector Space

DFN: Vector Space-

Let (F, +, *) be a field. The elements of F are called scalars.

Vector – vector addition: This assigns to any u, v ∈ V, a sum u + v ∈ V.

Let V be a non-empty set with two operations:

Scalar- vector multiplication: This assigns to any u ∈ V and α ∈ F, a product αv ∈ V.

a)
b)

I) A set V is called the vector space over a field F, if it satisfies the following conditions:
V1: V contains the additive identity (zero vector of that set wrt given operation).

i.e., for every v ∈ V, and scalar α, we have αv ∈ V.

V2: V is closed under scalar-vector multiplication

i.e., for every v1, v2 ∈ V, we have v1 + v2 ∈ V.

V3: V is closed under vector addition

II) (DEFINITION) A vector space is a set V of elements, together with operations of addition and

V is closed under addition; i.e., for u, v ∈ V, u + v ∈ V.

scalar multiplication that satisfy the following properties:

V is closed under scalar multiplication; i.e., for u ∈ V and α ∈ IF, αu ∈ V.

1.

V is commutative wrt addition; for u, v ∈ V, u + v = v + u.

2.

V is associative wrt addition; for u, v, w ∈ V, (u + v) + w = u + (v + w).

3.
4.

such that for u ∈ V, u + ea = u = ea + u.

5. Existence of additive identity in V; there exists an element e a (0v) in V called the additive identity

6. Existence of additive inverse in V; For every u in V, there exists an element -u in V called the

Existence of in multiplicative identity F; for u ∈ V, 1.u = u, and 1 is the multiplicative identity.

additive inverse such that u + (-u) = ea = (-u) + u.

For α, β ∈ IF, u ∈ V, (αβ)u = α(βu).

7.
8.
9. V satisfies distributive laws: a) (α + β)u = αu + βu and b) α(u + v) = αu + αv.

Steps to check if a Set V together with operations of addition and scalar multiplication is a Vector
Space.
Method 1: Using Short definition, I)

Let u, v ∈ V, u + v ∈ V.
Property V1- To show that (TST) V is closed under vector addition

Let v ∈ V, αv ∈ V.
Property V2- TST V is closed under scalar-vector multiplication

Property V3- TST e or 0v ∈ V

0v ∈ V is true.

Method 2: Using Definition II)

Let u, v, w ∈ V
1. Vector – vector addition satisfies the following properties:

a) Closure property: u + v ∈ V
b) Commutative property: u + v = v + u.

d) Existence of additive identity: For u ∈ V, ∃ 0v ∈ V, such that u + 0v = u = 0v + u.

c) Associative property: (u + v) + w = u + (v + w).

e) Existence of additive inverse: For u ∈ V, ∃! u’ ∈ V, such that u + u’ = 0v = u’ + u.

Let u, v ∈ V and α, β ∈ F
2. Scalar – vector multiplication satisfies the following properties:
 a) Closure property: αu ∈ V
b) α(u + v) = αu + αv
c) (α + β)u = αu + βu
d) α(βu) = (αβ)u
e) 1u = u

Examples:
1. Show that R is a vector space over itself.
Solution: (Method II)
V = R = Set of real numbers.

Let u, v, w ∈ V = R and α, β ∈ F = R
F=R

We define the vector addition ‘+’ : R x R  R defined as u + v as usual addition,

& define the scalar vector multiplication ‘∙’ : R x R  R defined as αu as usual multiplication.

a) Closure property: u + v ∈ V.
1) Consider the following properties wrt ‘+’:

b) Commutative property: u + v = v + u.

d) Existence of additive identity: For u ∈ V, ∃ 0 ∈ V, such that u + 0 = u = 0 + u.

c) Associative property: (u + v) + w = u + (v + w).

e) Existence of additive inverse: For u ∈ V, ∃! u’ ∈ V, such that u + u’ = 0 = u’ + u.

2) Consider the following properties wrt ‘∙’:
a) α(u + v) = αu + αv
b) (α + β)u = αu + βu
c) α(βu) = (αβ)u
d) 1u = u
As all the properties of vector space are satisfied, R is a vector space over itself.

2. Show that R2 is a vector space over R .

V = R2 = {[a, b] | a, b ∈ R }
Solution:

Let u, v, w ∈ V = R2 and α, β ∈ F = R
F=R

Thus u = [u1, u2], v = [v1, v2], w = [w1, w2]

We define the vector addition ‘+’ : R2x R2  R2 defined as
u + v = [u1, u2] + [v1, v2] = [u1 + v1, u2 + v2]
& define the scalar vector multiplication ‘∙’ : R x R2  R2 defined as
αu = α[u1, u2] = [αu1, αu2]

a) Closure property: To check if u + v ∈ V

1) Consider the following properties wrt ‘+’:

Thus, u + v ∈ V.
Consider u + v = [u1, u2] + [v1, v2] = [u1 + v1, u2 + v2]

b) Commutative property: To check if u + v = v + u.

LHS = u + v = [u1, u2] + [v1, v2] = [u1 + v1, u2 + v2]
RHS = v + u = [v1, v2] + [u1, u2] = [v1 + u1, v2 + u2] = [u1 + v1, u2 + v2]
LHS = RHS
Thus, + satisfies commutative property.
c) Associative property: To check if (u + v) + w = u + (v + w).
LHS = (u + v) + w
= {[u1, u2] + [v1, v2]} + [w1, w2]
 = [u1 + v1, u2 + v2] + [w1, w2]
= [u1 + v1 + w1, u2 + v2 + w2]
RHS = u + (v + w)
= [u1, u2] + {[v1, v2] + [w1, w2]}
= [u1, u2] + {[v1 + w1, v2 + w2]}
= [u1 + v1 + w1, u2 + v2 + w2]
LHS = RHS
Thus, + satisfies associative property.
d) Existence of additive identity:
Let e = [e1, e2] such that u + e = u = e + u
Consider u + e = u
 [u1, u2] + [e1, e2] = [u1, u2]
 [u1 + e1, u2 + e2] = [u1, u2]
 u1 + e1 = u1 & u2 + e2 = u2
 e1 = 0 & e2 = 0

Let e = 0v = [0, 0] such that u + 0v = u = 0v + u

LHS = u + 0v = [u1, u2] + [0, 0] = [u1, u2] = u

Thus, for u ∈ V, ∃ additive identity 0v = [0, 0] ∈ V, such that u + 0v = u = 0v + u.

RHS = 0v + u = [0, 0] + [u1, u2] = [u1, u2] = u

Thus, e = [0, 0], i.e., [0, 0] is the additive identity.

e) Existence of additive inverse:

Let u’ = [u1’, u2’] such that u + u’ = 0v = u’ + u
Consider u + u’ = 0v
∴ [u1, u2] + [u1’, u2’] = [0, 0]
∴ [u1 + u1’, u2 + u2’] = [0, 0]
Comparing on both sides,
u1 + u1’ = 0  u1’ = - u1
u2 + u2’ = 0  u2’ = - u2

Let u’ = [-u1, -u2] such that u + u’ = 0v = u’ + u

Thus, for u ∈ V, ∃ additive inverse u’ = [-u1, -u2] ∈ V, such that u + u’ = 0v = u’ + u.

LHS = u + u’ = [u1, u2] + [-u1, -u2] = [u1 - u1, u2 - u2] = [0, 0] = RHS

a) Closure property: To check if αu ∈ V

2) Consider the following properties wrt ‘∙’:

Thus, αu ∈ V
Consider αu = α[u1, u2] = [αu1, αu2]

b) To check if α(u + v) = αu + αv
LHS = α(u + v) = α{[u1, u2] + [v1, v2]} = α[u1 + v1, u2 + v2] = [αu1 + αv1, αu2 + αv2]
RHS = αu + αv = α[u1, u2] + α[v1, v2] = [αu1, αu2] + [αv1, αv2] = [αu1 + αv1, αu2 + αv2]
LHS = RHS
Thus, α(u + v) = αu + αv is satisfied.

c) To check if (α + β)u = αu + βu
LHS = (α + β)u = (α + β)[u1, u2] = [(α + β)u1, (α + β)u2] = [αu1 + βu1, αu2 + βu2]
RHS = αu + βu = α[u1, u2] + β[u1, u2] = [αu1, αu2] + [βu1, βu2] = [αu1 + βu1, αu2 + βu2]
LHS = RHS
Thus, (α + β)u = αu + βu is satisfied.
 d) To check if α(βu) = (αβ)u
LHS = α(βu) = α{β[u1, u2]} = α[βu1, βu2] = [αβu1, αβu2]
RHS = (αβ)u = (αβ)[u1, u2] = [(αβ)u1, (αβ)u2] = [αβu1, αβu2]
LHS = RHS
Thus, α(βu) = (αβ)u is satisfied.

e) To check if 1u = u
LHS = 1u = 1[u1, u2] = [u1, u2] = u = RHS
Thus, 1u = u is satisfied.
As all the properties of vector space are satisfied, R2 is a vector space over R .

3. Check if M2x3( R ) is a vector space over R .

Solution:

V = M2x3( R ) =
{[ a b c
d e f ]
∨a , b , c , d ,e , f ∈ R
}
Let A, B, C ∈ V = M2x3( R ) and α, β ∈ F = R
F=R

Thus A =
[
a 1 a 2 a3
a 4 a 5 a6
,B=
] [
b1 b 2 b3
b4 b 5 b6
,C=
] [
c1 c2 c3
c 4 c5 c 6 ]
We define the vector addition ‘+’: M2x3( R ) x M2x3( R )  M2x3( R ) defined as

A+B=
[ ][
a 1 a 2 a3 b 1 b 2 b 3
+
a 4 a 5 a6 b 4 b 5 b 6 ][
a + b a +b a + b
= 1 1 2 2 3 3
a4 + b4 a5 +b 5 a 6+ b6 ]
& define the scalar vector multiplication ‘∙’: R x M2x3( R )  M2x3( R ) defined as

αA = α
[
a1 a2 a3
a4 a5 a6 ][
=
α a 1 α a2 α a3
α a 4 α a5 α a6 ]
Property V1- TST 0v ∈ V
Method 1:

[ 00 ∈V
]
0 0
0v =
0 0

Let A ∈ V,
Property V2- TST V is closed under scalar-vector multiplication

Consider αA = α
[ a 1 a 2 a3
a 4 a 5 a6
=
][
α a 1 α a2 α a3
α a 4 α a5 α a6 ]
αA ∈ V

Consider A, B ∈ V,
Property V3- TST V is closed under vector addition

A+B=
[ ][
a 1 a 2 a3 b 1 b 2 b 3
+
a 4 a 5 a6 b 4 b 5 b 6 ][
a + b a +b a + b
= 1 1 2 2 3 3
a4 + b4 a5 +b 5 a 6+ b6 ]
A+B∈V
As all the properties of vector space are satisfied, V =M 2 x3 (R) is a vector space over itself.

Method 2:

a) Closure property: To check if A + B ∈ V

1) Consider the following properties wrt ‘+’:

Consider A + B =
[ ][
a 1 a 2 a3 b 1 b 2 b 3
+
a 4 a 5 a6 b 4 b 5 b 6 ][
a + b a +b a + b
= 1 1 2 2 3 3
a4 + b4 a5 +b 5 a 6+ b6 ]
 Thus, A + B ∈ V
b) Commutative property: To check if A + B = B + A

LHS = A + B =
[
a 1 a 2 a3 b 1 b 2 b 3
+
a 4 a 5 a6 b 4 b 5 b 6 ][ ]
a +b a +b a +b
¿ 1 1 2 2 3 3
[
a4 +b 4 a5 +b5 a6 +b 6 ]
RHS = B + A =
[
b1 b 2 b3 a 1 a 2 a 3
+
b4 b 5 b6 a 4 a 5 a 6 ][ ]
¿¿
LHS = RHS
Thus, + satisfies commutative property.
c) Associative property: To check if (A + B) + C = A + (B + C)
LHS = (A + B) + C

=
{[ a1 a2 a3 b1 b2 b3
+
a 4 a5 a6 b 4 b5 b6 ][
c c c
+ 1 2 3
c4 c5 c6 ]} [ ]
=
[a1+ b1 a 2+ b2 a3 +b3 c 1 c 2 c 3
+
a4 + b4 a5 + b5 a 6 +b6 c 4 c 5 c 6 ][ ]
=
[a1 +b1 +c 1 a2 +b2 +c 2 a3 +b 3+ c 3
a4 + b4 + c 4 a5 +b5 + c5 a6 +b 6+ c 6 ]
RHS = A + (B + C)
LHS = RHS
Thus, + satisfies associative property.

d) Existence of additive identity:

Let E =
[ e 1 e2 e3
e 4 e5 e6 ]
such that A + E = A

Consider A + E = A,


[
a1 a2
a4 a5
+
][
a3 e1 e 2 e 3
a6 e 4 e5 e 6 ][
a a a
= 1 2 3
a4 a5 a6 ]

[
a1+ e1
a4 + e 4
a2+ e 2 a3 + e3
a5+ e 5 a6 + e6 ][
a a a
= 1 2 3
a 4 a5 a6 ]
 a1 + e1 = a1 & a2 + e2 = a2, …. a6 + e6 = a6
 e1 = 0, e2 = 0, …. e6 = 0

Thus E = 0v =
0 0
0 0 [ 00 ]
is the additive identity.

Thus, for u ∈ V, ∃ additive identity 0v = ∈ V, such that A + 0v = A = 0v + A.

[ ]
0 0 0
0 0 0

e) Existence of additive inverse:

Let A’ =
[ a1' a2' a3'
a4' a5' a6' ]
Consider A + A’ = 0v


[ a 1 a 2 a3 a1 ' a2 '
+
][
a 4 a 5 a6 a 4 ' a5 ' ][
a3 '
a6 '
=
0 0 0
0 0 0 ]
 
[ a1+ a1 ' a 2+ a2 ' a3 +a 3 '
a 4+ a4 ' a 5+ a5 ' a6 +a 6 '
=
][
0 0 0
0 0 0 ]
 a1 + a1’ = 0 & a2 + a2’ = 0, … a6 + a6’ = 0
 a1’ = - a1, a2’ = - a2, ... a6’ = - a6

Thus, for A ∈ V, ∃ additive inverse A’ = − A= ∈ V, such that A + A’ = 0v =

[ −a1 −a2 −a3
−a 4 −a5 −a6 ]
A’ + A.

a) Closure property: To check if αA ∈ V

2) Consider the following properties wrt ‘∙’:

Consider αA = α
[ a 1 a 2 a3
a 4 a 5 a6 ][
=
α a 1 α a2 α a3
α a 4 α a5 α a6 ]
Thus, αA ∈ V

b) To check if α(A + B) = αA + αB

LHS = α(A + B) = α
{[ ][
a1 a2 a3 b1 b 2 b3
+
a4 a5 a6 b4 b 5 b6 ]}
=α
[ a1+ b1 a 2+ b2 a3 +b3
a 4+ b4 a 5+ b5 a6 +b6 ]
=
[
α (a1+ b1 )
α (a4 + b4 )
α (a2 +b2 )
α (a5 +b5 )
α (a3 +b3 )
α (a6 +b6 ) ]
=
[
α a1 +α b1
α a 4 +α b4
α a2 + α b 2
α a 5+ α b 5
α a3 +α b 3
α a6 +α b 6 ]
RHS = αA + αB =
LHS = RHS
Thus, α(A + B) = αA + αB is satisfied.

c) To check if (α + β)A = αA + βA
LHS =
RHS =
LHS = RHS
Thus, (α + β)A = αA + βA is satisfied.

d) To check if α(βA) = (αβ)A

LHS =
RHS =
LHS = RHS
Thus, α(βA) = (αβ)A is satisfied.

e) To check if 1A = A

LHS = 1 A=1
[ a1 a2 a3
a 4 a5 a6
=
][
1 a1 1 a2 1 a3
1 a4 1 a5 1 a6
a a a
][
= 1 2 3 =A = RHS
a4 a5 a6 ]
Thus, 1A = A is satisfied.
As all the properties of vector space are satisfied, M2x3( R ) is a vector space over R .

Note: 1. Mrxc( R ) is the set of all matrices of order r x c with real entries.
 2. Mrxc( R ) is a vector space over R .

4. Prove that R3 is a vector space over R .

5. Prove that M2x2( R ¿ is a vector space over R .

6. Show that P2( R ) is a vector space over R .

V = P2( R ) = {a0 + a1x + a2x2 | a0, a1, a2 ∈ R }

Solution:

Let a, b ∈ V = P2( R ) and α ∈ F = R

F=R

Thus a(x) = a0 + a1x + a2x2, b(x) = b0 + b1x + b2x2

We define the vector addition ‘+’ : P2( R ) x P2( R )  P2( R ) defined as

a(x) + b(x) = (a0 + a1x + a2x2) + (b0 + b1x + b2x2)
= (a0 + b0) + (a1 + b1)x + (a2 + b2)x2
& define the scalar vector multiplication ‘∙’ : R x P2( R )  P2( R ) defined as
αa(x) = α(a0 + a1x + a2x2) = αa0 + αa1x + αa2x2

Property V1- TST 0v ∈ V

0v = 0 + 0x + 0x2 ∈ V

Let a(x) ∈ V,
Property V2- TST V is closed under scalar-vector multiplication

α*a(x) ∈ V
Consider αa(x) = α(a0 + a1x + a2x2) = αa0 + αa1x + αa2x2

Consider a(x), b(x) ∈ V,

Property V3- TST V is closed under vector addition

a(x) + b(x) ∈ V
a(x) + b(x) = (a0 + a1x + a2x2) + (b0 + b1x + b2x2) = (a0 + b0) + (a1 + b1)x + (a2 + b2)x2

As all the properties of vector space are satisfied, V =P 2 ( R ) is a vector space over R .

Note: 1. Pn( R ) is the set of all polynomials of degree less than or equal to n.
2. Pn( R ) is a vector space over R .

7. Let V be the set of ordered pairs (a, b) of real numbers. Using definition, show that V is not a
vector space over R with addition and scalar multiplication defined as (a, b) + (c, d) = (a + d, b +
c) and α(a, b) = (αa, αb).

V = R2 = {[a, b] | a, b ∈ R }
Solution:

Let u, v, w ∈ V = R2 and α, β ∈ F = R
F=R

Thus u = [u1, u2], v = [v1, v2], w = [w1, w2]

We define the vector addition ‘+’ : R2x R2  R2 defined as
u + v = [u1, u2] + [v1, v2] = [u1 + v2, u2 + v1]
& define the scalar vector multiplication ‘∙’ : R x R2  R2 defined as
αu = α[u1, u2] = [αu1, αu2]

1) Consider the following properties wrt ‘+’:

a) Closure Property:
Consider u + v = [u1, u2] + [v1, v2] = [u1 + v2, u2 + v1]
 Thus, u + v ∈ R2

b) Commutative property:
To check if u + v = v + u.
LHS = u + v = [u1, u2] + [v1, v2] = [u1 + v2, u2 + v1]
RHS = v + u = [v1, v2] + [u1, u2] = [v1 + u2, v2 + u1] = [u2 + v1, u1 + v2]
LHS ≠ RHS
Thus, + does not satisfy commutative property.
[1, 2] + [3, -4] = [-3, 5]
[3, -4] + [1, 2] = [5, -3]
As all the properties of vector space are not satisfied, V is a not a vector space over R with reference
to the given operations.

8. Prove or give a counterexample: “{[x, y, z] : x, y, z ∈ R , x + y + z = 1} wrt usual vector addition

and scalar-vector multiplication is a vector space.”

V = {[x, y, z] : x, y, z ∈ R , x + y + z = 1}
Solution:

Let u, v, w ∈ V = R3 and α, β ∈ F = R
F=R

u = [u1, u2, u3] such that u1 + u2 + u3 = 1

v = [v1, v2, v3] such that v1 + v2 + v3 = 1
w = [w1, w2, w3] such that w1 + w2 + w3 = 1

We define the vector addition ‘+’ : V x V  V defined as

u + v = [u1, u2, u3] + [v1, v2, v3] = [u1 + v1, u2 + v2, u3 + v3],
such that (u1 + v1) + (u2 + v2) + (u3 + v3) = 1
& define the scalar vector multiplication ‘∙’ : R x V  V defined as
αu = α[u1, u2, u3] = [αu1, αu2, αu3], such that αu1 + αu2 + αu3 = 1

Method 1: If 0v = [0, 0, 0] ∈ V, then 0v should satisfy u1 + u2 + u3 = 1

But 0 + 0 + 0 ≠ 1
So, 0v ∉ V.
Thus, additive identity does not exist in V.

Method 2 (By definition):

Consider u + v = (u1, u2, u3) + (v1, v2, v3) = (u1 + v1, u2 + v2, u3 + v3)
For (u1 + v1) + (u2 + v2) + (u3 + v3) = u1 + v1 + u2 + v2 + u3 + v3
= (u1 + u2 + u3) + (v1 + v2 + v3) = 1 + 1 = 2
So, u + v ∉ V.
Thus, closure property is not satisfied in V.

As all the properties of vector space are not satisfied, V is a not a vector space over R with reference
to the given operations.

9. Prove or give a counterexample: “{[x, y, z] : x, y, z ∈ R and x + y + z = 0} wrt usual vector addition

and scalar-vector multiplication is a vector space.”

V = {[x, y, z] : x, y, z ∈ R , x + y + z = 0}
Solution: (Method 2: By definition)

Let u, v, w ∈ V = R3 and α, β ∈ F = R
F=R

u = [u1, u2, u3] such that u1 + u2 + u3 = 0

v = [v1, v2, v3] such that v1 + v2 + v3 = 0
w = [w1, w2, w3] such that w1 + w2 + w3 = 0

We define the vector addition ‘+’ : V x V  V defined as

u + v = [u1, u2, u3] + [v1, v2, v3] = [u1 + v1, u2 + v2, u3 + v3],
such that (u1 + v1) + (u2 + v2) + (u3 + v3) = 0
& define the scalar vector multiplication ‘∙’ : R x V  V defined as
αu = α[u1, u2, u3] = [αu1, αu2, αu3], such that αu1 + αu2 + αu3 = 0

1) Consider the following properties wrt ‘+’:

a) Closure property: To Check…
Consider u + v = [u1, u2, u3] + [v1, v2, v3] = [u1 + v1, u2 + v2, u3 + v3],
Now u1 + u2 + u3 = 0 & v1 + v2 + v3 = 0
Adding both, we have such that u1 + u2 + u3 + v1 + v2 + v3 = 0 + 0
i.e., (u1 + v1) + (u2 + v2) + (u3 + v3) = 0
Thus, u + v ∈ V
b) Commutative property: To check if u + v = v + u.
LHS = u + v = [u1, u2, u3] + [v1, v2, v3] = [u1 + v1, u2 + v2, u3 + v3]
RHS = v + u = [v1, v2, v3] + [u1, u2, u3] = [v1 + u1, v2 + u2, v3 + u3]
= [u1 + v1, u2 + v2, u3 + v3]

Thus u + v = v + u and ∈ V
LHS = RHS

Thus, + satisfies commutative property.

c) Associative property: To check if (u + v) + w = u + (v + w).
LHS = (u + v) + w
= {[u1, u2, u3] + [v1, v2, v3]} + [w1, w2, w3]
= [u1 + v1, u2 + v2] + [w1, w2, w3]
= [u1 + v1 + w1, u2 + v2 + w2, u3 + v3 + w3]
RHS = u + (v + w)
= [u1, u2, u3] + {[v1, v2, v3] + [w1, w2, w3]}
= [u1, u2, u3] + {[v1 + w1, v2 + w2, v3 + w3]}
= [u1 + v1 + w1, u2 + v2 + w2, u3 + v3 + w3]
LHS = RHS
For [u1 + v1 + w1, u2 + v2 + w2, u3 + v3 + w3],
Consider (u1 + v1 + w1) + (u2 + v2 + w2) + (u3 + v3 + w3)
= u1 + v1 + w1 + u2 + v2 + w2 + u3 + v3 + w3
= (u1 + u2 + u3) + (v1 + v2 + v3) + (w1 + w2 + w3)

Thus (u + v) + w = u + (v + w) and ∈ V
=0+0+0=0

Thus, + satisfies associative property.

d) Existence of additive identity:

Consider 0v = [0, 0, 0]
LHS = u + 0v = [u1, u2, u3] + [0, 0, 0] = [u1, u2, u3]
RHS = 0v + u = [0, 0, 0] + [u1, u2, u3] = [u1, u2, u3]

Thus, for u ∈ V, ∃ additive identity 0v = [0, 0, 0] ∈ V, such that u + 0v = u = 0v + u.

0v = [0, 0, 0], 0 + 0 + 0 = 0

e) Existence of additive inverse:

Let u’ = [u1’, u2’, u3’]
Consider u + u’ = 0v
 ∴ [u1, u2, u3] + [u1’, u2’, u3’] = [0, 0, 0]
∴ [u1 + u1’, u2 + u2’, u3 + u3’] = [0, 0, 0]
Comparing on both sides,
u1 + u1’ = 0  u1’ = - u1
u2 + u2’ = 0  u2’ = - u2
u3 + u3’ = 0  u3’ = - u3
Thus, u’ = [-u1, -u2, -u3]

Thus, for u ∈ V, ∃ additive inverse u’ = [-u1, -u2, -u3] ∈ V, such that u + u’ = 0v = u’ + u.

Consider (-u1) + (-u2) + (-u3) = - (u1 + u2 + u3) = - 0 = 0

2) Consider the following properties wrt ‘∙’:

a) Closure Property: To check if …
Consider αu = α[u1, u2, u3] = [αu1, αu2, αu3],
As u1 + u2 + u3 = 0, we have α*(u1 + u2 + u3) = α*0
i.e, αu1 + αu2 + αu3 = 0
Thus,
b) To check if α(u + v) = αu + αv
LHS = α(u + v) = α{[ u1, u2, u3] + [v1, v2, v3]}
= α[u1 + v1, u2 + v2, u3 + v3] = [αu1 + αv1, αu2 + αv2, αu3 + αv3]
RHS = αu + αv = α[u1, u2, u3] + α[v1, v2, v3]
= [αu1, αu2, αu3] + [αv1, αv2, αv3] = [αu1 + αv1, αu2 + αv2, αu3 + αv3]
LHS = RHS
For [αu1 + αv1, αu2 + αv2, αu3 + αv3],
Consider (αu1 + αv1) + (αu2 + αv2) + (αu3 + αv3)
= αu1 + αv1 + αu2 + αv2 + αu3 + αv3
= α{u1 + v1 + u2 + v2 + u3 + v3}
= α {(u1 + u2 + u3) + (v1 + v2 + v3)}

Thus, α(u + v) = αu + αv and ∈ V is satisfied.

= α{0 + 0} = α0 = 0

c) To check if (α + β)u = αu + βu
LHS = (α + β)u = (α + β)[ u1, u2, u3] = [(α + β)u1, (α + β)u2, (α + β)u3]
= [αu1 + βu1, αu2 + βu2, αu3 + βu3]
RHS = αu + βu = α[u1, u2, u3] + β[u1, u2, u3] = [αu1, αu2, αu3] + [βu1, βu2, βu3]
= [αu1 + βu1, αu2 + βu2, αu3 + βu3]
LHS = RHS
For [αu1 + βu1, αu2 + βu2, αu3 + βu3],
Consider (αu1 + βu1) + (αu2 + βu2) + (αu3 + βu3)
= αu1 + βu1 + αu2 + βu2 + αu3 + βu3
= [αu1 + αu2 + αu3] + [βu1 + βu2 + βu3]
= α[u1 + u2 + u3] + β[u1 + u2 + u3]

Thus, (α + β)u = αu + βu and ∈ V is satisfied.

= α0 + β0 = 0

d) To check if α(βu) = (αβ)u

LHS = α(βu) = α{β[u1, u2, u3]} = α[βu1, βu2, βu3] = [αβu1, αβu2, αβu3]
RHS = (αβ)u = (αβ)[u1, u2, u3] = [(αβ)u1, (αβ)u2, (αβ)u3] = [αβu1, αβu2, αβu3]
LHS = RHS
For [αβu1, αβu2, αβu3],

Thus, α(βu) = (αβ)u and ∈ V is satisfied.

Consider αβu1 + αβu2 + αβu3 = (αβ)[u1 + u2 + u3] = (αβ)0 = 0
 e) To check if 1u = u

Thus, 1u = u and ∈ V is satisfied.

LHS = 1u = 1[u1, u2, u3] = [u1, u2, u3] = u = RHS

As all the properties of vector space are satisfied, V is a vector space over R .

10. Let V be the set of 3-vectors over GF(2). Is V a vector space?

Solution: V = GF(2)3 = {000, 001, 010, 011, 100, 110, 101, 111}
We define the vector addition ‘+’ : V x V  V defined as u + v as usual addition in GF(2),
& define the scalar vector multiplication ‘∙’ : GF (2)x V  V defined as αu as usual scalar vector
multiplication.
Consider the addition of elements in V.
u/v 000 001 010 011 100 110 101 111
00
001
0
00 011 010 101 111 100 110
001 000
1
01
011
0
01
010
1
10
101
0
11
111
0
10
100
1
11
110

We observe that for u, v ∈ V, for u + v ∈ V

1

With reference to the above, we can state the following properties wrt ‘+’:
a) Commutative property: u + v = v + u.

c) Existence of additive identity: For u ∈ V, ∃ 0v = 000 ∈ V, such that u + 0v = u = 0v + u.

b) Associative property: (u + v) + w = u + (v + w).

d) Existence of additive inverse: For u ∈ V, ∃! u’ ∈ V, such that u + u’ = 0 = u’ + u.

(Here, (000)’ = 000, (001)’ = , (010)’ = , (011)’ = ,
(100)’ = , (110)’ = , (101)’ =, (111)’ = 111)

Consider the scalar vector multiplication in V.

U 000 001 010 011 100 110 101 111
αu = 0u 000 000 000 000 000 000 000 000

We observe that for u ∈ V and for α ∈ GF(2), αv ∈ V

αu = 1u 000 001 010 011 100 110 101 111

With reference to the above, we can state the following properties wrt ‘∙’:
a) α(u + v) = αu + αv
b) (α + β)u = αu + βu
c) α(βu) = (αβ)u
d) 1u = u
As all the properties of vector space are satisfied, V is a vector space over GF(2).

11. Let V be the set of 3-vectors over GF(2) that have an even number of 1’s. Is V a vector space?
Solution:
GF(2)3 = {000, 001, 010, 011, 100,110, 101, 111}
V = {000, 011, 101, 110}

F = GF(2)
We define the vector addition ‘+’ : V x V  V defined as u + v as usual addition in GF(2)
& define the scalar vector multiplication ‘∙’ : GF (2)x V  V defined as αu as usual scalar vector
multiplication.
Consider the addition of elements in V.
u/v 000 011 101 110
000 000 011 101 110
011 011 000 110 101
101 101 110 000 011

We observe that for u, v ∈ V, for u + v ∈ V

110 110 101 011 000

With reference to the above, we can state the following properties wrt ‘+’:
a) Commutative property: u + v = v + u.

c) Existence of additive identity: For u ∈ V, ∃ 0v = 000 ∈ V, such that u + 0v = u = 0v + u.

b) Associative property: (u + v) + w = u + (v + w).

d) Existence of additive inverse: For u ∈ V, ∃! u’ ∈ V, such that u + u’ = 0 = u’ + u.

(Here, (000)’ = 000, (011)’ = 011, (101)’ = 101, (111)’ = 111)

Consider the scalar vector multiplication in V.

u αu = 0u αu = 1u
000 000 000
011 000 011
101 000 101

We observe that for u ∈ V and for α ∈ GF(2), αv ∈ V

110 000 110

With reference to the above, we can state the following properties wrt ‘∙’:
a) α(u + v) = αu + αv
b) (α + β)u = αu + βu
c) α(βu) = (αβ)u
d) 1u = u
As all the properties of vector space are satisfied, V is a vector space over GF(2).

12. Let V be the set of 5-vectors over GF(2) that have an odd number of 1’s. Is V a vector space?

13. Let V be the set of ordered pairs (a, b) of real numbers. Show that V is not a vector space over R
with addition and scalar multiplication defined by (a, b) + (c, d) = (0, 0) and α(a, b) = (a, b).
14. Let V be the set of ordered pairs (a, b) of real numbers. Show that V is not a vector space over R

15. Prove that {α[2, 1] | α ∈ R } wrt usual vector addition and scalar-vector multiplication is a vector
with addition and scalar multiplication defined by (a, b) + (c, d) = (ac, bd) and α(a, b) = (a, b).

space over R .

Let V = {α[2, 1] | α ∈ R }
Solution:
Let u, v, w ∈ V and α, β ∈ F = R
F=R

Thus u = a[2, 1], v = b[2, 1], w = c[2, 1], where a, b, c ∈ R

We define the vector addition ‘+’ : R2x R2  R2 defined as
u + v = a[2, 1] + b[2, 1] = [2a , a] + [2b, b]
= [2a + 2b, a + b]
= [2(a+b), (a+b)] = (a+b)[2, 1]
& define the scalar vector multiplication ‘∙’ : R x R2  R2 defined as
αu = αa[2, 1] = [2αa, αa]

a) Closure property: To check if u + v ∈ V

1) Consider the following properties wrt ‘+’:

Consider u + v = a[2, 1] + b[2, 1] = [2a , a] + [2b, b]

= [2a + 2b, a + b]

Thus, u + v ∈ V
= [2(a+b), (a+b)] = (a+b)[2, 1]

b) Commutative property: To check if u + v = v + u.

LHS = u + v = a[2, 1] + b[2, 1] = …. = (a + b)[2, 1]

LHS = RHS and ∈ V

RHS = v + u = b[2, 1] + a[2, 1] = … = (b + a)[2, 1]

Thus, + satisfies commutative property.

c) Associative property: To check if (u + v) + w = u + (v + w).
LHS = (u + v) + w
= {a[2, 1] + b[2, 1]} + c[2, 1]
=…
= (a + b + c)[2, 1]

LHS = RHS and ∈ V

RHS = u + (v + w) = …. = (a + b + c)[2, 1]

Thus, + satisfies associative property.

d) Existence of additive identity:

Consider 0v = [0, 0]
LHS = u + 0v = a[2, 1] + [0, 0] = a[2, 1]

Thus, for u ∈ V, ∃ additive identity 0v = [0, 0] ∈ V, such that u + 0v = u = 0v + u.

RHS = 0v + u = [0, 0] + a[2, 1] = a[2, 1]

e) Existence of additive inverse:

Let u’ = [u1’, u2’]
Consider u + u’ = 0v
∴ a[2, 1] + [u1’, u2’] = [0, 0]
∴ [2a, 1a] + [u1’, u2’] = [0, 0]
∴ [2a + u1’, a + u2’] = [0, 0]
Comparing on both sides,
2a + u1’ = 0  u1’ = - 2a

Thus, for u ∈ V, ∃ additive inverse u’ = [-2a, -a] = -a[2, 1] ∈ V,

a + u2’ = 0  u2’ = - a

such that u + u’ = 0v = u’ + u.

2) Consider the following properties wrt ‘∙’:

a) To check if α(u + v) = αu + αv
LHS = α(u + v) = α{a[2, 1] + b[2, 1]} = … = (αa + αb)[2, 1]
RHS = αu + αv = α*a[2, 1] + α*b[2, 1] = … = (αa + αb)[2, 1]
 LHS = RHS and ∈ V
Thus, α(u + v) = αu + αv is satisfied.

b) To check if (α + β)u = αu + βu
LHS = (α + β)u = …. = (αa + βa)[2, 1]

LHS = RHS and ∈ V

RHS = αu + βu = …. = (αa + βa)[2, 1]

Thus, (α + β)u = αu + βu is satisfied.

c) To check if α(βu) = (αβ)u

LHS = α(βu) = α{βa[2, 1]} = … = αβa[2, 1]

LHS = RHS and ∈ V

RHS = (αβ)u = … = = αβa[2, 1]

Thus, α(βu) = (αβ)u is satisfied.

d) To check if 1u = u
LHS = 1u = 1a[2, 1] = a[2, 1] = u = RHS
Thus, 1u = u is satisfied.

As all the properties of vector space are satisfied, V is a vector space over R .

16. Check if S = {[a, b, 0, d] | a, b, d ∈ R } wrt usual vector addition and scalar-vector multiplication is
a vector space over R .
Solution:
V=S
F=R
u = [u1, u2, 0, u4], v = [v1, v2, 0, v4]
αu = [αu1, αu2, 0, αu4]

1. Vector vector addition: u + v = [u1+v1, u2+v2, 0, u4+v4] ∈ S

2. Scalar vector multiplication: [αu1, αu2, 0, αu4] ∈ S
3. Zero vector: [0, 0, 0, 0] ∈ S

17. Check if S = {[a, b, 0, 1] | a, b ∈ R } wrt usual vector addition and scalar-vector multiplication is a
vector space over R .

5.2 Subspace

DFN: Subspace-
If V and W are vector spaces and W is a subset of V, we say W is a subspace of V.
And we denote it as W ⊆ SV
OR
A set W is called the subspace of V over a field IF, if it satisfies the following conditions:
Step 1: W ⊆V
Step 2: W is a vector space in itself
SS1: W contains the additive identity, i.e., the zero vector 0v.

i.e., for every u ∈ W, and α ∈ IF, we have αu ∈ W.

SS2: W is closed under scalar-vector multiplication

i.e., for every u, v ∈ W, we have u + v ∈ W.

SS3: W is closed under vector addition
Note:
1) A set is considered a subset of itself, so one subspace of W is W itself.

3) The set {[0, 0]} is a subspace of {α[2, 1] | α ∈ R }, which is in turn a subspace of R 2.

2) The only subspace of {[0, 0]} is itself.

{[0, 0]} ⊆ S {α[2, 1] | α ∈ R } ⊆ S R 2

{[0, 0, 0]} ⊆ S {α[-1, 3, 9] | α ∈ R } ⊆ S R 3

4) The set R 2 is not a subspace of R 3 since R 2 is not contained in R 3.

( R 2 consists of 2-vectors and R 3 contains no 2-vectors)

18. Show that S = {[a, b, 0, d] | a, b, d ∈ R } is a subspace of R 4.

Examples: Show that the following sets S are subspaces of V.

Solution:

S = {[a, b, 0, d] | a, b, d ∈ R }
V = R4

S = {[a, b, 0, d] | a, b ∈ IR} ∈ R 4
Step 1: Is S a subset of V

Thus, S ⊆V

SS1: to check if 0v ∈ S
Step 2: Is S a vector space in itself.

Thus, 0v = [0, 0, 0, 0] ∈ S
In R 4, [0, 0, 0, 0] is the additive identity.

Let u ∈ S  u = [a, b, 0, d]
SS2: S is closed under scalar-vector multiplication

So, αu ∈ S
Consider αu = α [a, b, 0, d] = [αa, αb, 0, αd]

Let u, v ∈ S  u = [a, b, 0, d], v = [x, y, 0, z]

SS3: S is closed under vector addition

So, u + v ∈ V
Consider u + v = [a, b, 0, d] + [x, y, 0, z] = [a + x, b + y, 0, d + z]

As S satisfies all the conditions of a subspace, we have S is a vector space.

From Step 1 & 2, we have S is a subspace of V.

19. Show that S = {[a, b, a + b] | a, b ∈ R } is a subspace of R 3.

Solution:

S = {[a, b, a + b] | a, b ∈ R }
V = R3

S = {[a, b, a + b] | a, b ∈ R } ∈ R 3
Step 1: Is S a subset of V

SS1: to check if 0v ∈ S
Step 2: Is S a vector space in itself.

In R 3, [0, 0, 0] is the additive identity.

Thus, 0v = [0, 0, 0] ∈ S
Also, [0, 0, 0] = [0, 0, 0 + 0]

Let u ∈ S  u = [a, b, a + b]
SS2: S is closed under scalar-vector multiplication

So, αu ∈ S
Consider αu = α[a, b, a + b] = [αa, αb, α(a + b)] = [αa, αb, αa + αb]

Let u, v ∈ S  u = [a, b, a + b], v = [x, y, x + y]

SS3: S is closed under vector addition
 So, u + v ∈ SV
u + v = [a + x, b + y, a + b + x + y] = [a + x, b + y, (a + x) + (b + y)]

As S satisfies all the conditions of a subspace, we have S is a vector space.

From Step 1 & 2, we have S is a subspace of V.

20. Check if S = {[x, 1] | x ∈ R } is a subspace of R 2.

Solution:

S = {[x, 1] | x ∈ R }
V = R2

S = {[x, 1] | x ∈ R } ∈ R 2
Step 1: Is S a subset of V

SS1: to check if 0v ∈ S
Step 2: Is S a vector space in itself.

In R 2, [0, 0] is the additive identity.

But 0v = [0, 0] ∉ S
As all the conditions of a subspace are not satisfied, S is a not a vector space.
Thus, S is a not a subspace of V.

21. Check if the set of all diagonal matrices of order 2 x 2 is a subspace of M2[ R ].
Solution:
V =M 2 [ R]=
{[ ]
a b
c d
∨a , b , c , d ∈ R
}
S=
{[ ]
a 0
0 d
∨a ,d ∈ R
}
22. Check if the set of all 2 x 2 matrices with determinant 0 is a subspace of M 2[ R ].
Solution:
V =M 2 [ R]=
{[ ]
a b
c d
∨a , b , c , d ∈ R
}
S=
[{ ac bd ]∨a ,b ,c , d ∈ R , ad−bc=0}
Step 1: Is S a subset of V
S⊆V
Step 2: Is S a vector space in itself.
SS1: 0v = [ 00 00]
0v ∈ S
|0v| = 0*0 – 0*0 = 0

SS2: S is closed under scalar-vector multiplication

Let A ∈ S  A = [ ac bd ], ad – bc = 0

Consider αA = α
[ ac bd ]=[ αα ac αα bd ]
So, αA ∈ S
|αA| = αa*αd – αb*αc = α2(ad – bc) = α2*0 = 0

Let A, B ∈ S
SS3: S is closed under vector addition
 A= [ ]
a b
c d
, ad – bc = 0

B= [ ]
x y
z w
, xw – zy = 0

Consider A + B = [ ][ ][
a b x y
c d
+
z w
=
a+ x b+ y
c + z d +w ]
|A + B| = (a + x)*(d + w) – (c + z)*(b + y)
= ad + aw + dx + xw – (cb + cy + zb + zy)
= ad + aw + dx + xw – cb – cy – zb – zy
= (ad – bc) + (xw – zy) + aw + dx – cy – zb
= 0 + 0 + aw + dx – cy – zb
= aw + dx – cy – zb
May or may not be zero
So, A + B ∉ S

For example, A = [ 10 00] [ 00 01] , A +B=[10 01]

,B=

As S satisfies all the conditions of a subspace are not satisfied, S is not a vector space.
From Step 1 & 2, we have S is not a subspace of V.