MATH ASSIGNMENT
Soham Chatterjee(22133), Akanto Nandi(22169), Saswat Prakash Dey(22120), Gourab Mondal(22177),
Tias Das(22152),Subhra Sekhar Mustafi(22142), Abhay Raj Sharma(22176), Ankit Kumar Bera(22025),
Prithweeraj Das(22096), Atreyee Burman(22039), Anika Majumder(22022),
Alipriya Chatterjee(22011), Aishwary Srivastava(22010), Parikshit Shekhar(22086)
Sayandip Saha(22121).
12 Dec 2023
1 Questions and answer
1.1 2. Find three vectors in R3 such that they are linearly dependent but any two of
them are linearly independent.
Let three vectors be a,b and c, where
a = (1,0,0), b = (0,1,0), c = (0,0,1)
then, a − b + c = 0
So clearly, a, b, and c are linearly dependent.
But in case between a and b if α, β ∈ R and
αa + βb = 0 then,
⇒ (α, 0, 0) + (β, β, 0) = (0, 0, 0)
⇒ (α + β, β, 0) = (0, 0, 0)
Therefore, α = β = 0
a and b are linearly independent.
Similerly between b and c, if β, γ ∈ R, and
βb + γc = 0 then,
⇒ (β, β + γ, 0) = (0, 0, 0)
β=γ=0
b and c are linearly independent.
Case between a and c if α, γ ∈ R and
αa + γc = 0 then,
⇒ (α, γ, 0) = (0, 0, 0)
⇒α=γ=0
clearly a and c are linearly independent.
1
Hence, a, b, and c are linearly independent, but any two of them are linearly depen-
dent.
1.2 4. Let S = (v1 , v2 , · · · , vn ) be linearly dependent subset of V and L(S) = V then show
that each vector in V can be expressed in more than one way as a linear combination
of vectors of S:
As given in the question, vectors from subset S (v1 , v2 , · · · , vn ) are all linearly depen-
dent.
means there exist non-zero scalars a1 , a2 , · · · , an such that
a1 v1 + a2 v2 + · · · + an vn = 0 ........(1)
Now if a vector vr ∈ S where (1 ≤ r ≤ n) then based on (1), it can be represented
as,
form (1) vr = − a1r (a1 v1 + · · · + ar−1 vr−1 + ar+1 vr+1 + · · · + an vn )
Since L(S) = V so any vector v in V can be expressed as a linear combination of
vectors in S.
Therefore, for some scalars c1 , c2 , · · · , cn , we can write,
⇒ v = c1 v1 + c2 v2 + · · · + cn vn
⇒ vr = v − c1r (c1 v1 + · · · + cr−1 vr−1 + cr+1 vr+1 + · · · + cn vn )
combining both we get,
c1 c2 cn
form (2) vr = (a1 − a1 )v1 + (a2 − a2 )v2 + · · · + (an − an )vn
This shows that the vector v can be expressed as a linear combination of vectors in
S in more than one way, since the choice of scalars is arbitary.
1.3 2. Let V = P3 (R) represent the set of all polynomials of degree atmost 3. (a) Show
that B1 = (1 − x, 1 + x2 , 1 − x3 , 3 + x2 − x3 ) and B2 = (1, 1 − x, 1 + x2 , 1 − x3 )are bases of P3 .
As we know dim(Pn ) = n + 1
then, dim(P3 ) = 3 + 1 = 4
2
Clearly, in the given question set B1 and B2 have four vectors each,
So, if we can show that the vectors of B1 and B2 are linearly independent, then they
would prove to be the basis of P3 ;
for set B1 , the vectors are
(1 − x) ⇒ (1, −1, 0, 0)
(1 + x2 ) ⇒ (1, 0, 1, 0)
(1 − x3 ) ⇒ (1, 0, 0, −1)
(3 + x2 − x3 ) ⇒ (3, 0, 1, −1)
So, for scalars c1 , c2 , c3 , c4 ∈ R
1 1 1 3 0
−1 0 0 0 0
c1
0 + c2 1 + c3 0 + c4 1 = 0
0 0 −1 −1 0
1 1 1 3 0
−1 0 0 0 0
Augmented matrix would be
0
1 0 1 0
0 0 −1 −1 0
after doing some row opporations we get,
1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
means, c1 = c2 = c3 = c4 = 0; trivial solution therefore, vectors of set B1 are linearly
independent. So, B1 is a basis for P3 .
Now for set B2 , the vectors are
(1) ⇒ (1, 0, 0, 0)
(1 − x) ⇒ (1, −1, 0, 0)
(1 + x2 ) ⇒ 1, 0, 1, 0)
(1 − x3 ) ⇒ (1, 0, 0, −1)
3
similerly for scalar c1 , c2 , c3 , c4 ∈ R
1 1 1 1 0
+ c2 −1 + c3 0 + c4 0 = 0
0
c1
0 0 1 0 0
0 0 0 −1 0
1 1 1 1 0
0 −1 0 0 0
the augmented matrix would be;
0 0 1 0
0
0 0 0 −1 0
After doing some row operations we get;
1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
means; c1 = c2 = c3 = c4 = 0; trivial solution therefore, vectors of set B2 are linearly
independent. So, B2 is a basis for P3 .
Hence proved.
1.4 4. Let T | R3 → R3 be a linear transformation defined by T (x, y, z) = (x + y + z, x − y −
3z, 2x + 3y + z) and let B be [(1,0,0); (0,1,0); (0,0,1)] the basis of R3
then find [T ]B
B
Given transformation is; T (x, y, z) = (x + y + z, x − y − 3z, 2x + 3y + z)
So,
T (1, 0, 0) → (1 + 0 + 0, 1 − 0 − 0, 2 · 1 + 0 + 0) = (1, 1, 2)
if c1 , c2 , c3 are scalars then, writin it w.r.t the basis B we get
c1 (1, 0, 0) + c2 (0, 1, 0) + c3 (0, 0, 1)
therefore, c1 = 1, c2 = 1 and c3 = 2
4
similerly,
T (0, 1, 0) → (1, −1, 3)
if c1 , c2 , c3 are scalars then, writin it w.r.t the basis B we get
c1 (1, 0, 0) + c2 (0, 1, 0) + c3 (0, 0, 1)
therefore, c1 = 1, c2 = −1 and c3 = 3
similerly,
T (0, 0, 1) → (2, −3, 1)
if c1 , c2 , c3 are scalars then, writin it w.r.t the basis B we get
c1 (1, 0, 0) + c2 (0, 1, 0) + c3 (0, 0, 1)
therefore, c1 = 2, c2 = −3 and c3 = 1
1 1 2
then, T (1, 0, 0) = 1 ; T (1, 0, 0) = −1 ; T (1, 0, 0) = −3
2 3 1
1 1 2
So, [T ]B
B = 1 −1 3
2 3 1
1.5 5. Let T : R3 → R be a non zero linear transformation, now show that dim(kerT ) is 2.
Also show for general case where V be a n dimentional matrix and T : V → R then
dim(kerT ) is n-1.
From rank nullity theorem we know that if T is a linear transformation on V then,
dim(V ) = rank(T ) + dim(kerT )........(1)
in the given case V is R3 then, dim(R3 ) = 3 so, dim(V ) = 3.
5
Now rank of transformation matrix T is the dimention of the image matrix of T
rank(T ) = dim(ImT )
= dim(R)
= 1 as, [T : R3 → R]
putting these results in (1) we get,
3 = 1 + dim(kerT )
⇒ dim(kerT ) = 2.
Now for general case, T : V → R if dim(V ) = n then,
similerly,
rank(T ) = dim(ImT ) = dim(R) = 1.
putting these in (1) we get,
dim(kerT ) = n − 1.
Hence proved.
1.6 Let A be the matrix such that A2 = A then show that the eigen values of are either 0
or 1 or both:
If for the matrix A eigen vector is v and eigen value is λ then,
Av = λv ........(1)
⇒ A2 v = Aλv [multiplying both sides with A]
⇒ Av = Aλv [as, A2 = A]
⇒ Av = λ(Av)
⇒ Av = λ(λv) [as, Av = λv]
⇒ Av = λ2 v.........(2)
comapiring (1) and (2) we get,
⇒ λ = λ2
⇒ λ(λ − 1) = 0
6
So, λ = 1 or λ = 0
eigen values of A are either 0 ro 1 or both.
1.7 4. Set A is a nillpotent matrix then show that all the eigen values of A are 0:
As A is a nillpotent matrix then,
An = 0 for some integer n,
Let λ be the eigen value of matrix A corresponding eigen vector v
then, Av = λv
now, An v can be written as,
⇒ An−1 (Av)
⇒ An−1 λv
⇒ An−2 λ2 v = · · · = Aλn−1 v = λn v
An v = λn v
⇒ λn v = 0 [as An = 0]
⇒ λn = 0 [as v ̸= 0]
⇒λ=0
So, all the eigen values of A is 0.
