The Real And Complex Number Systems
The Real And Complex Number Systems
The Real And Complex Number Systems
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
A B which contradicts (*)-3. Hence, we have prove that S is connected.<br />
Remark: We given another proof by the method of two valued function as follows. Let<br />
f be a two valued function defined on S, and choose any two points a, b S. If we can<br />
show that fa fb, we have proved that f is a constant which implies that S is<br />
connected. Since f is a continuous function defined on a compact set S, then f is uniformly<br />
on S. Thus, given 1 0, there exists a 0 such that as x y , x, y S, we<br />
have |fx fy| 1 fx fy. Hence, for this , there exists a finite set of<br />
points x 0 , x 1 ,...,x n in S with x 0 a and x n b such that<br />
x k x k1 for k 1,2,..,n.<br />
So, we have fa fx 0 fx 1 ... fx n fb.<br />
4.43 Prove that a metric space S is connected if, and only if, every nonempty proper<br />
subset of S has a nonempty boundary.<br />
Proof: () Suppose that S is connected, and if there exists a nonempty proper subset U<br />
of S such that U , thenletB clS U, wehave(defineclU A<br />
1. A . B since S U ,<br />
2. A B clU clS U U S U S<br />
S A B,<br />
3. A B clU clS U U ,<br />
and<br />
4. Both A and B are closed in S Both A and B are open in S.<br />
Hence, S is disconnected. That is, if S is connected, then every nonempty proper subset of<br />
S has a nonempty boundary.<br />
() Suppose that every nonempty proper subset of S has a nonempty boundary. If S is<br />
disconnected, then there exist two subsets A and B such that<br />
1. A, B are closed in S, 2.A and B , 3.A B , and 4. A B S.<br />
<strong>The</strong>n for this A, A is a nonempty proper subset of S with (clA A, andclB B)<br />
A clA clS A clA clB A B <br />
which contradicts the hypothesis that every nonempty proper subset of S has a nonempty<br />
boundary. So, S is connected.<br />
4.44. Prove that every convex subset of R n is connected.<br />
Proof: Given a convex subset S of R n , and since for any pair of points a, b, the set<br />
1 a b :0 1 : T S, i.e., g : 0, 1 T by g 1 a b is a<br />
continuous function such that g0 a, andg1 b. So,S is path-connected. It implies<br />
that S is connected.<br />
Remark: 1. In the exercise, it tells us that every n ball is connected. (In fact, every<br />
n ball is path-connected.) In particular, as n 1, any interval (open, closed, half-open, or<br />
infinite) in R is connected. For n 2, any disk (open, closed, or not) in R 2 is connected.<br />
2. Here is a good exercise on the fact that a path-connected set is connected. Given<br />
0, 1 0, 1 : S, andifT is a countable subset of S. Prove that S T is connected. (In<br />
fact, S T is path-connected.)<br />
Proof: Given any two points a and b in S T, then consider the vertical line L passing<br />
through the middle point a b/2. Let A x : x L S, and consider the lines form<br />
a to A, and from b to A. Note that A is uncountable, and two such lines (form a to A, and