Assignments Math 321
Assignments Math 321
#1. Consider the linear transformation T: M2x2(R) --> P2(R) given by T ( [s, t; u, v] ) =
(s+t) + (2v)X + tX^2 . Let beta = { [1,0;0,0], [0,1;0,0], [0,0;1,0], [0,0;0,1] } and let gamma
= { 1, X, X^2 }. Compute [T]b,c .
#2. Consider the linear transformation T: P2(R) --> M2x2(R) given by T( f(X) ) = [f'(0),
2f(1); 0, f''(3)] . Let alpha = { 1, X, X^2 } and let beta = { [1,0;0,0], [0,1;0,0], [0,0;1,0],
[0,0;0,1] }. Compute [T]a,b.
#3. Let V be a vector space with ordered basis beta = {v1,v2, ..., vn} . Let vsub0 = O.
By Theorem 17, there exists a unique linear transformation T: V --> V such that
T(vsubj) = vsubj + vsub(j-1) for 1<=j<=n. Compute [T]b,b .
#4. Consider a linear transformation T: V --> W where dim(V) = dim(W) . Show that
there exist ordered bases beta and gamma for V and W, respectively, such that [T]b,c
is diagonal.
#5. Let g(X) = 3 + X. Let T: P2(R) --> P2(R) and U: P2(R) --> R3 be the linear
transformations defined respectively by T( f(X) ) = f'(X)g(X) + 2f(X) and U( r + sX + tX^2
) = (r+s, t, r-s) . Let beta and gamma be the standard ordered bases of P2(R) and R3,
respectively. Compute [U]b,c and [T]b,b and [U o T]b,c directly. Then use Theorem 21
to verify your result.
#6. Assume that T: V --> W and U: W --> Z are linear. a) Prove that UoT is injective
=> T is injective. Must U also be injective? (justify) b) Prove that (UoT) is surjective =>
U is surjective. Must T also be surjective? (justify) c) Prove that if both U and T are
bijective (i.e., both injective and surjective) then UoT is bijective.
#2 Let M[n,n] be the vector space of nxn matrices with entries in the field F and let W
be the subset of those matrices having trace 0. Prove that W is a subspace of M[n,n]
and find dim(W).
#3 Let f(x) be a polynomial of degree n in the vector space Pn(R). Prove that for every
polynomial g(x) in Pn(R), there exist scalars c0, c1, c2, ..., cn in F satisfying
g(x) = (c0) f0(x) + (c1) f1(x) + (c2) f2(x) + ... + (cn) fn(x) where f0(x) =
f(x) and for each k with 1 <= k <= n, fk(x) is the k-th derivative of f(x).
For each of #4 and #5 below, prove that T is linear, find bases for both ker(t) and
im(t), compute the nullity of T and the rank of T to verify
#4 T: M[2,3] ----> M[2,2] defined by T ( a11 a12 a13; a21 a22 a23 ) =
(2a11-a12, a13+2a12; 0, 0)
#6 Assume that T: R2 ----> R2 is linear, T( (1,0) ) = (1,4) and T( (1,1) ) = (2,5). What
is T( (2,3) )? Is T injective?
#7 Assume that T: V ----> W is linear. Prove that T is injective <=> for every
independent subset I of V, { T(v) : v is in I} is an independent subset of W.
#8 Let T: P(R) ----> P(R) be the linear transformation T( f(x) ) = f'(x) . Prove that T
is surjective but not injective.
#1 Let M denote the vector space of mxn matrices with entries in F. Let W1 = {A in M :
Aij = 0 for i > j} and let W2 = {A in M : Aij = 0 for i <= j}. Prove that M = W1 DIRECT
SUM W2.
#2 In R3, determine whether or not (2,-1,0) is a linear combination of (1,2,-3) and (1,-
3,2).
#3 In M (the vector space of 2x2 matrices with entries in F) determine whether or not
I2 is in SPAN{A,B,C} where R1(A)=(1,0) R2(A)=(-1,0) R1(B)=(0,1) R2(B)=(0,1) and
R1(C)=(1,1) R2(C)=(0,0} .
#4 In the vector space P3(R) determine whether the following set is linearly dependent
or linearly dependent. {x^3 -x, 2x^2 + 4, -2x^3 + 3x^2 + 2x +6}
#5 Let M be a square upper triangular matrix with (all) non-zero diagonal entries. Prove
that the columns of M are linearly independent.
#6 In R3, determine whether or not the following set is a basis for R3. { (-1,3,1), (2,-4,-
3), (-3,8,2) }
#7 In the vector space P2(R), determine whether or not the following set is a basis. { 1
- 2x -2x^2, -2 + 3x -x^2, 1 - x + 6x^2 }
Assignment 2:
#1 A function f : R ---> R is an EVEN function if f(-t) = f(t) for each t in R. Prove that
the set of even functions under the usual (calculus) addition and scalar multiplication of
functions is a vector space over R. ( I suggest using a "+ in a box" for vector addition, a
"+" for field addition and juxtaposition for scalar multiplication.)
#2 Let V = R2; define (a1,a2) + (b1,b2) = (a1+a2,b1+b2); define 0*(a1,a2) = (0,0); and
for c not 0, define c*(a1,a2) = (ca1, a2/c). Prove or disprove that (V,+,*) is a vector
space.
Complex addition, &, is defined by (a+bi) & (c+di) = (a+c) + (b+d)i and
complex multiplication, *, is defined by (a+bi) * (c+di) = (ac-bd) +
(ad+bc)i.
Prove that (C,&,*) is a field. [Your only ammunition is the definition of a field]
{You can substitute something for the ampersand symbol &. Perhaps a large plus
symbol.]
2. Recall from class that Zp under mod p addition and mod p multiplication is a field
when p is prime. Moreover, its (p-1)-element multiplicative group is cyclic. When p=73,
Z73 is a field. Its 72-element CYCLIC multiplicative group is {1,2,3, ... , 71,72}. Find a
generator x of this group and list its elements in their natural order 1, x^1, X^2,
x^3, ... , x^71 . Using a computer is fine but you should BRIEFLY describe your
algorithm.