Defn. A disconnection of a set A in a metric space (X,d) consists of two nonempty sets A1, A2 whose disjoint union is A and each is open relative to A. A set is said to be connected if it does not have any disconnections.
Example. The set (0,1/2) È(1/2,1) is disconnected in the real number system.
Theorem. Each interval (open, closed, half-open) I in the real number system is a connected set.
Pf. Let A1,A2 be a disconnection for I. Let aj Î Aj, j = 1,2. We may assume WLOG that a1 < a2, otherwise relabel A1 and A2. Consider E1: = {x Î A1 | x £ a2 }, then E1 is nonempty and bounded from above. Let a: = supE1. But a1 £ a £ a2 implies a Î I since I is an interval. First note that by the lemma to the least upper bound property either a Î A1 or a is a limit point of A1. In either case, a Î A1 since A1 is closed relative to I. Since A1 is also open relative to the interval I, then there is an e > 0 so that Ne(a) Î A1. But then a+e/2 Î A1 and is less than a2, which contradicts that a is the sup of E1. [¯]
Theorem. If A is a connected subset of real numbers (with the standard metric), then A is an interval.
Pf. Otherwise, there would be a1 < a < a2, with aj Î A and a does not belong to A. But then O1 : = (-¥,a)ÇA and O2 : = (a,¥)ÇA form a disconnection of A. [¯]
Note. Each open subset of IR is the countable disjoint union of open intervals. This is seen by looking at open components (maximal connected sets) and recalling that each open interval contains a rational. Relatively (with respect to A Í IR) open sets are just restrictions of these.
Theorem. The continuous image of a connected set is connected.
Pf. If C is a connected set in a metric space X and there is a disconnection of the image f(C), then it can be `drawn back' to form a disconnection of C : if { O1, O2 } forms a disconnection for f(C), then { f-1(O1),f-1(O2) } forms a disconnection for C. [¯]
Corollary. (Intermediate Value Theorem) Suppose f is a real-valued function which is continuous on an interval I. If a1, a2 Î I and y is a number between f(a1) and f(a2), then there exists a between a1 and a2 such that f(a) = y.
Pf. We may assume WLOG that I = [a1, a2]. We know that f(I) is a closed interval, say I1. Any number y between f(a1) and f(a2), belongs to I1 and so there is an a Î [a1,a2] such that f(a) = y. [¯]
Corollary. The continuous image of a closed and bounded interval [a,b] is an interval [c,d] where
c = mina £ x £ b f(x)
d = maxa £ x £ b f(x).
Corollary. (Fixed Point Theorem) Suppose that f:[a,b] ® [a,b] is continuous, then f has a fixed point, i.e. there is an a Î [a,b] such that f(a) = a.
Pf. Consider the function g(x) : = x- f(x) , then g(a) £ 0 £ g(b). g is continuous on [a,b], so by the Intermediate Value Theorem, there is an a Î [a,b] such that g(a) = 0. This implies that f(a) = a. [¯]
Robert Sharpley Feb 21 1998