Linear Algebra MAT 160

Dr. Pradip Kumar, pradip.kumar@snu.edu.in, A111K

1 About the course

1.1 Assessment Scheme
1. 3 Quiz- Each 10% total 30%

2. Mid term 30%

3. End term 40%

1.2 Grading Scheme

ABSOLUTE. A ≥ 91.

1.3 Syllabus and Books

Main Text: W. Keith Nicholson,Linear Algebra with Applications, Open edition, Lyryx Learning,
2018.https://lyryx.com/wp-content/uploads/2018/01/Nicholson-OpenLAWA-2018A.pdf
Supporting Texts:
1. Robert Beezer,A First Course in Linear Algebra, 2015.http://linear.ups.edu/html/fcla.
html2.
2. Jim DeFranza and Daniel Gagliardi, Introduction to Linear Algebra with Applications, Tata
McGraw Hill, 2017
3. Kumaresan, Linear Algebra – A Geometric Approach, Prentice Hall India, 2000

Syllabus:
1. 1.1, 1.2 and 1.3
2. 2.1 to 2.6
3. 3.1 to 3.3

4. 5.1 to 5.5
5. 6.1 to 6.4
6. 7.1 to 7.3

1
7. 8.1, 8.2
8. 91. to 9.3
9. 10.1 to 10.3

2
2 Lecture 1: 12 08 2024: From the book- 1.1, 1.2, and 1.3
2.1 Concepts
1. Linear equation
2. Solution
3. System of linear equation
4. Solution to a system
5. Consistent
6. Parametric form of the solution
7. Coefficient matrix and constant matrix
8. Elementary row operations The following are called elementary row operations on a matrix:
(a) Interchange two rows.
(b) Multiply one row by a nonzero number.
(c) Add a multiple of one row to a different row.
9. Row-Echelon form A matrix is said to be in row-echelon form (and will be called a row-echelon
matrix ) if it satisfies the following three conditions:
(a) All zero rows (consisting entirely of zeros) are at the bottom.
(b) The first nonzero entry from the left in each nonzero row is a 1, called the leading 1 for
that row.
(c) Each leading 1 is to the right of all leading 1s in the rows above it.
A row-echelon matrix is said to be in reduced row-echelon form (and will be called a reduced
row-echelon matrix ) if, in addition, it satisfies the following condition:
(a) Each leading 1 is the only nonzero entry in its column.
4. Rank of a matrix
5. Suppose a system of m equations in n variables is consistent, and that the rank of the aug-
mented matrix is r.

(a) The set of solutions involves exactly n − r parameters.

(b) If r < n, the system has infinitely many solutions.
(c) If r = n, the system has a unique solution.

6. Let A be an m × n matrix of rank r, and consider the homogeneous system in n variables

with A as the coefficient matrix. Then:
(a) The system has exactly n − r basic solutions, one for each parameter.
(b) Every solution is a linear combination of these basic solutions.

3
2.2 Exercise Set 1
From the book- Exercise number 1.1, 1.2, and 1.3

2.3 Exercise Set 2

1. Define a system of linear equation.

2. Write down mathematically what does it mean to say α is a solution of the system:
n
X
1 ≤ i ≤ m, aij xj = 0 (1)
j=1

3. In short notation write down a system of linear equation having 5 variable and 3 equation
and system is homogeneous.
4. T/F: Every homogeneous system of linear equation is consistent.
P3
5. Let a1 , a2 , a3 be some fixed real numbers. Let i=1 ai xi = 0 be a linear equation in variables
x1 , x2 , x3 . Let S be the solution set of this linear equation. Below statements are True or
False. Explain with proper logic.
(a) S ⊂ R3 .
(b) S ̸= ϕ.
(c) Let a1 ̸= 0, then S ̸= R3 .
6. Let ax+by = 0 be a homogeneous linear equation with variable x, y. Is the following statement
true:
“If S has one element then it has infinitely many element"
If true then give reason, otherwise can you think, when is it not true and when is this true?
7. Let C = {(x, y) ∈ R2 : x2 + y 2 = 1} and this a subset of the solution set of a linear equation
in two variables, then solution set is R2 . True or False, with argument.
8. Give definition of a linear equation in one variable.

