Condition for Connected

Condition for Connected

Let ER. E is connected iff a<bE and cR if a<c<b then cE.

Really this is saying that E is an 'interval', in the more traditional sense.

Proof

(): Suppose E is connected, and let a,bE and a<c<b. Set:

A=(,c)E;B=(c,)E

Because aA and bB, then neither set is empty and neither set contains a limit point of the other (see Separated, Disconnected, Connected Sets#Examples to see how that works, namely example 2). If E=AB, then we would have that E is disconnected, which it is not (by our given). It must then be that AB is missing some element of E and c is the only possibility. Thus, cE.

(): Suppose a<bE and cR that (a<c<bcE). To show that E is connected, assume E=AB for contradiction, where A,B are nonempty and disjoint (being separated allows us to get disjoint for free). We need to show that one of these sets contains a limit point of the other. Pick a0A and b0B and, suppose (for the sake of argument) that a0<b0. Because E itself is an interval, then interval I0=[a0,b0]E. Now, bisect I0 into two equal halves. The midpoint of I0 must either be in A or B, so choose I1=[a1,b1]E to be the half that allows us to have a1A and b1B. Continue this process, where each In=[an,bn]E where anA and bnB and the length (bnan)0. By the Nested Interval Property then x where:

xn=0In

It is straightforward to see that anx and bnx. But now xE must belong to either A or B, thus making it a limit point of the other, contradicting A,B being separated. As such, then EAB so then E must be connected.