Tree representations of sets¶
Analytic sets are projections of closed sets. Closed sets are in are infinite paths through trees on .
We call a set -Souslin if is the projection of some , where is a tree on , that is
Proof
Assume first is . There is a recursive tree on (and hence, in , since “being recursive” is definable) such that
Hence, if and only if there exists an order preserving map (with respect to the inverse prefix ordering) . We recast this now in terms of getting an infinite branch through a tree.
Let be a recursive enumeration of . We may assume for this enumeration that . We define a tree on by
The tree is in , since it is definable from and . Furthermore, if , then the existence of an order-preserving map implies that there is an infinite path through .
Conversely, if such a path exists, then there is an order preserving map . Hence we have
so is of the desired form.
Next, we extend the representation to .
If is , then there is a set such that . Since , we can employ the tree representation of to obtain a tree over such that .
Now we recast as a tree over such that . This is done by using a bijection between and .
This way we can cast the component of into a single component, and thus transform the tree into a tree over such that .
sets as unions of Borel sets¶
We can use Shoenfield’s tree representation to extend Corollary 1 to sets.
Sierpinski’s original proof used . The following proof does not make use of choice.
Proof
Let be . By Theorem 1 there exists a tree on such that . For any let
Since the cofinality of is greater than (this can be proved without using ), every has its range included in some . Thus we have
For all , the set is , because the tree is a tree on a product of countable sets and hence is isomorphic to a tree on . By Corollary 2, each set is the union of many Borel sets, from which the result follows.
As for co-analytic sets, an immediate consequence of this theorem is (using the perfect set property of Borel sets):
Absoluteness of relations¶
Shoenfield used the tree representation of sets to establish an important absoluteness result for sets of reals.
Suppose is . Then, by the Kleene Normal Form there exists a bounded formula of second order arithmetic such that
Let be an inner model of . Arithmetical formulas can be interpreted in and we can also relativize them. This allows us to introduce a relativized version of by identifying, as usual, a set with the predicate that defines it:
Note that we do not have to relativize the inner natural number quantifier, since is absolute for inner models, and also not the formula , since a bounded arithmetic formula translates into a bounded set-theoretic formula (with only natural number quantifiers) and is therefore absolute for .
We can then say that is absolute for if for any ,
Absoluteness can be extended and relativized in a straightforward manner with respect to some .
All arithmetic predicates are absolute, since all quantifiers are natural number quantifiers. Shoenfield absoluteness extends this absoluteness to and predicates.
Proof
We show the theorem for predicates. For the relativized version, one uses the relative constructible universe , see Jech (2003) or Kanamori (2003).
Let be a relation. For simplicity, we assume that is unary. Fix a tree representation of as a projection of a set. So, let be a recursive tree on such that
Note that is in (since it is recursive and hence definable).
Now assume and . Hence there is a such that is well-founded in . This is equivalent to the fact that in there exists an order preserving mapping .
Since is an inner model and is absolute, the mapping exists also in . Hence is well-founded in and thus .
For the converse assume that and . Now we use the alternative tree representation of given by Theorem 1. Let be a tree on such that .
As before, let
Then, for any ,
This means that there exists no order preserving map . But then such a map cannot exist in either. Thus, is a tree in which is ill-founded in the sense of . Thus, by Shoenfield’s Representation Theorem relativized to , .
Absoluteness for follows by employing the same reasoning, using that the complement is .
By analyzing the proof one sees that it actually suffices that is a transitive -model of a certain finite collection of axioms such that .
The result is the best possible with respect to the analytical hierarchy, since the statement
is , but cannot be absolute for .
Shoenfield’s absoluteness theorem also holds for sentences rather than predicates, with a similar proof. This means a statement is true in if and only if it holds in . Many results of classical analysis are statements. The Shoenfield absoluteness theorem says that if they can be established under , they can be established in alone.
On the negative side, as we will soon see, Shoenfield absoluteness also puts strong limits on the use of forcing to establish independence results in analysis.
- Jech, T. (2003). Set Theory. Springer-Verlag.
- Kanamori, A. (2003). The Higher Infinite (Second). Springer-Verlag.