• Keine Ergebnisse gefunden

Question 3 (a) Let d∈N be fixed and for alln ∈Nlet Kn⊂Rd be a compact non-empty set such that Kn+1 ⊂Kn for all n ∈N

N/A
N/A
Protected

Academic year: 2021

Aktie "Question 3 (a) Let d∈N be fixed and for alln ∈Nlet Kn⊂Rd be a compact non-empty set such that Kn+1 ⊂Kn for all n ∈N"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Exercises for Analysis I, WWU M¨unster, Mathematisches Institut, WiSe 2015/16

P. Albers, K. Halupczok Sheet Nr. 8

Hand in by Thursday, December 17, 2015 at 08:30 in the mail-box in the H¨orsaal-geb¨aude.

Question 1

Determine which of the following subsets K1, . . . , K4 of R are compact.

(a) K1 :={1n |n∈N}

(b) K2 :=f([0,1]) under the map f :R\ {−3} →R, f(x) := x2−6x+ 7 x+ 3 (c) K3 :={1x |x∈(0,1]}

(d) K4 := \

n∈N

[−1 n,1]

Question 2

Give (possibly distinct) examples of a continuous map f :R→R such that (a) the pre-image of a connected set is not connected,

(b) the image of an open set is not open, (c) the image of a closed set is not closed,

(d) the pre-image of a compact set is not compact.

Question 3

(a) Let d∈N be fixed and for alln ∈Nlet Kn⊂Rd be a compact non-empty set such that Kn+1 ⊂Kn for all n ∈N. Show that \

n∈N

Kn 6=∅ holds.

(b) Construct for some d ∈ N and for all n ∈ N a closed non-empty set An ⊂ Rd in such a way that An+1 ⊂An for all n ∈N, but \

n∈N

An=∅holds.

Question 4

Prove Lemma 4’: Let n∈N and D⊂Rn be given. Then the following statement holds:

M ⊂D open in D⇐⇒ ∀x∈M ∃r >0 :Br(x)∩D⊂M.

please turn over

(2)

∗ Bonus question

Let us define C0 := [0,1], and

Cn=

2n

[

k=1

In,k,

where the In,k are 2n pairwise disjoint closed intervals of length 3−n such that Cn+1 is the union of all disjoint closed intervals In+1,2k−1, In+1,2k obtained by deleting the open middle third from In,k of Cn. Namely,

Cn+1 :=

2n

[

k=1

(In+1,2k−1 ∪In+1,2k) =

2n+1

[

k=1

In+1,k.

Sketch:

C0

C1

C2

. . .

In this way we construct recursively a sequence C0, C1, . . . of subsets of R, and we define C := \

n∈N

Cn. This set is called Cantor Set.

Show that:

(a) C =∂C,

(b) C is uncountable

(for instance by giving a bijection between C and the set of all 0-1-sequences), (c) every point ofC is an accumulation point of C,

(d) the total length of Cn goes to 0 as n → ∞.

Referenzen

ÄHNLICHE DOKUMENTE

Wie viele Dreiecke gibt es, deren Ecken auch Ecken des Polygons sind, aber deren Seiten keine Seiten des Polygons sind?. F¨ ur n = 7 gibt es zum Beispiel sieben

Ubungen zur Analysis I, WWU M¨ ¨ unster, Mathematisches Institut, WiSe 2015/16P. Halupczok

Exercises for Analysis I, WWU M¨ unster, Mathematisches Institut, WiSe 2015/16P. Halupczok

Ubungen zur Analysis I, WWU M¨ ¨ unster, Mathematisches Institut, WiSe 2015/16P. Halupczok

Exercises for Analysis I, WWU M¨ unster, Mathematisches Institut, WiSe

Ubungen zur Analysis I, WWU M¨ ¨ unster, Mathematisches Institut, WiSe 2015/16P. Halupczok

However, each time you apply it, do not forget to check that the hypotheses of the rule are satisfied (in relation to this see the bonus question on the back).. please

Ubungen zur Analysis I, WWU M¨ ¨ unster, Mathematisches Institut, WiSe 2015/16P. Halupczok