Applied Linear Algebra: Assignment-2

Instructor: Dwaipayan Mukherjee∗

(All problems, except the ones marked separately carry equal weight (5 points). Submission deadline: September
10, 2022)
Definitions: (1) For a non-empty set S and a field F, we define F[S; F] as F[S; F] := {f : S → F}, which is a vector
space over F.
(2) The vector space of all polynomials of degree less than or equal to n, with coefficients in the field F, is denoted
by F[x]n .

1. Are the vectors v1 = [1 1 2 4]T , v2 = [2 − 1 − 5 2]T , v3 = [1 − 1 − 4 3]T , v4 = [2 1 1 6]T linearly independent

2. Find a basis for symmetric 3 × 3 matrices, having real entries, as a vector space over R.
3. Let V be a vector space such that p, q, r, s ∈ V. Suppose S := ⟨{r, s}⟩, P := ⟨{p, r, s}⟩, Q := ⟨{q, r, s}⟩ are
subspaces of V. If q ∈ P but q ∈
/ S, show that p ∈ Q.
4. Delineate a constructive method for obtaining the basis of W1 ∩ W2 when the bases for the finite dimensional
vector spaces W1 and W2 are given.
2×2
5. In the vector
 space F over F, consider the following subspaces: W1 ⊆ F2×2 such that it contains
 matrices
 of
α −α 2×2 p q
the form with α, β, γ ∈ F and W2 ⊆ F such that it contains matrices of the form with
β γ −p r
p, q, r ∈ F. What are the dimensions of W1 , W2 , W1 ∩ W2 , and W1 + W2 ?
6. For two subspaces U and W of the vector space V, if every vector belonging to V either belong to U or to W
(or both), show that either V = U, or V = W (or both).
7. Denote F[N; F], the vector space of all infinite sequences of elements in F, as F∞ . Which of the following
subsets of R∞ are subspaces of R∞ ? Justify your answer in each case.
(a) W := {f ∈ R∞ : f (n + 1) ≤ f (n) ∀n ∈ N}
(b) W := {f ∈ R∞ : limn→∞ f (n) = 0}
(c) W := {f ∈ R∞ : ∃af , df ∈ R so that f (n) = af + (n − 1)df }
(d) W := {f ∈ R∞ : ∃af , rf ∈ R so that f (n) = af rfn−1 }
(e) W := {f ∈ R∞ : f (n) ̸= 0 only for finitely many n ∈ N}

8. Consider W := {p ∈ F[x]3 : p(x) = a0 + a1 x + a2 x2 + (a0 + a1 − a2 )x3 , a0 , a1 , a2 ∈ F}. Show that W is a

10. For any finite dimensional vector space, V, show that there exist subspaces W1 and W2 of V such that V =
W1 ⊕ W2 .
space, V, suppose there exist subspaces Wi , i ∈ {1, 2, . . . , m} such that V =
11. For a finite dimensional vectorP
m
⊕m W
i=1 i . Show that dim(V) = i=1 dim(Wi ).

12. Show that ⟨{1, cos x, sin x}⟩ and ⟨{1, eix , e−ix }⟩ over C are the same vector space. Also show that {1, cos x, sin x}
and {1, eix , e−ix } are both bases for the aforesaid vector space. Obtain the basis transformation matrix between
the two bases.
13. Provide an example of each of the following: (a) an injective map from R2 to R2 , and (b) a surjective map from
R2 to R2 . Can you cook up similar examples from R2 to R3 ? Is it possible to do so from R3 to R2 ? Justify if
these are not possible, or provide examples if they are possible.
14. Suppose ϕ : V → W is a linear map between two finite dimensional vector spaces. Prove that “ϕ is injective” =⇒
dim(V) ≤ dim(W) and “ϕ is surjective” =⇒ dim(V) ≥ dim(W).
∗ Asst. Professor, Electrical Engineering, Office: EE 214D, e-mail: [email protected].

1
 15. Consider a 3 × 3 matrix of real entries, say A ∈ R3×3 which is used to define a linear transformation ϕ :
R3×3 → R3×3 such that ϕ(X) := AX. Describe clearly, with suitable mathematical justifications, how you will
determine the rank of ϕ.
16. For a linear map φ : R2 → R2 that sends the vector (x1 , x2 ) to (−x2 , x1 ), show that φ2 = identity. Obtain
[φ]B , where B = {(1, 2), (−1, 1)}. Further, show that  λ ∈ R, (φ − λ · identity) is invertible. Can you
 for any
0 1
obtain a unique basis, B ′ for R2 , such that [φ]B′ = ? Justify with proper calculations.
−1 0

17. Suppose T : R3 → R2 be a linear map such that T (p1 , p2 , p3 ) = (p1 − p2 , 5p3 − 2p2 ). If B and B ′ are the
standard bases in R3 and R2 , respectively, obtain the matrix representation of T relative to B and B ′ . Suppose
instead someone chooses B = {(−1, 0, 1), (1, −1, 1), (1, 0, 0)} and B ′ = {(1, 1), (0, 1)}, how would (s)he rewrite
the same matrix representation?
18. Suppose V is the vector space of all polynomials having real coefficients with degree less than or equal to
n < ∞. Let B = {f0 , f1 , . . . , fn } and B ′ = {g0 , g1 , . . . , gn } be two ordered bases for V such that fi = xi and
gi = (x + α)i for some scalar α. Represent the differentiation operator, D : V → V in both these ordered bases,
using basis transformation. What do you observe?

19. Consider the same vector space as in Qn. 18 with the ordered basis B, and n = 3. Consider the linear operator
d
D̂ : V → V given by D̂(f (x)) = 3f (x) + (3 − x) dx (f (x)). Obtain bases for Ker(D̂) and Im(D̂). Suppose
g(x) = 7 + 8x. What are all possible solutions of D̂(f (x)) = g(x)?

20. For vector spaces U, V, and W, of which U, and V are finite dimensional, consider two linear transformations
τ : U → V and ψ : V → W. Suppose the composition of the two transformations is given by ψ ◦ τ . Establish
that dim(Ker(ψ ◦ τ )) ≤ dim(Ker(τ )) + dim(Ker(ψ)). When does equality hold? What can you say about the
inequality when τ is surjective?
21. (Cryptography: Hill cipher ) [Bonus question, not mandatory (10 points)] A common way of encoding
messages is to associate distinct positive integers with each letter of the alphabet. For instance, a very basic
encoding would be to choose A → 1, B → 2, C → 3, . . . , Z → 26. However, this can be easily cracked if it
falls into the hands of an adversary. To add a level of security, the messenger and receiver both agree upon a
predetermined invertible matrix, say A ∈ Rn×n . Thereafter, the sender splits up the message (without spaces!)
into chunks of n consecutive letters in the message leading to vectors in Rn . If the total number of letters is not
a multiple of n, the remaining spaces are filled by a place-holder number such as 27. Thereafter, the matrix acts
on each of the vectors and yields transformed vectors as the output, which are then sequentially transmitted to
the receiver. The receiver then decodes this message by passing each of these transformed vectors it received
through A−1 . Then the message is read by mapping the numbers to their corresponding letters.
 
1 −1
Example: Suppose the message is ‘I SEE’ and the matrix is A = ∈ R2×2 (with n = 2). Then the
2 1
sender, using an encoder machine, first converts the message into {9, 19, 5, 5}, splits it up into two vectors v1 =
[9 19]T , v2 = [5 5]T , operates on v1 and v2 using A to get y1 = Av1 = [−10 37]T and y2 = Av2 = [0 15]T , and
then transmits y1 and y2 sequentially to the receiver. The receiver then recovers v1 = A−1 y1 and v2 = A−1 y2
using a decoder, which then reads the message by replacing the numbers with suitable letters.
Suppose it is known that an adversary uses this form of coding with n = 3 but the matrix is unknown to you.
However, your spies have managed to steal a model of this encoder machine, used by the sender, and you can
now experiment with this machine (without ripping it open!) to find out what this matrix is. You decide to
send the message ‘LET ME TRY’ (without spaces, of course, and using 27 as the place-holder), and obtain a
series of numbers at the output.
(a) Determine the matrix A ∈ R3×3 if the encoder gives an output sequence {17, −8, 37, 18,
− 7, 38, 43, −9, 70} for the chosen message. Give an example of a message (not necessarily meaningful words),
using which you will certainly not be able to determine the matrix A.
(b) Suppose your friend playfully decides to send you a message using this encoder, which you read as the
sequence of numbers given by {21, −6, 36, 27, 10, 39, 23, 4, 28, 19, 0, 20, 19, 7,
24, 20, 1, 21} at the output of the encoder. What is your friend trying to tell you?

We [he and Halmos] share a philosophy about linear algebra: we think basis-free, we write basis-free, but when
the chips are down we close the office door and compute with matrices like fury.
–‘Paul Halmos: Celebrating 50 Years of Mathematics’, Irving Kaplansky