9. Can you find a linear equation in one variable whose solution set is empty.
10. Can you find a linear equation in one variable whose solution set has exactly two elements.
11. (a) Give an example of linear equation in 29 variable.
(b) Solution set of your linear equation (29 variable) as above.
12. Let
n
X
1 ≤ i ≤ m, aij xj = bi (2)
j=1

above, 1 ≤ i ≤ 3, n = 4. moreover for i ≥ 2, bi = 0 and for i ≥ 2, aij = 0. Then system is

consistent or not. If consistent, how many free variable.

4
13. Let Sh be a solution set for a homogeneous system of linear equation then prove
(a) Ov ∈ Sh ,
(b) α, β ∈ Sh then α + β ∈ Sh .
(c) α ∈ Sh then for all t ∈ R, t.α ∈ Sh .

14. A famous result: (just remember this): A homogeneous system has a nontrivial solution if
and only if the number of the equations is less than the number of variables.
15. Given an example of an inconsistent system of linear equations.

5
3 Quiz 1
Date: 22 August 2024, during the class time
Syllabus: Exercise Set 1, and Exercise Set 2.

6
4 Exercise Set 3: Question related Linear Map
1. Show that the following maps are linear:
(a) F : R2 → R3 defined by F (x, y) = (x + y, , x)
(b) F : R3 → R defined by F (x, y, z) = 23x − 19y + 47x.
2. Show that the following maps are not linear.
(a) F : R → R given by F (x) = x2 , F (x) = sin x, F (x) = 2x + 5.
(b) F : R2 → R3 defined by F (x, y) = (x + 1, 2y, x + y).
3. Let T : M2×2 → M2×2 defined by T (A) = A + At . Check if it is a linear transformation.
4. T : R3 → R3 defined by T (x, y, z) = (−x + y + z, 2x − y, x + y + 3z). Prove that T is linear
map find a basis for Ker(T ) and Range(T ).
x+y+z
5. T : R3 → R given by T (x, y, z) = 3 . Find Im(T) and Ker (T).
6. Let F : R4 → R3 be a linear map defined by

F (u, v, x, t) = (u − v + x + t, u + 2x − t, 2u + v + x − 4t)

Find a basis and the dimension of

(a) Image of F
(b) Kernel of F
7. Find a linear map T : V → W , where V = {(x, y, z) : 2x+z = 0} and W = {(x, y) : x−y = 0}.
8. Let T : R2 → R be a linear map for which

T (1, 1) = 3, T (0, 1) = −2

How many such T exists, find all.

