Skip to article frontmatterSkip to article content

At the end of the previous section, we saw that Borel sets are well-behaved in the sense that they possess the perfect subset property. Two other important regularity properties are measurability and the Baire property, which we will introduce in this section.

Filters and Ideals

The most common measure of size is, of course, cardinality. In the presence of uncountable sets (like in a perfect Polish space), the usual division is between countable and uncountable sets. The smallness of the countable sets is reflected, in particular, by two properties: A subset of a countable set is countable, and countable unions of countable set are countable. These characteristics are shared with other notions of smallness, two of which we will encounter in this lecture.

If we have closure even under countable unions, we speak of a σ{}\sigma-ideal. For example, while the countable sets in R\Real form a σ{}\sigma-ideal, the finite subsets only form an ideal.

Another example of ideals are the so-called principal ideals. These are ideals of the form

Z={A ⁣:AZ}\langle Z \rangle = \{ A \colon A \subseteq Z\}

for a fixed ZXZ \subseteq X.

The dual notion to an ideal is that of a filter. It reflects that the sets in a filter share some largeness property.

Again, closure under countable intersections yields σ{}\sigma-filters.

If I\mathcal{I} is a (σ{}\sigma-) ideal, then F={¬A ⁣:AI}\mathcal{F} = \{\Co{A} \colon A \in \mathcal{I}\} is a (σ{}\sigma-) filter. Hence the co-finite subsets of R\Real form a filter, and the co-countable subsets form a σ{}\sigma-filter.

Note that the complement of a (σ{}\sigma-) ideal (in P(X)\Pow(X)) is not necessarily a (σ{}\sigma-) filter. This is true, however, for a special class of ideals/filters.

In light of the small-/largeness motivation, prime ideals and ultrafilters provide a complete separation of XX: Each set is either small or large.

Measures

Roughly speaking, a measure assigns a size to a set in a way that reflects our basic geometric intuition about sizes: The size of the union of disjoint objects is the sum of their sizes. The question whether this can be done in a consistent way for all subsets of a given space is of fundamental importance and has motivated many questions in set theory.

More formally, a measure μ{}\mu on XX is a [0,][0,\infty]-valued function defined on a collection of subsets of XX that satisfies

(M1)μ()=0(M2)μ(nAn)=nμ(An),whenever the An are pairwise disjoint.\begin{align*} (\Op{M1}) & \qquad \mu(\emptyset) = 0 \\ (\Op{M2}) & \qquad \mu(\bigcup_n A_n) = \sum_n \mu(A_n), \\ & \qquad \qquad \text{whenever the $A_n$ are pairwise disjoint.} \end{align*}

The question is, of course, which subsets of XX can be assigned a measure. The condition (M2) suggests that this family is closed under countable unions. Furthermore, if AXA \subseteq X, then the equation μ(X)=μ(A)+μ(¬A)\mu(X) = \mu(A) + \mu(\Co{A}) suggests that ¬A\Co{A} should be measurable, too. In other words, the sets who are assigned a measure form a σ{}\sigma-algebra.

If we want the measure μ{}\mu to reflect also some other basic intuition about geometric sizes, this often puts restrictions on the σ{}\sigma-algebra of measurable sets. For example, in R\Real the measure of an interval should be its length. We will see later that, if we assume the Axiom of Choice, it is impossible to assign every subset of R\Real a measure, so that (M1) and (M2) are satisfied, and the measure of an interval is its length.

To have some control over what the σ{}\sigma-algebra of measurable sets should be, one can construct a measure more carefully, start with a measure on basic objects such as intervals or balls, and then extend it to larger classes of sets by approximation.

An essential component in this extension process is the concept of an outer measure.

An outer measure hence weakens the conditions of additivity (M2) to subadditivity (O3). This makes it possible to have non-trivial outer measures that are defined on all subsets of XX.

The usefulness of outer measures lies in the fact that they can always be restricted to subset of P(X)\Pow(X) on which they behave as measures.

This definition is justified rather by its consequences than by its intuitive appeal. Regarding the latter, suffice it to say here that outer measures may be rather far from being even finitely additive. The definition singles out those sets that split all other sets correctly, with regard to measure.

A proof can be found in any standard book on measure theory, for instance Halmos (1950) or Royden & Fitzpatrick (1988).

The size of the σ{}\sigma-algebra of measurable sets depends, of course, on the outer measure μ\mu^*. If μ\mu^* is behaving rather pathetically, we cannot expect M\mathcal{M} to contain many sets.

Lebesgue measure

A standard way to obtain “nice” outer measures is to start with a well-behaved function defined on a certain class of sets, and then approximate. The paradigm for this approach is the construction of Lebesgue measure on R\Real.

We call the λ\lambda^*-measurable sets Lebesgue measurable.

The following two facts are also standard Royden & Fitzpatrick (1988).

Proof

This follows from Proposition 1, Proposition 3 and the fact that any open set in R\Real is a countable union of intervals.

