2
$\begingroup$

Show that an open ball in $\mathbb{R^n}$ is a connected set.

Attempt at a Proof: Let $r>0$ and $x_o\in\mathbb{R^n}$. Suppose $B_r(x_o)$ is not connected. Then, there exist $U,V$ open in $\mathbb{R^n}$ that disconnect $B_r(x_o)$. Without loss of generality, let $a\in B_r(x_o)$: $a\in U$. Since $U$ is open, for some $r_1>0$, $B_{r_1}(x_o)\subseteq U$. Since $(U\cap B_r(x_o))\cap (V\cap B_r(x_o))=\emptyset$, $a\not\in V$. Thus, $\forall b\in V, d(a,b)>0$. But then for some $b'\in V: b'\in B_r(x_o)$ and some $r>o$, $d(a,b')>r$. Contradiction since both $a$ and $b'$ were in the ball of radius $r$.

Is this the general idea?

  • 1
    What is $A$? And, your definitions of connectedness is with _disjoint_ open sets, I assume.2012-02-25
  • 0
    sorry about the ambiguity, edited. my definition of connectedness deals with open sets disjoint in $B_r(x_o)$.2012-02-25

4 Answers 4

2

An easy way to see this : a convex set is by construction path-connected, since $\forall x, y \in C$ with $C$ convex, $\lambda x + (1-\lambda)y \in C$ by convexity (so that you can choose the line between $x$ and $y$ as a path). Therefore since the unit ball is convex (show it if you wish to), and since path-connected sets are also connected, you're done.

I'm not quite sure your proof is correct though. Why would $d(a,b') > r$? I don't see an explicit reason for this.

Hope that helps,

  • 0
    we haven't done anything about convexity or path connectedness yet, thanks though. Anyway, my logic for the proof is, because $\forall b\in V, d(a,b)>0,$ for some $r\in\mathbb{R}$ and some $b'$ $d(a,b')>r$.2012-02-25
  • 0
    Then something's wrong, because you fixed $r$ when you began your proof, thus you cannot change it afterwards.2012-02-25
  • 0
    you're right. Is there still a way to show that $d(a,b)>r$ for some $b'\in B_r(x_o): b'\in V$, perhaps by taking $b=\sup V$? Or am I barking up the wrong tree with this proof attempt?2012-02-25
  • 0
    I've given some thought about it but right now this is the only way I see fit. What have you seen in your class? Perhaps that might give me an idea of where I could start for you.2012-02-25
  • 0
    we've covered compactness, connectedness and separability and all of the related notions, we just haven't seen anything dealing with path-connectedness and convexity (though if they are essential to the proof, I would have to ask the prof to go over them)2012-02-25
  • 0
    I don't think it is necessary, it's just more easy. Have you studied continuity and such?2012-02-26
  • 0
    @Emir : I have a proof that doesn't use path-connectedness, but it still uses convexity though. I really suggest that you talk to your teacher about path-connectedness for this, unless he has some magical proof using the tools he has shown in class.2012-02-26
  • 0
    thanks Patrick, I will ask him about it. The definition of convexity is in the book (we skipped over it) so the question likely calls for it.2012-02-26
  • 0
    let us [continue this discussion in chat](http://chat.stackexchange.com/rooms/2617/discussion-between-emir-and-patrick-da-silva)2012-02-26
1

As mentioned, the simplest way to see this is via path connectedness. However, I think induction works too:

We already know that open balls in $\mathbb{R}$ (i.e. open intervals) are connected. Suppose that open balls in $\mathbb{R}^{n-1}$ are connected. Consider an open ball $B(x,r)$ in $\mathbb{R}^n$, and view it as $$B(x,r)=\{(x_1,\ldots,x_{n-1},y):|x_n-y|

In particular the theorem in question states that $X\cup\bigcup_\alpha Y_\alpha$ is connected if $X$ is connected and each $Y_\alpha$ is connected, and furthermore $X\cap Y_\alpha\neq\emptyset$ for each $\alpha.$ This is a straightforward corollary of the more basic theorem that $\bigcup_\alpha Y_\alpha$ is connected if each $Y_\alpha$ is connected and $Y_\alpha\cap Y_\beta\neq\emptyset$ for each $\alpha,\beta$.

1

The last line, "Contradiction since both a and b′ were in the ball of radius r" is NOT a contradiction. It is only a contradiction if one of the points is the center of the ball, otherwise the farthest two points can be is 2r.

0

Hint: An open ball in $\mathbb R^n$ is convex, as can be shown with the triangle inequality. And convex set is path-connected, thus connected.