2007 Boot Camp Problem Set: Linear Algebra and Mathematics Basics - Prof. Chad Giusti, Assignments of Mathematics

A problem set from a 2007 boot camp focused on linear algebra and mathematical problem-solving skills. It covers various topics such as defining and stating concepts, true/false problems, computations, and proofs. The problem set includes exercises on fields, vector spaces, linear maps, eigenvalues, and jordan normal form, among others.

Typology: Assignments

Pre 2010

Uploaded on 07/29/2009

koofers-user-5og
koofers-user-5og 🇺🇸

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
2007 Boot Camp, Problem Set 1
One of the primary goals of boot camp will be to familiarize you with some techniques for solving the sorts
of problems that will occur in your 500/600-level classes. These same sorts of problems will occur on your
qualifying exams, so it’s good to get comfortable with them early, and they really are helpful for learning to
do research in the end.
There are four essential exercise types that occur in mathematics courses: define/state, true/false, com-
pute, and prove: Define/state problems require some level of memorization when one is new to a subject,
but rapidly become trivial as one’s understanding of why a particular definition is made or theorem is true
increases. Our purpose with these problems will be two-fold: to give you an idea which common definitions
and theorems you need to review and to try to make the reason some of these definitions and theorems are
the way they are clearer.
True/false problems tend to be the most difficult of the problem types when one is unfamiliar with a
subject as they test the sharpness of one’s knowledge a slightly weakened condition makes something that
seemed true become false, or something that seems too good to be true if one isn’t thinking cleverly turns
out to be so. Our purpose with these problems will be to get you into the habit of writing down examples
for theorems you run across and counterexamples for those same theorems when conditions are relaxed. If
I had one habit that I could have instilled in myself before starting classes, this would be it. To answer
true/false problems: if true, write down an example and a sketch of the proof if you can; if false, write down
two non-trivial counterexamples. (Here, non-trivial means ”not the first thing that comes to mind.”)
Computations ground us back to reality. It’s going to be very tempting to forget that all of the theorems
we spend so much time proving exist so we can actually do computations. Taking a moment to apply the
theorems gives an opportunity to tie all of our knowledge back together and see it as a whole.
And lastly, proofs are fairly self-explanatory, as we all hope to be doing them for a living some day.
This first problem set is going to focus on Linear Algebra, though will contain a few basic problems of
the type you might see at the beginning of 500-level courses, just to spice things up. Linear Algebra is
generally assumed to be background knowledge by 500/600-level instructors at a level most undergraduates
don’t necessarily see or recall. Take some time to work through these problems on your own and we will
proceed depending on the average level of progress and number of questions when we get together for the
first time. Much of this will be used in the other problem sets and we will see quite a bit of other linear
algebra along the way. If you have questions, let me know!
1. Linear Algebra
Here, unless otherwise noted, Fis a field, Vand Ware Fvector spaces.
(1) Define...
(a) a field.
(b) an Fvector space.
(c) a linear map fbetween vector spaces.
(d) a basis for an Fvector space.
(e) similar matrices
(f) characteristic and minimal polynomials of a linear map
(g) eigenvalues and eigenvectors of linear maps
(h) diagonalizable linear maps
(i) Jordan Normal Form of a matrix
(2) Give as many examples of (types of) fields and vector spaces over those fields as you can.
(3) Let Vbe a finite dimensional vector space. Explain what it means for a matrix Ato represent a
linear map f:VV. Prove that matrices Aand Brepresent fif and only if Aand Bare similar.
(4) Using the last problem, explain what is meant by a property of a linear map being basis invariant.
The basis invariant properties of a vector space/general mathematical object tend to be those that
matter.
(5) Let Vbe the set of all real polynomials in twith degree less than n (written by abuse of ring notation
as V=R[t]/(tn))
(a) Show that Van Rvector space.
1
pf3

Partial preview of the text

Download 2007 Boot Camp Problem Set: Linear Algebra and Mathematics Basics - Prof. Chad Giusti and more Assignments Mathematics in PDF only on Docsity!

2007 Boot Camp, Problem Set 1 One of the primary goals of boot camp will be to familiarize you with some techniques for solving the sorts of problems that will occur in your 500/600-level classes. These same sorts of problems will occur on your qualifying exams, so it’s good to get comfortable with them early, and they really are helpful for learning to do research in the end. There are four essential exercise types that occur in mathematics courses: define/state, true/false, com- pute, and prove: Define/state problems require some level of memorization when one is new to a subject, but rapidly become trivial as one’s understanding of why a particular definition is made or theorem is true increases. Our purpose with these problems will be two-fold: to give you an idea which common definitions and theorems you need to review and to try to make the reason some of these definitions and theorems are the way they are clearer. True/false problems tend to be the most difficult of the problem types when one is unfamiliar with a subject as they test the sharpness of one’s knowledge – a slightly weakened condition makes something that seemed true become false, or something that seems too good to be true if one isn’t thinking cleverly turns out to be so. Our purpose with these problems will be to get you into the habit of writing down examples for theorems you run across and counterexamples for those same theorems when conditions are relaxed. If I had one habit that I could have instilled in myself before starting classes, this would be it. To answer true/false problems: if true, write down an example and a sketch of the proof if you can; if false, write down two non-trivial counterexamples. (Here, non-trivial means ”not the first thing that comes to mind.”) Computations ground us back to reality. It’s going to be very tempting to forget that all of the theorems we spend so much time proving exist so we can actually do computations. Taking a moment to apply the theorems gives an opportunity to tie all of our knowledge back together and see it as a whole. And lastly, proofs are fairly self-explanatory, as we all hope to be doing them for a living some day.

