Homework 8 (Due on Wednesday April 8, 2020)
- Section 6.4: Exercises 6.4.4 and 6.4.5 (comparison principles and squeeze test).
- Exercise 6.5.3 (limit of n-th root of x>0 as n goes to infinity is one).
- Section 6.6: Exercise 6.6.2 (create two different sequences so that each is a subsequence of the other).
- Section 6.6: Exercise 6.6.4 (subsequences related to limits, see remark 6.6.7).
Reading Assignment: Sections 6.4, 6.5, 6.6 and 6.7.
Homework 7 (due on Sunday March 29, 2020)
- Section 5.5: Exercise 5.5.1 (supremum vs infimum, a "mirror exercise").
- Section 6.1: Exercise 6.1.8(a)(b)(f) (Limit Laws, recall that the limit being different than zero means the sequence is eventually bounded away from zero).
- Given the sequence 1, -1, -1/2, 1, 1/2, 1/3, -1, -1/2, -1/3, -1/4, 1, 1/2, 1/3, 1/4, 1/5, -1, -1/2, -1/3, -14, -1/5, -1/6, 1,1/2,... find its supremum, its infimum, its limsup, its liminf, and all its limit-points. Write a short justification for each one of them.
- Section 6.4: Exercise 6.4.1 (limits are limit-points).
- Section 6.4: Exercises 6.4.7 (zero test for sequences, do this using the definition of convergent sequences).
- Section 6.4: Exercise 6.4.10 (limit-points of limit-points are themselves limit-points of the original sequence).
- Bonus: Exercise 6.1.8 (g) or (h) (limit laws involving max or min).
Reading Assignment: Chapter 6.
Homework 6 (Due on Thursday March 12, 2020):
- Show that for all x,y,z in R (use the definition of real numbers as Cauchy sequences in Q and that the corresponding properties are true in Q)
- (a) 1.x = x
- (b) y-y = 0
- (c) If z is not 0 then z.(1/z) = 1
- (d) (x+y)z = x.z + y.z
- (e) if x < y then x+z < y+z
- Section 5.4: Exercise 5.4.4 ("Archimedean Principle", use Corollary 5.4.13).
- Decide if the given statement is TRUE or FALSE. Justify each answer: if true provide a proof, if false a counterexample and a corrected statement.
- (a) If a nonempty set of R has an upper bound, then it has a least upper bound.
- (b) If a nonempty set of R has an infimum, then it is bounded.
- (c) Every nonempty bounded subset of R has a maximum and a minimum.
- (d) Let S be a nonempty subset of R. If m=inf (S) and m'< m then m' is a lower bound of S.
- For each subset of R, find, if they exist, its supremum, infimum, maximum, and minimum. Decide whether each set is bounded below, bounded above, or bounded. Explain each answer.
- (a) The interval I=(0,4].
- (b) The set A={1/n: n>0 and n is in N}.
- (c) The set B={r in Q: r^2<=3}.
- (d) The set C={x in R: x> -5}.
- (e) The set of integers Z.
- Let A and B be nonempty bounded subsets of R with a A being a subset of B. Show that sup(A) <= sup(B) and inf(B)<=inf(A).
- Bonus Exercise 5.4.3 (interspersing of integers by reals, here Euclidean algorithm will not work). Please write this problem in a separate piece of paper, I will grade it for bonus points).
Reading Assignment: Section 5.4, 5.5 and 5.6.
Homework 5 (due Thursday March 5, 2020)
- Show that if a sequence of rational numbers converges to a rational number then the sequence is Cauchy. (See Exercise 6.1.5).
- Section 5.1: Exercise 5.1.1 (Cauchy sequences are bounded).
- Section 5.2: Exercise 5.2.1 (if two sequences are equivalent and one is Cauchy so is the other).
- Section 5.3: Exercise 5.3.2 (multiplication of real numbers is a well defined real number: 1) product of Cauchy sequences is Cauchy, 2) well defined).
- Negate mathematical statements involving quantifiers: not Cauchy, not equivalent sequences, not convergent to L, not a bounded sequence). More details on what is expected on the class summary for 2/27/20 Lecture 12.
Reading Assignment: Chapter 5
Homework 4 (due on Thursday Feb 20, 2020): Please write the bonus in a separated piece of paper and don't staple it to the homework.
- Section 4.1: Exercise 4.1.2 (negation in Z is well defined).
- Section 4.2: Exercise 4.2.1 (show equality in Q is an honest equality).
- Section 4.2: Exercise 4.2.6 (show that multiplication by a negative rational number reverses an inequality between two rational number).
- Section 4.3: Exercise 4.3.2 (d) and (g) (properties of epsilon-close, Proposition 4.3.7, can use previous properties).
- Section 4.4: Exercise 4.4.1 (Interspersing of integers by rationals).
- Bonus: Exercise 3.6.4 (Cardinal arithmetic)
Note about Exercise 4.2.6: The first edition says reals instead of rationals, clearly a typo. In the second edition the exercise is written correctly.
Reading Assignment: Chapter 4
Homework 3 (due on Thursday Feb 13, 2020):
- Show that the symmetric difference of two sets is equal to the union of the two sets minus the intersection of the two sets: (A\B)U(B\A)=(AUB)\(A intersect B).
- Section 3.3: Exercise 3.3.7 (composition of bijections is a bijection moreover you have a formula for the inverse function of the composition).
- Section 3.6: Exercise 3.6.1 (equal cardinality is an "honest" equality).
- Section 3.6: Exercise 3.6.5 (cardinality of AxB equals that of BxA, use that together with cardinal arithmetic to show that multiplication in N is commutative).
- Bonus: Exercise 3.6.6 (about power sets) -I will grade it, please turn it in on a separate piece of paper.
Reading Assignment: Sections 3.5, 3.6 (you are more than welcome to also read 3.4).
Homework 2 (due on Thursday Jan 31st, 2019):
Knowledge is off. You can use any fact that has been proved before the exercise (including prior exercises in the book), unless the exercise asks you to prove a Theorem/Lemma/Proposition, in that case you can use any fact before the Theorem/Lemma/Proposition.
If you are asked to prove item (d) in a proposition, you can use prior items (a), (b), and (c).
- Section 2.2: Exercise 2.2.2 (existence of a predecessor for positive natural numbers).
- Not in the book: Let a, b, c, d be in N, if a < b and c< d then a+c < b+d (can use anything in Section 2.2 or before).
- Section 2.3: Exercise 2.3.2 (N has no zero divisors).
- Section 2.3: Exercise 2.3.5 (Euclidean Algorithm, show also uniqueness, not just existence).
- Not in the book: use truth tables to prove the distributive property for OR and AND, that is if p, q, r are statements then p or (q and r) <=> (p or q) and (p or r)
Reading Assignment: Sections 2.3, 3.1 (sets) and 3.3 (functions) (you are more welcome to read also Section 3.2 (Russel Paradox) I will not lecture on this however).
Homework 1 (due on Thursday Jan 30, 2020):
For the first two problems turn on your number knowledge, for the last two problems turn it off:
- Show by induction that for all n natural numbers
0+1+4+9+16+...+ n^2 = n(n+1)(2n+1)/6.
- Show by induction that n^2 <= 2^n for all natural numbers n>=4.
(you will need at some point to show that 2n+1<=2^n for n>=4, or to show that
n^2>= 2n+1 for n>=4 depending whether you go right to left or left to right in your inequality, that will be an auxiliary lemma that you may prove by induction! in fact these auxiliary inequalities are true for n>=3).
- Show that for all n in N, 1+n=n++ . Then show that 1+1=2.
- Show that multiplication is commutative, that is nxm=mxn for all n,m in N
(Exercise 2.3.1 in the book).
Hint: prove it by induction on n for each m fixed, and you will need two auxiliary lemmas similar to those
used when proving commutativity of addition in class.
Reading Assignment Chapter 2.
Return to: Department
of Mathematics and Statistics, University
of New Mexico
Last updated: Feb 28, 2020