9. Let T : R3 → R such that T (1, 0, 0) = 4, T (2, 0, 1) = 10. Find T (0, 0, 1).
10. Let T : R3 → R given by T (v) = A.v, where A is a 3 × 3 matrix. Find A such that
Ker(T ) = x − z plane.
11. Let V = {(x, y) = 2x + y = 0, W = {(x, y, z) = 2x + 3y = 0} and W1 = {(x, y, z) : 2x + 3y =
0, z = 0}.
(a) Find a linear map T : V → W whose image lies in W1 .
(b) Find a non linear map from V → W .
12. Let T : R3 → R is linear map given by T (1, 1, 0) = 3 and T (0, 1, 1) = 6 and T (1, 1, 1) = 7.
Find T (x, y, z).
13. Let F : V → W be a linear map which is one one and onto. Prove that F −1 will also be a
linear map.

7
 14. Let f : R → R be a linear map. Prove that there is constant a ∈ R such that f (x) = a.x
15. Find a linear map F : R2 → R3 whose image is generated by linear combination of (1, 0, 4)
and (2, 3, 5).
16. Give two examples of linear mapping T : V → U with image U1 and U2 , U ̸= U2

17. Sum of two linear map is a linear map.

18. Let V, W be two vector space. Does there is a linear map T : V → W such that Ker(T ) =
Im(T ).
19. Does there exists V , W and a linear map T : V → W such that

(a) Im(T ) = W and Ker(T ) = V and V is not a trivial vector space.

(b) V and W both are not tivial vector space and Im(T ) = W and Ker(T ) = V .

5 Quiz 2
Date: 19th September 2024
Syllabus: Exercise set 3 from this notes– and from the book- 2.5 and 2.6.

6 Mid Term Syllabus

1. Syllabus of Quiz 1
2. Syllabus of Quiz 2
3. and from the book. 5.1, 5.2 and 5.4

Date and Time: 27 September 5:30 to 7:30 PM

8
 7 Vector Space over R: definition
A vector space over R is a set (V, +, .), where + and . are defined as the vector addition and scalar
multiplication. It is easy to see that it is closed under addition as well as scalar multiplication. It
satisfies the following axioms:
1. For all v, w ∈ V, v + w = w + v.
2. For all u, v, w ∈ V, (u + v) + w = u + (v + w).

3. There exist 0 ∈ V such that ∀v ∈ V, v + 0 = v.

4. For all v ∈ V, ∃w ∈ V such that w + v = 0v .
5. For all t ∈ R, v, w ∈ V, t.(v + w) = t.v + t.w.
6. For all t, s ∈ R, v ∈ V, (ts).v = t.(sv).

7. For all t, s ∈ R, v ∈ V, (t + s).v = t.v + t.s.

8. For all v ∈ V, 1v = v.
Exercise 7.1. Define the set Rn . Define a vector addition and scalar multiplication • on Rn
such that (Rn , , •) becomes vector space over R.

Solution. Rn is a set defined as

Rn := {(x1 , x2 , . . . xn ) : x1 , x2 , . . . xn ∈ R}

We define vector addition on Rn as follows:

Let x, y ∈ Rn , then we have
x = (x1 , x2 , . . . xn );
and y = (y1 , y2 , . . . yn )
We define
x y := (x1 + y1 , x2 + y2 , . . . xn + yn ); and
α • x := (α.x1 , α.x2 , . . . α.xn )
With this vector addition and scalar multiplication, we will prove that (Rn , , •) is a vector space
over R.

Proof of A. Let x, y ∈ Rn , we have x = (x1 , x2 . . . xn ) and y = (y1 , y2 , . . . , yn ). Then x y = (x1 + y1 , x2 +

y2 , . . . xn + yn ). Since each xi + yi ∈ R therefore (x1 + y1 , x2 + y2 , . . . xn + yn ) ∈ Rn . Therefore
Rn is closed under .
Proof of B. Let x ∈ Rn , we have x = (x1 , x2 . . . xn ). Then α • x = (α.x1 , . . . α.xn ). Since each α.xi ∈ R
therefore (α.x1 , . . . α.xn ) ∈ Rn . Therefore Rn is closed under •.

9
1. Let x = (x1 , x2 . . . xn ) and y = (y1 , y2 . . . yn ). We have x y = (x1 + y1 , x2 + y2 , . . . xn + yn )
and y x = (y1 + x1 , y2 + x2 , . . . yn + xn ).
Using the commutative property of R, we have for each i, xi + yi = yi + xi .
Therefore (x1 + y1 , x2 + y2 , . . . xn + yn ) = (y1 + x1 , y2 + x2 , . . . yn + xn ). This proves that

x y=x y

.
Did you notice? We use commutative property of R to prove that is commutative in Rn .
2. Here we will prove that for any x, yz ∈ Rn , we have

x (y z) = (x y) z

So we will start from x, y, z ∈ Rn . Let x, y, z ∈ Rn , then we have x = (x1 , x2 , . . . xn ),

y = (y1 , y2 , . . . yn ) and z = (z1 , x2 , . . . zn ).
We have !
x (y z) = x1 + (y1 + z1 ), x2 + (y2 + z2 ), . . . xn + (yn + zn )

and !
(x y) z = (x1 + y1 ) + z1 , (x2 + y2 ) + z2 , . . . (xn + yn ) + zn )

Now using associative property of R we have for each i, xi + (yi + zi ) = (xi + yi ) + zi

therefore we have
x (y z) = (x y) z

3. Now we will prove that there exists a 0V ∈ Rn such that for any x ∈ Rn , we have x 0V = x.
To prove this we have two steps: First is to search 0V ∈ Rn and then we have to verify that

∀x ∈ Rn , x 0V = x

Lets start proving:

We want 0V ∈ Rn , so 0V = (v1 , v2 , . . . vn ) and we want v1 , v2 , . . . vn ∈ R such that for each
x = (x1 , x2 , . . . , xn ), we have x 0V = x.
We have vi ∈ R such that for each xi ∈ R we have xi + vi = 0.
As 0 ∈ R and and we know that for each i, xi + 0 = xi . Therefore if we take

0V = (0, 0, . . . , 0) n tuple

then we have this OV ∈ Rn and for

x 0V = x.

10
 4. Here we will start from fix x ∈ Rn and then find some y ∈ Rn such that x y = 0V .
So for the following calculation, we will assume x ∈ Rn is given and find y.
Let x = (x1 , x2 , . . . xn ). We are looking for some y = (y1 , y2 . . . yn ) such that

x y = (x1 + y1 , x2 + y2 , . . . xn + yn ) = 0V = (0, 0, . . . 0)

This means that for each given xi we have to find yi such that xi + yi = 0.
Using property of R we know that yi = −xi and this gives that
y = (−x1 , −x2 , . . . , −xn )
since each −xi ∈ R, therefore y ∈ Rn and we can verify that

x y = 0V

5. Here we will prove that for given α ∈ R and given x, y ∈ Rn , we have

α • (x y) = α • x α • y.

Here again you expand left side and right side and use the distributive property of R to say
that for each i, we have
α.(xi + yi ) = α.xi + αyi

ALERT: above statement is the distributive property of R.

Hence after expanding (applying definition of , we can conclude that α • (x y) = α • x α • y.
6. Here we will prove that for given α, β ∈ R, and x ∈ Rn , we have to prove that

(α.β) • x = α • (β • x)

Here again you start from given α, β and given xi ∈ R, x = (x1 , x2 , . . . , xn ) and expand the
both side of above. Remember: Given means, you have given symbol α, β and x. Here again
you have to use property of R (which property, can you guess? better write complete the
proof).
7. Now for given α, β ∈ R and x ∈ Rn , we have to prove that

(α + β) • x = α • x β • x

8. Here we have to prove that for given x ∈ Rn ,

1•x=x

Here
1 • x = 1 • (x1 , x2 , . . . , xn ) = (1.x1 , 1.x2 , . . . , 1.xn ) = (x1 , x2 , . . . , xn ) = x
Here we are using for for every xi ∈ R, we have 1.xi = xi .

Above A, B, (1) to (8) proves that (Rn , , •) is a vector space over R.

11
8 Properties of vector space
Let (V, +, •) be a vector space over R2 then we have the following properties. Please supply the
proof of the following.
Property 8.1 (Property 1). For all v ∈ V , we have 0.v = 0V

Property 8.2 (Property 2). If there are two element w1 , w2 ∈ V such that for all v ∈ V we have
v + w1 = v and v + w2 = v. Then we have w1 = w2 .
This property tells us that the element in the vectors space which we get from the third axiom
is unique. This unique element is said to be THE IDENTITY of the vector space and denoted by
0V .
The identity element is unique in the vector space. It does not depend on the element of v ∈ V .
Property 8.3 (Property 3). For v ∈ V if there are two element w1 , w2 ∈ V such that v + w1 = 0V
and v + w2 = 0V , then we have w1 = w2 .
This property says that for given v ∈ V , the vector w such that v + w = 0V , is unique.
This w depends upon v for each v such unique w is said to be ADDITIVE INVERSE of v. It
is denoted by −v.
Remember, −v is the symbol for such w. No other meaning.
Property 8.4 (Property 4). For any α ∈ R and v ∈ V , we have α.0V = 0v .

Property 8.5 (Property 5). If for some α ∈ R and v ∈ V we have α.v = 0V then we have either
α = 0 or v = 0V .
You should do the proof of above properties using only axioms of the vector space.
Exercise 8.6. Let u, w ∈ V and
∀v ∈ V, v + u = v + w
then prove that u = w.
Solution. In the class, we have seen the proof of this one. We have seen three proof. Write the
using only the third axiom.
Exercise 8.7. For given v, u, w ∈ V , if we have

v+u=v+w

then u = w
Solution. Proof of this one using axiom or properties. Write proof carefully.
The exercise above 8.7 is said to be CANCELLATION LAW.

12
9 Exercise: Vector sapces
9.1 Linear Span of a finite subset of Rn
Now we will do the following exercises:
1. If A is a finite subset of Rn and A = LS(A) then prove that A = {Ov }.
2. Let B = LS(A), then prove that LS(B) = LS(A).
3. Let A, B ⊂ R2 are two sets. Then
LS(A) ∩ LS(B) = LS(A ∩ B)
True or False.
4. Let A = {(1, 3, 0), (0, 4, 1), (0, 0, 1)}, then prove that LS(A) = R3 .
5. Let W be a subset of R2 such that
(a) ∀v, w ∈ W we have v + w ∈ W
(b) and ∀α ∈ R, v ∈ W , we have α.v ∈ W .
Let A ⊂ W , then prove that LS(A) ⊂ W .
(c) If A = (0, 1), then find LS(A).

9.2 Exercise:vector space

1. Let V = {(x, y) ∈ R2 : x ≥ 0, y ≥ 0} be a subset of R2 . We defined scalar multiplication and
vector addition in V as in R2 . Is (V, +, .) is a vector space over R.
2. W = {(x, 0) : 0 ≤ x ≤ 1} with usual addition and scalar multiplication, is W a vector space
over R.
3. Let V be a Singleton set containing the element a BABY DOLL. Can we make V as a vector
space over R.
4. Can we interchange the numbering of the defining axioms of the vector space.
5. What is the difference between Axiom and properties.
6. Define Rn , define addition and scalar multiplication • on Rn such that (Rn , , •) is a vector
space over R. Prove all facts.
7. Let Sh be a solution set of set of homogeneous linear equation in n variable and m equations.
Define addition and scalar multiplication • on Sh such that (Sh , , •) is a vector space over
R. Prove all facts.
8. Let A be a subset of Rn . Let LS(A) be the linear spanning set of A. Define addition and
scalar multiplication • on LS(A) such that (LS(A), , •) is a vector space over R. Prove all
facts.
9. Let Mm×n be a set of all matrices of order m × n. With vector addition as matrix addition
and scalar multiplication as the multiplying the matrix by a scalar. Prove that Mm×n is a
vector space.

13
9.3 Exercises: Subspaces
Let (V, +, .) be a vector space. Let W ⊂ V such that W itself is a vector space with induced
operations. We say W a subspace of V .
1. True or False with supportive arguments.
(a) W1 ⊂ Mm×n = V be the matrices whose first row is zero. Then W1 is a subspace of V .
(b) W2 is the set of all matrices of order m × n with diagonal zero. Then W2 is a subspace
of V .
2. Let P be the set of all polynomial with degree less than or equal to 5. Let W = {p ∈ P :
p(5) = 0} Then W is a subspace of P . True of False.
3. Let V = {f : R → R : f (5) = 0}. Is V a subspace of set of all functions from R to R.

4. Let V = {f : R → R : ∃t0 ∈ R, f (t0 ) = 0}. Is V a subspace of set of all functions from R to

R.
Pn
5. For given aij constants, Let V = {(x1 , x2 .., xn ) : j=1 aij xj = 0}. Is V a subspace of Rn

6. Let V = {(x1 , x2 ) : x21 + x22 = 1}. Is V a subspace of R2 .

7. Let A be a n × n matrix and λ ∈ R as fixed number. Let V = {v ∈ Rn : A.v = λ.v}. Then V
a subspace.

8. {(1, 2, 1) + s(3, −2, 1) : s ∈ R} is a subspace. True or False.

9. Prove: W is a subspace of V if and only if
(a) 0V ∈ W .
(b) W is closed under vector addition.
(c) W is closed under scalare multiplication.

14
10 How to construct Subspaces: More exercises
Do the following exercises.
1. Let V = R4 , a vector space. Find subpspaces W1 , W2 , W3 and W4 such that

W 1 ⊂ W 2 ⊂ W 3 ⊂ W 4 = R4 .

Here containment is proper.

2. Let
W1 = {t(1, 0, 0, 7) + s(1, 6, 3, 2) : t, s ∈ R}
and
W2 = {t(1, 18, 9, −20) + s(1, 0, 0, 7) : t, s ∈ R}
Find a finite set A such that LS(A) = W1 ∩ W2 .
3.      9  
1 3 7 1 2 0 0 0
W = a. +b +c 2 1 : a, b, c ∈ R
2 4 6 0 3 1 0 3 2
Check:
(a) Whether W a subspace of M2×3 (R).
(b) Find a non trivial subspace of W .
4. W1 and W2 are two subspace of V . Prove that
(a) W1 ∪ W2 may not be subpsace.
(b) If W1 ∪ W2 is a subspace then either W1 ⊂ W2 or W2 ⊂ W1 . Here ⊂ included equality
as well.
5. Let W1 and W2 are two subspaces of a vector space V . Prove that W1 ∩W2 always a subspace.
6. Let S = {(1, 1, 3), (0, 2, 1)} ⊂ R3 .
(a) Is (2, 3, 1) ∈ L(S)
(b) Find two subspaces W1 and W2 such that S ⊂ W1 and S ⊂ W2 and W1 ⊂ W2 . Here
containment is proper.
7. Let S = {f1 , f2 , f3 , f4 , f5 } ⊂ F (R, R). Here f1 (x) = x, f2 (x) = x2 , f3 (x) = x3 , f4 (x) = x4
and f5 (x) = 1.
(a) Let g : R → R defined by g(x) = (1 + x)2 , does g ∈ LS(S).
(b) Let h(x) = sin x. Does h ∈ LS(S)?
8. Prove that LS(A) is the smallest subspace containing A.
9. Let W1 = {(x, y, z) ∈ R3 : x − y = 0} and W2 = {(x, y, z) : x = 0}.
(a) Prove that W1 and W2 are subspaces of R3

15
 (b) Find W1 + W2 . Whether it is R3 ?
(c) Find A1 , A2 , A3 and A4 finite sets such that W1 = LS(A1 ), W2 = LS(A2 ), W1 + W2 =
LS(A3 ) and W1 ∩ W2 = LS(A4 )
10. W1 be the set of matrices of order 3 × 3 whose diagnonal is zero. W2 be the set of matrices
of order 3 × 3 whose a2,2 entry is zero.

(a) Prove that W1 and W2 are subspaces of M3×3 (R)

(b) Find A1 , A2 , A3 and A4 finite sets such that W1 = LS(A1 ), W2 = LS(A2 ), W1 + W2 =
LS(A3 ) and W1 ∩ W2 = LS(A4 )
11. V = R3 , Find W1 and W2 two subspaces of R3 such that W1 ∩W2 = {(0, 0, 0)} and W1 +W2 =
R3 .

16
11 Revision Exercises
1. Find the solution set for the following system of equations:
(a) L1 := x + y + z = 1, L2 := 2x − y + z = 2.
(b) L1 := 5x + 4y + 3z = −1, L2 := 2x + z = 10, L3 := 3x + 8y + 9z = 6.
(c) L1 := x + z + w = 1, L2 := 9x + y + z − 3w = 0
(d) L1 := x + 2y + 3z = 0, L2 := 2x + 60y = 0, L3 := x − z = 0.
2. Let (V, +, •) be a vector space over R. Let V ̸= 0v , then prove that V has infinite number of
elements.

3. If S is a non empty subset of a vector space V, then prove that the set W consisting of all
linear combination of elements of S is a subspace of V. Also, prove that it is the smallest
subspace containing S.
4. Prove the following for a vector space V :
(a) 0.x = 0V for all x ∈ V.
(b) α.0V = 0V for all α ∈ R and 0 ∈ V.
5. 0x = 0 for each x ∈ V.
6. Prove that the vector 0V in the vector space is unique.

7. A real valued function defined on the real line R is called an even function if f (−x) = f (x)
for each real number x. Prove that the set of even functions defined on the real number with
the operations of addition and scalar multiplication defined as (f + g)(s) = f (s) + g(s) and
(cf )(s) = cf (s).
8. Prove that set of all polynomials of degree (≤ n) forms a vector space under the usual addition
and scalar multiplication of polynomials.
9. What are all the vector subspaces of R, R2 ? What are their geometric description?
10. The trace of a matrix is defined as the sum of diagonal elements of a matrix. Let W = {A ∈
Mn (R) : T race(A) = 0}. Check W is a vector subspace of Mn (R) or not.

11. Let W1 = {(x, y, z) ∈ R3 : x − y = 0} and W2 = {(x, y, z) ∈ R3 : x = 0}. Then

(a) Prove that W1 , W2 are subspace of R3 .
(b) Find W1 + W2 and W1 ∩ W2 .
12. W1 = Set of all matrices of order 3 × 3 whose diagonal is zero.
W2 = Set of all matrices of order 3 × 3 whose a22 entry is zero.Then

(a) Prove that W1 , W2 are subspace of R3 .

(b) Find W1 + W2 and W1 ∩ W2 .

17
13. Let V = R3 . Find W1 and W2 be two subspaces of R3 such that W1 ∩ W2 = {(0, 0, 0)} and
W1 + W2 = R 3 .
14. Check: the following are subspace of R3 : or not?
(a) W = {(x, y, z) ∈ R3 : xyz = 0}.
(b) W = {(x, y, z) ∈ R3 : x2 + y 2 − z 2 = 0}.
(c) W = {(2x, 3y, 4z) ∈ R3 : t ∈ R}.
(d) W = {(x, y, z) ∈ R3 : ax + by + cz = 0}.
(e) W = {(x, y, z) ∈ R3 : x + y + z = 10}.
(f) W = {(x, y, z) ∈ R3 : x = 3z + 1}.
(g) W = {(x, y, z) ∈ R3 : x = 2y, z = −y}.
15. Prove the following statements are true or false:
(a) tanx ∈ LS(sinx, cosx).
(b) x3 + 4x + 9 ∈ LS(1, x).
(c) x2 + 2 ∈ LS(1, x, 1 + x).
(d) 3 − x2 ∈ LS(1, x, x2 )
(e) 5x + π ∈ LS(x2 + 1, x).
(f) (4, 9, 12) ∈ LS((1, 0, 0), (0, 2, 0), (0, 0, 5)).
(g) (4, 5, 6, 7) ∈ LS((1, 0, 0, 0), (0, 1, 0, 0), (0, 0, 1, 0), (0, 0, 0, 1)).
(h) The empty set is always a subspace of every vector space.
16. W1 = Set of all symmetric matrices of order n × n.
W2 = Set of all skew symmetric matrices of order n × n.
W3 = Set of all diagonal matrices of order n × n.
Prove that W1 , W2 , W3 are subspace of Mn (R).
17. Let V = R4 be a vector space. Find subspaces W1 , W2 , W3 , W4 of R4 such that W1 ⊂ W2 ⊂
W3 ⊂ W4 = R4 .(Here containment means proper subset.)
    9 
1 0 10 9 11 15 0 0
18. Let W = {a +b +c 2 : a, b, c ∈ R}
5 −1 10 6 1 9 0 3 12
(a) Check whether W is a subspace or not.
(b) Find a proper subspace of W, (W ̸= 0v )
19. Let A = {(1, −1, 4), (1, 0, −2)} ⊂ R3 .
(a) (4, 6, 8) ∈ LS(A).
(b) Find two subspace W1 , W2 such that A ⊂ W1 , A ⊂ W2 and W1 ⊂ W2 .
20. Let A = {1, x, x2 , x3 } be a subset of all function from R to R. Let g be a function from R to
R such that g(x) = (1 + x)3 . Then g ∈ LS(A)

18
12 Basis.
Definition 12.1 (Basis). Let V be a vector space over R. Basis of B is the subset of V such that
B is independent and LS(B) = V .
Few very important results:
1. Let B be a basis of V then every vector v ∈ V can be written UNIQUELY as linear combi-
nation of elements of B.

2. Every vector space has a Basis.

3. Every vector space has infinitely number of basis.
4. Every basis of the vector space will have same cardinality

5. If a vector space has a basis B such that |B| = n (finite). Then we say vector space is finite
dimensional. And the number of element of the basis is called the DIMENSION of the vector
space.

13 How to find Basis

Only one method:
1. First find the set A such that V = LS(A).

2. Then if A is independent, A will be Basis, otherwise find a subset B of A which is independent

and LS(B) = LS(A).
In the case of Matrices or Rn , it can be done using REF techniques etc.
Sometime the following result is also useful:

Dim(W1 + W2 ) = Dim(W1 ) + Dim(W2 ) − Dim(W1 ∩ W2 )

14 Exercise
1. Basis is always a proper subset of a vector space. True or false with logic.

2. Does there exists a vector space having a basis B such that B = LSB
3. Give an example of a vector space which is infinite dimension.
4. Given an example of a vector space which is finite dimension but not a subset of Rn .

5. Give three basis (that is three subset of R3 which are independent and spans R3 ) of R3 .
6. Does there exist two basis of B1 and B2 of R4 such that B1 ⊂ B2 (properly contained).
7. Find basis of W , W1 , W2 , W1 + W2 and W1 ∩ W2 , where

19
 (a) W1 = {(x, y, z) ∈ R3 : x − y = 0} and W2 = {(x, y, z) : x = 0}.
    9 
1 0 10 9 11 15 0 0
(b) W = {a +b +c 2 : a, b, c ∈ R}
5 −1 10 6 1 9 0 3 21
(c) W1 = Set of all matrices of order 3 × 3 whose diagonal is zero.
W2 = Set of all matrices of order 3 × 3 whose a22 entry is zero.
8. Let V be a n dimensional vector space over R. Let W be a subspace of V and Dimension of
W is n. Prove that W = V .
9. Let B1 and B2 are finite set and which are basis of W1 and W2 respectively. Let V = W1 ⊕W2 .
Prove that basis of V is B1 ∪ B2 .

1. Basis is always a proper subset of a vector space. True or false with logic.
2. Does there exists a vector space having a basis B such that B = LSB
3. Give an example of a vector space which is infinite dimension.

4. Given an example of a vector space which is finite dimension but not a subset of Rn .
5. Give three basis (that is three subset of R3 which are independent and spans R3 ) of R3 .
6. Does there exist two basis of B1 and B2 of R4 such that B1 ⊂ B2 (properly contained).

7. Find basis of W , W1 , W2 , W1 + W2 and W1 ∩ W2 , where

(a) W1 = {(x, y, z) ∈ R3 : x − y = 0} and W2 = {(x, y, z) : x = 0}.
    9 
1 0 10 9 11 15 0 0
(b) W = {a +b +c 2 : a, b, c ∈ R}
5 −1 10 6 1 9 0 3 21
(c) W1 = Set of all matrices of order 3 × 3 whose diagonal is zero.
W2 = Set of all matrices of order 3 × 3 whose a22 entry is zero.

8. Let V be a n dimensional vector space over R. Let W be a subspace of V and Dimension of

W is n. Prove that W = V .
9. Let B1 and B2 are finite set and which are basis of W1 and W2 respectively. Let V = W1 ⊕W2 .
Prove that basis of V is B1 ∪ B2 .

20