Infinity-Borel set

In set theory, a subset of a Polish space [math]\displaystyle{ X }[/math] is ∞-Borel if it can be obtained by starting with the open subsets of [math]\displaystyle{ X }[/math], and transfinitely iterating the operations of complementation and well-ordered union. This concept is usually considered without the assumption of the axiom of choice, which means that the ∞-Borel sets may fail to be closed under well-ordered union; see below.

Formal definition

We define the set of ∞-Borel codes [math]\displaystyle{ C }[/math] and the interpretation function [math]\displaystyle{ \left\| - \right\| : C \to \mathcal{P}(X) }[/math] below. A ∞-Borel set is a subset of [math]\displaystyle{ X }[/math] which is in the image of the interpretation function [math]\displaystyle{ \left\| - \right\| }[/math].

The set of ∞-Borel codes is an inductive type [math]\displaystyle{ C }[/math] generated by functions [math]\displaystyle{ \mathtt{open}: \mathcal{O}(X) \to C }[/math], [math]\displaystyle{ \mathtt{comp} : C \to C }[/math] and [math]\displaystyle{ \mathtt{union}_\alpha : C^\alpha \to C }[/math] for each [math]\displaystyle{ \alpha \lt \Xi }[/math]; the interpretation function is defined inductively as [math]\displaystyle{ \left\| \mathtt{open}(U) \right\| = U }[/math], [math]\displaystyle{ \left\| \mathtt{comp}(c) \right\| = X \setminus \left\| c \right\| }[/math] and [math]\displaystyle{ \left\| \mathtt{union}_\alpha(\vec c) \right\| = \cup_{\beta\lt \alpha}\left\| c_\beta \right\| }[/math]. Here [math]\displaystyle{ \Xi }[/math] denotes the Hartogs number of [math]\displaystyle{ \mathcal{P}(X) }[/math]: a sufficiently large ordinal such that there is no injection from [math]\displaystyle{ \Xi }[/math] to [math]\displaystyle{ \mathcal{P}(X) }[/math]. Restricting to unions of length below [math]\displaystyle{ \Xi }[/math] doesn't affect the possible unions (as any union of length [math]\displaystyle{ \geq \Xi }[/math] can be replaced by one of length [math]\displaystyle{ \lt \Xi }[/math] by removing duplicates), but ensures that the ∞-Borel codes form a set, not a proper class.

This can be phrased more set-theoretically as a definition by transfinite recursion as follows:

• For every open subset [math]\displaystyle{ U \subseteq X }[/math], the ordered pair [math]\displaystyle{ \left\langle 0,U\right\rangle }[/math] is an ∞-Borel code; its interpretation is [math]\displaystyle{ U }[/math].
• If [math]\displaystyle{ c }[/math] is an ∞-Borel code, then the ordered pair [math]\displaystyle{ \left\langle 1,c\right\rangle }[/math] is also an ∞-Borel code; its interpretation is the complement of [math]\displaystyle{ \left\| c \right\| }[/math], that is, [math]\displaystyle{ X \setminus \left\| c \right\| }[/math].
• If [math]\displaystyle{ \vec c }[/math] is a length-α sequence of ∞-Borel codes for some ordinal α < Ξ (that is, if for every β<α, [math]\displaystyle{ c_\beta }[/math] is an ∞-Borel code), then the ordered pair [math]\displaystyle{ \left\langle 2,\vec c\right\rangle }[/math] is an ∞-Borel code; its interpretation is [math]\displaystyle{ \bigcup_{\beta\lt \alpha}\left\| c_{\beta} \right\| }[/math].

The axiom of choice implies that every set can be well-ordered, and therefore that every subset of every Polish space is ∞-Borel. Therefore, the notion is interesting only in contexts where the axiom of choice does not hold (or is not known to hold). Unfortunately, without the axiom of choice, it is not clear that the ∞-Borel sets are closed under well-ordered union. This is because, given a well-ordered union of ∞-Borel sets, each of the individual sets may have many ∞-Borel codes, and there may be no way to choose one code for each of the sets, with which to form the code for the union.

The assumption that every set of reals is ∞-Borel is part of AD⁺, an extension of the axiom of determinacy studied by Woodin.

Incorrect definition

It is very tempting to read the informal description at the top of this article as claiming that the ∞-Borel sets are the smallest class of subsets of [math]\displaystyle{ X }[/math] containing all the open sets and closed under complementation and well-ordered union. That is, one might wish to dispense with the ∞-Borel codes altogether and try a definition like this:

For each ordinal α define by transfinite recursion B_α as follows:

1. B₀ is the collection of all open subsets of [math]\displaystyle{ X }[/math].
2. For a given even ordinal α, B_α+1 is the union of B_α with the set of all complements of sets in B_α.
3. For a given even ordinal α, B_α+2 is the set of all well-ordered unions of sets in B_α+1.
4. For a given limit ordinal λ, B_λ is the union of all B_α for α<λ

B_β equals B_Ξ for every β>Ξ; B_Ξ would then be the collection of "∞-Borel sets".

This set is manifestly closed under well-ordered unions, but without the axiom of choice it cannot be proved equal to the ∞-Borel sets (as defined in the previous section). Specifically, this set may contain unions of sequences [math]\displaystyle{ \vec b }[/math] of ∞-Borel sets for which it is not possible to choose a code for each [math]\displaystyle{ b_\beta }[/math]; it is the closure of the ∞-Borel sets under all well-ordered unions (and complements), even those for which a choice of codes cannot be made.

Alternative characterization

For subsets of Baire space or Cantor space, there is a more concise (if less transparent) alternative definition, which turns out to be equivalent. A subset A of Baire space is ∞-Borel just in case there is a set of ordinals S and a first-order formula φ of the language of set theory such that, for every x in Baire space,

[math]\displaystyle{ x\in A\iff L[S,x]\models\phi(S,x) }[/math]

where L[S,x] is Gödel's constructible universe relativized to S and x. When using this definition, the ∞-Borel code is made up of the set S and the formula φ, taken together.

References

• Woodin, W. Hugh (1999) (in en). The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal. De Gruyter Series in Logic and Its Applications. 1. Berlin: Walter de Gruyter. p. 618. ISBN 3-11-015708-X.