lacunary - Mathnotes

Note \@{cantor-set-reference-note}

This section was developed by following Rudin, Principles of Mathematical Analysis, Chapter 2, with some help from Pugh, Real Mathematical Analysis Section 2.8.

The Cantor Set

Definition: Cantor set \@{cantor-set}

Let E0 be the interval [0,1]. Remove the segment (13,23), and let

E1=[0,13][23,1].

Similarly, remove the middle thirds of these intervals, and let

E2=[0,19][29,39][69,79][89,1].

We can continue this forever, and we get a nested sequence {En} of compact sets En where:

(a) En+1En.

(b) En is the union of 2n intervals, each of length 1/3n.

Finally, the set

P=n=1En

is called the Cantor set.

Theorem \@{cantor-set-is-compact}

The Cantor set is compact.

Proof \@{proof-of-cantor-set-is-compact}

Clearly, P is bounded, for it lies within [0,1]. Each En is composed of the union of 2n closed intervals, and the union of finitely many closed intervals is also closed. P is then the intersection of infinitely many closed intervals, which is again closed. Therefore, P is closed and bounded, and by Heine-Borel, is compact.

Theorem \@{cantor-set-is-not-empty}

The Cantor set is not empty.

Proof \@{proof-of-cantor-set-is-not-empty}

Suppose En has [α,β] as an interval and thus α,βEn. Then, by definition, En+1 will contain [α,βα3] and 2(βα)3,β] as intervals, so α,βEn+1. Note that E0 has [0,1] as an interval. By induction, all En contain 0 and 1, and therefore so does their intersection P, and P is nonempty.

Referenced by (2 direct)
Theorem \@{cantor-set-contains-no-segment}

The Cantor set contains no segment.

Proof \@{proof-of-cantor-set-contains-no-segment}

Suppose, for the sake of contradiction, that some segment (α,β)P and let L=βα. Pick some nN such that 1/3n<L. Now, En is the union of 2n intervals of length 1/3n, and since (α,β)P, it must be the case that (α,β) is a subset of some interval of length 1/3n. However, this can't be the case, since L>1/3n, by construction. Therefore, our provision assumption is incorrect, and P contains no segment.

Theorem \@{cantor-set-is-perfect}

The Cantor set is a perfect set.

Proof \@{proof-of-cantor-set-is-perfect}

Let xP. Let r>0, and pick nN to be large enough that 1/3n<r. Then, x lies in one of the 2n intervals of length 1/3n in En; call it In. The endpoints of In are also in P (see The Cantor set is not empty.,) and at least one of them is not x. Since the endpoints are contained in a neighborhood of x with radius r>0, all neighborhoods of x are limit points of P, and therefore P is perfect.

Corollary \@{cantor-set-is-uncountable}

Because nonempty perfect sets in Rk are uncountable, and the Cantor set is nonempty and perfect, the Cantor set is uncountable.

Referenced by (1 direct)

Direct references: