LAE Assign Prob
LAE Assign Prob
C ONTENTS
1. Vector Space 2
1.1. Assignment-Problems: Vector spaces 2
1.2. Assignment-Problems: Subspaces 3
1.3. Assignment-Problems: Linear span 4
1.4. Assignment-Problems: Linear independence 5
1.5. Assignment-Problems: Basis, Dimension and Quotient space 6
1.6. Assignment-Problems: Additional problems 8
2. Linear Transformations 10
2.1. Assignment-Problems: Linearity 10
2.2. Rank and nullity 11
2.3. Matrix representations 12
2.4. Change of basis 13
2.5. Space of linear transformations 14
2.6. Additional Problems on Linear transformations 14
1
2 LINEAR ALGEBRA FOR ENGINEERS: ASSIGNMENT PROBLEMS
1. Vector Space
(1) Suppose S is a set consisting of n elements and V is the set of all real valued functions
defined on S. Show that V is a vector space of dimension n.
(2) Let U and W be subspaces of a vector space V. Prove the following:
(a) U ∪W = V iff U = V or W = V.
(b) U ∪W is a subspace of V iff U ⊆ W or W ⊆ U.
(c) Let U ∩ W = {0}. If v ∈ U + W, then there are unique u ∈ U, w ∈ W such that
v = u + w.
(3) Let V be a vector
n space. Prove that V is not a finite
o union of proper subspaces.
(4) Let `1 (N) := x ∈ F (N, F) : ∑∞j=1 |x( j)| < ∞ , where F (N, F) is the space of all
scalar sequences. Show that `1 (N) is asubspace of F (N, F).
(5) For a nonempty set Ω, let `∞ (Ω) := x ∈ F (S, F) : sups∈S |x(s)| < ∞ . Note that
`∞ (Ω) is the set of all bounded functions on S. Thus, x ∈ `∞ (Ω) if and only there
exists Mx > 0 such that |x(s)| ≤ Mx for all s ∈ S. In particular, `∞ (N) is the set of all
bounded sequences of scalars.
Show that `∞ (Ω) is a subspace of F (S, F)
(6) Show that
c00 := {x ∈ F (N, F) : ∃ k ∈ N such that x(n) = 0 ∀ n ≥ k},
c0 := {x ∈ F (N, F) : x(n) → 0 as n → ∞},
c := {x ∈ F (N, F) : (x(n)) converges }
are subspaces of `∞ (N). We observe that c00 ⊆ `1 (N) ⊆ c0 ⊆ c ⊆ `∞ (N). Are these
inclusions proper?
(7) Suppose Λ is a set, and for each λ ∈ Λ let Vλ be a subspace of a vector space V . Then
prove that ∩λ∈ΛVλ is a subspace of V.
(8) If one defines U −W = {u − v : u ∈ U, v ∈ V } for subspaces U, W of a vector space
V, then which of the following would hold and which do not?
U −U = {0}, U −W = U +W, (U −W ) +W = U.
(9) Let U,W, X be subspaces of a vector space V. Prove or give a counter-example: if
U ⊕W = U ⊕ X, then W = X.
(10) Show that a subset {u1 , . . . , un } of V is linearly independent iff the function (α1 , . . . , αn ) 7→
α1 u1 + · · · + αn un from Fn into V is injective.
(11) Answer the following questions with justification:
(a) Is every subset of a linearly independent set linearly independent?
(b) Is every subset of a linearly dependent set linearly dependent?
(c) Is every superset of a linearly independent set linearly independent?
(d) Is every superset of a linearly dependent set linearly dependent?
(e) Is union of two linearly independent sets linearly independent?
(f) Is union of two linearly dependent sets linearly dependent?
(g) Is intersection of two linearly independent sets linearly independent?
(h) Is intersection of two linearly dependent sets linearly dependent?
LINEAR ALGEBRA FOR ENGINEERS: ASSIGNMENT PROBLEMS 9
(12) Let U be a finite dimensional subspace of a vector space V. Show that any subspace
W of V that satisfies U +W = V and U ∩W = {0} has dimension dim(V ) − dim(U).
(13) Let U1 , . . . ,Uk be subspaces of a vector space V. Prove that V = U1 ⊕ · · · ⊕Uk iff for
all x1 ∈ U1 , . . . , xk ∈ Uk , x1 + · · · + xk = 0 implies that x1 = · · · = xk = 0.
(14) Let V be an infinite dimensional vector space. Show that there exists a sequence
v1 , v2 , . . . , of vectors in V such that for each n ∈ N, the vectors v1 , . . . , vn are linearly
independent.
(15) For λ ∈ [a, b], let uλ (t) = exp (λt), t ∈ [a, b]. Show that {uλ : λ ∈ [a, b]} is an uncount-
able linearly independent subset of C [a, b].
(16) Given a0 , a1 , . . . , an ∈ R, let
V = { f ∈ Ck [0, 1] : an f (n) (t) + · · · + a1 f (1) (t) + a0 f (t) = 0 ∀t ∈ [0, 1]}.
Show that V is a subspace of Ck [0, 1], and find its dimension.
(17) Show that if {u1 , . . . , un } is a linearly independent subset of a vector space V , and
if W is a subspace of V such that {u1 , . . . , un } ∩ W = 0, / then every x in the span of
{u1 , . . . , un ,W } can be written uniquely as x = α1 u1 +· · ·+αn un +y with (α1 , . . . , αn ) ∈
Fn , y ∈ W .
(18) Show that if E1 and E2 are linearly independent subsets of V such that span(E1 ) ∩
span(E2 ) = {0}, then E1 ∪ E2 is linearly independent.
(19) Let p1 (t), . . . , pn+1 (t) ∈ Pn be such that p1 (1) = · · · = pn+1 (1) = 0. Show that the
polynomials p1 (t), . . . , pn+1 (t) are linearly dependent in Pn .
(20) Let U1 , . . . ,Un be finite dimensional subspaces of a vector space V. Prove that dim(U1 +
· · · +Un ) ≤ dim(U1 ) + · · · + dim(Un ).
(21) Let U,W and X be subspaces of a finite dimensional vector space V. Are the following
true?
(a) If U ⊕W = V, then W ⊕U = V ?
(b) If U ⊕ (W ⊕ X) = V, then (U ⊕W ) ⊕ X = V.
(22) Let U1 , . . . ,Un be subspaces of a finite dimensional vector space V. Prove the follow-
ing.
(a) If dim(U1 ) + · · · + dim(Un ) = V, then V = U1 ⊕ · · · ⊕Un .
(b) dim(U1 ⊕ · · · ⊕Un ) = dim(U1 ) + · · · + dim(Un ).
(c) Each vector in V can be written as a unique sum of vectors from the subspaces
U1 , . . . ,Un iff V = U1 + · · · + Un and for each i ∈ {2, . . . , n}, Ui ∩ (U1 + · · · +
Ui−1 ) = {0}.
(d) V = U1 ⊕ · · · ⊕ Un iff V = U1 + · · · + Un and whenever 0 = u1 + · · · + un for
u1 ∈ U1 , . . . , un ∈ Un , we have u1 = · · · = un = 0.
(23) Let V be a vector space. Show that dim(V ) = n ≥ 1 iff there exist one dimensional
subspaces U1 , . . . ,Un such that V = U1 ⊕ · · · ⊕Un .
10 LINEAR ALGEBRA FOR ENGINEERS: ASSIGNMENT PROBLEMS
2. Linear Transformations
f 0 (0) 2 f (1)
(b) Define T : P2 (R) → R2×2 by T ( f ) = . Compute [T ]F,E .
0 f 0 (3)
(c) Define T : R2×2 → R by T (A) = tr(A). Compute [T ]B,F .
(9) Let T : R3 → R3 be given by T (a, b, c) = (a + b, 2a − b − c, a + b + c). Consider the
bases B = {(1, 0, 0), (1, 1, 0), (1, 1, 1)} and E = {(1, 2, 1), (2, 1, , 0), (3, 2, 1)} for R3 .
Determine the matrices [T ]B,B , [T ]B,E , [T ]E,B , and [T ]E,E . Also, find the rank(s) of all
these matrices.
(10) Let T : Pn → Pn be given by P(q)(t) = q(t + 1). Determine [T ] with respect to the
standard basis of Pn .
(11) Let B = {u1 , . . . , un } be an ordered basis of a vector space V. Let f be a linear func-
tional on V. Prove that there exists a unique (β1 , . . . , βn ) ∈ Fn such that f (α1 u1 +
. . . + αn un ) = α1 β1 + . . . + αn βn . Conclude that the matrix representation [ f ]B,{1} is
the row vector [β1 · · · βn ].
(12) Let {v1 , . . . , vn } be a basis for a vector space V. Let E be the standard basis of Fn×1 .
Define a map f : V → Fn×1 by f (v) = [v]E . Show that f is an invertible linear trans-
formation.
(13) Let B = {v1 , . . . , vn } be a basis for a vector space V. Let T be an operator on V. Show
that T is invertible iff [T ]B,B is an invertible matrix.
(14) Let B and E be bases for the finite dimensional vector spaces U and V, respectively.
If S, T : U → V are linear transformations and α ∈ F, then show that [S + T ]B,E =
[S]B,E + [T ]B,E and [αT ]B,E = α[T ]B,E .
(15) Let S and T be operators on a vector space of dimension n. Show that
rank(S) + rank(T ) − n ≤ rank(ST ) ≤ min{rank(S), rank(T )}.
Give examples, where strict inequalities hold.
(a) Is T injective?
(b) Is it true that T (z1 z2 ) = T (z1 )T (z2 ) for all z1 , z2 ∈ CR ?
(c) How do you describe R(T )?
(2) Let T : V → W be a linear transformation. Show that rankT < ∞ if and only if there
exists n ∈ N, {v1 , . . . , vn } ⊂ V and { f1 , . . . , fn } ⊂ L (V, F) such that
n
Tx = ∑ f j (x)v j for each x ∈ V.
j=1
(17) Let V and W be finite dimensional vector spaces. Prove the following:
(a) An injective linear map from V to W exists iff dim(V ) ≤ dim(W ).
(b) A surjective linear map from V to W exists iff dim(V ) ≥ dim(W ).
(18) Let T : V → W be a linear transformation. Prove the following:
(a) Let dim(W ) < ∞. Then T is injective iff there exists S : W → V such that ST = IV .
(b) Let dim(V ) < ∞. Then T is surjective iff ∃ S : W → V such that T S = IW .
(19) Let T be an operator on a vector space such that T 2 − T + I = 0. Show that A is
invertible.
(20) Let A ∈ Fm×n . Define T : Fn×1 → Fm×1 by T (X) = AX. Show the following:
(a) If m < n, then T can be surjective but not injective.
(b) If m > n, then T can be injective but not surjective.
(21) Let k, m, n ∈ N. Let A ∈ Fk×m . Define T : Fm×n → Fk×n by T (X) = AX. Prove that T
is invertible iff k = m and A is invertible.
(22) Let p(t) be any polynomial. Let S, T be operators where S is invertible. Show that
S−1 p(T )S = p(S−1 T S).
(23) Let S and T be linear operators on a finite dimensional vector space V. Show that ST
is invertible iff both S and T are invertible.
(24) Let S and T be linear operators on a finite dimensional vector space V. Show that
ST = I iff T S = I.
(25) Let A, B ∈ Fn×n . Prove that if AB = I, then BA = I.
(26) Let T : V → W be a linear transformation, where both rankT and nulT are finite.
Show that V is finite dimensional. (Note: Since dim(V ) < ∞ is not assumed, you
cannot use the formula dim(V ) = rankT + nulT.)
(27) Let U be a subspace of a finite dimensional vector space V over F. Let W be any
vector space over F. Let T : U → W be a linear transformation. Show that there
exists a linear transformation S : V → W such that Tu = Su for each u ∈ U.
(28) Let U and V be vector spaces. Let {u1 , . . . , un } be a basis for U. Let v1 , . . . , vn ∈ V.
Prove or disprove:
(a) There exists a unique linear transformation T : U → V with T (ui ) = vi for i =
1, 2, . . . , n.
(b) This T is one-one iff {v1 , . . . , vn } is linearly independent.
(c) This T is onto iff span{v1 , . . . , vn } = V.
(29) Let U and V be vector spaces. Let E = {u1 , . . . , un } ⊆ U be linearly independent and
let v1 , . . . , vn ∈ V. Prove the following:
(a) A linear transformation T : V → W with Tu1 = v1 , . . . , Tun = vn exists.
(b) T in (a) is unique if and only if E is a basis of V.
(30) Let P be an operator on a finite dimensional vector space V such that P2 = P. Prove
that tr(P) = rank(P).
(31) Let V be a finite dimensional vector space. Let V 00 be the dual of the dual of V.
Define the map T : V → V 00 by (T v)(g) = g(v) for each g ∈ V 0 . Prove that T is an
isomorphism.
(32) In general, a hyperspace in a vector space v is a maximal proper subspace of V. Prove
the following:
LINEAR ALGEBRA FOR ENGINEERS: ASSIGNMENT PROBLEMS 17