1
$\begingroup$

I could not prove the following question could you please help me?

Best Regards

Let $X, d(x, y)$ be a metric space. By definition, diameter of a bounded set $A ⊂ X$ is the number $diam(A)$ = $sup${$d(a, b) : a, b ∈ A$}.

a) Suppose that $X$ is a complete and $A1 ⊃ A2 ⊃ A3 ⊃ · · · An ⊃ · · ·$ is a nested sequence of closed subsets of $X$. Prove, that if $diam (An )$$0$ then there is a unique point $a$ such that $a ∈ An$ for every $n$.

b) Give an example of a sequence $A1 ⊃ A2 ⊃ A3 ⊃ · · · An ⊃ · · ·$ of closed subsets of $\mathbb{R}$ such that $diam (An ) ⇸ 0$ and $\bigcap{_n}$ $An = ∅$

c) b) Give an example of a sequence $A1 ⊃ A2 ⊃ A3 ⊃ · · · An ⊃ · · ·$ of open subsets of $\mathbb{R}$ such that $diam (An ) → 0$ but $\bigcap{_n}$ $An = ∅$

  • 0
    For (a), I would try picking an element from each set and using completeness to justify taking a limit and finding $a$. Then you'd have to worry about uniqueness. For (b), you can find an example where the diameter of each set is infinite if you think about it. You can do (c) using open intervals and a few minutes' thought.2012-12-16
  • 1
    I guess this should be enough for a) Choose $x_n ∈ A_n$ , and show that the sequence $(x_n)$ satisfies the Cauchy condition.2012-12-16
  • 0
    @user108903 I would really appreciate if you can show me how to prove (a) explicitly?2012-12-16
  • 0
    Do you see why each set $A_n$ is non-empty? If so, start by choosing $x_n\in A_n$ for each $n$. Then you have to show that $(x_n)_{n\ge1}$ is Cauchy; this should come out of the condition $diam(A_n)\to 0$. Then apply completelness. I think it's better for you to work this out yourself if possible. If you understand the definitions of these concepts, each step shouldn't be difficult.2012-12-16
  • 0
    @user108903 Could you please check my reply to ThomasE.'s answer.2012-12-17

1 Answers 1

1

Since this is a homework, I will give you some hints to lead you on the right track.

(a) For each $n\in\mathbb{N}$ choose $x_{n}\in A_{n}$. Can you show that this sequence converges, and that the limit is in $A_{n}$ for all $n\in\mathbb{N}$? Also, if there would be another such point $y$ in every $A_{n}$, then how would this contradict diam$(A_{n})\to 0$?

(b) Try to look for a nested sequence of unbounded closed sets. Bounded closed sets will not work, because Heine-Borel says that compact sets in $\mathbb{R}$ are those that are closed and bounded, and if each $A_{n}$ is compact, then it can be shown that $\bigcap A_{n}\neq\emptyset$ even if diam$(A_{n})\not\to 0$.

(c) Try to look for a nested sequence of open intervals where the other end stays fixed in each set, and choose the second ends so that diam$(A_{n})\to 0$.

  • 0
    sorry that I could not write back for a while. It seems like I should do the following for the part (a): We say that $X,d(x,y)$ is a complete metric space, if every Cauchy Sequence of $X$ converges. Then if we choose $X_n∈A_n$ we know that, for every $\epsilon>0$ there exists $N$ such that if $n,m>N$ we have $d(X_n,X_m)<\epsilon$. This means that the series is convergent and if $diam (An )$$0$ then, $d(X_n,X_m)→0$ which means that $X_n$ and $X_m$ should converge to same number which should conclude my proof. But there seems to be many missing points in my proof. Could you help me?2012-12-16
  • 1
    @Xentius. Since the sequence of sets is nested, then for any $n,m\in\mathbb{N}$, $n, you have $d(X_{n},X_{m})\leq diam(A_{m})$, so if $n,m\to\infty$, then $d(X_{n},X_{m})\to 0$. Hence $(X_{n})$ is a Cauchy sequence and conveges to some $x\in X$ because $X$ is complete. You still have to show that $x\in\bigcap A_{n}$, and if $y\in\bigcap A_{n}$ then $y=x$. First use that each $A_{n}$ is closed and thus $X\setminus A_{n}$ are open. So if $x\notin A_{k}$ for some $k$‚ then you find $r>0$ s.t. $B(x,r)\subset X\setminus A_{k}$. Since $x_{n}\in A_{k}$ for all $n\geq k$, then what does this imply?2012-12-17
  • 0
    Since $x_n$ converges to $x$ and $x_n∈A_k$, then should not it follow that $x∈A_k$? If yes, then we have a contradiction here? But I feel like I am on the wrong track :/2012-12-17
  • 1
    @Xentius The trick is that the limit is outside $A_{k}$, while rest of the sequence continues inside $A_{k}$. I.e. since $x_{n}\to x$ you find $j$ s.t. $d(x_{n},x) for all $n\geq j$. Now choose $m=\max\{k,j\}$. Then $d(x_{n},x)>r$ for all $n\geq m$ (since $B(x,r)\subset X\setminus A_{k}$ and $x_{n}\in A_{k}$ for all $n\geq m$) and simultaneously $d(x_{n},x) for all $n\geq m$ since $x_{n}\to x$. This is an obvious contradiction, so we conclude that $x\in A_{n}$ for all $n$. Now what happens if there exists another $y\in A_{n}$ for all $n$? Since $d(x,y)>0$ and diam$(A_{n})\to 0$, then...2012-12-18
  • 0
    If $x$ and $y$ are both $∈$ $\bigcap A_{n}$ and if $diam(A_n)→0$, then it must follow that $d(x,y)$ cannot be greater than $0$. It must be equal to zero which means that $x$ must be equal to $y$ ?2012-12-18
  • 0
    @Xentius Exactly.2012-12-18
  • 0
    Thank you so much! Now if we think about b) and c), in c) should not $A1$ be an empty set?. Because $A1 ⊃ A2 ⊃ A3 ⊃ · · · An ⊃ · · ·$ and $\bigcap{_n}$ $An = ∅$ . If $A1$ was not an empty set, then would not it follow that $\bigcap{_n}$ $An = A1$2012-12-18
  • 0
    for b) I do not even have an idea :/2012-12-18
  • 0
    @Xentius I think the exercise asks for non-empty candidates. And $\bigcap A_{n}=A_{1}$ if all the sets are same, otherwise no. For (b) try to think of a nested sequence of closed intervals $A_{n}$ so that diam$(A_{n})=\infty$ for all $n$‚ but $\bigcap A_{n}=\emptyset$. For (c) I would try the hint I provided above in this post. Take you favourite non constant decreasing sequence $(a_{n})$ of real numbers so that $a_{n}\to a$, and choose $A_{n}=]a,a_{n}[$ for all $n$. Why do these sets do the job?2012-12-18
  • 1
    I guess for b we can choose $A_n=[n,\infty)$ right? Their intersection will be empty but they are all nonempty closed sets.2012-12-18
  • 1
    and for c) I should take $A_n=(0,1/n)$ ?2012-12-18
  • 1
    @Xentius Yes, both are correct.2012-12-18
  • 0
    I am so much grateful for your help. Thank you very much.2012-12-18
  • 0
    @Xentius: You're welcome.2012-12-18