Condition for Connected

Condition for Connected

Let E⊆R. E is connected iff ∀a<b∈E and ∀c∈R if a<c<b then c∈E.

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

Proof

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

A=(−∞,c)∩E;B=(c,∞)∩E

Because a∈A and b∈B, 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=A∪B, then we would have that E is disconnected, which it is not (by our given). It must then be that A∪B is missing some element of E and c is the only possibility. Thus, c∈E.

(⇐): Suppose ∀a<b∈E and ∀c∈R that (a<c<b→c∈E). To show that E is connected, assume E=A∪B 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 a0∈A and b0∈B 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 a1∈A and b1∈B. Continue this process, where each In=[an,bn]⊆E where an∈A and bn∈B and the length (bn−an)→0. By the Nested Interval Property then ∃x where:

x∈⋂n=0∞In

It is straightforward to see that an→x and bn→x. But now x∈E must belong to either A or B, thus making it a limit point of the other, contradicting A,B being separated. As such, then E≠A∪B so then E must be connected.

☐