Homework 4 Practice - Advanced Calculus | MATH 521, Assignments of Advanced Calculus

Material Type: Assignment; Professor: Bertrand; Class: Analysis I; Subject: MATHEMATICS; University: University of Wisconsin - Madison; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 09/02/2009

koofers-user-n73
koofers-user-n73 🇺🇸

8 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 521, Lecture 2 - Spring 2009
Advanced Calculus
Homework 4
Exercise 1
Let k]0,1[.Let (xn)be a sequence satisfying for every nN
|xn+2 xn+1| k|xn+1 xn|.
(1) Prove that for every nN:
|xn+2 xn+1| kn+1 |x1x0|.
(2) Prove that if p, q are integers such that p > q 0, then:
p1
X
i=q
ki=kq1kpq
1kkq
1k.
(3) Prove that if p, q are integers such that pq0, then:
|xpxq| kq|x1x0|
1k.
(4) Prove that (xn)is a Cauchy sequence.
Exercise 2 Let AnRbe a set for every nN. We define nNAnas follows: x nNAnif and
only if for every nNxAn. We define nNAnas follows: x nNAnif and only if there is an
integer nNsuch that xAn.
(1) Let An= (1
n,1
n). Prove that nNAn={0}.
(2) Let An= [ 1
n,11
n]. Prove that nNAn= (0,1).
Exercise 3 Let (xn),(yn)be two sequences satisfying xn< ynfor every nN. Set In:= [xn, yn].
Assume that In+1 Inand that the sequence (ynxn)converges to 0.
We assume first that α:= sup{xn,n N}exists.
(1) Prove that for every p, q N,xpyq.
(2) Prove that for every qN,αyq.
(3) Prove that α nNIn.
(4) Prove that nNIn={α}(clue: assume by contradiction that there is α06=αand estimate |αα0|
using |xnyn|).
We don’t assume anymore that sup{xn, n N}exists. But we assume that nNIn={c}.
(5) Prove that sup{xn, n N}exists and that c= sup{xn, n N}.
Honour Exercise Using the previous exercise, we want to prove that Ris uncountable. So assume by
contradiction that Ris countable.
1
pf2

Partial preview of the text

Download Homework 4 Practice - Advanced Calculus | MATH 521 and more Assignments Advanced Calculus in PDF only on Docsity!

Math 521, Lecture 2 - Spring 2009

Advanced Calculus

Homework 4

Exercise 1 Let k ∈]0, 1[. Let (xn) be a sequence satisfying for every n ∈ N |xn+2 − xn+1| ≤ k |xn+1 − xn|. (1) Prove that for every n ∈ N : |xn+2 − xn+1| ≤ kn+1^ |x 1 − x 0 |. (2) Prove that if p, q are integers such that p > q ≥ 0 , then: ∑^ p−^1

i=q

ki^ = kq^

1 − kp−q 1 − k

kq 1 − k

(3) Prove that if p, q are integers such that p ≥ q ≥ 0 , then:

|xp − xq| ≤ kq^

|x 1 − x 0 | 1 − k

(4) Prove that (xn) is a Cauchy sequence.

Exercise 2 Let An ⊂ R be a set for every n ∈ N. We define ∩n∈NAn as follows: x ∈ ∩n∈NAn if and only if for every n ∈ N x ∈ An. We define ∪n∈NAn as follows: x ∈ ∪n∈NAn if and only if there is an integer n ∈ N such that x ∈ An.

(1) Let An = ( − n^1 , (^) n^1 ). Prove that ∩n∈NAn = { 0 }. (2) Let An = [ (^1) n , 1 − (^) n^1 ]. Prove that ∪n∈NAn = (0, 1).

Exercise 3 Let (xn), (yn) be two sequences satisfying xn < yn for every n ∈ N. Set In := [xn, yn]. Assume that In+1 ⊂ In and that the sequence (yn − xn) converges to 0. We assume first that α := sup{xn, n ∈ N} exists. (1) Prove that for every p, q ∈ N, xp ≤ yq. (2) Prove that for every q ∈ N, α ≤ yq. (3) Prove that α ∈ ∩n∈NIn. (4) Prove that ∩n∈NIn = {α} (clue: assume by contradiction that there is α′^6 = α and estimate |α − α′| using |xn − yn|).

We don’t assume anymore that sup{xn, n ∈ N} exists. But we assume that ∩n∈NIn = {c}. (5) Prove that sup{xn, n ∈ N} exists and that c = sup{xn, n ∈ N}.

Honour Exercise Using the previous exercise, we want to prove that R is uncountable. So assume by contradiction that R is countable. 1

2

(1) Why can we write R = {an, n ∈ N}? (2) Why is there an interval I 0 := [x 0 , y 0 ] which does not contain a 0? (3) Write I 0 = [x 0 , x 0 + y^0 − 3 x^0 ] ∪ [x 0 + y^0 − 3 x^0 , x 0 + 2 y^0 − 3 x^0 ] ∪ [x 0 + 2 y^0 − 3 x 0 , y 0 ]. Why is there an interval among [x 0 , x 0 + y^0 − 3 x^0 ], [x 0 + y^0 − 3 x^0 , x 0 + 2 y^0 − 3 x^0 ] and [x 0 + 2 y^0 − 3 x^0 , y 0 ] that does not contain a 1? Denote I 1 := [x 1 , y 1 ] such an interval. (4) We continue this process and get a sequence of intervals In such that an is not in In for every n ∈ N. Find an element x ∈ R such that x 6 = an for every n ∈ N. Why this is a contradiction?