College of Engineering Pune

Linear Algebra ( MA15001 )

F.Y.B.Tech. Semester I (All Branches) 2019-20
Hints for Tutorial -1

Q.1 a) False, think of equations of two overlapping lines and a non-parallel lines to
those two. (eg. x + y = 3, x − y = −1, 2x + 2y = 6.)
b) True, show that we get always at least one free variable
c) False, show that if we have two solutions then any linear combinations of those
two solutions is also a solution.
d) True, prove it using the definition of pivot. (Pivot is the first non-zero entry in
each row of echelon form of the matrix)
e) True, show that rank(A) is not equal to rank([A:b]).
f) False, think of homogeneous system
g) Show that homogeneous system always have at least one solution. (think of
trivial solution)

Q.2 Use the fact that AX = 0 has infinitely many solutions only if det(A) = 0 or apply
Gauss elimination method.

Q.3 Homogenous system AX = 0 have non-trivial solution if det(A) = 0 or apply Gauss

elimination method.

Q.4 Express the n-tuple X = (x1 , x2 , · · · , xn ) as x1 E1 + x2 E2 + · · · + xn En and use the

properties of dot products.

Q.5 Use properties of dot product

Q.6 use properties of dot product

Q.7 AXp = B, AXh = 0 implies AX = A(Xp + Xh ) = AXp + AXh = B + 0 = B.

Q.8 Use Gaussian elimination method and take help of free variable to arrive at a non-
trivial solution

Q.9 Show that determinant of each coefficient matrix is zero or apply Gauss method.

Q.10 Use Gaussian elimination method to check whether rank of coefficient matrix is
equal to the rank of the augmented matrix.

Q.11 Find the values of λ for which determinant of the coefficient matrix is 0. or one can
try to apply the Gaussian elimination method.

1
Q.12 Form the non-homogenous system of equations and solve it for a1 , a2 , a3
   
1 1
Q.13 a) Consider a system AX = 0 , where first column of the matrix is 0 and
  
0 0
determinant of the matrix A is not equal to 0.
b) Consider a system AX=B in which first two columns of the matrix A are same
and equal to B.
c) Consider a system AX=B in which all three columns are same and equal to B.

Q.14 Perform the row operations, for example for the first matrix perform R2 − 2R1 ; R3 −
4R1 and then R2 + R3 .

Q.15 Let x: No. of packets of N and y: No. of packets of S. Packet N contains 5 kg of

wheat and 2 kg of rice, let us denote it by N = (5, 2) similarly S = (2, 5) i.e. first
coordinate denotes amount in kg of wheat and second coordinate denotes amount in
kg of rice. Now we need 34 kg of rice and 1 kg of rice. Therefore xN + yS = (34, 1)
implies that x = 8, y = −3. How will you interpret this practically?

Q.16 Solution set of homogeneous system system AX = 0 is the set of all n-tupples
(x1 , x2 , ..., xn ) which are orthogonal to every row vector of A.(Hyperplanes!)

Q.17 Theory question!

Q.18 Theory question. R2 is not a subspace of R3 . Why?

Q.19 Ans:(c) A and D only.

p′
Q.20 i {(u, v)|u = pq , v = q′
; p, q, p′, q ′ ∈ Z, q 6= 1, q ′ 6= 1.}
ii {(u, v)|u = 0orv = 0, u, v ∈ R}

Q.21 Yes! Try to show this.

Q.22 Easy.

Q.23 A plane passing through u, w, 0 or a straight line passing through v, w, 0.

Q.24 Zero matrix is not a non-singular matrix. Hence the set of all non-singular matrices is
not a vector space. Note also that sum of two singular matrices can be non-singular.

Q.25 W = {B ∈ Rn |B  Ai = 0∀i = 1, 2, ..., r.} ⊂ Rn .

i Note O = (0, 0, ..., 0) ∈ W since O  Ai = 0 ∀i.

ii Note that for B1 , B2 ∈ W, (B1 + B2 )  Ai = 0 implies that B1 + B2 ∈ W.

