Skip to article frontmatterSkip to article content

Perfect Subsets of the Real Line

Penn State University

Descriptive set theory nowadays is understood as the study of definable subsets of Polish Spaces. Many of its problems and techniques arose out of efforts to answer basic questions about the real numbers. A prominent example is the Continuum Hypothesis (CH\CH):

Early approaches tried to show that CH\CH holds for a number of sets with an easy topological structure.

For closed sets, the situation is less clear. Given a set ARA \subseteq \Real, we call xRx \in \Real a limit point of AA if

ϵ>0zA[zx&zUε(x)],\forall \epsilon > 0 \: \exists z \in A \: [z \neq x \: \& \: z \in U_\eps(x)],

where Uε(x)U_\eps(x) denotes the standard ε\eps-neighborhood of xx in R\Real

In other words, a perfect set is a closed set that has no isolated points. We can also deduce that for a perfect set PP, every neighborhood of a point pPp \in P contains infinitely many points from PP.

Cantor set

Cantor set

Obviously, R\Real itself is perfect, as is any closed interval in R\Real. There are totally disconnected perfect sets, such as the middle-third Cantor set in [0,1][0,1]

Proof

Let PRP \subseteq \Real be perfect. We construct an injection from the set 2N\Cant of all infinite binary sequences into PP. An infinite binary sequence ξ=ξ0ξ1ξ2\xi = \xi_0 \xi_1 \xi_2 \dots can be identified with a real number [0,1]\in [0,1] via the mapping

ξi0ξi2i1.\xi \mapsto \sum_{i \geq 0} \xi_i 2^{-i-1}.

Note that this mapping is onto. It follows that the cardinality of PP is at least as large as the cardinality of [0,1][0,1]. The Schröder-Bernstein Theorem (for a proof see e.g. Jech (2003)) implies that P=R|P| = |\R|.

To construct the desired injection, choose xPx \in P and let ε0=1=20\eps_0 = 1 = 2^0. Since PP is perfect, PUε0(x)P \cap U_{\eps_0}(x) is infinite. Let x0x1x_0 \neq x_1 be two points in PUε0(x)P \cap U_{\eps_0}(x), distinct from xx. Let ε1\eps_1 be such that ε11/2\eps_1 \leq 1/2, Uε1(x0),Uε1(x1)Uε0(x)U_{\eps_1}(x_0), U_{\eps_1}(x_1) \subseteq U_{\eps_0}(x), and Uε1(x0)Uε1(x1)=\overline{U_{\eps_1}(x_0)} \cap \overline{U_{\eps_1}(x_1)} = \emptyset, where U\overline{U} denotes the closure of UU.

We can iterate this procedure recursively with smaller and smaller diameters, using the fact that PP is perfect. This gives rise to a so-called Cantor scheme, a family of open balls (Uσ)(U_\sigma) satisfying certain nesting conditions. Here the index σ\sigma is a finite binary sequence, also called a string. A Cantor scheme is defined by the following properties.

  1. diam(Uσ)2σ\diam(U_\sigma) \leq 2^{-|\sigma|}, where σ|\sigma| denotes the length of σ\sigma.
  2. If τ\tau is a proper extension of σ\sigma, then UτUσ\Cl{U_\tau} \subseteq U_\sigma.
  3. If τ\tau and σ\sigma are incompatible (i.e. neither extends the other), then
    UτUσ=.U_\tau \cap U_\sigma = \emptyset.
  4. The center of each UσU_\sigma, call it xσx_\sigma, is in PP.
Nested structure of a Cantor scheme

Figure 2:Nested structure of a Cantor scheme

Let ξ\xi be an infinite binary sequence. Given n0n \geq 0, we denote by ξn\xi\Rest{n} the string formed by the first nn bits of ξ\xi, i.e.

ξn=ξ0ξ1ξn1.\xi\Rest{n} = \xi_0 \xi_1 \dots \xi_{n-1}.

The finite initial segments give rise to a sequence xξnx_{\xi\Rest{n}} of centers. By properties (1.) and (2.), this is a Cauchy sequence. By (4.), the sequence lies in PP. Since PP is closed, the limit xξx_\xi is in PP. By (3.), the mapping ξxξ\xi \mapsto x_\xi is well-defined and injective.

Thus, to show that a set of reals has the same cardinality as R\R, it suffices to show the set contains a perfect subset. The next theorem establishes that the Continuum Hypothesis holds for all closed subsets of R\R.

Proof

Let CRC \subseteq \Real be uncountable and closed. We say zRz \in \Real is a condensation point of CC if

ε>0[Uε(z)C uncountable].\forall \eps > 0 \:[ U_\eps(z) \cap C \text{ uncountable}].

Let DD be the set of all condensation points of CC. Note that DCD \subseteq C, since every condensation point is clearly a limit point and CC is closed.

Furthermore, we claim that DD is perfect. It is straightforward to verify that DD is closed. To see that every point of DD is a limit point, suppose zDz \in D and ε>0\eps > 0. Then, by assumption, Uε(z)CU_\eps(z) \cap C is uncountable. We would like to conclude that Uε(z)DU_\eps(z) \cap D is uncountable, too, since this would mean in particular that Uε(z)DU_\eps(z) \cap D is infinite. The conclusion holds if CDC \setminus D is countable.

To show that CDC\setminus D is countable, assume that yCDy \in C \setminus D. Then, for some δ>0\delta > 0, Uδ(y)CU_\delta(y) \cap C is countable. We can find an interval I(y)Uδ(y)I(y) \subseteq U_\delta(y) that contains yy and has rational endpoints. There are at most countably many intervals with rational endpoints and hence for each yCDy \in C \setminus D there are at most countably many choices for I(y)I(y). Thus, we have

CDyCDI(y)C.C\setminus D \subseteq \bigcup_{y \in C \setminus D} I(y) \cap C.

The right hand side is a countable union of countable sets, hence countable.

Finally, the fact that CDC \setminus D is countable also implies that DD is non-empty. We have therefore verified that DD is a perfect subset of CC.

It follows that the Continuum Hypothesis holds for closed sets.

The results of this lecture give us a blueprint on how to verify the Continuum Hypothesis for a given family F\mathcal{F} of sets (of reals):

A family F\mathcal{F} of sets (of reals) has the perfect set property if every set in F\mathcal{F} is either countable or has a perfect subset.

References
  1. Jech, T. (2003). Set Theory. Springer-Verlag.