The construction of Lebesgue measure can be generalized and extended to other metric spaces, for example through the concept of Hausdorff measures.

All these measures are Borel measures, in the sense that the Borel sets are measurable. However, there are measurable sets that are not Borel sets. The reason for this lies in the presence of nullsets, which are measure theoretically “easy” (since they do not contribute any measure at all), but can be topologically quite complicated.

Nullsets

Let μ\mu^* be an outer measure on XX. If μ(A)=0\mu^*(A) = 0, then AA is called a μ\mu^*-nullset.

Proof

Suppose μ(A)=0\mu^*(A)=0. Let BXB \subseteq X. Then, since μ\mu^* is subadditive and monotone,

μ(B)μ(BA)+μ(B¬A)=μ(B¬A)μ(B),\mu^*(B) \leq \mu^*(B \cap A) + \mu^*(B \cap \Co{A}) = \mu^*(B \cap \Co{A}) \leq \mu^*(B),

and therefore μ(B)=μ(BA)+μ(B¬A)\mu^*(B) = \mu^*(B \cap A) + \mu^*(B \cap \Co{A}).

The next result confirms the intuition that nullsets are a notion of smallness.

Proof

(I1) follows directly from monotonicity (O2). Countable additivity follows immediately from subadditivity (O3).

In case of Lebesgue measure, we can use Proposition 4 to further describe the Lebesgue measurable subsets of R\Real.

Proof

We first assume λ(A)<\lambda^*(A) <\infty. Let GnRG_n \subseteq \Real be an open set such that GnAG_n \supseteq A and λ(Gn)λ(A)+1/n\lambda^*(G_n) \leq \lambda^*(A) + 1/n. The existence of such a GnG_n follows from the definition of λ\lambda^*, and the fact that every open set is the disjoint union of open intervals. Then G=nGnG = \bigcap_n G_n is Π20\bPi^0_2, AGA \subseteq G, and for all nn,

λ(A)λ(G)λ(A)+1/n\lambda^*(A) \leq \lambda^*(G) \leq \lambda^*(A) + 1/n

hence λ(A)=λ(G)\lambda^*(A) = \lambda^*(G). Hence for N=GAN = G \setminus A, since AA is measurable,

λ(N)=λ(G)λ(A)=0 and A=GN.\lambda^*(N) = \lambda^*(G) - \lambda^*(A) = 0 \quad \text{ and } \quad A = G \setminus N.

If λ(A)=\lambda^*(A) = \infty, we set Am=A[m,m+1)A_m = A \cap [m,m+1) for mZm \in \Integer. By monotonicity, each λ(Am)\lambda^*(A_m) is finite. For each mZm \in \Integer, nNn \in \Nat, pick Gn(m)G^{(m)}_n open such that λ(Gn(m))λ(A)+1/2n+2m+1\lambda^*(G^{(m)}_n) \leq \lambda^*(A) + 1/2^{n+2|m|+1}. Then, with

nNmZGn(m),\bigcap_{n \in \Nat} \bigcup_{m \in \Integer} G^{(m)}_n,

N=GAN = G\setminus A is the desired set.

For the other direction, note that the measurable sets form a σ{}\sigma-algebra which contains both the Borel sets and the nullsets. Hence any set that is the difference of a Borel set and a nullset is measurable, too.

Hence if a set is measurable, it differs from a (rather simple) Borel set only by a nullset.

We also obtain the following characterization of the σ{}\sigma-algebra of Lebesgue measurable sets.

As mentioned before, there are Lebesgue measurable sets that are not Borel sets. We will eventually encounter such sets. The question which sets exactly are Lebesgue measurable was one of the major questions that drove the development of descriptive set theory, just like the question which uncountable sets have perfect subsets.

Baire category

The basic paradigm for smallness here is of topological nature. A set is small if it does not look anything like an open set, not even under closure. In the following, let XX be a topological space.

Being nowhere dense means for any open set UXU \subseteq X we can find a non-empty open subset VUV \subseteq U such that V¬AV \subseteq \Co{A}. In other words, a nowhere dense set is “full of holes”.

Examples of nowhere dense sets are all finite, or more generally, all discrete subsets of a perfect Polish space, i.e. sets all whose points are isolated. There are non-discrete nowhere dense sets, such as {0}{1/n ⁣:nN}\{0\} \cup \{1/n \colon n \in \Nat \} in R\Real, even uncountable ones, such as the middle-third Cantor set.

The nowhere dense sets form an ideal, but not a σ{}\sigma-ideal: Every singleton set is nowhere dense, but there are countable sets that are not, such as the rationals Q\Rat in R\Real.

To obtain a σ{}\sigma-ideal, we close the nowhere dense sets under countable unions.

The meager subsets of XX form a σ{}\sigma-ideal. Examples of meager sets are all countable sets, but there are uncountable ones (Cantor set).

The concept of Baire category is often used in existence proofs: To show that a set with a certain property exists, one shows that the set of points not having the property is meager. A famous example is Banach’s proof of the existence of continuous, nowhere differentiable functions. For this to work, of course, we have to ensure that the complements of meager sets are non-empty.

In particular, the properties of the theorem hold for Polish spaces.

Proof

(a) Assume M=nNnM = \bigcup_n N_n, where each NnN_n is nowhere dense. Then ¬M=Dn\Co{M} = \bigcap D_n, where each DnD_n contains a dense, open set. Let UXU \subseteq X be open.

We construct a point xU¬Mx \in U \cap \Co{M} by induction. We can find an open ball B1B_1 of radius <1<1 such that B1UD1\Cl{B_1} \subseteq U \cap D_1, since D1D_1 contains a dense open set. In the next step, we use the same property of D2D_2 to find an open ball B2B_2 of radius <1/2<1/2 whose closure is completely contained in B1D2B_1 \cap D_2. Continuing inductively, we obtain a nested sequence of balls BnB_n of radius <1/n<1/n such that BnBn1Dn\Cl{B_n} \subseteq B_{n-1} \cap D_n.

Let xnx_n be the center of BnB_n. Then (xn)(x_n) is a Cauchy sequence, so x=limnxnx = \lim_n x_n exists in XX. Since for any nn, all but finitely many xix_i are in BnB_n, we have xBnx \in \Cl{B_n} for all nn. Therefore, by construction

xnBn=nBnUnDnU.x \in \bigcap_n \Cl{B_n} = \bigcap_n B_n \subseteq U \cap \bigcap_n D_n \subseteq U.

(b) follows immediately from (a), the proof of (c) is exactly the same as that for (a). In fact, the three statements are equivalent.

Any topological space that satisfies the three equivalent conditions (a)-(c) is called a Baire space (not to be confused with the Baire space NN\Baire - the latter is, of course, aa Baire space, too).

As an application, we determine the exact location of Q\Rat in the Borel hierarchy of R\Real.

Proof

Note that R\Real cannot be meager, by (b). Since Q\Rat is meager, RQ\Real \setminus \Rat cannot be meager either. If Q\Rat were a Π20\bPi^0_2 set, it would be the intersection of open, dense sets and hence its complement RQ\Real \setminus \Rat would be meager.

The Baire property

We have seen that the measurable sets are precisely the ones that differ from a Π20\bPi^0_2 set by a nullset. We can introduce a similar concept for Baire category.

In the above definition, we can replace open sets by closed sets.

Proof

Suppose B=GMB = G \bigtriangleup M, GG open and MM meager.

N=GGN = \Cl{G} \setminus G is nowhere dense and closed. Furthermore, Q=MNQ = M \bigtriangleup N is meager (it is the union of two meager sets). We easily verify that G=GNG = \Cl{G} \bigtriangleup N, and therefore

B=GM=(GN)M=G(NM)=GQ,B = G \bigtriangleup M = (\Cl{G} \bigtriangleup N) \bigtriangleup M = \Cl{G} \bigtriangleup (N \bigtriangleup M) = \Cl{G} \bigtriangleup Q,

as desired.

The converse direction is similar, using the interior instead of the closure.

Proof

To show closure under complement, note that ¬(AB)=¬AB\Co{(A \bigtriangleup B)} = \Co{A} \bigtriangleup B. Therefore, if B=GMB = G \bigtriangleup M with GG open and MM meager, we have ¬B=¬GM\Co{B} = \Co{G} \bigtriangleup M, and we can use Lemma 1.

Now assume B=BiB = \bigcup B_i, and for each ii there exist open GiG_i and meager MiM_i such that Bi=GiMiB_i = G_i \bigtriangleup M_i.

Let G=GiG = \bigcup G_i and M=MiM = \bigcup M_i. Then GG is open and MM is meager (since the meager sets form a σ{}\sigma-ideal).

We easily check that

GMBGM.G \setminus M \subseteq B \subseteq G \cup M.

This implies BGMB \bigtriangleup G \subseteq M and hence BGB \bigtriangleup G is meager.

Since

B=G(BG),B = G \bigtriangleup (B \bigtriangleup G),

we conclude that BB has the Baire property.

As in the case of measure, there exist non-Borel sets with the Baire property, and using the Axiom of Choice one can show that there exists set that do not have the Baire property.

We conclude this lecture with a note on the relationship between measure and category. From the results so far it seems that they behave quite similarly. This might lead to the conjecture that maybe they more or less coincide. This is not so, in fact, they are quite orthogonal to each other, as the next result shows.

Proof

Let (Gn)(G_n) be a sequence of open sets witnessing that Q\Rat is a nullset, i.e. each GnG_n is a union of disjoint open intervals that covers Q\Rat and whose total length does not exceed 2n2^{-n}. Then G=nGnG = \bigcap_n G_n is a nullset, but at the same time it is an intersection of open dense sets, thus comeager, hence its complement is meager.

References
  1. Halmos, P. R. (1950). Measure Theory. Van Nostrand.
  2. Royden, H. L., & Fitzpatrick, P. (1988). Real analysis (Vol. 32). Macmillan New York.