2
 iii For B1 ∈ W and k ∈ R, (k.B1 )  Ai = 0, implies that k.B1 ∈ W.

Q.26 (Viii), (ix) and (x) are not subspaces. why? other examples are subspaces. Justify.

Q.27 l ⊂ R2 . Part 1: Assume that l is a subspace of R2 then (0, 0) ∈ l =⇒ 0 =

m.0 + b =⇒ b = 0.
Part 2: Assume that b = 0, therefore l = {(x, y) ∈ R2 |y = mx} and one can easily
show that

(a) (0, 0) ∈ l
(b) if (x1 , y1 ) and (x2 , y2) ∈ l and k ∈ R then (x1 , y1 ) + (x2 , y2 ) ∈ l
(c) k.(x1 , y1 ) ∈ l.

Q.28 Answer is given. Explain.

Q.29 If U = W , then U + W = U or U + W = W . As for any element u ∈ U and

w ∈ W . u + w will be element of U + W and u + w = u + u = 2u ∈ U. In a similar
way, if U ⊆ W , then U + W = W .

Q.30 Subspaces of R2 are {0}, Lines through origin and R2 itself. Subspaces of R3 are
{0}, Lines through origin, planes through origin and R3 itself.

Q.31 Show that the unit element 0 belongs to W i.e. perpendicular to every element of
V. Also, sum of two elements of W and scalar multiple of a vector from W are also
perpendicular to every element of V.

Q.32 v1 , v2 , · · · , vn generate V if for an element v ∈ V , there exists numbers x1 , x2 , · · · , xn

such that
v = x1 v1 + x2 v2 + · · · + xn vn

Q.33 In class.

Q.34 In class.

Q.37 If we put linear combination

c1 v1 + c2 v2 + · · · + cn vn = 0

gives all the coefficients c1 = c2 = · · · = cn are all zero. Then the vectors
v1 , v2 , · · · , vn are said to be linearly independent. If any of the coefficients ci (i =
1, 2, 3, · · · , n) is non-zero, then the vectors v1 , v2 , · · · , vn are said to be linearly de-
pendent.

3
Q.38 (i) True. In system Ax = b, column vector bm×1 is in column space of matrix A. If
all the column vectors of matrix A are linearly independent and rank(A) = m. Thus
system of equations Ax = b have a unique solution.
(ii) For a 5 × 7 matrix, rank of matrix can at most be 5. So, it is not possible for all 7
columns to be linearly independent.
(iii) Consider a subset J of set I having less number of elements than the set I. We
will firstly consider that functions y1 and y2 are dependent in set J. So, coefficients
c1 and c2 both in linear combination
c1 y 1 + c2 y 2 = 0
can not be zero. We can extend this set J to set I. Since both of these coefficients are
not all zero in set I also, thus, functions y1 and y2 in set I will be linearly dependent
which leads to contradiction since I was a linearly independent set. Hence, subset J
can not be linearly dependent.
(iv) Consider u = (1, 0, 0), v = (0, 1, 0) and w = (0, 0, 1). The set {u, v, w} is
linearly independent. Also, consider the set {v, w, p} with p = (2, 0, 0). The set
{v, w, p} is also linearly independent. But the set {u, v, w, p} is linearly dependent
since p = 2u.
(v) True. Since the given set {u, v, w} is dependent then one vector is linear combi-
nation of other two i.e. one is in span of other two vectors.
(vi) If {u, v} is linearly independent and {u, v, w} is linearly dependent, then the
third vector {w} in the linearly dependent set is linear combination of linearly inde-
pendent vectors {u, v}.
Q.39 (i) Consider the linear combination
c1 (1, 1, 1) + c2 (0, 1, −2) = 0
We will get equations as
c1 = 0
c1 + c2 = 0
and
c1 − 2c2 = 0.
Only c1 = 0 and c2 = 0 will satisfy above equations. So, given vectors are linearly
independent.
(ii) Proceed in same way as part (i). The given vectors are independent.
(iii) The given vectors are dependent. Consider the linear combination
c1 (1, 0) + c2 (1, 1) + c3 (0, 1) = 0
which gives
c1 + c2 = 0

4
 and
c2 + c3 = 0.
We have c1 = −c2 and c2 = −c3 . So we have to choose value of one variable as
arbitrary say c1 = k. This will further give c2 = −k and c3 = k. ⇒ (c1 , c2 , c3 ) =
k(1, −1, 1). Since k is arbitrary so given vectors are a set of dependent vectors.
(iv-x) Proceed in same way as above parts. Firstly consider the linear combination
of given vectors as zero and solve the equations for the coefficients. If all the coeffi-
cients c1 , c2 , · · · , cn are zero then the vectors are independent else dependent.

Q.40
f1 (t) = t

and (
t if t ∈ [0, 1]
f2 (t) = (0.1)
−t if t ∈ [−1, 0].
Consider the interval [−1, 0]. Consider the linear combination

c1 f1 + c2 f2 = 0

⇒ c1 t + c2 (−t) = 0
⇒ c1 t − c2 t = 0
⇒ (c1 − c2 )t = 0
⇒ (c1 − c2 ) = 0
⇒ c1 = c2 .
So, we have to take one coefficient as arbitrary and thus c1 and c2 both are non-zero.
Hence, the vectors are dependent.
Again, consider the interval [0, 1]. Consider the linear combination

c1 f1 + c2 f2 = 0

⇒ c1 t + c2 (t) = 0
⇒ c1 t + c2 t = 0
⇒ (c1 + c2 )t = 0
⇒ (c1 + c2 ) = 0
⇒ c1 = −c2 .

5
 So, we have to take one coefficient as arbitrary and thus c1 and c2 both are non-zero.
Hence, the vectors are dependent.
Now, consider the interval [−1, 1]. Consider the linear combination

c1 f1 + c2 f2 = 0

We will have two equations

c1 t − c2 t = 0
and
c1 t + c2 t = 0
On solving these two equations, we will get c1 = c2 = 0. Thus independent in
interval [−1, 1].

Q.41 Firstly, assume ad − bc 6= 0. Consider the linear combination

p(a, b) + q(c, d) = (0, 0)

which will give

pa + qc = 0
and
pb + qd = 0.
First equation will give p = − ac q. Using this value in 2nd equation, we will have

ad − bc
q =0
a
⇒q=0
since ad − bc 6= 0. This will further give p = 0.
Again, consider (a, b) and (c, d) are independent. Then the equations

pa + qc = 0

and
pb + qd = 0
have only trivial solution. So, from equation
ad − bc
q = 0,
a
we know q = 0 and a 6= 0. This gives ad − bc 6= 0.

6
Q.42 Assume v and w are linearly dependent. Then ∃ c1 and c2 , both not zero such that
c1 v + c2 w = 0. Assume c1 6= 0
c2
⇒v=− w
c1
Again, assume v = cw, where c ∈ R.

1(v) − c(w) = 0.

Thus, we have coefficients as 1 and −c which are not both zero. Hence, the vectors
are dependent.

Q.43 Consider Σni−1 αi Ai = 0. For each j = 1, 2 · · · n ⇒ (Σni−1 αi Ai ) · Aj = 0 ⇒ αj Aj ·

Aj = 0 ⇒ αj = 0. Give proper reasoning for each implication.

Q.44 (f) Consider αsint + βcost = 0 for all t. In particular this is true for t = 0, t = π/2.
Hence α = 0, β − 0. Hence LI.
Similarly show for others.

Q.45 (a) Here we want specific values of t for which the system of equations α(cost, sint)′ +
β(sint, cost)′ = 0 has only the trivial solution. For this the coefficient determinant
is non zero.

Q.46 (3, 5)

Q.47 (−5, 3)

Q.48 It is enough to show that the vectors are LI (Why?)

Q.49 Yes. For example S1 = {(1, 0, 0), (2, 0, 0), (3, 0, 0)} spans the x-axis.

Q.50 Theory question.

Q.51 i. For i = 1, 2, j = 1, 2Eij = (ars ) such that aij = 1, ars = 0 for all other r, s.
Hence dim is 4. ii. Dim = mn, iii. Dim = m, iv. Dim = n(n + 1)/2 where n = size,
v. Dim = 3, vi. Dim = 6, vii. Dim = n(n + 1)/2
Bases will be different even if the dimension is the same.

Q.52 3 since the polynomials are LI.

Q.53 V = {(0, 0)} is the trivial subspace of R2 of dimension 0 and span [(x,y)] where
(x, y) 6= (0, 0) is a one dimensional subspace which is just a line through origin and
(x, y). Two dimensional subspace of R2 is R2 itself.

Q.54 Possible dimensions for a subspace of R3 are 0, 1, 2, 3.

7
Q.55 (2, −2, 1)

Q.56 A. , B. and C. are true.

Q.57 Recall If A = (a1 , a2 , a3 ) and B = (b1 , b2 , b3 ) then dot product A · B is defined as

A · B = a1 b1 + a2 b2 + a3 b3 . If A · B = 0 then we say that A and B are perpendicular
(orthogonal). given a = (1, 0, 1, 0), b − (1, 1, 0, 0), c = (0, −1, −1, 0) take d =
(x, y, z, w) ∈ R4 and a · d = 0, b · d = 0, c · d = 0 gives us x = 0, y = 0, z =
0, w = t where ∈ R. Hence d = (0, 0, 0, 1) is orthogonal to a, b, c
So V = {(0, 0, 0, t)R4 : t ∈ R} clearly V is subspace of R4 . and basis of V are
(0, 0, 0, 1) ( or k(0, 0, 0, 1) where k ∈ R and k 6= 0) and dimension of V is 1.

Q.58 (a) Number of linearly independent rows in row echelon form of the matrix is 4,
Hence rank of matrix is 4.
(b) Rank=3
(c) Rank=2
(d) Rank=3

Q.59 c = 0 and d = 2

Q.60 R8

Q.61 Answer is given in tutorial

Q.62 (i)  
1 1 1 1
 1 1 1 1 
1 1 1 1 3×4
First we find row echelon form we use the row operation
R3 → R3 − R1 , R2 → R2 − R1 then we get
 
1 1 1 1
 0 0 0 0 
0 0 0 0

This matrix is the row echelon form of given matrix, Hence rank of given matrix
is 1.
(ii), (iii) Proceed as in part (i)

8
Q.63 (i)  
2 3 5 1
A=
1 −1 2 1
Note that rank of matrix is zero if and only if matrix is zero matrix. Clearly A
is nonzero matrix therefore rank (A) > 0.
 
 2 3 
 1 −1  = −2 − 3 = −5 6= 0
 

Rank of matrix is highest order submatrix with nonzero determinant.

Hence Rank (A) = 2.
       
 3 5 1   5 1 4   3 5 4   3 1 4 
       
(ii) Check  2 −1 1  = 0,  −1 1 1  = 0,  2 −1 1  = 0,  2 1 1  =
 5 4 2   4 2 5   5 4 5   5 2 5 
0  
3 5 1 4
Given matrix A =  2 −1 1 1  has 4 rows so number of ways of select-
5 4 2 5
ing 3 columns from 4 columns is 4. Hnece rank of given matrix is NOT 3
 3 5 
But   6= 0 So rank of given matrix is 2.
2 −1 
(iii)
 
 2 1
6 6  
 1 1 −1 
 
 3 1
  
 −1   3 1 −1 
 3 1
1 −1       
 = 2  2 7 5  − 1  5 7 5  +6 5 2 5 
 5 2
7 5  
 4 3 2 
 
 −2 3
  
 2   −2 4 2 
 −2 4
3 2 
 
 3 1 1 
 
− 6  5 2 7 
 −2 4 3 
     
 1 1 −1   3 1 −1   3 1 −1 
    
 2 7 5  = 37,  5 7 5  = −52,  5 2 5  = −92,
    
 4 3 2   −2 3 2   −2 4 2 
 
 3 1 1 
 
 5 2 7  = −71
 
 −2 4 3 

9
  

 2 1 6 6 
 3 1 1 −1 
 = 2(37) − 1(−52) + 6(−92) − 6(−71)

 5 2 7 5 
 −2 4 3 2 

 

 2 1 6 6 
 3 1 1 −1 
 =0

 5 2 7 5 
 −2 4 3 2 
 
 1 1 −1 
 
But  2 7 5  = 37 6= 0
 4 3 2 
Hence rank of given this matrix is 3

Q.64 In class

Q.65 NO. (why?)

Q.66 Let A be m × n matrix. The row (respectively columns) of A generate a vector

subspace of Rm (respectively Rm ) dimension of this subspace is called the row
rank (respectively column rank) . In other words the row rank is equal to the maxi-
mum number of linearly independent rows (respectively the column rank is equal to
the maximum number of linearly independent columns). Please refer Theorem 6.1
which state that Row and column operations do not change the row rank of a matrix,
nor do they change the column rank. And Theorem 6.2 say that Let A be a matrix
of row rank r then by succession of row and column operations the matrix A can
be transformed to the matrix having components equal to 1 on the diagonal of the
 I 0 
first r rows and columns and 0 everywhere else that is  r  = 0 where Ir is the
0 0 
Identity matrix of order r and 0 denote the zero matrix of apporate order. Hence the
row rank is equal to column rank.

Q.67 (i) Given system x + 4z + t = 0, x + y + 2z − 4t = 0

subtract second equation from first equation we get 2z − y + 5t = 0
given system has 4 variables and 2 equations, so we take z = a and t = b where
a, b ∈ R
2z − y + 5t = 0 gives y = 2a + 5b
Finally if we substitue z = a,t = b and y = 2a + 5b in equation x + 4z + t = 0
we get x = −4a − b
(x, y, z, t) = (−4a − b, 2a + 5b, a, b)

10
 In particular if we take a = 1 = b then we get (x, y, z, t) = (−5, 7, 1, 1) check
this is the solution of given system. Hence dimension of the solution space is
two.
(ii) x + 2y = 0, y − z = 0, x + y + z = 0
x
 = −2y
 y = z − 2y  + 2z= 0 ⇒ y = z
x 2y −2
 y  =  y  = y  1 . Dimension of solution space is 1.
z y 1
Q.68 If .....n. These vectors are the basis vectors for that space. If the vectors........., then
m is greater than n.

Q.69 Cosine space F contains all combinations y(x) = A cos x + B cos 2x + C cos 3x If
y(0) = 0 then we get A + B + C = 0 whish is one equation in three variables, so we
take A = s and B = t so we get C = −s − t Therefore (A, B, C) = (s, t, −s − t) =
s(1, 0, −1) + t(0, 1, −1) so basis for this subspace are {(1, 0, −1), (0, 1, −1)}

Q.70 Case - I If y1 (x) = ex y2 (x) = e2x y3 (x) = e3x

OR y1 (x) = 1 y2 (x) = x y3 (x) = x2
dim of the vector space generated by y1 (x), y2 (x), y3 (x) is 3.
check that y1 (x), y2 (x) and y3 (x) are linearly independent.
Case - II If y1 (x) = 1, y2 (x) = x, y3 (x) = 2x dim of the vector space generated
by 1, x, 2x is two.
Case - III y1 (x) = x y2 (x) = 2x y3 (x) = 3x
clearly y1 (x) 6= y2 (x) 6= y3 (x) 6= y1 (x) and 3x = x + 2x and 2x = 3x − x x =
3x − 2x
dim of the vector space generated by x, 2x, 3x is 1.[4pt]

11