Linear Algebra Problem Set 3: Linear Independence, Subspaces, and Polynomials, Assignments of Linear Algebra

Problem set 3 for math 110—linear algebra, taught by haiman in fall 2009. The problem set covers topics such as linear independence, finding the number of linearly independent vectors and subspaces, lagrange interpolation, and polynomials. Students are required to find formulas, prove theorems, and calculate numbers.

Typology: Assignments

Pre 2010

Uploaded on 10/01/2009

koofers-user-mxb-1
koofers-user-mxb-1 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 110—Linear Algebra
Fall 2009, Haiman
Problem Set 3
Due Monday, Sept. 21 at the beginning of lecture.
1. Show that if vectors v1, . . . , vkin a vector space Vhave the properties that v16= 0, and
each viis not in the span of the preceding ones, then the vectors are linearly independent.
Conversely, show that if v1, . . . , vkis an ordered list of linearly independent vectors, then it
has the above properties.
2. (a) Find a formula for the number Q(n, k) of (ordered) sequences (v1, v2, . . . , vk) of linearly
independent vectors in V, where Vis a vector space of dimension nover F2, and kn.
[Hint: Use the previous problem and Problem Set 2, Problem 5.]
(b) Prove that the number of k-dimensional subspaces of (F2)nis given by
Q(n, k)/Q(k, k ), for kn.
(c) Calculate the number of 5-dimensional subspaces of (F2)10.
3. Let c1, . . . , cnbe distinct elements of a field F. Define the function E:Pm(F)Fnby
E(f(x)) = (f(c1), . . . , f (cn)).
(a) Use Lagrange interpolation to prove that Eis onto if mn1.
(b) Find the nullity of Eif m=n. Deduce that if f(x) is a polynomial of degree at most n
such that every ciis a root of f, then fmust be a scalar multiple of (xc1)(xc2)· · · (xcn).
4. Let p(x)P(F) be a polynomial of degree d(exactly). Given nd, let Wbe the set of
polynomials in Pn(F) which are divisible by p(x).
(a) Prove that Wis a subspace of Pn(F).
(b) Find dim(W).
[Hint for both parts: show that Wis equal to the range of a linear transformation
T:Pnd(F)Pn(F) given by T(f(x)) = p(x)f(x).]
5. (a) Show that the function T:CnCngiven by T((z1, . . . , zn)) = (z1, . . . , zn) is additive
(satisfies the first property in the definition of linear transformation) but not linear. Here z
denotes the complex conjugate abi of z=a+bi.
(b) Show that if we regard Cnas a vector space over Rinstead of C, then Tis linear.
6. Let S:Mm×n(F)Fnbe the function that sends a matrix Ato the sum of its rows.
Assume mand nare non-zero.
(a) Prove that Sis a linear transformation.
(b) Find the range of S.
(c) Find the nullspace S.
(d) Let Nbe the set of matrices AMm×n(F) such that every column of Asums to
zero. Use the preceding parts of this problem to prove that Nis a subspace of Mm×n(F),
and find its dimension.
7. Section 2.1 Exercise 17.

Partial preview of the text

Download Linear Algebra Problem Set 3: Linear Independence, Subspaces, and Polynomials and more Assignments Linear Algebra in PDF only on Docsity!

Math 110—Linear Algebra Fall 2009, Haiman Problem Set 3

Due Monday, Sept. 21 at the beginning of lecture.

  1. Show that if vectors v 1 ,... , vk in a vector space V have the properties that v 1 6 = 0, and each vi is not in the span of the preceding ones, then the vectors are linearly independent. Conversely, show that if v 1 ,... , vk is an ordered list of linearly independent vectors, then it has the above properties.
  2. (a) Find a formula for the number Q(n, k) of (ordered) sequences (v 1 , v 2 ,... , vk) of linearly independent vectors in V , where V is a vector space of dimension n over F 2 , and k ≤ n. [Hint: Use the previous problem and Problem Set 2, Problem 5.] (b) Prove that the number of k-dimensional subspaces of (F 2 )n^ is given by Q(n, k)/Q(k, k), for k ≤ n. (c) Calculate the number of 5-dimensional subspaces of (F 2 )^10.
  3. Let c 1 ,... , cn be distinct elements of a field F. Define the function E : Pm(F) → Fn^ by E(f (x)) = (f (c 1 ),... , f (cn)). (a) Use Lagrange interpolation to prove that E is onto if m ≥ n − 1. (b) Find the nullity of E if m = n. Deduce that if f (x) is a polynomial of degree at most n such that every ci is a root of f , then f must be a scalar multiple of (x−c 1 )(x−c 2 ) · · · (x−cn).
  4. Let p(x) ∈ P (F) be a polynomial of degree d (exactly). Given n ≥ d, let W be the set of polynomials in Pn(F) which are divisible by p(x). (a) Prove that W is a subspace of Pn(F). (b) Find dim(W ). [Hint for both parts: show that W is equal to the range of a linear transformation T : Pn−d(F) → Pn(F) given by T (f (x)) = p(x)f (x).]
  5. (a) Show that the function T : Cn^ → Cn^ given by T ((z 1 ,... , zn)) = (z 1 ,... , zn) is additive (satisfies the first property in the definition of linear transformation) but not linear. Here z denotes the complex conjugate a − bi of z = a + bi. (b) Show that if we regard Cn^ as a vector space over R instead of C, then T is linear.
  6. Let S : Mm×n(F) → Fn^ be the function that sends a matrix A to the sum of its rows. Assume m and n are non-zero. (a) Prove that S is a linear transformation. (b) Find the range of S. (c) Find the nullspace S. (d) Let N be the set of matrices A ∈ Mm×n(F) such that every column of A sums to zero. Use the preceding parts of this problem to prove that N is a subspace of Mm×n(F), and find its dimension.
  7. Section 2.1 Exercise 17.