This first problem set is going to focus on Linear Algebra, though will contain a few basic problems of the type you might see at the beginning of 500-level courses, just to spice things up. Linear Algebra is generally assumed to be background knowledge by 500/600-level instructors at a level most undergraduates don’t necessarily see or recall. Take some time to work through these problems on your own and we will proceed depending on the average level of progress and number of questions when we get together for the first time. Much of this will be used in the other problem sets and we will see quite a bit of other linear algebra along the way. If you have questions, let me know!

  1. Linear Algebra Here, unless otherwise noted, F is a field, V and W are F vector spaces. (1) Define... (a) a field. (b) an F vector space. (c) a linear map f between vector spaces. (d) a basis for an F vector space. (e) similar matrices (f) characteristic and minimal polynomials of a linear map (g) eigenvalues and eigenvectors of linear maps (h) diagonalizable linear maps (i) Jordan Normal Form of a matrix (2) Give as many examples of (types of) fields and vector spaces over those fields as you can. (3) Let V be a finite dimensional vector space. Explain what it means for a matrix A to represent a linear map f : V → V. Prove that matrices A and B represent f if and only if A and B are similar. (4) Using the last problem, explain what is meant by a property of a linear map being basis invariant. The basis invariant properties of a vector space/general mathematical object tend to be those that matter. (5) Let V be the set of all real polynomials in t with degree less than n (written by abuse of ring notation as V = R[t]/(tn)) (a) Show that V an R vector space. 1

2

(b) Differentiation is a linear map (^) ddt : V → V. Exhibit two different matrices that represent (^) dtd. (c) Integration is not a linear map

dt : V → V. Why not? How can this problem be rectified? This being done, can you represent this map using a matrix? (6) Let F = R. Consider the matrix

A =

(a) Compute the determinant of A. (b) Calculate the characteristic polynomial p(t) and the minimal polynomial m(t) for A. (c) Find the eigenvalues and eigenvectors of A. (d) Is A diagonalizable? If so, find a basis in which it is diagonal. (e) Find the Jordan Normal Form of A. (If A is diagonalizable, you’re already done!) (7) Do the last problem with F = Z/ 11 Z and F = Z/ 2 Z. (8) If V is a vector space, we define the dual of V

V ∗^ = {f : V → F |f linear}

(a) Show that V ∗^ is an F vector space (b) If V is finite dimensional with basis {v 1 , v 2 ,... , vn}, define fi ∈ V ∗^ by fi(vj ) = δij, where δij is the Kronecker delta function. Show that {f 1 , f 2 ,... , fn} forms a basis for V ∗^ called the dual basis. Conclude that dim V = dim V ∗. (c) Show that R[t], the set of all polynomials with real coefficients, is an R vector space with basis {ti|i ∈ N}. In particular, this is not a finite dimensional vector space. (d) Show that the ”dual basis” to the vector space basis for R[t] given above does not span R[t]∗. In general, finite dimensionality is required to make the dual basis work. (9) True or False: (a) Every linear operator over a real vector space is diagonalizable. (b) Every invertible linear operator over a real vector space is diagonalizable. (c) Every invertible linear operator over a complex vector space is diagonalizable. (d) Each of the above, with ”is diagonalizable” replaced by ”can be put in Jordan Normal Form”. (e) There is precisely one vector space up to isomorphism of each finite dimension over any field F. (10) Let B be a 4 × 4 matrix over C with characteristic polynomial (x^2 + 1)(x − 2)^3. Find all possible Jordan normal forms of B. What happens if we consider B as a matrix over R?

  1. 500 Analysis (1) Prove that sequences in R are convergent if and only if they are Cauchy. (2) Let f and g be continuous real valued functions on R, x 0 ∈ R a point such that f (x 0 ) > g(x 0 ). Prove that there exists an interval (a, b) such that x 0 ∈ (a, b) and f (x) > g(x) for all x ∈ (a, b). (3) Let (sn) and (tn) be sequences of real numbers. (a) State the definition of lim sup sn and lim inf sn. (b) Prove that lim sup sn ≥ lim inf sn. (c) What can you say about (sn) if lim sup sn = lim inf sn? Prove your assertion. (d) Prove that lim inf(sn + tn) ≥ lim inf sn + lim inf tn.
  2. 500 Algebra (1) Prove that a group G is Abelian if and only if (ab)−^1 = a−^1 b−^1 for all a, b ∈ G. (2) True or False: There is a group G which is a union of two proper subgroups. (3) True or False: There is a group G which is a union of three proper subgroups. (4) Prove that a group which has only a finite number of subgroups is finite. (5) Let H and K be subgroups of a finite group. Prove that |HK| = ||HH||∩KK||.